Examples of LinkedMap

org.apache.commons.collections.map.LinkedMap
A Map implementation that maintains the order of the entries. In this implementation order is maintained by original insertion.
This implementation improves on the JDK1.4 LinkedHashMap by adding the {@link org.apache.commons.collections.MapIterator MapIterator}functionality, additional convenience methods and allowing bidirectional iteration. It also implements OrderedMap. In addition, non-interface methods are provided to access the map by index.
The orderedMapIterator() method provides direct access to a bidirectional iterator. The iterators from the other views can also be cast to OrderedIterator if required.
All the available iterators can be reset back to the start by casting to ResettableIterator and calling reset().
The implementation is also designed to be subclassed, with lots of useful methods exposed. @since Commons Collections 3.0 @version $Revision: 1.9 $ $Date: 2004/02/18 01:13:19 $ @author Stephen Colebourne
org.apache.commons.collections15.map.LinkedMap
A Map implementation that maintains the order of the entries. In this implementation order is maintained by original insertion.
This implementation improves on the JDK1.4 LinkedHashMap by adding the {@link org.apache.commons.collections15.MapIterator MapIterator}functionality, additional convenience methods and allowing bidirectional iteration. It also implements OrderedMap. In addition, non-interface methods are provided to access the map by index.
The orderedMapIterator() method provides direct access to a bidirectional iterator. The iterators from the other views can also be cast to OrderedIterator if required.
All the available iterators can be reset back to the start by casting to ResettableIterator and calling reset().
The implementation is also designed to be subclassed, with lots of useful methods exposed. @author Matt Hall, John Watkinson, Stephen Colebourne @version $Revision: 1.1 $ $Date: 2005/10/11 17:05:32 $ @since Commons Collections 3.0
org.pentaho.reporting.libraries.base.util.LinkedMap
A fast linked-hashmap that avoids any unneccessay work. It is slightly slower than an ordinary hashmap but faster than a combined hashmap and list-index that would be needed to get this functionality on JDK 1.2. The map is as fast as the LinkedHashMap of JDK 1.4+. @author Thomas Morgner @noinspection ProtectedField

Examples of org.apache.commons.collections.map.LinkedMap

     * Consolidate an event iterator obtained from observation, merging
     * add and remove operations on nodes with the same UUID into a move
     * operation.
     */
    private Iterator consolidateEvents(EventIterator events) {
        LinkedMap eventMap = new LinkedMap();


        while (events.hasNext()) {
            EventImpl event = (EventImpl) events.nextEvent();
            HierarchyEvent he;


            try {
                he = new HierarchyEvent(event.getChildId(),
                        PathFormat.parse(event.getPath(), nsResolver).getNormalizedPath(),
                        event.getType());
            } catch (MalformedPathException e) {
                log.info("Unable to get event's path: " + e.getMessage());
                continue;
            } catch (RepositoryException e) {
                log.info("Unable to get event's path: " + e.getMessage());
                continue;
            }


            HierarchyEvent heExisting = (HierarchyEvent) eventMap.get(he.id);
            if (heExisting != null) {
                heExisting.merge(he);
            } else {
                eventMap.put(he.id, he);
            }
        }
        return eventMap.values().iterator();
    }

View Full Code Here

Examples of org.apache.commons.collections.map.LinkedMap

        // map used for lookup by name
        // (key=name, value=either a single entry or a list of sns entries)
        private HashMap nameMap;


        ChildNodeEntries() {
            entries = new LinkedMap();
            nameMap = new HashMap();
        }

View Full Code Here

