Examples of java.util.SortedSet.toArray()

java.util.SortedSet.toArray()

        IWorkingSet workingSet = (IWorkingSet) i.next();
        if (workingSet.isVisible()) {
          visibleSubset.add(workingSet);
        }
      }
        return (IWorkingSet[]) visibleSubset.toArray(new IWorkingSet[visibleSubset.size()]);
    }
    
    public IWorkingSet[] getAllWorkingSets() {
        return (IWorkingSet[]) workingSets.toArray(new IWorkingSet[workingSets.size()]);
    }

View Full Code Here

    public static Key[] getUniqueKeys(IndexMatch[] matches) {
        SortedSet set = new TreeSet();
        for (int i = 0; i < matches.length; i++) {
            set.add(matches[i].getKey());
        }
        return (Key[]) set.toArray(EmptyKeys);
    }


    /**
     * andKeySets takes several sets of unique Keys and returns the
     * ANDed set (elements that exist in all sets).  The first dimension

View Full Code Here

            if (!eq) {
                highs.clear();
            }
        }


        return (Key[]) set.toArray(EmptyKeys);
    }


    /**
     * orKeySets takes several sets of unique Keys and returns the
     * ORed set (all unique elements).  The first dimension of the

View Full Code Here

            for (int j = 0; j < keySets[i].length; j++) {
                set.add(keySets[i][j]);
            }
        }


        return (Key[]) set.toArray(EmptyKeys);
    }


    /**
     * normalizeString normalizes the specific String by stripping
     * all leading, trailing, and continuous runs of white space.

View Full Code Here

          RecordSet rs = context.getFiler().getRecordSet();
          while (rs.hasMoreRecords())
          {
            set.add(rs.getNextKey());
          }
          keySet = (Key[]) set.toArray(EMPTY_KEYS);
        }


        return new ResultSet(context, pr, keySet, query);
      }
      catch (Exception e)

View Full Code Here

              RecordSet rs = context.getFiler().getRecordSet();
              while (rs.hasMoreRecords())
              {
                set.add(rs.getNextKey());
              }
              ks.add(set.toArray(EMPTY_KEYS));
            }
            else
            {
              // Try to use a NameIndex to resolve the path component
              IndexPattern pattern = new IndexPattern(symbols, name, nsMap);

View Full Code Here

                for (int j=0; j<files.length; j++) {
                    sortedSet.add(files[j]);
                }
                int count = 0;
                ThemeResource[] sortedResources = 
                   (ThemeResource[])sortedSet.toArray(new ThemeResource[sortedSet.size()]);
                List atomEntries = new ArrayList();
                for (int i=start; i<(start + max) && i<(sortedResources.length); i++) {
                    Entry entry = createAtomResourceEntry(website, sortedResources[i]);
                    atomEntries.add(entry);
                    if (count == 0) {

View Full Code Here

        if (preferenceKey != null)
          containers.add(new NavigationEnablementAction(preference.getPreferenceLabel(), fStore, preferenceKey));
      }
    }


    return (IAction[]) containers.toArray(new Action[containers.size()]);
  }


  /*
   * @see org.eclipse.ui.IWorkbenchWindowActionDelegate#init(org.eclipse.ui.IWorkbenchWindow)
   */

View Full Code Here

                String[] eventUsecases = this.usecase.getUsecases(events[i]);
                usecases.addAll(Arrays.asList(eventUsecases));
            }
        }


        return (String[]) usecases.toArray(new String[usecases.size()]);
    }
    
    /**
     * @return The languages of the document in alphabetical order.
     * @throws DocumentException

View Full Code Here

            String usecase = (String) i.next();
            if (this.usecase2event.get(usecase).equals(event)) {
                usecases.add(usecase);
            }
        }
        return (String[]) usecases.toArray(new String[usecases.size()]);
    }


}

View Full Code Here

0 1 2 3 4 5 6

TOP

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.