Java Utililty Methods TreeSet

if (splitBits == 0)
    return;
if (splitBits < 0 || splitBits > 16)
    throw new IllegalArgumentException("Illegal nunmber of split bits");
final int splitStep = 1 << (16 - splitBits);
for (int i = splitStep; i <= 0xFFFF; i += splitStep) {
    byte bb[] = Arrays.copyOf(prefix, prefix.length + 2);
    bb[prefix.length] = (byte) ((i >> 8) & 0xff);
...

return new TreeSet<T>(elements);

TreeSet<T> ret = new TreeSet<T>(cmp);
ret.addAll(set);
set.clear();
return ret;

StringBuffer buffer = new StringBuffer();
for (String element : in) {
    buffer.append(element.trim().replaceAll(CONCATENATION_TOKEN + "", CONCATENATION_SUBSTITUTE + ""));
    buffer.append(CONCATENATION_TOKEN);
String result = buffer.toString();
return result;

final int lastIx = curIx + span;
int retSpan = 1;
for (final Integer ix : indexes) {
    if (ix <= curIx) {
        continue; 
    if (ix >= lastIx) {
        break;
...

return createTreeSet(null, c);

TreeSet treeSet = new TreeSet();
if (treeSet != null) {
    Iterator iter = list.iterator();
    while (iter.hasNext()) {
        treeSet.add(iter.next());
return treeSet;
...

final TreeSet<String> sizedSubDirs = new TreeSet<String>();
for (String subdir : themeSubdirs) {
    if (subdir.startsWith(size)) {
        sizedSubDirs.add(subdir);
return sizedSubDirs;

int c = 0;
for (final Integer i : set) {
    if (i < -MAX_GRID) {
        c++;
    } else {
        break; 
return c;

return new TreeSet<E>(collection);