content: /*
   * Copyright (c) 2019 abc123lzf <abc123lzf@126.com>
   *
   * Permission is hereby granted, free of charge, to any person obtaining a copy
   * of this software and associated documentation files (the "Software"), to deal
   * in the Software without restriction, including without limitation the rights
   * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
   * copies of the Software, and to permit persons to whom the Software is
   * furnished to do so, subject to the following conditions:
   *
   * The above copyright notice and this permission notice shall be included in all
   * copies or substantial portions of the Software.
   *
   * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
   * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
   * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
   * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
   * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
   * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
   * SOFTWARE.
   */
  package com.lzf.flyingsocks.misc;
  
  
  import java.util.AbstractSet;
  import java.util.Collection;
  import java.util.Iterator;
  import java.util.LinkedHashMap;
  
  public class ReturnableLinkedHashSet<E> extends AbstractSet<E> implements ReturnableSet<E> {
  
      private final LinkedHashMap<E, E> map;
  
      public ReturnableLinkedHashSet() {
          map = new LinkedHashMap<>();
      }
  
      public ReturnableLinkedHashSet(int size) {
          map = new LinkedHashMap<>(size);
      }
  
      public ReturnableLinkedHashSet(int size, float loadFactor) {
          map = new LinkedHashMap<>(size, loadFactor);
      }
  
      @Override
      public int size() {
          return map.size();
      }
  
      @Override
      public boolean isEmpty() {
          return map.isEmpty();
      }
  
      @Override
      public boolean contains(Object o) {
          return map.containsKey(o);
      }
  
      @Override
      public Iterator<E> iterator() {
          return map.keySet().iterator();
      }
  
      @Override
      public Object[] toArray() {
          return map.keySet().toArray();
      }
  
      @Override
      public <T> T[] toArray(T[] a) {
          return map.keySet().toArray(a);
      }
  
      @Override
      public boolean add(E e) {
          return map.put(e, e) != null;
      }
  
      @Override
      public E getIfContains(Object object) {
          return map.get(object);
      }
  
      @Override
      public boolean remove(Object o) {
          return map.remove(o) != null;
      }
  
      @Override
      public boolean containsAll(Collection<?> c) {
          return map.keySet().containsAll(c);
      }
  
      @Override
      public void clear() {
          map.clear();
      }
  }
  