public StringColumnPreIndexStatsCollector(String column, StatsCollectorConfig statsCollectorConfig) { super(column, statsCollectorConfig); rawStringSet = new ObjectOpenHashSet<>(INITIAL_HASH_SET_SIZE); aggregatedStringSet = new ObjectOpenHashSet<>(INITIAL_HASH_SET_SIZE); }
private Set<InternalDistributedMember> getAllRecipients(InternalCache cache, Map map) { Set recipients = new ObjectOpenHashSet(); for (Object pr : map.keySet()) { PartitionedRegion partitionedRegion = (PartitionedRegion) cache.getRegion((String) pr); if (partitionedRegion != null && partitionedRegion.getRegionAdvisor() != null) { recipients.addAll(partitionedRegion.getRegionAdvisor().adviseDataStore()); } } return recipients; }
public ValueSet(K value) { this.value = value; this.set = new ObjectOpenHashSet<T>(); }
/** Returns a copy of the current set of job managers. * * @return a copy of the current set of job managers. */ protected Set<JGroupsRemoteJobManager<J>> remoteJobManagers() { synchronized( identifier2RemoteJobManager ) { return new ObjectOpenHashSet<JGroupsRemoteJobManager<J>>( identifier2RemoteJobManager.values() ); } }
private static Set<String> union( Set<String>[] a ) { ObjectOpenHashSet<String> s = new ObjectOpenHashSet<String>(); for( Set<String> t: a ) s.addAll( t ); return s; }
private static Set<String> union( Set<String>[] a ) { ObjectOpenHashSet<String> s = new ObjectOpenHashSet<String>(); for( Set<String> t: a ) s.addAll( t ); return s; }
private static Set<String> union( Set<String>[] a ) { ObjectOpenHashSet<String> s = new ObjectOpenHashSet<String>(); for( Set<String> t: a ) s.addAll( t ); return s; }
private static Set<String> union( Set<String>[] a ) { ObjectOpenHashSet<String> s = new ObjectOpenHashSet<String>(); for( Set<String> t: a ) s.addAll( t ); return s; }
public Set<String> visitPost( Remap node, Set<String> v ) throws QueryBuilderVisitorException { final ObjectOpenHashSet<String> result = new ObjectOpenHashSet<String>(); for( String index: v ) { final String remappedIndex = node.indexRemapping.get( index ); result.add( remappedIndex == null ? index : remappedIndex ); } return result; } public Set<String> visitPost( Weight node, Set<String> v ) throws QueryBuilderVisitorException { return v; }
private Set<InternalDistributedMember> getAllRecipients( GemFireCacheImpl cache, Map map) { Set recipients = new ObjectOpenHashSet(); for (Object pr : map.keySet()) { recipients.addAll(((PartitionedRegion)(cache.getRegion((String)pr))) .getRegionAdvisor().adviseDataStore()); } return recipients; }
private Set<String> checkUnion( Set<String>[] a, String operator ) { ObjectOpenHashSet<String> s = new ObjectOpenHashSet<String>(); for( Set<String> t: a ) s.addAll( t ); if ( s.size() == 1 ) return s; errorMessage = "The " + operator + " operator requires subqueries on the same index"; return null; }
public Set<String> visitPost( Remap node, Set<String> v ) throws QueryBuilderVisitorException { final ObjectOpenHashSet<String> result = new ObjectOpenHashSet<String>(); for( String index: v ) { final String remappedIndex = node.indexRemapping.get( index ); result.add( remappedIndex == null ? index : remappedIndex ); } return result; } public Set<String> visitPost( Weight node, Set<String> v ) throws QueryBuilderVisitorException { return v; }
private Set<String> checkUnion( Set<String>[] a, String operator ) { ObjectOpenHashSet<String> s = new ObjectOpenHashSet<String>(); for( Set<String> t: a ) s.addAll( t ); if ( s.size() == 1 ) return s; errorMessage = "The " + operator + " operator requires subqueries on the same index"; return null; }
private Set<String> checkUnion( Set<String>[] a, String operator ) { ObjectOpenHashSet<String> s = new ObjectOpenHashSet<String>(); for( Set<String> t: a ) s.addAll( t ); if ( s.size() == 1 ) return s; errorMessage = "The " + operator + " operator requires subqueries on the same index"; return null; }
public Set<String> visitPost( Remap node, Set<String> v ) throws QueryBuilderVisitorException { final ObjectOpenHashSet<String> result = new ObjectOpenHashSet<String>(); for( String index: v ) { final String remappedIndex = node.indexRemapping.get( index ); result.add( remappedIndex == null ? index : remappedIndex ); } return result; } public Set<String> visitPost( Weight node, Set<String> v ) throws QueryBuilderVisitorException { return v; }
public Set<String> visitPost( Remap node, Set<String> v ) throws QueryBuilderVisitorException { final ObjectOpenHashSet<String> result = new ObjectOpenHashSet<String>(); for( String index: v ) { final String remappedIndex = node.indexRemapping.get( index ); result.add( remappedIndex == null ? index : remappedIndex ); } return result; } public Set<String> visitPost( Weight node, Set<String> v ) throws QueryBuilderVisitorException { return v; }
private Set<String> checkUnion( Set<String>[] a, String operator ) { ObjectOpenHashSet<String> s = new ObjectOpenHashSet<String>(); for( Set<String> t: a ) s.addAll( t ); if ( s.size() == 1 ) return s; errorMessage = "The " + operator + " operator requires subqueries on the same index"; return null; }
public Set<String> getColumnKeys() { lock(); try { return new ObjectOpenHashSet<String>(idMap.keySet()); } finally { unlock(); } }
@Override public Collection<Integer> getNeighbors(final Integer x) { final int v = x.intValue(); final int outdegree = graph.outdegree(v); final int indegree = transpose.outdegree(v); final LazyIntIterator succ = graph.successors(v); final LazyIntIterator pred = transpose.successors(v); final ObjectOpenHashSet<Integer> res = new ObjectOpenHashSet<>(outdegree + indegree); for(int s; (s = succ.nextInt()) != -1;) res.add(Integer.valueOf(s)); for(int p; (p = pred.nextInt()) != -1;) res.add(Integer.valueOf(p)); return res; }
/** * @return the union of two sets. The maxSize is the larger of the two. If one * of them allow for unbounded size (maxSize = 0) then so does the union. */ DistinctStrings union(final DistinctStrings otherSet) { ObjectOpenHashSet<String> hash = new ObjectOpenHashSet<String>( Math.max(this.uniqueStrings.size(), otherSet.uniqueStrings.size())); hash.addAll(this.uniqueStrings); hash.addAll(otherSet.uniqueStrings); return new DistinctStrings(hash); }