To be honest I don't even know yet if I will need it. I have to run some performance tests first. I'm just trying to see what are my options in case using only records + list proves too slow.
I have recently watched some videos about clojure/clojurescript where the advocate their support of persistent data structures and it seems pretty good. Since Array,Dict and Set in elm seem to support structural sharing too, I was wondering is the same kind of simple identity tests for detecting changes than in clojure were supported too. My use case is that I will have a list of records where records can be appended, inserted, removed and updated as well. In most of case, I will need to lookup a record by id (each of my records will have a unique id). I was wondering what would be the best way to store it and Dict appeared as a good candidate. However as I will probably have quite of few computations derived from that list so I tried to imagine a way to avoid recomputing them when this list of records hasn't changed (with a memoize function for example). Of course this will only be interesting if I can do a quick equality check between the old version of my Dict and the new one hence my original question. I actually very new to elm so I don't know what are the common practices for speed optimization. -- You received this message because you are subscribed to the Google Groups "Elm Discuss" group. To unsubscribe from this group and stop receiving emails from it, send an email to elm-discuss+unsubscr...@googlegroups.com. For more options, visit https://groups.google.com/d/optout.
