Package java.util

Examples of java.util.LinkedList.clear()

1835
1836
1837
1838
1839
1840
1841
1842
1843
1844
1845
      repository.setLocation(url1, false);
      removeSources = normalizeMergeSources(null, url1, sourceReposRoot, sRev, ranges, repository);
      sRev = eRev;
      eRev = SVNRevision.create(rev2);
      range = new SVNRevisionRange(sRev, eRev);
      ranges.clear();
      ranges.add(range);
      repository.setLocation(url2, false);
      addSources = normalizeMergeSources(null, url2, sourceReposRoot, eRev,
          ranges, repository);
    } finally {
View Full Code Here
96
97
98
99
100
101
102
103
104
105
106
        LinkedList list = (LinkedList) hashtable.get (pkey);
        if (list == null) {
            return;
        }
        if (entry == null) {
            list.clear();
            return;
        }
        ListIterator iter = list.listIterator ();
        while (iter.hasNext()) {
            AuthenticationInfo inf = (AuthenticationInfo)iter.next();
View Full Code Here
68
69
70
71
72
73
74
75
76
77
78
            } catch (OutOfMemoryError oome) {
                System.gc();
            }
            System.gc();
        }
        garbage.clear();
        System.gc();

        obj = pool.borrowObject();
        assertEquals("2", obj);
        pool.returnObject(obj);
View Full Code Here
103
104
105
106
107
108
109
110
111
112
113
            } catch (OutOfMemoryError oome) {
                System.gc();
            }
            System.gc();
        }
        garbage.clear();
        System.gc();

        obj = pool.borrowObject();
        assertEquals("1001", obj);
        pool.returnObject(obj);
View Full Code Here
134
135
136
137
138
139
140
141
142
143
144
            } catch (OutOfMemoryError oome) {
                System.gc();
            }
            System.gc();
        }
        garbage.clear();
        System.gc();

        obj = pool.borrowObject();
        assertTrue(((String)obj).startsWith("2."));
        pool.returnObject(obj);
View Full Code Here
318
319
320
321
322
323
324
325
326
327
328
                todoList.addLast(parent);
            }
        }
        transSet.clear();
        stateSet.clear();
        todoList.clear();
    }

    /**
     * @param step
     *            [inout]
View Full Code Here
409
410
411
412
413
414
415
416
417
418
419
        }
        // apply event + guard condition filter
        step.getTransitList().removeAll(removeList);
        // cleanup temporary structures
        allEvents.clear();
        removeList.clear();
        // optimization - global precedence potentially applies
        // only if there are multiple enabled transitions
        if (step.getTransitList().size() > 1) {
            // global transition precedence check
            Object[] trans = step.getTransitList().toArray();
View Full Code Here
745
746
747
748
749
750
751
752
753
754
755
        if (finalRuleCount == 1) {
            if (rules.size() == 1) {
                // Only one final rule, only governs the initial rule,
                // which is already initialized, thus, we do not need to
                // add this transition rule
                rules.clear();
            } else {
                // Normalize the final rule
                AnnualTimeZoneRule finalRule = (AnnualTimeZoneRule)rules.get(finalRuleIdx);
                int tmpRaw = finalRule.getRawOffset();
                int tmpDST = finalRule.getDSTSavings();
View Full Code Here
112
113
114
115
116
117
118
119
120
121
122
/*     */   {
/* 244 */     LinkedList nodeList = new LinkedList();
/* 245 */     getEntries(this.positions, nodeList);
/* 246 */     computeTags(nodeList, 3);
/*     */
/* 248 */     nodeList.clear();
/* 249 */     getEntries(this.colors, nodeList);
/* 250 */     computeTags(nodeList, 3);
/*     */
/* 252 */     nodeList.clear();
/* 253 */     getEntries(this.normals, nodeList);
View Full Code Here
116
117
118
119
120
121
122
123
124
125
126
/*     */
/* 248 */     nodeList.clear();
/* 249 */     getEntries(this.colors, nodeList);
/* 250 */     computeTags(nodeList, 3);
/*     */
/* 252 */     nodeList.clear();
/* 253 */     getEntries(this.normals, nodeList);
/* 254 */     computeTags(nodeList, 2);
/*     */   }
/*     */
/*     */   private void computeTags(LinkedList nodes, int minComponentCount)
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.