Package java.util

Examples of java.util.TreeSet.last()

196
197
198
199
200
201
202
203
204
205
206
        Set set = get(destination);
        if (set == null || set.isEmpty()) {
            return null;
        }
        SortedSet sortedSet = new TreeSet(set);
        return sortedSet.last();
    }

    /**
     * Returns the root node for the given destination type
     */
 
View Full Code Here
192
193
194
195
196
197
198
199
200
201
202
        Set set = get(destination);
        if (set == null || set.isEmpty()) {
            return null;
        }
        SortedSet sortedSet = new TreeSet(set);
        return sortedSet.last();
    }

    /**
     * Returns the root node for the given destination type
     */
 
View Full Code Here
154
155
156
157
158
159
160
161
162
163
164
            }

            if (list.isEmpty()) {
                return null;
            }
            return (Artifact) list.last();
        }

        // more than one version of the artifact was loaded...

        // if one of parents already loaded the artifact, use that version
View Full Code Here
157
158
159
160
161
162
163
164
165
166
167
            }

            if (list.isEmpty()) {
                return null;
            }
            return (Artifact) list.last();
        }

        // more than one version of the artifact was loaded...

        // if one of parents already loaded the artifact, use that version
View Full Code Here
74
75
76
77
78
79
80
81
82
83
84
    assertTrue(
        "Answered incorrect first element--did not use custom comparator ",
        myTreeSet.first().equals(new Integer(2)));
    assertTrue(
        "Answered incorrect last element--did not use custom comparator ",
        myTreeSet.last().equals(new Integer(1)));
  }

  /**
   * @tests java.util.TreeSet#TreeSet(java.util.SortedSet)
   */
 
View Full Code Here
201
202
203
204
205
206
207
208
209
210
211
        Set set = get(destination);
        if (set == null || set.isEmpty()) {
            return null;
        }
        SortedSet sortedSet = new TreeSet(set);
        return sortedSet.last();
    }

    /**
     * Returns the root node for the given destination type
     */
 
View Full Code Here
255
256
257
258
259
260
261
262
263
264
265
       
        //
        // create a binary tree of numbers, pick the last one (= largest)
        //
        TreeSet sortedNumbers = new TreeSet(getFileNumbersByEPR().values());
        Integer largest = (Integer)sortedNumbers.last();
        return largest.intValue() + 1;
    }
   
    /**
     *
 
View Full Code Here
201
202
203
204
205
206
207
208
209
210
211
        Set set = get(destination);
        if (set == null || set.isEmpty()) {
            return null;
        }
        SortedSet sortedSet = new TreeSet(set);
        return sortedSet.last();
    }

    /**
     * Returns the root node for the given destination type
     */
 
View Full Code Here
154
155
156
157
158
159
160
161
162
163
164
            }

            if (list.isEmpty()) {
                return null;
            }
            return (Artifact) list.last();
        }

        // more than one version of the artifact was loaded...

        // if one of parents already loaded the artifact, use that version
View Full Code Here
531
532
533
534
535
536
537
538
539
540
541
    public void testForLostKeys()
    {
        generateKeys();
        TreeSet set = new TreeSet((List) generatedKeys.clone());
        if (set.isEmpty()) fail("No generated keys found");
        int result = ((Integer) set.last()).intValue() - ((Integer) set.first()).intValue() + 1;
        assertEquals("Sequence manager lost sequence numbers, this could be a failure or could be" +
                " the volitional behaviour of the sequence manager" +
                " - retry test case, check test case, check sequence manager implementation.", keyCount, result);
    }
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.