commons-dev mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
Subject cvs commit: jakarta-commons/collections STATUS.html
Date Fri, 16 May 2003 15:59:51 GMT
scolebourne    2003/05/16 08:59:51

  Modified:    collections STATUS.html
  Update with classes that have been added/removed
  Revision  Changes    Path
  1.26      +10 -12    jakarta-commons/collections/STATUS.html
  Index: STATUS.html
  RCS file: /home/cvs/jakarta-commons/collections/STATUS.html,v
  retrieving revision 1.25
  retrieving revision 1.26
  diff -u -r1.25 -r1.26
  --- STATUS.html	7 May 2003 09:51:41 -0000	1.25
  +++ STATUS.html	16 May 2003 15:59:51 -0000	1.26
  @@ -48,6 +48,8 @@
       in some well-defined order.</li>
   <li><strong>BufferUtils</strong> - Contains static utility methods for

  +<li><strong>CircularFifoBuffer</strong> - a Buffer implementation that
is fixed in
  +    size and overwrites its oldest entry when full.</li>
   <li><strong>CollectionUtils</strong> - a variety of helper methods
       for working with collections.</li>
   <li><strong>ComparatorUtils</strong> - Contains static utility methods
  @@ -77,21 +79,18 @@
   <li><strong>IteratorUtils</strong> - Contains static utility methods
   <li><strong>ListUtils</strong> - miscelaneous utilities to manipulate
  +<li><strong>LRUMap</strong> - a least recently used Map implementation.</li>
   <li><strong>MultiMap</strong> - This is simply a Map with slightly different
       Instead of returning an Object, it returns a Collection.
       So for example, you can put( key, new Integer(1) ); 
       and then a Object get( key ); will return you a Collection 
       instead of an Integer.  This is an interface implemented
       by <strong>MultiHashMap</strong>.</li>
  +<li><strong>NodeCachingLinkedList</strong> - a LinkedList implementation
that has better
  +    performance.</li>
   <li><strong>PriorityQueue</strong> - a PriorityQueue interface, with
  -    <strong>BinaryHeap</strong> and <strong>SynchronizedPriorityQueue</strong>
  -    implementations.</li>
  -<li><strong>ProxyMap</strong> - This <code>Map</code> wraps
another <code>Map</code>
  -    implementation, using the wrapped instance for its default
  -    implementation.  This class is used as a framework on which to
  -    build to extensions for its wrapped <code>Map</code> object which
  -    would be unavailable or inconvenient via sub-classing (but usable
  -    via composition).</li>
  +    <strong>BinaryHeap</strong> as an implementation.</li>
  +<li><strong>PriorityQueueUtils</strong> - miscelaneous utilities to manipulate
   <li><strong>ReferenceMap</strong> - Hashtable-based Map implementation
       allows mappings to be removed by the garbage collector.</li>
   <li><strong>SequencedHashMap</strong> -  A map of objects whose mapping
entries are 
  @@ -102,9 +101,6 @@
   <li><strong>StaticBucketMap</strong> - An efficient, thread-safe 
       implementation of java.util.Map that performs well in in a highly 
       thread-contentious environment.</li>
  -<li><strong>StringStack</strong> - A stack for string objects.</li>
  -<li><strong>SynchronizedPriorityQueue</strong> - A thread-safe version
  -    the priority queue.</li>
   <li><strong>TreeBag</strong> - An implementation of <strong>Bag</strong>
that is backed by a 
       TreeMap. Order will be maintained among the unique representative
  @@ -130,6 +126,8 @@
      to multi-column sorting in SQL, and this class
      allows Java classes to emulate that kind of behaviour
      when sorting a List.</li>
  +<li><strong>FixedOrderComparator</strong> - A comparator that will compare
in an order
  +    specified at construction time.</li>
   <li><strong>NullComparator</strong> - A comparator that will compare
       to be either higher or lower than other objects.</li>
   <li><strong>ReverseComparator</strong> - Reverses the order of another


To unsubscribe, e-mail:
For additional commands, e-mail:

View raw message