Comments on: C++ Hash Table Memoization: Simplifying Dynamic Programming http://marknelson.us/2007/08/01/memoization/ Programming, mostly. Sat, 13 Mar 2010 12:39:59 +0000 http://wordpress.org/?v=2.2.3 By: Mark Nelson http://marknelson.us/2007/08/01/memoization/#comment-220109 Mark Nelson Thu, 02 Oct 2008 13:59:47 +0000 http://marknelson.us/2007/08/01/memoization/#comment-220109 @dan: I don't really understand what you are getting at. Yes, you can use the less than operator to order, but in this case I have no need for that. I have a simple equality test, which is fine, so why do anything else? @dan:

I don’t really understand what you are getting at. Yes, you can use the less than operator to order, but in this case I have no need for that. I have a simple equality test, which is fine, so why do anything else?

]]> By: dan http://marknelson.us/2007/08/01/memoization/#comment-220091 dan Thu, 02 Oct 2008 13:39:51 +0000 http://marknelson.us/2007/08/01/memoization/#comment-220091 "(It is not unusual to use the less-than operator to test for equality, by testing both a > b and a <b>1, mGenre => "B" } and (Instance 2) { mAge=>2, mGenre => "A" } then (Instance 1) is not less than (Instance 2) and (Instance 2) is not less than (Instance 1) and you might conclude they are equal. When putting one after the other in a map it would overwrite. Something like this should make it totally ordered. return (that1.mAge “(It is not unusual to use the less-than operator to test for equality,
by testing both a > b and a 1, mGenre => “B” } and
(Instance 2) { mAge=>2, mGenre => “A” }

then (Instance 1) is not less than (Instance 2) and (Instance 2) is
not less than (Instance 1) and you might conclude they are equal.
When putting one after the other in a map it would overwrite.
Something like this should make it totally ordered.
return (that1.mAge

]]> By: bulane http://marknelson.us/2007/08/01/memoization/#comment-196131 bulane Tue, 19 Aug 2008 07:58:20 +0000 http://marknelson.us/2007/08/01/memoization/#comment-196131 The article has been helpful to start my project The article has been helpful to start my project

]]> By: mais_tro http://marknelson.us/2007/08/01/memoization/#comment-100999 mais_tro Fri, 14 Mar 2008 10:35:28 +0000 http://marknelson.us/2007/08/01/memoization/#comment-100999 hey guys!!! can u giv exact example on ur program!!! that not having any error when we are going to copy it and run it to our compiler!!!! hey guys!!!
can u giv exact example on ur program!!!
that not having any error when we are going to copy it and run it to our compiler!!!!

]]> By: Relations « zeroblog http://marknelson.us/2007/08/01/memoization/#comment-51506 Relations « zeroblog Sun, 09 Dec 2007 23:35:53 +0000 http://marknelson.us/2007/08/01/memoization/#comment-51506 [...] that relation syntax overlaps function syntax isn’t coincidental; it enables function result memoisation as part of the language, thus (hopefully) also improving the efficiency of zero programs. I’ll [...] […] that relation syntax overlaps function syntax isn’t coincidental; it enables function result memoisation as part of the language, thus (hopefully) also improving the efficiency of zero programs. I’ll […]

]]>