Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

What about immutable? #27

Open
johnynek opened this issue Dec 8, 2015 · 1 comment
Open

What about immutable? #27

johnynek opened this issue Dec 8, 2015 · 1 comment

Comments

@johnynek
Copy link

johnynek commented Dec 8, 2015

a specialized immutable list might be of use. Likewise Vector and HashTrieMap/Set. Especially with concurrency, sometimes the immutable versions are better (when you need to provide snapshotting without copying).

@rklaehn
Copy link

rklaehn commented Dec 19, 2015

Once it is finally settled where basic typeclasses like Eq, Monoid, Order, Hash, Show live (spire.algebra, algebra, cats, whatever), I could port over the data structure underlying s.c.i.HashTrie/HashSet. Deep under all the scala collections methods it is actually quite beautiful. I implemented tree/tree operations for it in scala 2.11.

I also started working on some immutable, specialized collections in https://github.com/rklaehn/abc . But I have to pull in Show from cats and provide my own Hash, which is less than optimal.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

2 participants