Andy Ferris
Andy Ferris
(To say it differently - indexing is definitely in the “roadmap” as it is in my head but it’s been a matter of finding time for me to contribute to...
I just mean - it seems quite complicated when indexing to preserve the hash table for some (possibly repeated?) subset. I also think it could be slow - if you...
Another approach is to try use reflection to determin when `==` and `isequal` agree for the element type, but I don't think this is feasible. Perhaps types should have a...
That should be safe. I haven't thought a lot about this - but `copy` is only useful if you want to mutate something, and currenty you can't safely mutate an...
Ok a few thoughts. The functionality in this package can be reproduced in plain Julia if you plan it out in advance, using a trait pattern like you have demonstrated....
Then you can use a trait, which is determined at runtime by iterating the entire container (the compiler will optimize this away when it can infer the element type well...
Same speed, actually, assuming type inference succeeds. The instance version is strictly more powerful than the type version, and is the pattern I have been leaning towards lately. Not sure...
Actually... these are a little interesting... I think they would have to be added during the thunk (for standard multiple dispatch) yet multiple trait-based submethods might want (or might define)...
Hi! Thanks for your curiosity. Please keep in mind that this only works on Julia v0.4. :) The basic idea is that it creates a generated ("staged") function that handles...