Package java.util

Examples of java.util.TreeSet.first()

290
291
292
293
294
295
296
297
298
299
300
            {
                return null;
            }
            else
            {
                return set.first();
            }
        }

        Object value = getRaw( key );
        return value;
View Full Code Here
731
732
733
734
735
736
737
738
739
740
741
        if ( allowsDuplicates )
        {
            TreeSet set = ( TreeSet ) returned;
            this.count -= set.size();
            return set.first();
        }

        this.count--;
        return returned;
    }
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
293
294
295
296
297
298
299
300
301
302
303
      int size = synonyms.size();
      if (size > 0) {
        String[] syns = new String[size];
        if (size == 1) 
          syns[0] = (String) synonyms.first();
        else
          synonyms.toArray(syns);
//        if (syns.length > 1) Arrays.sort(syns);
//        if (DEBUG) System.err.println("word=" + word + ":" + Arrays.asList(syns));
        word2Syns.put(word, syns);
View Full Code Here
731
732
733
734
735
736
737
738
739
740
741
        if ( allowsDuplicates )
        {
            TreeSet set = ( TreeSet ) returned;
            this.count -= set.size();
            return set.first();
        }

        this.count--;
        return returned;
    }
View Full Code Here
290
291
292
293
294
295
296
297
298
299
300
            {
                return null;
            }
            else
            {
                return set.first();
            }
        }

        Object value = getRaw( key );
        return value;
View Full Code Here
53
54
55
56
57
58
59
60
61
62
63
        SortedSet sortedSet = new TreeSet();
        sortedSet.add(reaperElement);
        sortedSet.add(reaperElement3);
        sortedSet.add(reaperElement2);

        assertEquals(sortedSet.first(), reaperElement3);
        assertEquals(sortedSet.last(), reaperElement);

        // test insertion of timeout=0 is a nullop
        reaper.insert(reapable, 0);
        assertEquals(0, reaper.numberOfTransactions());
View Full Code Here
211
212
213
214
215
216
217
218
219
220
221
                }
            }
        }

        if (!compatibleMethods.isEmpty()) {
            result = (IMethod) compatibleMethods.first();
        }

        return result;
    }
View Full Code Here
214
215
216
217
218
219
220
221
222
223
224
        }
      }
    }

    if (!compatibleMethods.isEmpty()) {
      result = (IMethod)compatibleMethods.first();
    }

    return result;
  }
View Full Code Here
292
293
294
295
296
297
298
299
300
301
302
      int size = synonyms.size();
      if (size > 0) {
        String[] syns = new String[size];
        if (size == 1) 
          syns[0] = (String) synonyms.first();
        else
          synonyms.toArray(syns);
//        if (syns.length > 1) Arrays.sort(syns);
//        if (DEBUG) System.err.println("word=" + word + ":" + Arrays.asList(syns));
        word2Syns.put(word, syns);
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.