Refine search
public Iterator<Neo4jError> errors() { return errors == null ? emptyIterator() : errors.iterator(); }
@Override public Iterator<UIWidget> iterator() { if (contents == null) { return Collections.emptyIterator(); } return Arrays.asList(contents).iterator(); }
Iterator<Entity> get(com.google.datastore.v1.ReadOptions readOptionsPb, final Key... keys) { if (keys.length == 0) { return Collections.emptyIterator(); } com.google.datastore.v1.LookupRequest.Builder requestPb = com.google.datastore.v1.LookupRequest.newBuilder(); if (readOptionsPb != null) { requestPb.setReadOptions(readOptionsPb); } for (Key k : Sets.newLinkedHashSet(Arrays.asList(keys))) { requestPb.addKeys(k.toPb()); } return new ResultsIterator(requestPb); }
NodeLayer(TreeMapNode node, List<TreeMapNode> children) { this.node = node; this.children = children; this.iter = (this.children == null) ? Collections.emptyIterator() : children.iterator(); }
/** * Get cookies iterator. Return empty iterator if not cookies on HTTP request. * * @return cookies iterator, possible empty. */ public Iterator<Cookie> iterator() { if (cookies == null) { return Collections.emptyIterator(); } return Arrays.asList(cookies).iterator(); } }
assertTrue(immutability.test(null)); assertTrue(immutability.test(Collections.emptyEnumeration())); assertTrue(immutability.test(Collections.emptyIterator())); assertTrue(immutability.test(Collections.emptyList())); assertTrue(immutability.test(Collections.emptyListIterator())); assertTrue(immutability.test(Collections.singletonMap("1", new JCIPImmutableObject()))); assertTrue(immutability.test(Collections.unmodifiableCollection(Arrays.asList("1", "2")))); assertTrue(immutability.test(Collections.unmodifiableList(Arrays.asList("1", "2")))); assertTrue(immutability.test(Collections.unmodifiableMap(Collections.singletonMap("1", "2")))); assertTrue(immutability.test(Collections.unmodifiableNavigableMap(new TreeMap<>(Collections.singletonMap("1", "2")))));
public Iterator<T> details() { if (details == null) return Collections.emptyIterator(); return details.iterator(); }
@Override public Iterator<String> iterator() { if (value != null) { return Collections.singleton(value).iterator(); } if (values != null) { return Arrays.asList(values).iterator(); } return Collections.emptyIterator(); }
@Test public void testEmptyExceededValueThreshold() throws ParseException { List<? extends IndexStream> iterable = Arrays.asList(ScannerStream.exceededValueThreshold(Collections.emptyIterator(), JexlASTHelper.parseJexlQuery("THIS_FIELD == 20"))); Intersection intersection = new Intersection(iterable, null); Assert.assertEquals(IndexStream.StreamContext.ABSENT, intersection.context()); } }
@Override public Iterator<UIWidget> iterator() { if (!contents.isEmpty()) { return contents.iterator(); } return Collections.emptyIterator(); }
@Override public Iterator<UIWidget> iterator() { if (content != null) { return Collections.singletonList(content).iterator(); } return Collections.emptyIterator(); } }
@Override public Iterator<UIWidget> iterator() { if (content != null) { return Collections.singletonList(content).iterator(); } return Collections.emptyIterator(); }
Iterator<CapableIndexDescriptor> indexesByProperty( int propertyId ) { List<CapableIndexDescriptor> indexes = indexByProperty.get( propertyId ); return (indexes == null) ? emptyIterator() : indexes.iterator(); }
@Override public <V> Iterator<VertexProperty<V>> properties(String... keys) { if (vertexMemory.elementKeyMap.isEmpty()) return Collections.emptyIterator(); if (keys==null || keys.length==0) { return Collections.emptyIterator(); //Do NOT return compute keys as part of all the properties... //keys = vertexMemory.elementKeyMap.keySet().toArray(new String[vertexMemory.elementKeyMap.size()]); } //..but only if specifically asked for by key List<VertexProperty<V>> result = new ArrayList<>(Math.min(keys.length,vertexMemory.elementKeyMap.size())); for (String key : keys) { if (!supports(key)) continue; V value = vertexMemory.getProperty(vertexId,key); if (value!=null) result.add(constructProperty(key,value)); } return result.iterator(); }
/** {@inheritDoc} */ @Override protected Cursor findAllFetched(List<Row> fetched, SearchRow first, SearchRow last) { Iterator<Row> iter; if (fetched.isEmpty()) iter = emptyIterator(); else if (first == null && last == null) iter = fetched.iterator(); else { int low = first == null ? 0 : binarySearchRow(fetched, first, firstRowCmp, false); if (low == fetched.size()) iter = emptyIterator(); else { int high = last == null ? fetched.size() : binarySearchRow(fetched, last, lastRowCmp, false); iter = fetched.subList(low, high).iterator(); } } return new GridH2Cursor(iter); }
@Override public <V> Iterator<VertexProperty<V>> properties(String... keys) { final Set<String> memoryKeys = vertexMemory.getMemoryKeys(); if (memoryKeys.isEmpty()) return Collections.emptyIterator(); if (keys==null || keys.length==0) { keys = memoryKeys.stream().filter(k -> !k.equals(TraversalVertexProgram.HALTED_TRAVERSERS)).toArray(String[]::new); } final List<VertexProperty<V>> result = new ArrayList<>(Math.min(keys.length,memoryKeys.size())); for (String key : keys) { if (!supports(key)) continue; V value = vertexMemory.getProperty(vertexId,key); if (value!=null) result.add(constructProperty(key,value)); } return result.iterator(); }
private Iterator<RuleSet> resolveAdditionalRulesets(List<String> additionalRulesets) throws RuleSetNotFoundException { if (additionalRulesets == null) { return Collections.emptyIterator(); } List<RuleSet> rulesets = new ArrayList<>(); RuleSetFactory ruleSetFactory = new RuleSetFactory(); for (String filename : additionalRulesets) { try { // do not take rulesets from pmd-test or pmd-core if (!filename.contains("pmd-test") && !filename.contains("pmd-core")) { rulesets.add(ruleSetFactory.createRuleSet(filename)); } else { LOG.fine("Ignoring ruleset " + filename); } } catch (IllegalArgumentException e) { // ignore rulesets, we can't read LOG.log(Level.WARNING, "ruleset file " + filename + " ignored (" + e.getMessage() + ")", e); } } return rulesets.iterator(); }
@Override public Iterator<ServerHolder> pickServersToDrop(DataSegment toDrop, NavigableSet<ServerHolder> serverHolders) { List<ListenableFuture<Pair<Double, ServerHolder>>> futures = new ArrayList<>(); for (final ServerHolder server : serverHolders) { futures.add( exec.submit( () -> Pair.of(computeCost(toDrop, server, true), server) ) ); } final ListenableFuture<List<Pair<Double, ServerHolder>>> resultsFuture = Futures.allAsList(futures); try { // results is an un-ordered list of a pair consisting of the 'cost' of a segment being on a server and the server List<Pair<Double, ServerHolder>> results = resultsFuture.get(); return results.stream() // Comparator.comapringDouble will order by lowest cost... // reverse it because we want to drop from the highest cost servers first .sorted(Comparator.comparingDouble((Pair<Double, ServerHolder> o) -> o.lhs).reversed()) .map(x -> x.rhs).collect(Collectors.toList()) .iterator(); } catch (Exception e) { log.makeAlert(e, "Cost Balancer Multithread strategy wasn't able to complete cost computation.").emit(); } return Collections.emptyIterator(); }
private void nextMessage() { try { row = null; while (row == null) { if (!nextIterator.hasNext()) { if (msg != null) { lastOffsetPartitions.put(msg.getPartition(), msg.offset()); } msg = messageQueue.take(); final byte[] message = msg.message(); nextIterator = message == null ? Collections.emptyIterator() : firehoseParser.parseBatch(ByteBuffer.wrap(message)).iterator(); continue; } row = nextIterator.next(); } } catch (InterruptedException e) { //Let the caller decide whether to stop or continue when thread is interrupted. log.warn(e, "Thread Interrupted while taking from queue, propagating the interrupt"); Thread.currentThread().interrupt(); } }
/** * Returns an iterator over the methods in this class. */ public Iterator<SootMethod> methodIterator() { checkLevel(SIGNATURES); if (methodList == null) { return Collections.emptyIterator(); } return new Iterator<SootMethod>() { final Iterator<SootMethod> internalIterator = methodList.iterator(); private SootMethod currentMethod; @Override public boolean hasNext() { return internalIterator.hasNext(); } @Override public SootMethod next() { currentMethod = internalIterator.next(); return currentMethod; } @Override public void remove() { internalIterator.remove(); subSigToMethods.put(currentMethod.getNumberedSubSignature(), null); currentMethod.setDeclared(false); } }; }