java.util.AbstractSet源码实例Demo-ICode联盟

类java.util.AbstractSet源码实例Demo

下面列出了怎么用java.util.AbstractSet的API类实例代码及写法，或者点击链接到github查看源代码。

源代码1 项目： smithy 文件： Model.java

/**
 * Converts the model to an immutable Set of shapes.
 *
 * @return Returns an unmodifiable set of shapes.
 */
public Set<Shape> toSet() {
    return new AbstractSet<Shape>() {
        @Override
        public int size() {
            return shapeMap.size();
        }

        @Override
        public boolean contains(Object o) {
            return o instanceof Shape && shapeMap.containsKey(((Shape) o).getId());
        }

        @Override
        public Iterator<Shape> iterator() {
            return shapeMap.values().iterator();
        }
    };
}

源代码2 项目： Bats 文件： ImmutableBitSet.java

/** Creates a view onto this bit set as a set of integers.
 *
 * <p>The {@code size} and {@code contains} methods are both O(n), but the
 * iterator is efficient. */
public Set<Integer> asSet() {
  return new AbstractSet<Integer>() {
    public Iterator<Integer> iterator() {
      return ImmutableBitSet.this.iterator();
    }

    public int size() {
      return cardinality();
    }

    @Override public boolean contains(Object o) {
      return ImmutableBitSet.this.get((Integer) o);
    }
  };
}

源代码3 项目： Bats 文件： Util.java

/** Returns a map that is a view onto a collection of values, using the
 * provided function to convert a value to a key.
 *
 * <p>Unlike
 * {@link com.google.common.collect.Maps#uniqueIndex(Iterable, com.google.common.base.Function)},
 * returns a view whose contents change as the collection of values changes.
 *
 * @param values Collection of values
 * @param function Function to map value to key
 * @param <K> Key type
 * @param <V> Value type
 * @return Map that is a view onto the values
 */
public static <K, V> Map<K, V> asIndexMapJ(
    final Collection<V> values,
    final Function<V, K> function) {
  final Collection<Map.Entry<K, V>> entries =
      Collections2.transform(values, v -> Pair.of(function.apply(v), v));
  final Set<Map.Entry<K, V>> entrySet =
      new AbstractSet<Map.Entry<K, V>>() {
        public Iterator<Map.Entry<K, V>> iterator() {
          return entries.iterator();
        }

        public int size() {
          return entries.size();
        }
      };
  return new AbstractMap<K, V>() {
    public Set<Entry<K, V>> entrySet() {
      return entrySet;
    }
  };
}

源代码4 项目： jdk1.8-source-analysis 文件： Collectors.java

@Override
public Set<Map.Entry<Boolean, T>> entrySet() {
    return new AbstractSet<Map.Entry<Boolean, T>>() {
        @Override
        public Iterator<Map.Entry<Boolean, T>> iterator() {
            Map.Entry<Boolean, T> falseEntry = new SimpleImmutableEntry<>(false, forFalse);
            Map.Entry<Boolean, T> trueEntry = new SimpleImmutableEntry<>(true, forTrue);
            return Arrays.asList(falseEntry, trueEntry).iterator();
        }

        @Override
        public int size() {
            return 2;
        }
    };
}

源代码5 项目： Quicksql 文件： ImmutableBitSet.java

/** Creates a view onto this bit set as a set of integers.
 *
 * <p>The {@code size} and {@code contains} methods are both O(n), but the
 * iterator is efficient. */
public Set<Integer> asSet() {
  return new AbstractSet<Integer>() {
    @Nonnull public Iterator<Integer> iterator() {
      return ImmutableBitSet.this.iterator();
    }

    public int size() {
      return cardinality();
    }

    @Override public boolean contains(Object o) {
      return ImmutableBitSet.this.get((Integer) o);
    }
  };
}

源代码6 项目： Quicksql 文件： Util.java

/** Returns a map that is a view onto a collection of values, using the
 * provided function to convert a value to a key.
 *
 * <p>Unlike
 * {@link com.google.common.collect.Maps#uniqueIndex(Iterable, com.google.common.base.Function)},
 * returns a view whose contents change as the collection of values changes.
 *
 * @param values Collection of values
 * @param function Function to map value to key
 * @param <K> Key type
 * @param <V> Value type
 * @return Map that is a view onto the values
 */
