All Downloads are FREE. Search and download functionalities are using the official Maven repository.

org.linkedin.glu.utils.collections.ComparableTreeSet Maven / Gradle / Ivy

There is a newer version: 4.7.1
Show newest version
/*
 * Copyright (c) 2011 Yan Pujante
 *
 * Licensed under the Apache License, Version 2.0 (the "License"); you may not
 * use this file except in compliance with the License. You may obtain a copy of
 * the License at
 *
 * http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS, WITHOUT
 * WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the
 * License for the specific language governing permissions and limitations under
 * the License.
 */

package org.linkedin.glu.utils.collections;

import org.linkedin.util.lang.LangUtils;

import java.util.Collection;
import java.util.Comparator;
import java.util.Iterator;
import java.util.SortedSet;
import java.util.TreeSet;

/**
 * Extends a TreeSet to make it comparable
 *
 * @author [email protected]
 */
public class ComparableTreeSet> extends TreeSet implements Comparable>
{

  public ComparableTreeSet()
  {
  }

  public ComparableTreeSet(Comparator comparator)
  {
    super(comparator);
  }

  public ComparableTreeSet(Collection ts)
  {
    super(ts);
  }

  public ComparableTreeSet(SortedSet ts)
  {
    super(ts);
  }

  @Override
  public int compareTo(ComparableTreeSet set)
  {
    // if sizes mismatch then it is easy
    int res = LangUtils.compare(size(), set.size());
    if(res != 0)
      return res;

    // we know they are the same size
    Iterator thisValues = iterator();
    Iterator otherValues = set.iterator();

    while(thisValues.hasNext())
    {
      res = LangUtils.compare(thisValues.next(), otherValues.next());
      if(res != 0)
        return res;
    }

    return 0;
  }
}




© 2015 - 2025 Weber Informatics LLC | Privacy Policy