/** * @param filter Filters to evaluate. * @return Primary values. */ public Collection<V> primaryValues(@Nullable GridPredicate<GridCacheEntry<K, V>>... filter) { return map.values(F.and(filter, F.<K, V>cachePrimary())); }
/** {@inheritDoc} */ @Override public Map<K, V> peekAll(@Nullable Collection<? extends K> keys, @Nullable GridPredicate<GridCacheEntry<K, V>>... filter) { final Map<K, V> resMap = super.peekAll(keys, filter); if (resMap.size() != keys.size()) resMap.putAll(dht().peekAll(keys, F.and(filter, new GridPredicate<GridCacheEntry<K, V>>() { @Override public boolean apply(GridCacheEntry<K, V> e) { return !resMap.containsKey(e.getKey()); } }))); return resMap; }
/** * @param filter Filters to evaluate. * @return Primary entry set. */ public Set<GridCacheEntry<K, V>> primaryEntrySet( @Nullable GridPredicate<GridCacheEntry<K, V>>... filter) { return map.entries(F.and(filter, F.<K, V>cachePrimary())); }
/** * @param filter Primary key set. * @return Primary key set. */ public Set<K> primaryKeySet(@Nullable GridPredicate<GridCacheEntry<K, V>>... filter) { return map.keySet(F.and(filter, F.<K, V>cachePrimary())); }
/** {@inheritDoc} */ @Override public Set<GridCacheEntry<K, V>> primaryEntrySetx(GridPredicate<GridCacheEntry<K, V>>... filter) { return map.entriesx(F.and(filter, F.<K, V>cachePrimary())); }
/** {@inheritDoc} */ @Override public Set<GridCacheEntry<K, V>> primaryEntrySetx(GridPredicate<GridCacheEntry<K, V>>... filter) { return cache.primaryEntrySetx(F.and(filter, entryFilter(true))); }
/** {@inheritDoc} */ @Override public Set<GridCacheEntry<K, V>> entrySetx(GridPredicate<GridCacheEntry<K, V>>... filter) { return cache.entrySetx(F.and(filter, entryFilter(true))); }
/** * @param vals Values. * @param filter Filter to evaluate. * @return {@code True} if contains any of given values. */ public boolean containsAnyValues(@Nullable Collection<? extends V> vals, @Nullable GridPredicate<GridCacheEntry<K, V>> filter) { if (F.isEmpty(vals)) return true; validateCacheValues(vals); return !values(F.and(filter, F.<K, V>cacheContainsPeek(vals))).isEmpty(); }
/** {@inheritDoc} */ @Override public final GridProjection forPredicate(GridPredicate<GridNode> p) { A.notNull(p, "p"); guard(); try { return new GridProjectionAdapter(this, ctx, subjId, this.p != null ? F.and(p, this.p) : p); } finally { unguard(); } }
F.and(routine.prjPred, F.remoteNodes(ctx.localNodeId())));
/** * @param mode Peek mode. * @param filter Optional entry filter. * @return Peeked value. * @throws GridException If failed. */ @SuppressWarnings({"unchecked"}) @Nullable private V peekDht0(@Nullable GridCachePeekMode mode, @Nullable GridPredicate<GridCacheEntry<K, V>>[] filter) throws GridException { if (mode == null) mode = SMART; while (true) { GridCacheProjectionImpl<K, V> prjPerCall = proxy.gateProjection(); if (prjPerCall != null) filter = ctx.vararg(F.and(ctx.vararg(proxy.predicate()), filter)); GridCacheProjectionImpl<K, V> prev = ctx.gate().enter(prjPerCall); try { GridCacheEntryEx<K, V> entry = dht().peekEx(key); return entry == null ? null : ctx.cloneOnFlag(entry.peek(mode, filter)); } catch (GridCacheEntryRemovedException ignore) { // No-op. } finally { ctx.gate().leave(prev); } } }
nodes = F.view(ctx.discovery().allNodes(), F.and(prjPred, F.remoteNodes(ctx.localNodeId())));
filter = ctx.vararg(F.and(ctx.vararg(proxy.predicate()), filter));
F.and(F.notIn(processed), VISIBLE_NODES));