Java SortedSet setminus(SortedSet pSet1, SortedSet pSet2)

Description

Computes a new set, that is the setminus of set1 and set2.

License

Open Source License

Parameter

Parameter	Description
pSet1	a Set.
pSet2	the other Set

Return

Setminus.

Declaration

public static <E> SortedSet<E> setminus(SortedSet<E> pSet1, SortedSet<E> pSet2) 

Method Source Code

//package com.java2s;
/*//ww  w.j av a2 s. c o m
 *  CPAchecker is a tool for configurable software verification.
 *  This file is part of CPAchecker.
 *
 *  Copyright (C) 2007-2015  Dirk Beyer
 *  All rights reserved.
 *
 *  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.
 *
 *
 *  CPAchecker web page:
 *    http://cpachecker.sosy-lab.org
 */

import java.util.Iterator;

import java.util.SortedSet;
import java.util.TreeSet;

public class Main {
    /**
     * Computes a new set, that is the setminus of <i>set1</i> and <i>set2</i>.
     * @param pSet1 a Set.
     * @param pSet2 the other Set
     * @return Setminus.
     */
    public static <E> SortedSet<E> setminus(SortedSet<E> pSet1, SortedSet<E> pSet2) {
        SortedSet<E> result = new TreeSet<>();
        Iterator<E> it1 = pSet1.iterator();
        while (it1.hasNext()) {
            E elem = it1.next();
            if (!pSet2.contains(elem)) {
                result.add(elem);
            }
        }
        return result;
    }
}

Related

1. intersect(SortedSet pSet1, SortedSet pSet2)
2. intersectSorted(final Collection c1, final Collection c2)
3. mapToSortedSet(Map map)
4. newSortedSet()
5. setDistance(SortedSet s1, SortedSet s2)
6. sorted(Iterable input)
7. sortedByValues(Map map, final boolean asc)
8. sortedConfigKeys(Iterable> conf)
9. sortedSet()