Timeline for Using Memoization with a Mutable Object
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 26, 2012 at 2:57 | comment | added | rcollyer | As I noted in the update, I am selecting yours for speed and simplicity. | |
| Apr 26, 2012 at 2:57 | vote | accept | rcollyer | ||
| Apr 23, 2012 at 16:51 | comment | added | Pillsy | With further investigation, this solution seems to win big over mine when you miss the cache a lot. | |
| Apr 23, 2012 at 16:17 | comment | added | rcollyer | As a side note, for testing they're small trees, but that is not guaranteed to always be the case. Although with Andy's test data, you don't expect the number of unique elements to exceed 1000, so I guess small still applies. | |
| Apr 23, 2012 at 16:14 | comment | added | rcollyer | This gives a 60% increase in speed over Pillsy' s similar solution on my machine. Likely because it is the common pattern, and hence higher on the list. +1 | |
| Apr 23, 2012 at 16:07 | history | answered | Rojo | CC BY-SA 3.0 |