public static <K, V> Map<K, V> asIndexMapJ(
    final Collection<V> values,
    final Function<V, K> function) {
  final Collection<Map.Entry<K, V>> entries =
      Collections2.transform(values, v -> Pair.of(function.apply(v), v));
  final Set<Map.Entry<K, V>> entrySet =
      new AbstractSet<Map.Entry<K, V>>() {
        public Iterator<Map.Entry<K, V>> iterator() {
          return entries.iterator();
        }

        public int size() {
          return entries.size();
        }
      };
  return new AbstractMap<K, V>() {
    public Set<Entry<K, V>> entrySet() {
      return entrySet;
    }
  };
}

源代码7 项目： dragonwell8_jdk 文件： Collectors.java

@Override
public Set<Map.Entry<Boolean, T>> entrySet() {
    return new AbstractSet<Map.Entry<Boolean, T>>() {
        @Override
        public Iterator<Map.Entry<Boolean, T>> iterator() {
            Map.Entry<Boolean, T> falseEntry = new SimpleImmutableEntry<>(false, forFalse);
            Map.Entry<Boolean, T> trueEntry = new SimpleImmutableEntry<>(true, forTrue);
            return Arrays.asList(falseEntry, trueEntry).iterator();
        }

        @Override
        public int size() {
            return 2;
        }
    };
}

源代码8 项目： dragonwell8_jdk 文件： Defaults.java

public Set<Map.Entry<K, V>> entrySet() {
    return new AbstractSet<Map.Entry<K, V>>() {
        public int size() {
            return map.size();
        }

        public Iterator<Map.Entry<K,V>> iterator() {
            final Iterator<Map.Entry<K,V>> source = map.entrySet().iterator();
            return new Iterator<Map.Entry<K,V>>() {
               public boolean hasNext() { return source.hasNext(); }
               public Map.Entry<K,V> next() { return source.next(); }
               public void remove() { source.remove(); }
            };
        }

        public boolean add(Map.Entry<K,V> e) {
            return map.entrySet().add(e);
        }
    };
}

源代码9 项目： TencentKona-8 文件： Collectors.java

@Override
public Set<Map.Entry<Boolean, T>> entrySet() {
    return new AbstractSet<Map.Entry<Boolean, T>>() {
        @Override
        public Iterator<Map.Entry<Boolean, T>> iterator() {
            Map.Entry<Boolean, T> falseEntry = new SimpleImmutableEntry<>(false, forFalse);
            Map.Entry<Boolean, T> trueEntry = new SimpleImmutableEntry<>(true, forTrue);
            return Arrays.asList(falseEntry, trueEntry).iterator();
        }

        @Override
        public int size() {
            return 2;
        }
    };
}

源代码10 项目： TencentKona-8 文件： Defaults.java

public Set<Map.Entry<K, V>> entrySet() {
    return new AbstractSet<Map.Entry<K, V>>() {
        public int size() {
            return map.size();
        }

        public Iterator<Map.Entry<K,V>> iterator() {
            final Iterator<Map.Entry<K,V>> source = map.entrySet().iterator();
            return new Iterator<Map.Entry<K,V>>() {
               public boolean hasNext() { return source.hasNext(); }
               public Map.Entry<K,V> next() { return source.next(); }
               public void remove() { source.remove(); }
            };
        }

        public boolean add(Map.Entry<K,V> e) {
            return map.entrySet().add(e);
        }
    };
}

源代码11 项目： ZjDroid 文件： ReflectionClassDef.java

@Nonnull @Override public Set<String> getInterfaces() {
    return new AbstractSet<String>() {
        @Nonnull @Override public Iterator<String> iterator() {
            return Iterators.transform(Iterators.forArray(cls.getInterfaces()), new Function<Class, String>() {
                @Nullable @Override public String apply(@Nullable Class input) {
                    if (input == null) {
                        return null;
                    }
                    return ReflectionUtils.javaToDexName(input.getName());
                }
            });
        }

        @Override public int size() {
            return cls.getInterfaces().length;
        }
    };
}

源代码12 项目： ZjDroid 文件： ReflectionClassDef.java

