Timeline for Syracuse conjecture in OCaml
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 5 at 5:12 | comment | added | Chris |
Array.get cache x => cache.(x)
|
|
| Aug 26, 2016 at 12:17 | vote | accept | RUser4512 | ||
| Aug 26, 2016 at 12:12 | comment | added | Quentin Pradet |
Sure. Try to write one yourself :) Such implementations usually use Hashtbl to be able to handle any value, while my implementation is specialized for integers where I'm going to fill most of the array. But maybe it would be just as fast with an hash table.
|
|
| Aug 26, 2016 at 12:08 | comment | added | RUser4512 | Thank you ! using the cache was indeed very efficient ! is there any generic implementation of caching in OCaml ? Something as simple as python cache decorators ? | |
| Aug 26, 2016 at 11:47 | history | answered | Quentin Pradet | CC BY-SA 3.0 |