Examples of java.util.LinkedHashMap$EntrySet

java.util.LinkedHashMap
The entry we use includes next/prev pointers for a doubly-linked circular list with a head node. This reduces the special cases we have to deal with in the list operations. Note that we duplicate the key from the underlying hash map so we can find the eldest entry. The alternative would have been to modify HashMap so more of the code was directly usable here, but this would have added some overhead to HashMap, or to reimplement most of the HashMap code here with small modifications. Paying a small storage cost only if you use LinkedHashMap and minimizing code size seemed like a better tradeoff

     * @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$EntrySet

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.