adding CollectionUtils and tests for it
git-svn-id: https://svn.apache.org/repos/asf/jakarta/commons/proper/collections/trunk@130450 13f79535-47bb-0310-9956-ffa450edef68
This commit is contained in:
Rodney Waldhoff
parent
2f826db45b
commit
256420016e
|
|
@ -0,0 +1,296 @@
|
|||
/*
|
||||
* $Header: /home/jerenkrantz/tmp/commons/commons-convert/cvs/home/cvs/jakarta-commons//collections/src/java/org/apache/commons/collections/CollectionUtils.java,v 1.1 2001/04/24 18:48:36 rwaldhoff Exp $
|
||||
* $Revision: 1.1 $
|
||||
* $Date: 2001/04/24 18:48:36 $
|
||||
*
|
||||
* ====================================================================
|
||||
*
|
||||
* The Apache Software License, Version 1.1
|
||||
*
|
||||
* Copyright (c) 1999-2001 The Apache Software Foundation. All rights
|
||||
* reserved.
|
||||
*
|
||||
* Redistribution and use in source and binary forms, with or without
|
||||
* modification, are permitted provided that the following conditions
|
||||
* are met:
|
||||
*
|
||||
* 1. Redistributions of source code must retain the above copyright
|
||||
* notice, this list of conditions and the following disclaimer.
|
||||
*
|
||||
* 2. Redistributions in binary form must reproduce the above copyright
|
||||
* notice, this list of conditions and the following disclaimer in
|
||||
* the documentation and/or other materials provided with the
|
||||
* distribution.
|
||||
*
|
||||
* 3. The end-user documentation included with the redistribution, if
|
||||
* any, must include the following acknowlegement:
|
||||
* "This product includes software developed by the
|
||||
* Apache Software Foundation (http://www.apache.org/)."
|
||||
* Alternately, this acknowlegement may appear in the software itself,
|
||||
* if and wherever such third-party acknowlegements normally appear.
|
||||
*
|
||||
* 4. The names "The Jakarta Project", "Commons", and "Apache Software
|
||||
* Foundation" must not be used to endorse or promote products derived
|
||||
* from this software without prior written permission. For written
|
||||
* permission, please contact apache@apache.org.
|
||||
*
|
||||
* 5. Products derived from this software may not be called "Apache"
|
||||
* nor may "Apache" appear in their names without prior written
|
||||
* permission of the Apache Group.
|
||||
*
|
||||
* THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESSED OR IMPLIED
|
||||
* WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
|
||||
* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
|
||||
* DISCLAIMED. IN NO EVENT SHALL THE APACHE SOFTWARE FOUNDATION OR
|
||||
* ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
||||
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
||||
* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF
|
||||
* USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
|
||||
* ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
|
||||
* OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT
|
||||
* OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
||||
* SUCH DAMAGE.
|
||||
* ====================================================================
|
||||
*
|
||||
* This software consists of voluntary contributions made by many
|
||||
* individuals on behalf of the Apache Software Foundation. For more
|
||||
* information on the Apache Software Foundation, please see
|
||||
* <http://www.apache.org/>.
|
||||
*
|
||||
*/
|
||||
|
||||
package org.apache.commons.collections;
|
||||
|
||||
import java.util.ArrayList;
|
||||
import java.util.Collection;
|
||||
import java.util.HashMap;
|
||||
import java.util.HashSet;
|
||||
import java.util.Iterator;
|
||||
import java.util.Map;
|
||||
import java.util.NoSuchElementException;
|
||||
import java.util.Set;
|
||||
|
||||
/**
|
||||
* A set of {@link Collection} related utility methods.
|
||||
*
|
||||
* @author Rodney Waldhoff
|
||||
*
|
||||
* @version $Id: CollectionUtils.java,v 1.1 2001/04/24 18:48:36 rwaldhoff Exp $
|
||||
*/
|
||||
public class CollectionUtils {
|
||||
/**
|
||||
* Returns a {@link Collection} containing the union
|
||||
* of the given {@link Collection}s.
|
||||
* <p>
|
||||
* The cardinality of each element in the returned {@link Collection}
|
||||
* will be equal to the maximum of the cardinality of that element
|
||||
* in the two given {@link Collection}s.
|
||||
*
|
||||
* @see Collection#addAll
|
||||
*/
|
||||
public static Collection union(final Collection a, final Collection b) {
|
||||
ArrayList list = new ArrayList();
|
||||
Map mapa = getCardinalityMap(a);
|
||||
Map mapb = getCardinalityMap(b);
|
||||
Set elts = new HashSet(a);
|
||||
elts.addAll(b);
|
||||
Iterator it = elts.iterator();
|
||||
while(it.hasNext()) {
|
||||
Object obj = it.next();
|
||||
for(int i=0,m=Math.max(getFreq(obj,mapa),getFreq(obj,mapb));i<m;i++) {
|
||||
list.add(obj);
|
||||
}
|
||||
}
|
||||
return list;
|
||||
}
|
||||
|
||||
/**
|
||||
* Returns a {@link Collection} containing the intersection
|
||||
* of the given {@link Collection}s.
|
||||
* <p>
|
||||
* The cardinality of each element in the returned {@link Collection}
|
||||
* will be equal to the minimum of the cardinality of that element
|
||||
* in the two given {@link Collection}s.
|
||||
*
|
||||
* @see Collection#retainAll
|
||||
*/
|
||||
public static Collection intersection(final Collection a, final Collection b) {
|
||||
ArrayList list = new ArrayList();
|
||||
Map mapa = getCardinalityMap(a);
|
||||
Map mapb = getCardinalityMap(b);
|
||||
Set elts = new HashSet(a);
|
||||
elts.addAll(b);
|
||||
Iterator it = elts.iterator();
|
||||
while(it.hasNext()) {
|
||||
Object obj = it.next();
|
||||
for(int i=0,m=Math.min(getFreq(obj,mapa),getFreq(obj,mapb));i<m;i++) {
|
||||
list.add(obj);
|
||||
}
|
||||
}
|
||||
return list;
|
||||
}
|
||||
|
||||
/**
|
||||
* Returns a {@link Collection} containing the exclusive disjunction
|
||||
* (symmetric difference) of the given {@link Collection}.
|
||||
* <p>
|
||||
* The cardinality of each element <i>e</i> in the returned {@link Collection}
|
||||
* will be equal to
|
||||
* <tt>Math.max(cardinality(<i>e</i>,<i>a</i>),cardinality(<i>e</i>,<i>b</i>)) - Math.min(cardinality(<i>e</i>,<i>a</i>),cardinality(<i>e</i>,<i>b</i>))</tt>.
|
||||
* <p>
|
||||
* This is equivalent to
|
||||
* <tt>{@link #subtract subtract}({@link #union union(a,b)},{@link #intersection intersection(a,b)})</tt>
|
||||
* or
|
||||
* <tt>{@link #union union}({@link #subtract subtract(a,b)},{@link #subtract subtract(b,a)})</tt>.
|
||||
*/
|
||||
public static Collection disjunction(final Collection a, final Collection b) {
|
||||
ArrayList list = new ArrayList();
|
||||
Map mapa = getCardinalityMap(a);
|
||||
Map mapb = getCardinalityMap(b);
|
||||
Set elts = new HashSet(a);
|
||||
elts.addAll(b);
|
||||
Iterator it = elts.iterator();
|
||||
while(it.hasNext()) {
|
||||
Object obj = it.next();
|
||||
for(int i=0,m=((Math.max(getFreq(obj,mapa),getFreq(obj,mapb)))-(Math.min(getFreq(obj,mapa),getFreq(obj,mapb))));i<m;i++) {
|
||||
list.add(obj);
|
||||
}
|
||||
}
|
||||
return list;
|
||||
}
|
||||
|
||||
/**
|
||||
* Returns a {@link Collection} containing <tt><i>a</i> - <i>b</i></tt>.
|
||||
* The cardinality of each element <i>e</i> in the returned {@link Collection}
|
||||
* will be the cardinality of <i>e</i> in <i>a</i> minus the cardinality
|
||||
* of <i>e</i> in <i>b</i>, or zero, whichever is greater.
|
||||
*
|
||||
* @see Collection#removeAll
|
||||
*/
|
||||
public static Collection subtract(final Collection a, final Collection b) {
|
||||
ArrayList list = new ArrayList( a );
|
||||
Iterator it = b.iterator();
|
||||
while(it.hasNext()) {
|
||||
list.remove(it.next());
|
||||
}
|
||||
return list;
|
||||
}
|
||||
|
||||
/**
|
||||
* Returns a {@link Map} mapping each unique element in
|
||||
* the given {@link Collection} to an {@link Integer}
|
||||
* representing the number of occurances of that element
|
||||
* in the {@link Collection}.
|
||||
* An entry that maps to <tt>null</tt> indicates that the
|
||||
* element does not appear in the given {@link Collection}.
|
||||
*/
|
||||
public static Map getCardinalityMap(final Collection col) {
|
||||
HashMap count = new HashMap();
|
||||
Iterator it = col.iterator();
|
||||
while(it.hasNext()) {
|
||||
Object obj = it.next();
|
||||
Integer c = (Integer)(count.get(obj));
|
||||
if(null == c) {
|
||||
count.put(obj,new Integer(1));
|
||||
} else {
|
||||
count.put(obj,new Integer(c.intValue() + 1));
|
||||
}
|
||||
}
|
||||
return count;
|
||||
}
|
||||
|
||||
/**
|
||||
* Returns <tt>true</tt> iff <i>a</i> is a sub-collection of <i>b</i>,
|
||||
* that is, iff the cardinality of <i>e</i> in <i>a</i> is less
|
||||
* than or equal to the cardinality of <i>e</i> in <i>b</i>,
|
||||
* for each element <i>e</i> in <i>a</i>.
|
||||
*
|
||||
* @see #isProperSubCollection
|
||||
* @see Collection#containsAll
|
||||
*/
|
||||
public static boolean isSubCollection(final Collection a, final Collection b) {
|
||||
ArrayList list = new ArrayList();
|
||||
Map mapa = getCardinalityMap(a);
|
||||
Map mapb = getCardinalityMap(b);
|
||||
Iterator it = a.iterator();
|
||||
while(it.hasNext()) {
|
||||
Object obj = it.next();
|
||||
if(getFreq(obj,mapa) > getFreq(obj,mapb)) {
|
||||
return false;
|
||||
}
|
||||
}
|
||||
return true;
|
||||
}
|
||||
|
||||
/**
|
||||
* Returns <tt>true</tt> iff <i>a</i> is a <i>proper</i> sub-collection of <i>b</i>,
|
||||
* that is, iff the cardinality of <i>e</i> in <i>a</i> is less
|
||||
* than or equal to the cardinality of <i>e</i> in <i>b</i>,
|
||||
* for each element <i>e</i> in <i>a</i>, and there is at least one
|
||||
* element <i>f</i> such that the cardinality of <i>f</i> in <i>b</i>
|
||||
* is strictly greater than the cardinality of <i>f</i> in <i>a</i>.
|
||||
*
|
||||
* @see #isSubCollection
|
||||
* @see Collection#containsAll
|
||||
*/
|
||||
public static boolean isProperSubCollection(final Collection a, final Collection b) {
|
||||
// XXX optimize me!
|
||||
return CollectionUtils.isSubCollection(a,b) && (!(CollectionUtils.isEqualCollection(a,b)));
|
||||
}
|
||||
|
||||
/**
|
||||
* Returns <tt>true</tt> iff the given {@link Collection}s contain
|
||||
* exactly the same elements with exactly the same cardinality.
|
||||
* <p>
|
||||
* That is, iff the cardinality of <i>e</i> in <i>a</i> is
|
||||
* equal to the cardinality of <i>e</i> in <i>b</i>,
|
||||
* for each element <i>e</i> in <i>a</i> or <i>b</i>.
|
||||
*/
|
||||
public static boolean isEqualCollection(final Collection a, final Collection b) {
|
||||
if(a.size() != b.size()) {
|
||||
return false;
|
||||
} else {
|
||||
Map mapa = getCardinalityMap(a);
|
||||
Map mapb = getCardinalityMap(b);
|
||||
if(mapa.size() != mapb.size()) {
|
||||
return false;
|
||||
} else {
|
||||
Iterator it = mapa.keySet().iterator();
|
||||
while(it.hasNext()) {
|
||||
Object obj = it.next();
|
||||
if(getFreq(obj,mapa) != getFreq(obj,mapb)) {
|
||||
return false;
|
||||
}
|
||||
}
|
||||
return true;
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
/**
|
||||
* Returns the number of occurrences of <i>obj</i>
|
||||
* in <i>col</i>.
|
||||
*/
|
||||
public static int cardinality(Object obj, final Collection col) {
|
||||
int count = 0;
|
||||
Iterator it = col.iterator();
|
||||
while(it.hasNext()) {
|
||||
Object elt = it.next();
|
||||
if((null == obj && null == elt) || obj.equals(elt)) {
|
||||
count++;
|
||||
}
|
||||
}
|
||||
return count;
|
||||
}
|
||||
|
||||
private static final int getFreq(final Object obj, final Map freqMap) {
|
||||
try {
|
||||
return ((Integer)(freqMap.get(obj))).intValue();
|
||||
} catch(NullPointerException e) {
|
||||
// ignored
|
||||
} catch(NoSuchElementException e) {
|
||||
// ignored
|
||||
}
|
||||
return 0;
|
||||
}
|
||||
}
|
||||
|
|
@ -1,7 +1,7 @@
|
|||
/*
|
||||
* $Header: /home/jerenkrantz/tmp/commons/commons-convert/cvs/home/cvs/jakarta-commons//collections/src/test/org/apache/commons/collections/TestAll.java,v 1.5 2001/04/21 12:22:30 craigmcc Exp $
|
||||
* $Revision: 1.5 $
|
||||
* $Date: 2001/04/21 12:22:30 $
|
||||
* $Header: /home/jerenkrantz/tmp/commons/commons-convert/cvs/home/cvs/jakarta-commons//collections/src/test/org/apache/commons/collections/TestAll.java,v 1.6 2001/04/24 18:48:38 rwaldhoff Exp $
|
||||
* $Revision: 1.6 $
|
||||
* $Date: 2001/04/24 18:48:38 $
|
||||
*
|
||||
* ====================================================================
|
||||
*
|
||||
|
|
@ -66,7 +66,7 @@ import junit.framework.*;
|
|||
/**
|
||||
* Entry point for all Collections tests.
|
||||
* @author Rodney Waldhoff
|
||||
* @version $Id: TestAll.java,v 1.5 2001/04/21 12:22:30 craigmcc Exp $
|
||||
* @version $Id: TestAll.java,v 1.6 2001/04/24 18:48:38 rwaldhoff Exp $
|
||||
*/
|
||||
public class TestAll extends TestCase {
|
||||
public TestAll(String testName) {
|
||||
|
|
@ -86,6 +86,7 @@ public class TestAll extends TestCase {
|
|||
suite.addTest(TestFastTreeMap1.suite());
|
||||
suite.addTest(TestHashMap.suite());
|
||||
suite.addTest(TestTreeMap.suite());
|
||||
suite.addTest(TestCollectionUtils.suite());
|
||||
return suite;
|
||||
}
|
||||
|
||||
|
|
|
|||
|
|
@ -0,0 +1,313 @@
|
|||
/*
|
||||
* $Header: /home/jerenkrantz/tmp/commons/commons-convert/cvs/home/cvs/jakarta-commons//collections/src/test/org/apache/commons/collections/TestCollectionUtils.java,v 1.1 2001/04/24 18:48:38 rwaldhoff Exp $
|
||||
* $Revision: 1.1 $
|
||||
* $Date: 2001/04/24 18:48:38 $
|
||||
*
|
||||
* ====================================================================
|
||||
*
|
||||
* The Apache Software License, Version 1.1
|
||||
*
|
||||
* Copyright (c) 1999-2001 The Apache Software Foundation. All rights
|
||||
* reserved.
|
||||
*
|
||||
* Redistribution and use in source and binary forms, with or without
|
||||
* modification, are permitted provided that the following conditions
|
||||
* are met:
|
||||
*
|
||||
* 1. Redistributions of source code must retain the above copyright
|
||||
* notice, this list of conditions and the following disclaimer.
|
||||
*
|
||||
* 2. Redistributions in binary form must reproduce the above copyright
|
||||
* notice, this list of conditions and the following disclaimer in
|
||||
* the documentation and/or other materials provided with the
|
||||
* distribution.
|
||||
*
|
||||
* 3. The end-user documentation included with the redistribution, if
|
||||
* any, must include the following acknowlegement:
|
||||
* "This product includes software developed by the
|
||||
* Apache Software Foundation (http://www.apache.org/)."
|
||||
* Alternately, this acknowlegement may appear in the software itself,
|
||||
* if and wherever such third-party acknowlegements normally appear.
|
||||
*
|
||||
* 4. The names "The Jakarta Project", "Commons", and "Apache Software
|
||||
* Foundation" must not be used to endorse or promote products derived
|
||||
* from this software without prior written permission. For written
|
||||
* permission, please contact apache@apache.org.
|
||||
*
|
||||
* 5. Products derived from this software may not be called "Apache"
|
||||
* nor may "Apache" appear in their names without prior written
|
||||
* permission of the Apache Group.
|
||||
*
|
||||
* THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESSED OR IMPLIED
|
||||
* WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
|
||||
* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
|
||||
* DISCLAIMED. IN NO EVENT SHALL THE APACHE SOFTWARE FOUNDATION OR
|
||||
* ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
||||
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
||||
* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF
|
||||
* USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
|
||||
* ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
|
||||
* OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT
|
||||
* OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
||||
* SUCH DAMAGE.
|
||||
* ====================================================================
|
||||
*
|
||||
* This software consists of voluntary contributions made by many
|
||||
* individuals on behalf of the Apache Software Foundation. For more
|
||||
* information on the Apache Software Foundation, please see
|
||||
* <http://www.apache.org/>.
|
||||
*
|
||||
*/
|
||||
|
||||
package org.apache.commons.collections;
|
||||
|
||||
import junit.framework.*;
|
||||
import java.util.*;
|
||||
|
||||
/**
|
||||
* @author Rodney Waldhoff
|
||||
* @version $Id: TestCollectionUtils.java,v 1.1 2001/04/24 18:48:38 rwaldhoff Exp $
|
||||
*/
|
||||
public class TestCollectionUtils extends TestCase {
|
||||
public TestCollectionUtils(String testName) {
|
||||
super(testName);
|
||||
}
|
||||
|
||||
public static Test suite() {
|
||||
return new TestSuite(TestCollectionUtils.class);
|
||||
}
|
||||
|
||||
public static void main(String args[]) {
|
||||
String[] testCaseName = { TestCollectionUtils.class.getName() };
|
||||
junit.textui.TestRunner.main(testCaseName);
|
||||
}
|
||||
|
||||
private Collection _a = null;
|
||||
private Collection _b = null;
|
||||
|
||||
public void setUp() {
|
||||
_a = new ArrayList();
|
||||
_a.add("a");
|
||||
_a.add("b");
|
||||
_a.add("b");
|
||||
_a.add("c");
|
||||
_a.add("c");
|
||||
_a.add("c");
|
||||
_a.add("d");
|
||||
_a.add("d");
|
||||
_a.add("d");
|
||||
_a.add("d");
|
||||
_b = new LinkedList();
|
||||
_b.add("e");
|
||||
_b.add("d");
|
||||
_b.add("d");
|
||||
_b.add("c");
|
||||
_b.add("c");
|
||||
_b.add("c");
|
||||
_b.add("b");
|
||||
_b.add("b");
|
||||
_b.add("b");
|
||||
_b.add("b");
|
||||
|
||||
}
|
||||
|
||||
public void testGetCardinalityMap() {
|
||||
Map freq = CollectionUtils.getCardinalityMap(_a);
|
||||
assertEquals(new Integer(1),freq.get("a"));
|
||||
assertEquals(new Integer(2),freq.get("b"));
|
||||
assertEquals(new Integer(3),freq.get("c"));
|
||||
assertEquals(new Integer(4),freq.get("d"));
|
||||
assert(null == freq.get("e"));
|
||||
|
||||
freq = CollectionUtils.getCardinalityMap(_b);
|
||||
assert(null == freq.get("a"));
|
||||
assertEquals(new Integer(4),freq.get("b"));
|
||||
assertEquals(new Integer(3),freq.get("c"));
|
||||
assertEquals(new Integer(2),freq.get("d"));
|
||||
assertEquals(new Integer(1),freq.get("e"));
|
||||
}
|
||||
|
||||
public void testCardinality() {
|
||||
assertEquals(1,CollectionUtils.cardinality("a",_a));
|
||||
assertEquals(2,CollectionUtils.cardinality("b",_a));
|
||||
assertEquals(3,CollectionUtils.cardinality("c",_a));
|
||||
assertEquals(4,CollectionUtils.cardinality("d",_a));
|
||||
assertEquals(0,CollectionUtils.cardinality("e",_a));
|
||||
|
||||
assertEquals(0,CollectionUtils.cardinality("a",_b));
|
||||
assertEquals(4,CollectionUtils.cardinality("b",_b));
|
||||
assertEquals(3,CollectionUtils.cardinality("c",_b));
|
||||
assertEquals(2,CollectionUtils.cardinality("d",_b));
|
||||
assertEquals(1,CollectionUtils.cardinality("e",_b));
|
||||
}
|
||||
|
||||
public void testUnion() {
|
||||
Collection col = CollectionUtils.union(_a,_b);
|
||||
Map freq = CollectionUtils.getCardinalityMap(col);
|
||||
assertEquals(new Integer(1),freq.get("a"));
|
||||
assertEquals(new Integer(4),freq.get("b"));
|
||||
assertEquals(new Integer(3),freq.get("c"));
|
||||
assertEquals(new Integer(4),freq.get("d"));
|
||||
assertEquals(new Integer(1),freq.get("e"));
|
||||
|
||||
Collection col2 = CollectionUtils.union(_b,_a);
|
||||
Map freq2 = CollectionUtils.getCardinalityMap(col2);
|
||||
assertEquals(new Integer(1),freq2.get("a"));
|
||||
assertEquals(new Integer(4),freq2.get("b"));
|
||||
assertEquals(new Integer(3),freq2.get("c"));
|
||||
assertEquals(new Integer(4),freq2.get("d"));
|
||||
assertEquals(new Integer(1),freq2.get("e"));
|
||||
}
|
||||
|
||||
public void testIntersection() {
|
||||
Collection col = CollectionUtils.intersection(_a,_b);
|
||||
Map freq = CollectionUtils.getCardinalityMap(col);
|
||||
assert(null == freq.get("a"));
|
||||
assertEquals(new Integer(2),freq.get("b"));
|
||||
assertEquals(new Integer(3),freq.get("c"));
|
||||
assertEquals(new Integer(2),freq.get("d"));
|
||||
assert(null == freq.get("e"));
|
||||
|
||||
Collection col2 = CollectionUtils.intersection(_b,_a);
|
||||
Map freq2 = CollectionUtils.getCardinalityMap(col2);
|
||||
assert(null == freq2.get("a"));
|
||||
assertEquals(new Integer(2),freq2.get("b"));
|
||||
assertEquals(new Integer(3),freq2.get("c"));
|
||||
assertEquals(new Integer(2),freq2.get("d"));
|
||||
assert(null == freq2.get("e"));
|
||||
}
|
||||
|
||||
public void testDisjunction() {
|
||||
Collection col = CollectionUtils.disjunction(_a,_b);
|
||||
Map freq = CollectionUtils.getCardinalityMap(col);
|
||||
assertEquals(new Integer(1),freq.get("a"));
|
||||
assertEquals(new Integer(2),freq.get("b"));
|
||||
assert(null == freq.get("c"));
|
||||
assertEquals(new Integer(2),freq.get("d"));
|
||||
assertEquals(new Integer(1),freq.get("e"));
|
||||
|
||||
Collection col2 = CollectionUtils.disjunction(_b,_a);
|
||||
Map freq2 = CollectionUtils.getCardinalityMap(col2);
|
||||
assertEquals(new Integer(1),freq2.get("a"));
|
||||
assertEquals(new Integer(2),freq2.get("b"));
|
||||
assert(null == freq2.get("c"));
|
||||
assertEquals(new Integer(2),freq2.get("d"));
|
||||
assertEquals(new Integer(1),freq2.get("e"));
|
||||
}
|
||||
|
||||
public void testDisjunctionAsUnionMinusIntersection() {
|
||||
Collection dis = CollectionUtils.disjunction(_a,_b);
|
||||
Collection un = CollectionUtils.union(_a,_b);
|
||||
Collection inter = CollectionUtils.intersection(_a,_b);
|
||||
assert(CollectionUtils.isEqualCollection(dis,CollectionUtils.subtract(un,inter)));
|
||||
}
|
||||
|
||||
public void testDisjunctionAsSymmetricDifference() {
|
||||
Collection dis = CollectionUtils.disjunction(_a,_b);
|
||||
Collection amb = CollectionUtils.subtract(_a,_b);
|
||||
Collection bma = CollectionUtils.subtract(_b,_a);
|
||||
assert(CollectionUtils.isEqualCollection(dis,CollectionUtils.union(amb,bma)));
|
||||
}
|
||||
|
||||
public void testSubtract() {
|
||||
Collection col = CollectionUtils.subtract(_a,_b);
|
||||
Map freq = CollectionUtils.getCardinalityMap(col);
|
||||
assertEquals(new Integer(1),freq.get("a"));
|
||||
assert(null == freq.get("b"));
|
||||
assert(null == freq.get("c"));
|
||||
assertEquals(new Integer(2),freq.get("d"));
|
||||
assert(null == freq.get("e"));
|
||||
|
||||
Collection col2 = CollectionUtils.subtract(_b,_a);
|
||||
Map freq2 = CollectionUtils.getCardinalityMap(col2);
|
||||
assertEquals(new Integer(1),freq2.get("e"));
|
||||
assert(null == freq2.get("d"));
|
||||
assert(null == freq2.get("c"));
|
||||
assertEquals(new Integer(2),freq2.get("b"));
|
||||
assert(null == freq2.get("a"));
|
||||
}
|
||||
|
||||
public void testIsSubCollectionOfSelf() {
|
||||
assert(CollectionUtils.isSubCollection(_a,_a));
|
||||
assert(CollectionUtils.isSubCollection(_b,_b));
|
||||
}
|
||||
|
||||
public void testIsSubCollection() {
|
||||
assert(!CollectionUtils.isSubCollection(_a,_b));
|
||||
assert(!CollectionUtils.isSubCollection(_b,_a));
|
||||
}
|
||||
|
||||
public void testIsSubCollection2() {
|
||||
Collection c = new ArrayList();
|
||||
assert(CollectionUtils.isSubCollection(c,_a));
|
||||
assert(!CollectionUtils.isSubCollection(_a,c));
|
||||
c.add("a");
|
||||
assert(CollectionUtils.isSubCollection(c,_a));
|
||||
assert(!CollectionUtils.isSubCollection(_a,c));
|
||||
c.add("b");
|
||||
assert(CollectionUtils.isSubCollection(c,_a));
|
||||
assert(!CollectionUtils.isSubCollection(_a,c));
|
||||
c.add("b");
|
||||
assert(CollectionUtils.isSubCollection(c,_a));
|
||||
assert(!CollectionUtils.isSubCollection(_a,c));
|
||||
c.add("c");
|
||||
assert(CollectionUtils.isSubCollection(c,_a));
|
||||
assert(!CollectionUtils.isSubCollection(_a,c));
|
||||
c.add("c");
|
||||
assert(CollectionUtils.isSubCollection(c,_a));
|
||||
assert(!CollectionUtils.isSubCollection(_a,c));
|
||||
c.add("c");
|
||||
assert(CollectionUtils.isSubCollection(c,_a));
|
||||
assert(!CollectionUtils.isSubCollection(_a,c));
|
||||
c.add("d");
|
||||
assert(CollectionUtils.isSubCollection(c,_a));
|
||||
assert(!CollectionUtils.isSubCollection(_a,c));
|
||||
c.add("d");
|
||||
assert(CollectionUtils.isSubCollection(c,_a));
|
||||
assert(!CollectionUtils.isSubCollection(_a,c));
|
||||
c.add("d");
|
||||
assert(CollectionUtils.isSubCollection(c,_a));
|
||||
assert(!CollectionUtils.isSubCollection(_a,c));
|
||||
c.add("d");
|
||||
assert(CollectionUtils.isSubCollection(c,_a));
|
||||
assert(CollectionUtils.isSubCollection(_a,c));
|
||||
c.add("e");
|
||||
assert(!CollectionUtils.isSubCollection(c,_a));
|
||||
assert(CollectionUtils.isSubCollection(_a,c));
|
||||
}
|
||||
|
||||
public void testIsEqualCollectionToSelf() {
|
||||
assert(CollectionUtils.isEqualCollection(_a,_a));
|
||||
assert(CollectionUtils.isEqualCollection(_b,_b));
|
||||
}
|
||||
|
||||
public void testIsEqualCollection() {
|
||||
assert(!CollectionUtils.isEqualCollection(_a,_b));
|
||||
assert(!CollectionUtils.isEqualCollection(_b,_a));
|
||||
}
|
||||
|
||||
public void testIsEqualCollection2() {
|
||||
Collection a = new ArrayList();
|
||||
Collection b = new ArrayList();
|
||||
assert(CollectionUtils.isEqualCollection(a,b));
|
||||
assert(CollectionUtils.isEqualCollection(b,a));
|
||||
a.add("1");
|
||||
assert(!CollectionUtils.isEqualCollection(a,b));
|
||||
assert(!CollectionUtils.isEqualCollection(b,a));
|
||||
b.add("1");
|
||||
assert(CollectionUtils.isEqualCollection(a,b));
|
||||
assert(CollectionUtils.isEqualCollection(b,a));
|
||||
a.add("2");
|
||||
assert(!CollectionUtils.isEqualCollection(a,b));
|
||||
assert(!CollectionUtils.isEqualCollection(b,a));
|
||||
b.add("2");
|
||||
assert(CollectionUtils.isEqualCollection(a,b));
|
||||
assert(CollectionUtils.isEqualCollection(b,a));
|
||||
a.add("1");
|
||||
assert(!CollectionUtils.isEqualCollection(a,b));
|
||||
assert(!CollectionUtils.isEqualCollection(b,a));
|
||||
b.add("1");
|
||||
assert(CollectionUtils.isEqualCollection(a,b));
|
||||
assert(CollectionUtils.isEqualCollection(b,a));
|
||||
}
|
||||
}
|
||||
Loading…
Reference in New Issue