Java Collection Intersect makeIntersection(Collection a, Collection b)

Here you can find the source of makeIntersection(Collection a, Collection b)

Description

make Intersection

License

Open Source License

Declaration

public static <K> ArrayList<K> makeIntersection(Collection<? extends K> a, Collection<? extends K> b) 

Method Source Code


//package com.java2s;
/*//from  w  w w .  ja v  a2 s  .c  o m
 * WANDORA
 * Knowledge Extraction, Management, and Publishing Application
 * http://wandora.org
 * 
 * Copyright (C) 2004-2016 Wandora Team
 * 
 * This program is free software: you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation, either version 3 of the License, or
 * (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program.  If not, see <http://www.gnu.org/licenses/>.
 *
 *
 * 
 *
 * GenericVelocityHelper.java
 *
 * Created on 17. joulukuuta 2004, 10:54
 */

import java.util.*;

public class Main {
    public static <K> ArrayList<K> makeIntersection(Collection<? extends K> a, Collection<? extends K> b) {
        ArrayList<K> intersection = new ArrayList<K>();
        if (a != null && b != null && b.size() > 0) {
            K o = null;
            for (Iterator<? extends K> iter = a.iterator(); iter.hasNext();) {
                o = iter.next();
                if (b.contains(o))
                    intersection.add(o);
            }
        }
        return intersection;
    }

    public static boolean contains(Collection objects, Object o) {
        if (objects == null || o == null)
            return false;
        else
            return objects.contains(o);
    }
}

Related

  1. intersection(final Collection c1, final Collection c2)
  2. intersectionSize(Collection c1, Collection c2)
  3. intersects(Collection c1, Collection c2)
  4. intersects(Collection c0, Collection c1)
  5. intersectsWith(Collection S1, Collection S2)
  6. sizeOfIntersection(Collection a, Collection b)