@CheckReturnValue public HeldLockSet plusAll(Collection<GuardedByExpression> locks) { return new HeldLockSet(this.locks.plusAll(locks)); }
/** * @param list * @return * @see org.pcollections.MapPSet#plusAll(java.util.Collection) */ public PSetX<T> plusAll(Collection<? extends T> list) { return new PSetXImpl<>(set.plusAll(list)); }
@Override public void visitNode(JavaSymbolicObject node) { if (node.variableSet != null) { variables = variables.plusAll(node.variableSet); return; } PSet<Variable> parentVariables = variables; variables = HashTreePSet.empty(); if (!(node instanceof KLabelConstant || node instanceof Token)) { super.visitNode(node); } node.variableSet = variables; variables = parentVariables.plusAll(variables); }
@Override public PersistentSetX<T> plusAll(Collection<? extends T> list) { return from(get().plusAll(list)); }
@CheckReturnValue public HeldLockSet plusAll(Collection<GuardedByExpression> locks) { return new HeldLockSet(this.locks.plusAll(locks)); }
public void testSet() { PSet<String> a = HashTreePSet.empty(), b = HashTreePSet.empty(); assertEqualsAndHash("empty sets not equal",a,b); assertTrue("adding element should change empty set",!a.equals(a.plus("one"))); a = a.plus("one"); assertEqualsAndHash("adding duplicate should not change set",a,a.plus("one")); a = a.plus("two").plus(""); b = b.plus("two").plus("").plus("one").plus("two"); assertEqualsAndHash(a,b); b = b.plus("three"); assertTrue(!a.equals(b)); int n = b.size(); for(@SuppressWarnings("unused") String s : b) n--; assertTrue("iterator() should return size() elements", n==0); assertEqualsAndHash("adding a set to itself should do nothing",b,b.plusAll(b)); assertEqualsAndHash("adding a set to the empty set should be identity", b, MapPSet.from(HashTreePMap.<String,Object>empty(), b)); // bug Mike found: assertEqualsAndHash(HashTreePSet.from(Arrays.asList(2)), HashTreePSet.empty().plus(1).plus(2).minus(1)); }
private void mergeProxies(Class key,PSet<ProxyWrapper> proxies){ val current = proxyCache.get(key); proxyCache.minus(key); val newProxies = current==null ? proxies : proxies.plusAll(current); proxyCache = proxyCache.plus(key, newProxies); }
private void mergeProxies(Class key,PSet<ProxyWrapper> proxies){ val current = proxyCache.get(key); proxyCache.minus(key); val newProxies = current==null ? proxies : proxies.plusAll(current); proxyCache = proxyCache.plus(key, newProxies); }
private void mergeProxies(Class key,PSet<ProxyWrapper> proxies){ val current = proxyCache.get(key); proxyCache.minus(key); val newProxies = current==null ? proxies : proxies.plusAll(current); proxyCache = proxyCache.plus(key, newProxies); }
private synchronized void mergeProxies(Class key,PSet<ProxyWrapper> proxies){ val current = proxyCache.get(key); proxyCache.minus(key); val newProxies = current==null ? proxies : proxies.plusAll(current); proxyCache = proxyCache.plus(key, newProxies); }
public static <T> Monoid<PSet<T>> toPSet() { return Monoid.<PSet<T>>of(HashTreePSet.empty(), (PSet<T> a) -> b -> a.plusAll(b), (T x) -> HashTreePSet.singleton(x)); } public static <T> Monoid<PVector<T>> toPVector() {
/** * <pre> * {@code * PSet<Integer> q = Reducers.<Integer>toPSet() .mapReduce(Stream.of(1,2,3,4)); * * } * </pre> * @return Reducer for PSet */ public static <T> Reducer<PSet<T>> toPSet() { return Reducer.<PSet<T>> of(HashTreePSet.empty(), (final PSet<T> a) -> b -> a.plusAll(b), (final T x) -> HashTreePSet.singleton(x)); } /**