Apache
/
commons-collections
mirror of https://github.com/apache/commons-collections.git
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

ComparatorUtils renamed methods 

git-svn-id: https://svn.apache.org/repos/asf/jakarta/commons/proper/collections/trunk@130791 13f79535-47bb-0310-9956-ffa450edef68
This commit is contained in:
Stephen Colebourne 2002-08-17 12:07:24 +00:00
parent 49f3fe1be6
commit db484419cb
1 changed files with 6 additions and 6 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

12
src/test/org/apache/commons/collections/TestBinaryHeap.java
View File

@ -1,7 +1,7 @@
/* /*
* $Header: /home/jerenkrantz/tmp/commons/commons-convert/cvs/home/cvs/jakarta-commons//collections/src/test/org/apache/commons/collections/TestBinaryHeap.java,v 1.4 2002/07/03 02:09:06 mas Exp $ * $Header: /home/jerenkrantz/tmp/commons/commons-convert/cvs/home/cvs/jakarta-commons//collections/src/test/org/apache/commons/collections/TestBinaryHeap.java,v 1.5 2002/08/17 12:07:24 scolebourne Exp $
* $Revision: 1.4 $ * $Revision: 1.5 $
* $Date: 2002/07/03 02:09:06 $ * $Date: 2002/08/17 12:07:24 $
* *
* ==================================================================== * ====================================================================
* *
@ -76,7 +76,7 @@ import org.apache.commons.collections.comparators.ReverseComparator;
* Tests the BinaryHeap. * Tests the BinaryHeap.
* *
* @author <a href="mailto:mas@apache.org">Michael A. Smith</a> * @author <a href="mailto:mas@apache.org">Michael A. Smith</a>
* @version $Id: TestBinaryHeap.java,v 1.4 2002/07/03 02:09:06 mas Exp $ * @version $Id: TestBinaryHeap.java,v 1.5 2002/08/17 12:07:24 scolebourne Exp $
*/ */
public class TestBinaryHeap extends TestCollection { public class TestBinaryHeap extends TestCollection {
@ -274,8 +274,8 @@ public class TestBinaryHeap extends TestCollection {
BinaryHeap heap = (BinaryHeap)collection; BinaryHeap heap = (BinaryHeap)collection;
Comparator c = heap.comparator(); Comparator c = heap.comparator();
if (c == null) c = ComparatorUtils.NATURAL; if (c == null) c = ComparatorUtils.naturalComparator();
if (!heap.m_isMinHeap) c = ComparatorUtils.reverse(c); if (!heap.m_isMinHeap) c = ComparatorUtils.reversedComparator(c);
Object[] tree = heap.m_elements; Object[] tree = heap.m_elements;
for (int i = 1; i <= heap.m_size; i++) { for (int i = 1; i <= heap.m_size; i++) {