Examples of org.apache.commons.collections.list.TreeList

Package org.apache.commons.collections.list

Examples of org.apache.commons.collections.list.TreeList

org.apache.commons.collections.list.TreeList
A List implementation that is optimised for fast insertions and removals at any index in the list.
This list implementation utilises a tree structure internally to ensure that all insertions and removals are O(log n). This provides much faster performance than both an ArrayList and a LinkedList where elements are inserted and removed repeatedly from anywhere in the list.
The following relative performance statistics are indicative of this class:
```
 get  add  insert  iterate  remove TreeList       3    5       1       2       1 ArrayList      1    1      40       1      40 LinkedList  5800    1     350       2     325 
```
ArrayList is a good general purpose list implementation. It is faster than TreeList for most operations except inserting and removing in the middle of the list. ArrayList also uses less memory as TreeList uses one object per entry.
LinkedList is rarely a good choice of implementation. TreeList is almost always a good replacement for it, although it does use sligtly more memory. @since Commons Collections 3.1 @version $Revision: 1.3 $ $Date: 2004/05/26 21:56:05 $ @author Joerg Schmuecker @author Stephen Colebourne

      
      assertNotNull(library.getBooks());
      assertNotNull(dto.getBooks());
      
      @SuppressWarnings("unchecked")
    List<Book> sortedBooks = new TreeList(library.getBooks()); 
      
      @SuppressWarnings("unchecked")
    List<BookDTO> sortedDTOs = new TreeList(dto.getBooks());
      
      assertEquals(sortedBooks.size(), sortedDTOs.size());
      
      for (int i = 0, count=sortedBooks.size(); i < count; ++i) {
        Book book = sortedBooks.get(i);
        BookDTO bookDto = sortedDTOs.get(i);
        assertValidMapping(book,bookDto);
      }
    }

View Full Code Here

      
      assertNotNull(library.getBooks());
      assertNotNull(dto.getBooks());
      
      @SuppressWarnings("unchecked")
    List<BookNested> sortedBooks = new TreeList(library.getBooks()); 
      
      @SuppressWarnings("unchecked")
    List<BookDTO> sortedDTOs = new TreeList(dto.getBooks());
      
      assertEquals(sortedBooks.size(), sortedDTOs.size());
      
      for (int i = 0, count=sortedBooks.size(); i < count; ++i) {
        BookNested book = sortedBooks.get(i);
        BookDTO bookDto = sortedDTOs.get(i);
        assertValidMapping(book,bookDto);
      }
    }

View Full Code Here

      
      assertNotNull(library.getBooks());
      assertNotNull(dto.getBooks());
      
      @SuppressWarnings("unchecked")
    List<Book> sortedBooks = new TreeList(library.getBooks()); 
      
      @SuppressWarnings("unchecked")
    List<BookDTO> sortedDTOs = new TreeList(dto.getBooks());
      
      assertEquals(sortedBooks.size(), sortedDTOs.size());
      
      for (int i = 0, count=sortedBooks.size(); i < count; ++i) {
        Book book = sortedBooks.get(i);
        BookDTO bookDto = sortedDTOs.get(i);
        assertValidMapping(book,bookDto);
      }
    }

View Full Code Here

      
      assertNotNull(library.getBooks());
      assertNotNull(dto.getBooks());
      
      @SuppressWarnings("unchecked")
    List<BookNested> sortedBooks = new TreeList(library.getBooks()); 
      
      @SuppressWarnings("unchecked")
    List<BookDTO> sortedDTOs = new TreeList(dto.getBooks());
      
      assertEquals(sortedBooks.size(), sortedDTOs.size());
      
      for (int i = 0, count=sortedBooks.size(); i < count; ++i) {
        BookNested book = sortedBooks.get(i);
        BookDTO bookDto = sortedDTOs.get(i);
        assertValidMapping(book,bookDto);
      }
    }

View Full Code Here

      
      assertNotNull(library.getBooks());
      assertNotNull(dto.getBooks());
      
      @SuppressWarnings("unchecked")
    List<Book> sortedBooks = new TreeList(library.getBooks()); 
      
      @SuppressWarnings("unchecked")
    List<BookDTO> sortedDTOs = new TreeList(dto.getBooks());
      
      assertEquals(sortedBooks.size(), sortedDTOs.size());
      
      for (int i = 0, count=sortedBooks.size(); i < count; ++i) {
        Book book = sortedBooks.get(i);
        BookDTO bookDto = sortedDTOs.get(i);
        assertValidMapping(book,bookDto);
      }
    }

View Full Code Here

      
      assertNotNull(library.getBooks());
      assertNotNull(dto.getBooks());
      
      @SuppressWarnings("unchecked")
    List<BookNested> sortedBooks = new TreeList(library.getBooks()); 
      
      @SuppressWarnings("unchecked")
    List<BookDTO> sortedDTOs = new TreeList(dto.getBooks());
      
      assertEquals(sortedBooks.size(), sortedDTOs.size());
      
      for (int i = 0, count=sortedBooks.size(); i < count; ++i) {
        BookNested book = sortedBooks.get(i);
        BookDTO bookDto = sortedDTOs.get(i);
        assertValidMapping(book,bookDto);
      }
    }

View Full Code Here

        if (this.headElements == null)
        {
            // org.apache.commons.collections.list.TreeList is well-optimized for
            // fast insertions at any index in the list.
            // Refer to description in the javadoc for details.
            this.headElements = new TreeList();
        }


        if (element == null)
        {
            if (keyHint != null)

View Full Code Here

        if (headElements == null)
        {
            // org.apache.commons.collections.list.TreeList is well-optimized for
            // fast insertions at any index in the list.
            // Refer to description in the javadoc for details.
            headElements = new TreeList();
            aggregateHeadElements(getFragment(), headElements);
            mergeHeadElementsByHint(headElements);
        }
        
        return headElements;

View Full Code Here

        if (this.headElements == null)
        {
            // org.apache.commons.collections.list.TreeList is well-optimized for
            // fast insertions at any index in the list.
            // Refer to description in the javadoc for details.
            this.headElements = new TreeList();
        }


        if (headElement == null)
        {
            if (keyHint != null)

View Full Code Here

        if (windowIds.isEmpty())
        {
            return headElements;
        }
        
        List<KeyValue<String, HeadElement>> mergedHeadElements = new TreeList(headElements);
        
        for (String windowId : windowIds)
        {
            PortletWindow window = portletWindows.get(windowId);

View Full Code Here

0 1

TOP

Related Classes of org.apache.commons.collections.list.TreeList

ma.glasnost.orika.test.boundmapperfacade.ConstructorMappingTestCase

ma.glasnost.orika.test.common.types.Validations

ma.glasnost.orika.test.constructor.ConstructorMappingTestCase

org.apache.jetspeed.aggregator.impl.PortletContentImpl

org.apache.jetspeed.om.window.impl.PortletWindowImpl

org.apache.jetspeed.request.JetspeedRequestContext

java.util.ConcurrentModificationException

java.util.NoSuchElementException

All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.