Examples of javolution.util.FastMap$Values

javolution.util.FastMap
synchronized(index) { // javolution.util.Index instances are unique. sparseVector.put(index, value); } ... // Get synchronized(index) { // Blocking only when accessing the same index. value = sparseVector.get(index); // Latest value guaranteed. }[/code]

{@link FastMap} may use custom key comparators; the default comparator iseither {@link FastComparator#DIRECT DIRECT} or {@link FastComparator#REHASH REHASH} based upon the current Javolution Configuration. Users may explicitly set the key comparator to {@link FastComparator#DIRECT DIRECT} for optimum performancewhen the hash codes are well distributed for all run-time platforms (e.g. calculated hash codes).

Custom key comparators are extremely useful for value retrieval when map's keys and argument keys are not of the same class (such as {@link String} and {@link javolution.text.Text Text} ( {@link FastComparator#LEXICAL LEXICAL})), to substitute more efficient hash code calculations ( {@link FastComparator#STRING STRING}) or for identity maps ( {@link FastComparator#IDENTITY IDENTITY}):[code] FastMap identityMap = new FastMap().setKeyComparator(FastComparator.IDENTITY); [/code]

{@link FastMap.Entry} can quickly be iterated over (forward or backward)without using iterators. For example:[code] FastMap map = ...; for (FastMap.Entry e = map.head(), end = map.tail(); (e = e.getNext()) != end;) { String key = e.getKey(); // No typecast necessary. Thread value = e.getValue(); // No typecast necessary. }[/code]

Custom map implementations may override the {@link #newEntry} method in order to return their own {@link Entry} implementation (with additional fields for example).

{@link FastMap} are {@link Reusable reusable}; they maintain an internal pool of Map.Entry objects. When an entry is removed from a map, it is automatically restored to its pool. Any new entry is allocated in the same memory area as the map itself (RTSJ). If the map is shared, removed entries are not recycled but only dereferenced (to maintain thread-safety)

{@link #shared() Shared} maps do not use internal synchronization, except in case ofconcurrent modifications of the map structure (entries being added/deleted). Reads and iterations are never synchronized and never blocking. With regards to the memory model, shared maps are equivalent to shared non-volatile variables (no "happen before" guarantee). They can be used as very efficient lookup tables. For example:[code] public class Unit { static FastMap labels = new FastMap().shared(); ... public String toString() { String label = labels.get(this); // No synchronization. if (label != null) return label; label = makeLabel(); labels.put(this, label); return label; } }[/code]

Implementation Note: To maintain time-determinism, rehash/resize is performed only when the map's size is small (see chart). For large maps (size > 512), the map is divided recursively into (64) smaller sub-maps. The cost of the dispatching (based upon hashcode value) has been measured to be at most 20% of the access time (and most often way less).
@author Jean-Marie Dautelle @version 5.2, September 11, 2007

        map = new FastMap();
    }
    
    protected CenterCommand(Map map) {
        if(map.keySet().size()< 7) throw new IllegalArgumentException("Illegal number argument");
        this.map = new FastMap(map);
    }

View Full Code Here

public class CenterGroupCommand implements Comparable<CenterGroupCommand>, Identifiable {


    private Map map;


    public CenterGroupCommand() {
        map = new FastMap();
    }

View Full Code Here


        // put an array into the token
        lResponse.put("array", new Object[]{1, 2, 3, 'a', 'b', 'c', "ABC", "XYZ", true, false});


        // put a map into the token
        Map lMap = new FastMap();
        lMap.put("MapItem1", 1);
        lMap.put("MapItem2", 2);
        lResponse.put("map", lMap);


        List lList = new FastList();
        lList.add("ListItem1");
        lList.add("ListItem2");

View Full Code Here

        Boolean lIsSecure = false;
        Long lSecNum1 = null;
        Long lSecNum2 = null;
        byte[] lSecKeyResp = new byte[8];


        Map lRes = new FastMap();


        int lReqLen = aReq.length;
        String lRequest = "";
        try {
            lRequest = new String(aReq, "US-ASCII");
        } catch (Exception ex) {
            // TODO: add exception handling
        }


        if (lRequest.indexOf("policy-file-request") >= 0) { // "<policy-file-request/>"
            lRes.put("policy-file-request", lRequest);
            return lRes;
        }


        lIsSecure = (lRequest.indexOf("Sec-WebSocket") > 0);


        if (lIsSecure) {
            lReqLen -= 8;
            for (int i = 0; i < 8; i++) {
                lSecKey3[i] = aReq[lReqLen + i];
            }
        }


        // now parse header for correct handshake....
        // get host....
        int lPos = lRequest.indexOf("Host:");
        lPos += 6;
        lHost = lRequest.substring(lPos);
        lPos = lHost.indexOf("\r\n");
        lHost = lHost.substring(0, lPos);
        // get origin....
        lPos = lRequest.indexOf("Origin:");
        lPos += 8;
        lOrigin = lRequest.substring(lPos);
        lPos = lOrigin.indexOf("\r\n");
        lOrigin = lOrigin.substring(0, lPos);
        // get path....
        lPos = lRequest.indexOf("GET");
        lPos += 4;
        lPath = lRequest.substring(lPos);
        lPos = lPath.indexOf("HTTP");
        lPath = lPath.substring(0, lPos - 1);


        lLocation = "ws://" + lHost + lPath;


        // the following section implements the sec-key process in WebSocket
        // Draft 76
        /*
         * To prove that the handshake was received, the server has to take
         * three pieces of information and combine them to form a response. The
         * first two pieces of information come from the |Sec-WebSocket-Key1|
         * and |Sec-WebSocket-Key2| fields in the client handshake.
         * 
         * Sec-WebSocket-Key1: 18x 6]8vM;54 *(5: { U1]8 z [ 8
         * Sec-WebSocket-Key2: 1_ tx7X d < nw 334J702) 7]o}` 0
         * 
         * For each of these fields, the server has to take the digits from the
         * value to obtain a number (in this case 1868545188 and 1733470270
         * respectively), then divide that number by the number of spaces
         * characters in the value (in this case 12 and 10) to obtain a 32-bit
         * number (155712099 and 173347027). These two resulting numbers are
         * then used in the server handshake, as described below.
         */


        lPos = lRequest.indexOf("Sec-WebSocket-Key1:");
        if (lPos > 0) {
            lPos += 20;
            lSecKey1 = lRequest.substring(lPos);
            lPos = lSecKey1.indexOf("\r\n");
            lSecKey1 = lSecKey1.substring(0, lPos);
            lSecNum1 = calcSecKeyNum(lSecKey1);
            // log.debug("Sec-WebSocket-Key1:" + secKey1 + " => " + secNum1);
        }


        lPos = lRequest.indexOf("Sec-WebSocket-Key2:");
        if (lPos > 0) {
            lPos += 20;
            lSecKey2 = lRequest.substring(lPos);
            lPos = lSecKey2.indexOf("\r\n");
            lSecKey2 = lSecKey2.substring(0, lPos);
            lSecNum2 = calcSecKeyNum(lSecKey2);
            // log.debug("Sec-WebSocket-Key2:" + secKey2 + " => " + secNum2);
        }


        /*
         * The third piece of information is given after the fields, in the last
         * eight bytes of the handshake, expressed here as they would be seen if
         * interpreted as ASCII: Tm[K T2u The concatenation of the number
         * obtained from processing the |Sec- WebSocket-Key1| field, expressed
         * as a big-endian 32 bit number, the number obtained from processing
         * the |Sec-WebSocket-Key2| field, again expressed as a big-endian 32
         * bit number, and finally the eight bytes at the end of the handshake,
         * form a 128 bit string whose MD5 sum is then used by the server to
         * prove that it read the handshake.
         */


        if (lSecNum1 != null && lSecNum2 != null) {


            // log.debug("Sec-WebSocket-Key3:" + new String(secKey3, "UTF-8"));
            BigInteger sec1 = new BigInteger(lSecNum1.toString());
            BigInteger sec2 = new BigInteger(lSecNum2.toString());


            // concatenate 3 parts secNum1 + secNum2 + secKey (16 Bytes)
            byte[] l128Bit = new byte[] { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 };
            byte[] lTmp;
            int lOfs;


            lTmp = sec1.toByteArray();
      int lIdx = lTmp.length;
      int lCnt = 0;
      while(lIdx > 0 && lCnt < 4) {
        lIdx--;
        lCnt++;
                l128Bit[4 - lCnt] = lTmp[lIdx];
            }


            lTmp = sec2.toByteArray();
      lIdx = lTmp.length;
      lCnt = 0;
      while(lIdx > 0 && lCnt < 4) {
        lIdx--;
        lCnt++;
                l128Bit[8 - lCnt] = lTmp[lIdx];
            }


            lTmp = lSecKey3;
      System.arraycopy(lSecKey3, 0, l128Bit, 8, 8);
/*
            // TODO: replace by arraycopy
            for (int i = 0; i < 8; i++) {
                l128Bit[i + 8] = lTmp[i];
            }
 */
            // build md5 sum of this new 128 byte string
            try {
                MessageDigest md = MessageDigest.getInstance("MD5");
                lSecKeyResp = md.digest(l128Bit);
            } catch (Exception ex) {
                // log.error("getMD5: " + ex.getMessage());
            }
        }


        lRes.put("path", lPath);
        lRes.put("host", lHost);
        lRes.put("origin", lOrigin);
        lRes.put("location", lLocation);
        lRes.put("secKey1", lSecKey1);
        lRes.put("secKey2", lSecKey2);


        lRes.put("isSecure", lIsSecure);
        lRes.put("secKeyResponse", lSecKeyResp);


        return lRes;
    }

View Full Code Here

    }


    if (getUsername(aConnector) != null) {
      String lGroup = aToken.getString("group");
      Integer lMode = aToken.getInteger("mode", 0);
      FastMap lFilter = new FastMap();
      lFilter.put(BaseConnector.VAR_USERNAME, ".*");
      List<String> listOut = new FastList<String>();
      for (WebSocketConnector lConnector : getServer().selectConnectors(lFilter).values()) {
        listOut.add(getUsername(lConnector) + "@"
            + lConnector.getRemotePort());
      }

View Full Code Here

     * @param aResp
     * 
     * @return
     */
    public static Map parseS2CResponse(byte[] aResp) {
        Map lRes = new FastMap();
        String lResp = null;
        try {
            lResp = new String(aResp, "US-ASCII");
        } catch (Exception ex) {
            // TODO: add exception handling

View Full Code Here

    PrintWriter out = response.getWriter();


    try {
      if (server != null) {
        // convert request arguments to token
        FastMap<String, String[]> lParms = new FastMap(request.getParameterMap());
        Token lToken = new Token();
        for (String lParm : lParms.keySet()) {
          String[] lValues = lParms.get(lParm);
          if (lValues != null && lValues.length > 0) {
            lToken.put(lParm, lValues[0]);
          }
        }
        ServletConnector lConn = new ServletConnector(request, response);

View Full Code Here

            }
            allocators.clear();
        }


        protected Allocator getAllocator(ObjectFactory factory) {
            FastMap factoryToAllocator = (FastMap) _factoryToAllocator.get();
            StackAllocator allocator = (StackAllocator) factoryToAllocator.get(factory);
            if (allocator == null) {
                allocator = new StackAllocator(factory);
                factoryToAllocator.put(factory, allocator);
            }
            if (allocator.user == null) { // Activate.
                allocator.user = Thread.currentThread();
                FastTable activeAllocators = (FastTable) _activeAllocators.get();
                activeAllocators.add(allocator);

View Full Code Here

        allocators.clear();
    }


    // Overrides.
    protected Allocator getAllocator(ObjectFactory factory) {
        final FastMap factoryToAllocator = (FastMap) FACTORY_TO_ALLOCATOR.get();
        PoolAllocator allocator = (PoolAllocator) factoryToAllocator.get(factory);
        if (allocator == null) {
            allocator = new PoolAllocator(factory);
            factoryToAllocator.put(factory, allocator);
        }
        if (allocator.user == null) { // Activate.
            allocator.user = Thread.currentThread();
            FastTable activeAllocators = (FastTable) ACTIVE_ALLOCATORS.get();
            activeAllocators.add(allocator);

View Full Code Here

        public Object getField(Class forClass, Class type, boolean inherited) {
            ClassInitializer.initialize(forClass);
            return getField2(forClass, type, inherited);
        }
        private Object getField2(Class forClass, Class type, boolean inherited) {
            FastMap typeToField = (FastMap) _fields.get(forClass);
            if (typeToField != null) {
                Object field = typeToField.get(type);
                if (field != null)
                    return field;
            }
            if (!inherited)
                return null;

View Full Code Here

0 1 2 3 4 5 6

TOP

Related Classes of javolution.util.FastMap$Values

com.enigmastation.collections.NestedDictionary

com.enigmastation.collections.NestedDictionaryStringStringDouble

com.foundationdb.server.types.TClass

com.foundationdb.server.types.TExecutionContext

com.foundationdb.server.types.TInstance

com.foundationdb.server.types.value.Value

com.foundationdb.server.types.value.ValueSource

com.google.common.base.Predicate

de.timefinder.core.io.xml.XmlImport

javolution.context.HeapContext

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.