Package java.util

Examples of java.util.TreeSet.addAll()


        for (Iterator i = taskIDs.iterator(); i.hasNext();) {
            String id = (String) i.next();
            Set labels = (Set) labelData.get(id);
            if (labels != null) {
                foundMatch = true;
                result.addAll(labels);
            }
        }

        if (!foundMatch)
            return null;
View Full Code Here


  private final Sorter sorter = new Sorter();

  public String[] getNames() {
    TreeSet t = new TreeSet(sorter);
    t.addAll(dataList.entrySet());
    String [] result = new String[dataList.size()];
    Iterator iter = t.iterator();
    int i = 0;
    while (iter.hasNext())
      result[i++] = (String) ((Map.Entry) iter.next()).getKey();
View Full Code Here

    if (guardianInfo != null) {
      imports.add (guardianInfo.getIdentityClassInfo ().getQualifiedName ());
    }

    // Add any extra imports needed by accessors.
    imports.addAll (info.getAccessorImports ());

    addImports (imports);

    GenerateUtilities.writeImports (out, imports);
View Full Code Here

        Collection c = new HashSet(recipientsList);

        TreeSet sortedSet = new TreeSet(new MessageRecipientComparator());

        sortedSet.addAll(c);

        return sortedSet.iterator();
    }
}
View Full Code Here

   
    public void testSorting() throws Exception {
        SortedSet set = new TreeSet();
        ActiveMQDestination[] destinations = { new ActiveMQQueue("A"), new ActiveMQQueue("B"), new ActiveMQTopic("A"), new ActiveMQTopic("B") };
        List expected = Arrays.asList(destinations);
        set.addAll(expected);
        List actual = new ArrayList(set);
        assertEquals("Sorted order", expected, actual);
    }

    public static Test suite() {
View Full Code Here

    new Employee("Support", "Rate, Rhoda"), };
  final Set set = new TreeSet(Arrays.asList(emps));
  System.out.println(set);
  final Set set2 = new TreeSet(Collections.reverseOrder());
  System.out.println(set2);
  set2.addAll(Arrays.asList(emps));
  System.out.println(set2);

  final Set set3 = new TreeSet(new EmpComparator());
  for (final Employee emp : emps) {
      set3.add(emp);
View Full Code Here

        return PredicatedSortedSet.decorate(new TreeSet(), truePredicate);
    }
   
    public Set makeFullSet() {
        TreeSet set = new TreeSet();
        set.addAll(Arrays.asList(getFullElements()));
        return PredicatedSortedSet.decorate(set, truePredicate);
    }
  
   
//--------------------------------------------------------------------  
View Full Code Here

        return TypedSortedSet.decorate(new TreeSet(), integerType);
    }
   
    public Set makeFullSet() {
        TreeSet set = new TreeSet();
        set.addAll(Arrays.asList(getFullElements()));
        return TypedSortedSet.decorate(set, integerType);
    }
  
   
//--------------------------------------------------------------------           
View Full Code Here

        return TransformedSortedSet.decorate(new TreeSet(), TestTransformedCollection.NOOP_TRANSFORMER);
    }

    public Set makeFullSet() {
        SortedSet set = new TreeSet();
        set.addAll(Arrays.asList(getFullElements()));
        return TransformedSortedSet.decorate(set, TestTransformedCollection.NOOP_TRANSFORMER);
    }
   
    //-----------------------------------------------------------------------  
    public void testTransformedSet() {
View Full Code Here

        return UnmodifiableSortedSet.decorate(new TreeSet());
    }
   
    public Set makeFullSet() {
        TreeSet set = new TreeSet();
        set.addAll(Arrays.asList(getFullElements()));
        return UnmodifiableSortedSet.decorate(set);
    }
   
    public boolean isAddSupported() {
        return false;
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.