Examples of java.util.Comparator.compare()

java.util.Comparator.compare()
Compares its two arguments for order. Returns a negative integer, zero, or a positive integer as the first argument is less than, equal to, or greater than the second.
In the foregoing description, the notation sgn(expression) designates the mathematical signum function, which is defined to return one of -1, 0, or 1 according to whether the value of expression is negative, zero or positive.
The implementor must ensure that sgn(compare(x, y)) == -sgn(compare(y, x)) for all x and y. (This implies that compare(x, y) must throw an exception if and only if compare(y, x) throws an exception.)
The implementor must also ensure that the relation is transitive: ((compare(x, y)>0) && (compare(y, z)>0)) implies compare(x, z)>0.
Finally, the implementor must ensure that compare(x, y)==0 implies that sgn(compare(x, z))==sgn(compare(y, z)) for all z.
It is generally the case, but not strictly required that (compare(x, y)==0) == (x.equals(y)). Generally speaking, any comparator that violates this condition should clearly indicate this fact. The recommended language is "Note: this comparator imposes orderings that are inconsistent with equals." @param o1 the first object to be compared. @param o2 the second object to be compared. @return a negative integer, zero, or a positive integer as thefirst argument is less than, equal to, or greater than the second. @throws ClassCastException if the arguments' types prevent them frombeing compared by this comparator.


        Object[] tree = heap.m_elements;
        for (int i = 1; i <= heap.m_size; i++) {
            Object parent = tree[i];
            if (i * 2 <= heap.m_size) {
                assertTrue("Parent is less than or equal to its left child", c.compare(parent, tree[i * 2]) <= 0);
            }
            if (i * 2 + 1 < heap.m_size) {
                assertTrue("Parent is less than or equal to its right child", c.compare(parent, tree[i * 2 + 1]) <= 0);
            }
        }

View Full Code Here

            Object parent = tree[i];
            if (i * 2 <= heap.m_size) {
                assertTrue("Parent is less than or equal to its left child", c.compare(parent, tree[i * 2]) <= 0);
            }
            if (i * 2 + 1 < heap.m_size) {
                assertTrue("Parent is less than or equal to its right child", c.compare(parent, tree[i * 2 + 1]) <= 0);
            }
        }
    }


    //-----------------------------------------------------------------------

View Full Code Here

            for ( Value<?> value : attr )
            {
                Object normValue = normalizer.normalize( value );


                // Found a value that is greater than or equal to the ava value
                if ( comparator.compare( normValue, filterValue ) >= 0 )
                {
                    return true;
                }
            }
        }

View Full Code Here

            for ( Value<?> value : attr )
            {
                Object normValue = normalizer.normalize( value );


                // Found a value that is less than or equal to the ava value
                if ( comparator.compare( normValue, filterValue ) <= 0 )
                {
                    return true;
                }
            }
        }

View Full Code Here

         */
        for ( Value<?> val : attr )
        {
            Value<?> normValue = normalizer.normalize( val );


            if ( 0 == comparator.compare( normValue.getValue(), filterValue.getValue() ) )
            {
                return true;
            }
        }

View Full Code Here

            Comparator typeComparator = (Comparator) typeComparators.get(leftJahiaObject.getObjectKey().getType());
            if (typeComparator == null) {
                logger.warn("No comparator found for type : " + leftJahiaObject.getObjectKey().getType() + ", returning equal in comparison.");
                return 0;
            }
            return typeComparator.compare(o1, o2);
        } else {
            // these comparators should only be used with subclasses of JahiaObject,
            // never with anything else
            if ((o1 instanceof Comparable) && (o2 instanceof Comparable)) {
                Comparable leftComparable = (Comparable) o1;

View Full Code Here

        }
        Iterator comparatorIter = orderedComparators.iterator();
        int curCompareResult = 0;
        while (comparatorIter.hasNext()) {
            Comparator curComparator = (Comparator) comparatorIter.next();
            curCompareResult = curComparator.compare(o1, o2);
            if (curCompareResult != 0) {
                return curCompareResult;
            }
        }
        return curCompareResult;

View Full Code Here

            {
               equals = output != null ? output.equals(expected) : expected == null;
            }
            else
            {
               equals = c.compare(output, expected) == 0;
            }
            assertTrue("Transform of "+input+" equals "+expected+", output="+output, equals);
               
            String expectedStringOutput = expectedStringData[t][i];
            String stringOutput = editor.getAsText();

View Full Code Here

            for ( Value<?> value : attr )
            {
                Object normValue = normalizer.normalize( value );


                // Found a value that is greater than or equal to the ava value
                if ( 0 >= comparator.compare( normValue, filterValue ) )
                {
                    return true;
                }
            }
        }

View Full Code Here

            for ( Value<?> value : attr )
            {
                Object normValue = normalizer.normalize( value );


                // Found a value that is less than or equal to the ava value
                if ( 0 <= comparator.compare( normValue, filterValue ) )
                {
                    return true;
                }
            }
        }

View Full Code Here

0 1 2 3 4 5 6 7 8 9

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.