public QueryNode( final ComparatorKeyProvider<? super T> comparatorKeyProvider) { super(comparatorKeyProvider); this.directSuperNodes_ = new ArrayHashSet<Node<T>>(); }
@Override public boolean removeAll(Collection<?> c) { boolean modified = false; for (Object o : c) { modified |= remove(o); } return modified; }
@Override public String toString() { return Arrays.toString(toArray()); }
@Override public boolean remove(Object o) { if (o == null) throw new NullPointerException(); boolean removed = LinearProbing.remove(data, o); if (removed && --size == LinearProbing.getLowerSize(data.length)) shrink(); return removed; }
@Override public boolean add(E e) { if (e == null) throw new NullPointerException(); boolean added = LinearProbing.add(data, e); if (added && ++size == LinearProbing.getUpperSize(data.length)) enlarge(); return added; }
@Override public boolean remove(Object o) { if (o == null) throw new NullPointerException(); boolean removed = LinearProbing.remove(data, o); if (removed && --size == LinearProbing.getLowerSize(data.length)) shrink(); return removed; }
@Override public boolean add(E e) { if (e == null) throw new NullPointerException(); boolean added = LinearProbing.add(data, e); if (added && ++size == LinearProbing.getUpperSize(data.length)) enlarge(); return added; }
@Override protected Collection<IndexedComplexPropertyChain> newRecord() { return new ArrayHashSet<IndexedComplexPropertyChain>(2); } }
@Override public boolean remove(Object o) { if (o == null) throw new NullPointerException(); boolean removed = LinearProbing.remove(data, o); if (removed && --size == LinearProbing.getLowerSize(data.length)) shrink(); return removed; }
@Override public boolean add(E e) { if (e == null) throw new NullPointerException(); boolean added = LinearProbing.add(data, e); if (added && ++size == LinearProbing.getUpperSize(data.length)) enlarge(); return added; }
@Override public boolean removeAll(Collection<?> c) { boolean modified = false; for (Object o : c) { modified |= remove(o); } return modified; }
@Override public String toString() { return Arrays.toString(toArray()); }
public QueryNode(final Iterable<T> allMembers, final int size, final ComparatorKeyProvider<? super T> comparatorKeyProvider) { super(allMembers, size, comparatorKeyProvider); this.directSuperNodes_ = new ArrayHashSet<Node<T>>(); }
@Override public boolean removeAll(Collection<?> c) { boolean modified = false; for (Object o : c) { modified |= remove(o); } return modified; }
@Override public String toString() { return Arrays.toString(toArray()); }
public OrphanTypeNode(final Iterable<? extends T> members, final int size, final T canonical, final Taxonomy<T> taxonomy, final int estimatedInstanceNodes) { super(members, size, canonical, taxonomy); this.instanceNodes = new ArrayHashSet<OrphanInstanceNode<T, I>>( estimatedInstanceNodes); }
@Override protected Collection<Value> newRecord() { return new ArrayHashSet<Value>(); } }
@Override protected Collection<IndexedComplexPropertyChain> newRecord() { return new ArrayHashSet<IndexedComplexPropertyChain>(2); } }
@Override protected Collection<IndexedComplexPropertyChain> newRecord() { return new ArrayHashSet<IndexedComplexPropertyChain>(2); } }
@Override protected Collection<Value> newRecord() { return new ArrayHashSet<Value>(); } }