10

Does the Java standard library have any functional data structures, like immutable Sets, Lists, etc., with functional update?

3
  • Do you want a deep copy of all the objects in the list or simply a function that gives you a new list of pointers all to the same objects as the source? Commented Nov 5, 2009 at 20:51
  • I want a persistent data structure for a Set not implemented in a silly way. For example, an immutable list could implement adding by copying all the elements into a new list and adding the element - O(n). Or it could be a linked list, add the element to the head, and return the head - O(1) Commented Nov 5, 2009 at 20:59
  • there is no general way to "deep-copy" anything in Java. Commented Nov 5, 2009 at 22:50

10 Answers 10

15

Functional java has Sets, Lists and more interesting abstractions.

Sign up to request clarification or add additional context in comments.

Comments

2

Have a look at the pcollections project:

PCollections serves as a persistent and immutable analogue of the Java Collections Framework. This includes efficient, thread-safe, generic, immutable, and persistent stacks, maps, vectors, sets, and bags, compatible with their Java Collections counterparts.

Persistent and immutable datatypes are increasingly appreciated as a simple, design-friendly, concurrency-friendly, and sometimes more time- and space-efficient alternative to mutable datatypes.

Comments

1

Sounds like you're looking for Scala. It compiles to .class, so that's good enough, right?

1 Comment

hmm perhaps. It's just that we got some support code in a course that acts functionally (i.e. adding something to a structure returns a new version w/ the update), but it's written by just always copying the old structure and adding something new to it. it makes me sad. i wondered if there was an easy, better way, but I guess Java just makes it hard.
1

Well, there are two possible approaches to "changing" an immutable collection:

  • Make a copy of it that includes the "change"

  • Create a new, different object that consists of a reference to the original object and a reference to a description of the change.

Clojure takes the latter approach, so it becomes fairly quick to create a lot of siblings of an original collection with minor corrections to each, with reasonable memory requirements. But most Java code tends to go for the first option.

For what it's worth, Google has created a handful of collections that support functional-style programming: http://code.google.com/p/google-collections/ but I haven't looked at them in depth.

Comments

1

You don't need scala. Just pass your collection into:

java.util.Collections.unmodifiableCollection(/* Collection<? extends T> c */);
java.util.Collections.unmodifiableSet(Set s);
java.util.Collections.unmodifiableMap(Map m);
java.util.Collections.unmodifiableList(List l);

I just saw this from another SO question:

Google's ImmutableSet

http://google-collections.googlecode.com/svn/trunk/javadoc/com/google/common/collect/ImmutableSet.html

from the docs:

Unlike Collections.unmodifiableSet(java.util.Set), which is a view of a separate collection that can still change, an instance of this class contains its own private data and will never change. This class is convenient for public static final sets ("constant sets") and also lets you easily make a "defensive copy" of a set provided to your class by a caller.

edited to incorporate comment.

4 Comments

+1: You were quickier =) There are by the way also unmodifiableList(), unmodifiableMap(), ans more methods available in java.util.Collections API: java.sun.com/javase/6/docs/api/java/util/Collections.html
I want to add something to a Set, keeping the old Set the same, and returning a new Set. I dont think unmodifiableSet gives me that?
@Claudiu yes, unmodifiableSet will certainly not do that.
Immutable and unmodifiable are not the same thing. An attempt to mutate an unmodifiable collection will lead to a RuntimeException, whereas with immutable collection such a mutation is not possible at all and thus the code is guaranteed not to blow up at runtime. (Look at source code of fj.data.List if you don't understand what I mean.)
1

It's always nice to see Google Collections plugged, but no, we do not have this. I don't know of any Java library that does. Inside Google, we implemented some functional List structures, and guess what? No one uses them. So they aren't likely to become open-sourced any time soon.

Comments

1

I know this is an old question but a bit of searching around tells me that now we have an alternative for Functional Java.

JavasLang looks like an interesting library for declarative programming and functional data structures in Java.

I haven't compared it with Functional Java in terms of ease of use and performance, but I'd love to get any pointers on that.

Comments

0

If you are interested in collections manipulation in a functional style give a look to lambdaj

Comments

0

Strings and numbers are immutable in a functional way, but most collections are not (the immutable collections throw exceptions on add, remove, etc). CopyOnWriteArrayList and CopyOnWriteArraySet are the closest in that sense.

Comments

-1

Take a look at Google collections.

Comments

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Start asking to get answers

Find the answer to your question by asking.

Ask question

Explore related questions

See similar questions with these tags.