@Nonnull @Override public Set<? extends Field> getFields() {
    return new AbstractSet<Field>() {
        @Nonnull @Override public Iterator<Field> iterator() {
            return Iterators.transform(Iterators.forArray(cls.getDeclaredFields()),
                    new Function<java.lang.reflect.Field, Field>() {
                        @Nullable @Override public Field apply(@Nullable java.lang.reflect.Field input) {
                            return new ReflectionField(input);
                        }
                    });
        }

        @Override public int size() {
            return cls.getDeclaredFields().length;
        }
    };
}

源代码13 项目： jdk8u60 文件： Collectors.java

@Override
public Set<Map.Entry<Boolean, T>> entrySet() {
    return new AbstractSet<Map.Entry<Boolean, T>>() {
        @Override
        public Iterator<Map.Entry<Boolean, T>> iterator() {
            Map.Entry<Boolean, T> falseEntry = new SimpleImmutableEntry<>(false, forFalse);
            Map.Entry<Boolean, T> trueEntry = new SimpleImmutableEntry<>(true, forTrue);
            return Arrays.asList(falseEntry, trueEntry).iterator();
        }

        @Override
        public int size() {
            return 2;
        }
    };
}

源代码14 项目： jdk8u60 文件： Defaults.java

public Set<Map.Entry<K, V>> entrySet() {
    return new AbstractSet<Map.Entry<K, V>>() {
        public int size() {
            return map.size();
        }

        public Iterator<Map.Entry<K,V>> iterator() {
            final Iterator<Map.Entry<K,V>> source = map.entrySet().iterator();
            return new Iterator<Map.Entry<K,V>>() {
               public boolean hasNext() { return source.hasNext(); }
               public Map.Entry<K,V> next() { return source.next(); }
               public void remove() { source.remove(); }
            };
        }

        public boolean add(Map.Entry<K,V> e) {
            return map.entrySet().add(e);
        }
    };
}

源代码15 项目： JDKSourceCode1.8 文件： Collectors.java

@Override
public Set<Map.Entry<Boolean, T>> entrySet() {
    return new AbstractSet<Map.Entry<Boolean, T>>() {
        @Override
        public Iterator<Map.Entry<Boolean, T>> iterator() {
            Map.Entry<Boolean, T> falseEntry = new SimpleImmutableEntry<>(false, forFalse);
            Map.Entry<Boolean, T> trueEntry = new SimpleImmutableEntry<>(true, forTrue);
            return Arrays.asList(falseEntry, trueEntry).iterator();
        }

        @Override
        public int size() {
            return 2;
        }
    };
}

源代码16 项目： transport 文件： PrestoMap.java

public Set<StdData> keySet() {
  return new AbstractSet<StdData>() {
    @Override
    public Iterator<StdData> iterator() {
      return new Iterator<StdData>() {
        int i = -2;

        @Override
        public boolean hasNext() {
          return !(i + 2 == size() * 2);
        }

        @Override
        public StdData next() {
          i += 2;
          return PrestoWrapper.createStdData(readNativeValue(_keyType, _block, i), _keyType, _stdFactory);
        }
      };
    }

    @Override
    public int size() {
      return PrestoMap.this.size();
    }
  };
}

源代码17 项目： transport 文件： GenericMap.java

