Examples of java.util.LinkedHashMap$AbstractMapIterator

java.util.LinkedHashMap
LinkedHashMap is a variant of HashMap. Its entries are kept in a doubly-linked list. The iteration order is, by default, the order in which keys were inserted. Reinserting an already existing key doesn't change the order. A key is existing if a call to {@code containsKey} would return true.
If the three argument constructor is used, and {@code order} is specified as{@code true}, the iteration will be in the order that entries were accessed. The access order gets affected by put(), get(), putAll() operations, but not by operations on the collection views.
Null elements are allowed, and all the optional map operations are supported.
Note: The implementation of {@code LinkedHashMap} is not synchronized.If one thread of several threads accessing an instance modifies the map structurally, access to the map needs to be synchronized. For insertion-ordered instances a structural modification is an operation that removes or adds an entry. Access-ordered instances also are structurally modified by put(), get() and putAll() since these methods change the order of the entries. Changes in the value of an entry are not structural changes.
The Iterator that can be created by calling the {@code iterator} methodthrows a {@code ConcurrentModificationException} if the map is structurallychanged while an iterator is used to iterate over the elements. Only the {@code remove} method that is provided by the iterator allows for removal ofelements during iteration. It is not possible to guarantee that this mechanism works in all cases of unsynchronized concurrent modification. It should only be used for debugging purposes. @since 1.4

     * @param e The element under which the form is keyed (e.g. "<form>" in HTML)
     * @param f The form element being stored.
     */
    protected void addForm(Element e, XhtmlForm f) {
        if (forms == null) {
            forms = new LinkedHashMap();
        }
        forms.put(e, f);
    }

View Full Code Here

    private Element _parentFormElement;


    public XhtmlForm(UserAgentCallback uac, Element e) {
        _userAgentCallback = uac;
        _buttonGroups = new HashMap();
        _componentCache = new LinkedHashMap();
        _parentFormElement = e;
    }

View Full Code Here


public class HttpHeaders {
    private Map map;


    public HttpHeaders() {
        this.map = new LinkedHashMap();
    }

View Full Code Here

         * method / RelationEntryHolder
         * @param relationName The relation to look for
         * @return The map
         */
        private LinkedHashMap getMapFor(String relationName) {
            LinkedHashMap retVal;
            retVal = (LinkedHashMap) relations.get(relationName);


            if (retVal == null) {
                retVal = new LinkedHashMap();
                relations.put(relationName, retVal);
            }


            return retVal;
        }

View Full Code Here


            return retVal;
        }


        public void manage(EjbRelationTag relTag, JavaMethod method, JavaClass sourceBean) {
            LinkedHashMap mapFor = getMapFor(relTag.getName_());
            RelationEntryHolder entryHolder;


            if (mapFor.containsKey(method)) {
                entryHolder = (RelationEntryHolder) mapFor.get(method);


                if (log.isDebugEnabled()) {
                    log.debug("Existing relation entry pair for relation named '" + relTag.getName_() + "' found at " +
                        tagToString(relTag));
                }
            } else {
                if (log.isDebugEnabled()) {
                    log.debug("A new relation entry pair for relation named '" + relTag.getName_() +
                        "' is being created at " + tagToString(relTag));
                }


                entryHolder = new RelationEntryHolder(relTag, method);
                mapFor.put(method, entryHolder);
            }


            entryHolder.addSourceBean(sourceBean);
        }

View Full Code Here

         * @param relationName The relation name
         * @return The list of found relations (empty array if not found)
         */
        public Relation[] getRelationsByName(String relationName) {
            Collection retVal = new ArrayList();
            LinkedHashMap mapFor = (LinkedHashMap) relations.get(relationName);


            if (mapFor != null) {
                retVal.addAll(validateAndCreateRelations(relationName, mapFor));
            }

View Full Code Here

    public FIFO(int cacheSize) {
        if (cacheSize <= 0) {
            throw new IllegalArgumentException("cacheSize must be larger than 0");
        } else {
            this.sizeBoundary = cacheSize;
            this.map = new LinkedHashMap(cacheSize + 1, 1, false) {
                protected boolean removeEldestEntry(Map.Entry eldest) {
                    return size() > sizeBoundary;
                }
            };
        }

View Full Code Here

    public MeasurableLRU(long sizeBoundaryInBytes) {
        if (sizeBoundaryInBytes <= 0) {
            throw new IllegalArgumentException("cacheSize must be larger than 0");
        } else {
            this.sizeBoundaryInBytes = sizeBoundaryInBytes;
            this.map = new LinkedHashMap(DEFAULT_INITIAL_CAPACITY, DEFAULT_LOAD_FACTOR, true);
        }
    }

View Full Code Here

    public LRU(int cacheSize) {
        if (cacheSize <= 0) {
            throw new IllegalArgumentException("cacheSize must be larger than 0");
        } else {
            this.sizeBoundary = cacheSize;
            this.map = new LinkedHashMap(cacheSize + 1, 1, true) {
                protected boolean removeEldestEntry(Map.Entry eldest) {
                    return size() > sizeBoundary;
                }
            };
        }

View Full Code Here

    public MeasurableFIFO(long sizeBoundaryInBytes) {
        if (sizeBoundaryInBytes <= 0) {
            throw new IllegalArgumentException("cacheSize must be larger than 0");
        } else {
            this.sizeBoundaryInBytes = sizeBoundaryInBytes;
            this.map = new LinkedHashMap(DEFAULT_INITIAL_CAPACITY, DEFAULT_LOAD_FACTOR, false);
        }
    }

View Full Code Here

0 1 2 3 4 5 6 7 8 9

TOP

Related Classes of java.util.LinkedHashMap$AbstractMapIterator

com.alibaba.fastjson.parser.deserializer.MapDeserializer

com.alibaba.json.bvt.serializer.JSONSerializerFeatureTest

com.alimama.mdrill.json.JSONObject

com.azazar.krotjson.CrippledJavaScriptParser

com.cedarsoftware.util.io.JsonReader

com.cedarsoftware.util.io.JsonReader$MapFactory

com.common.tool.CollectionUtil

com.eva.properties.MapProperties

com.google.gwt.user.client.rpc.core.java.util.LinkedHashMap_CustomFieldSerializer

com.iisigroup.cap.log.LogContext

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.