All Downloads are FREE. Search and download functionalities are using the official Maven repository.

org.jetbrains.kotlin.utils.HashSetUtil Maven / Gradle / Ivy

There is a newer version: 2.1.0-Beta1
Show newest version
/*
 * Copyright 2010-2015 JetBrains s.r.o.
 *
 * 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.
 */

package org.jetbrains.kotlin.utils;

import com.intellij.util.containers.hash.EqualityPolicy;
import com.intellij.util.containers.hash.HashSet;
import com.intellij.util.containers.hash.LinkedHashMap;
import org.jetbrains.annotations.NotNull;

import java.util.Map;
import java.util.Set;

public class HashSetUtil {
    @NotNull
    public static  Set linkedHashSet(@NotNull Set set,  @NotNull EqualityPolicy policy) {
        // this implementation of LinkedHashMap doesn't admit nulls as values
        Map map = new LinkedHashMap(policy);
        for (T t : set) {
            map.put(t, "");
        }
        return map.keySet();
    }

    @NotNull
    public static  Set symmetricDifference(@NotNull Set set1, @NotNull Set set2) {
        Set intersection = new HashSet();
        intersection.addAll(set1);
        intersection.retainAll(set2);
        Set result = new HashSet();
        result.addAll(set1);
        result.addAll(set2);
        result.removeAll(intersection);

        return result;
    }
}




© 2015 - 2024 Weber Informatics LLC | Privacy Policy