@Override
public Set<StdData> keySet() {
  return new AbstractSet<StdData>() {
    @Override
    public Iterator<StdData> iterator() {
      return new Iterator<StdData>() {
        Iterator<Object> keySet = _map.keySet().iterator();

        @Override
        public boolean hasNext() {
          return keySet.hasNext();
        }

        @Override
        public StdData next() {
          return GenericWrapper.createStdData(keySet.next(), _keyType);
        }
      };
    }

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

源代码18 项目： transport 文件： HiveMap.java

@Override
public Set<StdData> keySet() {
  return new AbstractSet<StdData>() {
    @Override
    public Iterator<StdData> iterator() {
      return new Iterator<StdData>() {
        Iterator mapKeyIterator = _mapObjectInspector.getMap(_object).keySet().iterator();

        @Override
        public boolean hasNext() {
          return mapKeyIterator.hasNext();
        }

        @Override
        public StdData next() {
          return HiveWrapper.createStdData(mapKeyIterator.next(), _keyObjectInspector, _stdFactory);
        }
      };
    }

    @Override
    public int size() {
      return HiveMap.this.size();
    }
  };
}

源代码19 项目： transport 文件： AvroMap.java

@Override
public Set<StdData> keySet() {
  return new AbstractSet<StdData>() {
    @Override
    public Iterator<StdData> iterator() {
      return new Iterator<StdData>() {
        Iterator<Object> keySet = _map.keySet().iterator();
        @Override
        public boolean hasNext() {
          return keySet.hasNext();
        }

        @Override
        public StdData next() {
          return AvroWrapper.createStdData(keySet.next(), _keySchema);
        }
      };
    }

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

源代码20 项目： gyro 文件： FileScope.java

@Override
public Set<Entry<String, Object>> entrySet() {
    return new AbstractSet<Entry<String, Object>>() {

        @Override
        public void clear() {
            FileScope.this.clear();
        }

        @Override
        public Iterator<Map.Entry<String, Object>> iterator() {
            return FileScope.super.entrySet().iterator();
        }

        @Override
        public int size() {
            return FileScope.super.entrySet().size();
        }
    };
}

源代码21 项目： gyro 文件： FileScope.java

@Override
public Set<String> keySet() {
    return new AbstractSet<String>() {

        @Override
        public void clear() {
            FileScope.this.clear();
        }

        @Override
        public Iterator<String> iterator() {
            return FileScope.super.keySet().iterator();
        }

        @Override
        public int size() {
            return FileScope.super.keySet().size();
        }
    };
}

源代码22 项目： desugar_jdk_libs 文件： Collectors.java

@Override
public Set<Map.Entry<Boolean, T>> entrySet() {
    return new AbstractSet<Map.Entry<Boolean, T>>() {
        @Override
        public Iterator<Map.Entry<Boolean, T>> iterator() {
            Map.Entry<Boolean, T> falseEntry = new SimpleImmutableEntry<>(false, forFalse);
            Map.Entry<Boolean, T> trueEntry = new SimpleImmutableEntry<>(true, forTrue);
            return Arrays.asList(falseEntry, trueEntry).iterator();
        }

        @Override
        public int size() {
            return 2;
        }
    };
}

源代码23 项目： openjdk-jdk8u 文件： Collectors.java

@Override
public Set<Map.Entry<Boolean, T>> entrySet() {
    return new AbstractSet<Map.Entry<Boolean, T>>() {
        @Override
        public Iterator<Map.Entry<Boolean, T>> iterator() {
            Map.Entry<Boolean, T> falseEntry = new SimpleImmutableEntry<>(false, forFalse);
            Map.Entry<Boolean, T> trueEntry = new SimpleImmutableEntry<>(true, forTrue);
            return Arrays.asList(falseEntry, trueEntry).iterator();
        }

        @Override
        public int size() {
            return 2;
        }
    };
}

源代码24 项目： openjdk-jdk8u 文件： Defaults.java

public Set<Map.Entry<K, V>> entrySet() {
    return new AbstractSet<Map.Entry<K, V>>() {
        public int size() {
            return map.size();
        }

        public Iterator<Map.Entry<K,V>> iterator() {
            final Iterator<Map.Entry<K,V>> source = map.entrySet().iterator();
            return new Iterator<Map.Entry<K,V>>() {
               public boolean hasNext() { return source.hasNext(); }
               public Map.Entry<K,V> next() { return source.next(); }
               public void remove() { source.remove(); }
            };
        }

        public boolean add(Map.Entry<K,V> e) {
            return map.entrySet().add(e);
        }
    };
}

源代码25 项目： n4js 文件： MemberByNameAndAccessMap.java

@Override
public Set<Map.Entry<NameAndAccess, TMember>> entrySet() {
	return new AbstractSet<>() {
		@Override
		public Iterator<Map.Entry<NameAndAccess, TMember>> iterator() {
			return Iterators.unmodifiableIterator(
					new TransformedIterator2<TMember, Map.Entry<NameAndAccess, TMember>>(members.iterator()) {
						@Override
						protected Map.Entry<NameAndAccess, TMember> transform(TMember input) {
							final NameAndAccess[] nameAndAccess = NameAndAccess.of(input);
							if (nameAndAccess.length > 1) {
								setAdditionalElement(
										new AbstractMap.SimpleImmutableEntry<>(nameAndAccess[1], input));
							}
							return new AbstractMap.SimpleImmutableEntry<>(nameAndAccess[0], input);
						}
					});
		}

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

源代码26 项目： neoscada 文件： AbstractIoService.java

/**
 * {@inheritDoc}
 */
public final Set<WriteFuture> broadcast(Object message) {
    // Convert to Set.  We do not return a List here because only the
    // direct caller of MessageBroadcaster knows the order of write
    // operations.
    final List<WriteFuture> futures = IoUtil.broadcast(message, getManagedSessions().values());
    return new AbstractSet<WriteFuture>() {
        @Override
        public Iterator<WriteFuture> iterator() {
            return futures.iterator();
        }

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

源代码27 项目： org.alloytools.alloy 文件： Containers.java

/**
 * Returns a set backed by the given array (i.e. a set that uses object equality
 * for comparisons). The array must contain no duplicates, its elements must be
 * sorted in the increasing order of hashcodes (as by
 * {@link #hashSort(Object[])}), and its contents must not be changed while it
 * is in use by the returned set.
 *
 * @requires all i, j: [0..array.length) | i < j => array[i].hashCode() <=
 *           array[j].hashCode
 * @return an unmodifiable Set view of the given array
 */
public static final <T> Set<T> asHashSet(final T[] array) {
    return new AbstractSet<T>() {

        @Override
        public boolean contains(Object o) {
            return hashBinarySearch(array, o) >= 0;
        }

        @Override
        public Iterator<T> iterator() {
            return iterate(array);
        }

        @Override
        public int size() {
            return array.length;
        }
    };
}

源代码28 项目： openjdk-jdk8u-backup 文件： Collectors.java

@Override
public Set<Map.Entry<Boolean, T>> entrySet() {
    return new AbstractSet<Map.Entry<Boolean, T>>() {
        @Override
        public Iterator<Map.Entry<Boolean, T>> iterator() {
            Map.Entry<Boolean, T> falseEntry = new SimpleImmutableEntry<>(false, forFalse);
            Map.Entry<Boolean, T> trueEntry = new SimpleImmutableEntry<>(true, forTrue);
            return Arrays.asList(falseEntry, trueEntry).iterator();
        }

        @Override
        public int size() {
            return 2;
        }
    };
}

源代码29 项目： openjdk-jdk8u-backup 文件： Defaults.java

public Set<Map.Entry<K, V>> entrySet() {
    return new AbstractSet<Map.Entry<K, V>>() {
        public int size() {
            return map.size();
        }

        public Iterator<Map.Entry<K,V>> iterator() {
            final Iterator<Map.Entry<K,V>> source = map.entrySet().iterator();
            return new Iterator<Map.Entry<K,V>>() {
               public boolean hasNext() { return source.hasNext(); }
               public Map.Entry<K,V> next() { return source.next(); }
               public void remove() { source.remove(); }
            };
        }

        public boolean add(Map.Entry<K,V> e) {
            return map.entrySet().add(e);
        }
    };
}

源代码30 项目： Bytecoder 文件： Collectors.java

@Override
public Set<Map.Entry<Boolean, T>> entrySet() {
    return new AbstractSet<>() {
        @Override
        public Iterator<Map.Entry<Boolean, T>> iterator() {
            Map.Entry<Boolean, T> falseEntry = new SimpleImmutableEntry<>(false, forFalse);
            Map.Entry<Boolean, T> trueEntry = new SimpleImmutableEntry<>(true, forTrue);
            return List.of(falseEntry, trueEntry).iterator();
        }

        @Override
        public int size() {
            return 2;
        }
    };
}

类所在包

java.util

类方法

java.util.concurrent.ConcurrentHashMap

java.util.TreeMap

java.util.LinkedHashSet

java.util.concurrent.LinkedBlockingQueue

java.util.Stack

java.util.concurrent.CopyOnWriteArrayList

java.util.ArrayDeque

java.util.concurrent.ConcurrentLinkedQueue

java.util.SortedSet