Brownies Collections complements the Java Collections Framework:
The class GapList combines the strengths of both ArrayList and LinkedList. It is implemented to offer both efficient random access to elements by index (as ArrayList does) and at the same time efficient adding and removing elements to and from beginning and end (as LinkedList does). It also exploits the locality of reference often seen in applications to further improve performance, e.g. for iterating over the list.
GapList has been designed to be used as drop-in replacement for both ArrayList and LinkedList by offering all their methods. It has a high test coverage and also passes the Guava testsuite for lists. Additionally many more helpful methods are available.
GapList has first been introduced in an article on Javalobby.
Additionally there are List implementations for all primitive data types. As the storage is realized using arrays of primitives, memory is saved and execution speed increased. For each primitive list class like IntGapList there is also wrapper class IntObjGapList which allows you to access the primitive data through the standard List interface.
To increase developer productivity, keys and constraints have been added to collections in an orthogonal and declarative way. These features offered by classes implementing the Collection (classes KeyCollection, Key1Collection, Key2Collection) and the List interface (classes KeyList, Key1List, Key2List).
You can read more about key collections in this article.
The Brownies Collections can be used with Java 6 or 7. The library has no additional dependencies, so you only need to add the JAR file to your class path. You can download the library under Download.
Use the Google group brownies-collections to ask questions or discuss about GapList or Brownies Collections.
The Brownies Collections are released under the Apache License 2.0.