All Downloads are FREE. Search and download functionalities are using the official Maven repository.
  • Log In
  • Register

    • repacked.com.google.common.collect.Sets Maven / Gradle / Ivy

    The newest version!
    package repacked.com.google.common.collect;

import repacked.com.google.common.base.Predicate;
import repacked.com.google.common.base.Predicates;

import java.util.AbstractSet;
import java.util.Iterator;
import java.util.Set;

/**
 * Copyright (C) 2010 RapidPM
 * 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.
 *
 * Created by RapidPM - Team on 19.09.16.
 */
public class Sets {
  private Sets() {
  }

  /**
   * Returns an unmodifiable view of the difference of two sets. The
   * returned set contains all elements that are contained by {@code set1} and
   * not contained by {@code set2}. {@code set2} may also contain elements not
   * present in {@code set1}; these are simply ignored. The iteration order of
   * the returned set matches that of {@code set1}.
   *
   * 
    Results are undefined if {@code set1} and {@code set2} are sets based
   * on different equivalence relations (as {@code HashSet}, {@code TreeSet},
   * and the keySet of an {@code IdentityHashMap} all are).
   */
//  public static  SetView difference(final Set set1, final Set set2) {
  public static  Set difference(final Set set1, final Set set2) {
    final Predicate notInSet2 = Predicates.not(Predicates.in(set2));

    return new SetView() {
      @Override
      public Iterator iterator() {
        return Iterators.filter(set1.iterator(), notInSet2);
      }

      @Override
      public int size() {
        return Iterators.size(iterator());
      }

      @Override
      public boolean isEmpty() {
        return set2.containsAll(set1);
      }

      @Override
      public boolean contains(Object element) {
        return set1.contains(element) && !set2.contains(element);
      }
    };
    //return null;
  }


  /**
   * An unmodifiable view of a set which may be backed by other sets; this view
   * will change as the backing sets do. Contains methods to copy the data into
   * a new set which will then remain stable. There is usually no reason to
   * retain a reference of type {@code SetView}; typically, you either use it
   * as a plain {@link Set}, or immediately invoke {@link #immutableCopy} or
   * {@link #copyInto} and forget the {@code SetView} itself.
   *
   * @since 2.0
   */
  public abstract static class SetView extends AbstractSet {
    private SetView() {
    } // no subclasses but our own

    /**
     * Returns an immutable copy of the current contents of this set view.
     * Does not support null elements.
     *
     * 
    Warning: this may have unexpected results if a backing set of
     * this view uses a nonstandard notion of equivalence, for example if it is
     * a {@link java.util.TreeSet} using a comparator that is inconsistent with {@link
     * Object#equals(Object)}.
     */
    public Set immutableCopy() {
      throw new RuntimeException("not yet impl - immutableCopy"); //Todo impl
      //return null;
//      return ImmutableSet.copyOf(this);
    }

    /**
     * Copies the current contents of this set view into an existing set. This
     * method has equivalent behavior to {@code set.addAll(this)}, assuming that
     * all the sets involved are based on the same notion of equivalence.
     *
     * @return a reference to {@code set}, for convenience
     */
    // Note: S should logically extend Set but can't due to either
    // some javac bug or some weirdness in the spec, not sure which.
    public > S copyInto(S set) {
      set.addAll(this);
      return set;
    }

    /**
     * Scope the return type to  UnmodifiableIterator {@link } to ensure this is an unmodifiable view.
     *
     * @since 20.0 (present with return type {@link Iterator} since 2.0)
     */
    @Override
    public abstract Iterator iterator();
  }
}
    
    
    
    

    




    
    
    © 2015 - 2025 Weber Informatics LLC | Privacy Policy