Examples of org.apache.commons.collections.map.LinkedMap

                out.writeUTF(entry.getId().toString());  // id
            }
        }


        private void readObject(ObjectInputStream in) throws IOException {
            entries = new LinkedMap();
            nameMap = new HashMap();
            // important: fields must be read in same order as they are
            // written in writeObject(ObjectOutputStream)
            short count = in.readShort();   // count
            for (int i = 0; i < count; i++) {

View Full Code Here

Examples of org.apache.commons.collections.map.LinkedMap

     * Consolidate an event iterator obtained from observation, merging
     * add and remove operations on nodes with the same UUID into a move
     * operation.
     */
    private Iterator consolidateEvents(EventIterator events) {
        LinkedMap eventMap = new LinkedMap();


        while (events.hasNext()) {
            EventImpl event = (EventImpl) events.nextEvent();
            HierarchyEvent he;


            try {
                he = new HierarchyEvent(event.getChildId(),
                        sysSession.getQPath(event.getPath()).getNormalizedPath(),
                        event.getType());
            } catch (MalformedPathException e) {
                log.info("Unable to get event's path: " + e.getMessage());
                continue;
            } catch (RepositoryException e) {
                log.info("Unable to get event's path: " + e.getMessage());
                continue;
            }


            HierarchyEvent heExisting = (HierarchyEvent) eventMap.get(he.id);
            if (heExisting != null) {
                heExisting.merge(he);
            } else {
                eventMap.put(he.id, he);
            }
        }
        return eventMap.values().iterator();
    }

View Full Code Here

Examples of org.apache.commons.collections.map.LinkedMap

     * modifiable.
     */
    private void ensureModifiable() {
        if (nameMap == Collections.EMPTY_MAP) {
            nameMap = new HashMap();
            entries = new LinkedMap();
        } else if (shared) {
            entries = (LinkedMap) entries.clone();
            nameMap = (Map) ((HashMap) nameMap).clone();
            for (Iterator it = nameMap.entrySet().iterator(); it.hasNext(); ) {
                Map.Entry entry = (Map.Entry) it.next();

View Full Code Here

Examples of org.apache.commons.collections.map.LinkedMap

        {
            throw new IllegalArgumentException(
                    "Configuration must not be null!");
        }
        configuration = config;
        layoutData = new LinkedMap();
        config.addConfigurationListener(this);


        if (c != null)
        {
            copyFrom(c);

View Full Code Here

Examples of org.apache.commons.collections.map.LinkedMap

     * Consolidate an event iterator obtained from observation, merging
     * add and remove operations on nodes with the same UUID into a move
     * operation.
     */
    private Iterator<HierarchyEvent> consolidateEvents(EventIterator events) {
        LinkedMap eventMap = new LinkedMap();


        while (events.hasNext()) {
            EventImpl event = (EventImpl) events.nextEvent();
            HierarchyEvent he;


            try {
                he = new HierarchyEvent(event.getChildId(),
                        sysSession.getQPath(event.getPath()).getNormalizedPath(),
                        event.getType());
            } catch (MalformedPathException e) {
                log.info("Unable to get event's path: " + e.getMessage());
                continue;
            } catch (RepositoryException e) {
                log.info("Unable to get event's path: " + e.getMessage());
                continue;
            }


            HierarchyEvent heExisting = (HierarchyEvent) eventMap.get(he.id);
            if (heExisting != null) {
                heExisting.merge(he);
            } else {
                eventMap.put(he.id, he);
            }
        }
        return eventMap.values().iterator();
    }

View Full Code Here

Examples of org.apache.commons.collections.map.LinkedMap

     * Consolidate an event iterator obtained from observation, merging
     * add and remove operations on nodes with the same UUID into a move
     * operation.
     */
    private Iterator<HierarchyEvent> consolidateEvents(EventIterator events) {
        LinkedMap eventMap = new LinkedMap();


        while (events.hasNext()) {
            EventImpl event = (EventImpl) events.nextEvent();
            HierarchyEvent he;


            try {
                he = new HierarchyEvent(event.getChildId(),
                        sysSession.getQPath(event.getPath()).getNormalizedPath(),
                        event.getType());
            } catch (MalformedPathException e) {
                log.info("Unable to get event's path: " + e.getMessage());
                continue;
            } catch (RepositoryException e) {
                log.info("Unable to get event's path: " + e.getMessage());
                continue;
            }


            HierarchyEvent heExisting = (HierarchyEvent) eventMap.get(he.id);
            if (heExisting != null) {
                heExisting.merge(he);
            } else {
                eventMap.put(he.id, he);
            }
        }
        return eventMap.values().iterator();
    }

View Full Code Here

Examples of org.apache.commons.collections15.map.LinkedMap

        String[] testCaseName = {TestMapBackedSet2.class.getName()};
        junit.textui.TestRunner.main(testCaseName);
    }


    public Set makeEmptySet() {
        return MapBackedSet.decorate(new LinkedMap());
    }

View Full Code Here

Examples of org.pentaho.reporting.libraries.base.util.LinkedMap

   *
   * @throws SAXException if there is a parsing error.
   */
  protected void doneParsing() throws SAXException
  {
    final LinkedMap map = (LinkedMap) parameters.getObject();
    staticDataFactory = new NamedStaticDataFactory();
    if (map.isEmpty())
    {
      staticDataFactory.setQuery(queryName, className + '#' + methodName);
    }
    else
    {
      String query = className + '#' + methodName + '(';
      final Object[] objects = map.keys();
      for (int i = 0; i < objects.length; i++)
      {
        if (i != 0)
        {
          query += ",";

View Full Code Here

0 1 2 3 4 5

TOP

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.