Examples of entrySet()

Examples of java.util.Hashtable.entrySet()

1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
      return;
   
    // consumers
    Hashtable copyConsumers = (Hashtable) consumers.clone();
   
    Set keys = copyConsumers.entrySet();
    Iterator it = keys.iterator();
    while (it.hasNext()) {
      Map.Entry entry = (Map.Entry) it.next();
     
      MessageEndpointFactory endpointFactory = ((InboundConsumer)entry.getValue()).endpointFactory;
View Full Code Here

Examples of java.util.IdentityHashMap.entrySet()

145
146
147
148
149
150
151
152
153
154
155
            }
            //top-level contribution
            scxmlCount.add(tt);
        }
        //Validate counts:
        for (Iterator i = counts.entrySet().iterator(); i.hasNext();) {
            Map.Entry entry = (Map.Entry) i.next();
            TransitionTarget tt = (TransitionTarget) entry.getKey();
            Set count = (Set) entry.getValue();
            if (tt instanceof Parallel) {
                Parallel p = (Parallel) tt;
View Full Code Here

Examples of java.util.LinkedHashMap.entrySet()

65
66
67
68
69
70
71
72
73
74
75
    result = (Offset[]) startDate_Offsets.get(bottomUnitStartDate);
    if (result==null) {
      result = myCalculator.calculateOffsets(timeFrame, frameBottomUnit, bottomUnitStartDate, offsetUnit, frameBottomUnitWidth);
      startDate_Offsets.put(bottomUnitStartDate, result);
            if (startDate_Offsets.size()>MAX_CACHE_SIZE) {
                Iterator iter = startDate_Offsets.entrySet().iterator();
                iter.next();
                iter.remove();
            }
    }
    return result;
View Full Code Here

Examples of java.util.List.entrySet()

118
119
120
121
122
123
124
125
126
127
128
            {
                Map dependencies = container.lookupMap( role );

                retValue = container.getComponentDescriptorList( role );

                field.set( component, dependencies.entrySet() );
            }
            else //"ordinary" field
            {
                String key = requirement.getRequirementKey();
View Full Code Here

Examples of java.util.Map.entrySet()

204
205
206
207
208
209
210
211
212
213
214
        Map accessMap = getAccessMap(metadata, capFinder, joinRegion);
       
        boolean structureChanged = false;
       
        //search for combinations of join sources that should be pushed down
        for (Iterator accessNodeIter = accessMap.entrySet().iterator(); accessNodeIter.hasNext();) {
            Map.Entry entry = (Map.Entry)accessNodeIter.next();
           
            List<PlanNode> accessNodes = (List)entry.getValue();
           
            if (accessNodes.size() < 2) {
View Full Code Here

Examples of java.util.NavigableMap.entrySet()

966
967
968
969
970
971
972
973
974
975
976
        assertEquals(three, k);
        k = (Integer)(r.next());
        assertEquals(two, k);
        assertFalse(r.hasNext());

        Iterator ei = sm.entrySet().iterator();
        Map.Entry e;
        e = (Map.Entry)(ei.next());
        assertEquals(two, e.getKey());
        assertEquals("B", e.getValue());
        e = (Map.Entry)(ei.next());
View Full Code Here

Examples of java.util.Properties.entrySet()

46
47
48
49
50
51
52
53
54
55
56
//        Map<String, String> englishMap = FastMap.newInstance();
        Set<String> deKeys = FastSet.newInstance();
        Map<String, String> missingInDE = new TreeMap();
        Set<String> unusedInDE = FastSet.newInstance();

        for (Entry<Object, Object> entry : de.entrySet()) {
            deKeys.add(entry.getKey().toString());
        }

        for (Entry<Object, Object> entry : english.entrySet()) {
            if (!deKeys.contains(entry.getKey().toString()))
View Full Code Here

Examples of java.util.SortedMap.entrySet()

258
259
260
261
262
263
264
265
266
267
268
        final String pkgName = (String) iE.getKey();
        final VersionRange range = (VersionRange) iE.getValue();

        SortedMap versions = (SortedMap) allExports.get(pkgName);
        if (null != versions) {
          final Iterator itV = versions.entrySet().iterator();
          while (itV.hasNext()) {
            final Map.Entry vE = (Map.Entry) itV.next();
            final Version pkgVersion = (Version) vE.getKey();

            if (range.contains(pkgVersion)) {
View Full Code Here

Examples of java.util.TreeMap.entrySet()

115
116
117
118
119
120
121
122
123
124
125
        resources.getString("system-properties-table.column.value"),};

    final Properties sysProps = System.getProperties();

    final TreeMap data = new TreeMap(sysProps);
    final Map.Entry[] entries = (Map.Entry[]) data.entrySet().toArray(new Map.Entry[data.size()]);
    final DefaultTableModel properties = new DefaultTableModel(names, entries.length);
    for (int i = 0; i < entries.length; i++)
    {
      final Map.Entry entry = entries[i];
      properties.setValueAt(entry.getKey(), i, 0);
View Full Code Here

Examples of java.util.WeakHashMap.entrySet()

55
56
57
58
59
60
61
62
63
64
65
        SessionListener sessions = new SessionListener();
        WeakHashMap allSessions = sessions.getAllSessions();
        List userList = new ArrayList();

        Iterator userit = allSessions.entrySet().iterator();
        while (userit.hasNext()) {
            Map.Entry entry = (Map.Entry) userit.next();
            HttpSession nextsession = (HttpSession) entry.getValue();

            Identity identity = (Identity) nextsession.getAttribute(IDENTITY);
View Full Code Here
TOP
Copyright © 2018 www.massapi.com. All rights reserved.
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.