@Override public ChildNodeEntry apply(Entry<String, ? extends NodeState> entry) { return new MemoryChildNodeEntry(entry.getKey(), entry.getValue()); } });
@NotNull @Override public Iterable<ChildNodeEntry> getChildNodeEntries() { return MemoryChildNodeEntry.iterable(nodes.entrySet()); }
@Override public ChildNodeEntry apply(Entry<String, ? extends NodeState> entry) { return new MemoryChildNodeEntry(entry.getKey(), entry.getValue()); } });
@Nonnull @Override public Iterable<ChildNodeEntry> getChildNodeEntries() { return MemoryChildNodeEntry.iterable(nodes.entrySet()); }
@NotNull @Override public Iterable<? extends ChildNodeEntry> getChildNodeEntries() { return record.getRoot() .map(root -> new MemoryChildNodeEntry("root", root)) .map(Collections::singletonList) .orElseGet(Collections::emptyList); }
@Nonnull @Override public Iterable<? extends ChildNodeEntry> getChildNodeEntries() { if (!base.exists()) { return emptyList(); } else if (nodes.isEmpty()) { return base.getChildNodeEntries(); // shortcut } else { Predicate<ChildNodeEntry> predicate = Predicates.compose( not(in(nodes.keySet())), ChildNodeEntry.GET_NAME); return concat( filter(base.getChildNodeEntries(), predicate), iterable(filterValues(nodes, NodeState.EXISTS).entrySet())); } }
@NotNull @Override public Iterable<? extends ChildNodeEntry> getChildNodeEntries() { return backend.getCommit(handle) .flatMap(Proc.Backend.Commit::getRoot) .map(r -> singleton(new MemoryChildNodeEntry("root", r))) .orElse(emptySet()); }
@NotNull @Override public Iterable<? extends ChildNodeEntry> getChildNodeEntries() { if (!base.exists()) { return emptyList(); } else if (nodes.isEmpty()) { return base.getChildNodeEntries(); // shortcut } else { Predicate<ChildNodeEntry> predicate = Predicates.compose( not(in(nodes.keySet())), ChildNodeEntry.GET_NAME); return concat( filter(base.getChildNodeEntries(), predicate), iterable(filterValues(nodes, NodeState.EXISTS).entrySet())); } }
@NotNull @Override public Iterable<MemoryChildNodeEntry> getChildNodeEntries() { List<MemoryChildNodeEntry> entries = newArrayListWithCapacity(nodes.size()); for (Map.Entry<String, NodeId> entry : nodes.entrySet()) { String name = entry.getKey(); final NodeState child = createChildNodeState(entry.getValue(), name); if (child != null) { entries.add(new MemoryChildNodeEntry(name, child)); } } return entries; }
@NotNull @Override public Iterable<MemoryChildNodeEntry> getChildNodeEntries() { List<MemoryChildNodeEntry> entries = newArrayListWithCapacity(nodes.size()); for (Map.Entry<String, NodeId> entry : nodes.entrySet()) { String name = entry.getKey(); final NodeState child = createChildNodeState(entry.getValue(), name); if (child != null) { entries.add(new MemoryChildNodeEntry(name, child)); } } return entries; }
private Iterable<ChildNodeEntry> toChildNodeEntries(Iterable<Record> records) { return StreamSupport.stream(records.spliterator(), false) .map(r -> new MemoryChildNodeEntry(Integer.toString(r.getNumber()), new RecordNode(r))) .collect(Collectors.toList()); }
@NotNull @Override public Iterable<? extends ChildNodeEntry> getChildNodeEntries() { return Arrays.asList( new MemoryChildNodeEntry("references", new ReferencesNode(backend, segmentId)), new MemoryChildNodeEntry("records", new RecordsNode(backend, segmentId)) ); }
@NotNull @Override public Iterable<? extends ChildNodeEntry> getChildNodeEntries() { List<ChildNodeEntry> entries = new ArrayList<>(); for (String name : backend.getTarNames()) { entries.add(new MemoryChildNodeEntry(name, new TarNode(backend, name))); } return entries; }
@NotNull @Override public Iterable<? extends ChildNodeEntry> getChildNodeEntries() { List<ChildNodeEntry> entries = new ArrayList<>(); for (String handle : backend.getCommitHandles()) { entries.add(new MemoryChildNodeEntry(handle, new CommitNode(backend, handle))); } return entries; }
@Nullable @Override public ChildNodeEntry apply(@Nullable String input) { return new MemoryChildNodeEntry(input, EMPTY_NODE); } }));
@Nullable @Override public ChildNodeEntry apply(@Nullable final ChildNodeEntry childNodeEntry) { if (childNodeEntry != null) { final String name = childNodeEntry.getName(); final NodeState nodeState = decorate(name, childNodeEntry.getNodeState()); if (nodeState.exists()) { return new MemoryChildNodeEntry(name, nodeState); } } return null; } }
@Nullable @Override public ChildNodeEntry apply(@Nullable final ChildNodeEntry childNodeEntry) { if (childNodeEntry != null) { final String name = childNodeEntry.getName(); final NodeState nodeState = decorate(name, childNodeEntry.getNodeState()); if (nodeState.exists()) { return new MemoryChildNodeEntry(name, nodeState); } } return null; } }
@NotNull @Override public Iterable<? extends ChildNodeEntry> getChildNodeEntries() { if (exists) { return ImmutableSet.of(new MemoryChildNodeEntry("c", C)); } else { return ImmutableSet.of(); } }
@Nullable @Override public ChildNodeEntry apply(@Nullable final ChildNodeEntry childNodeEntry) { if (childNodeEntry != null) { final String name = childNodeEntry.getName(); final NodeState nodeState = decorate(name, childNodeEntry.getNodeState()); if (nodeState.exists()) { return new MemoryChildNodeEntry(name, nodeState); } } return null; } }
private static void collectAggregatesForDirectMatchers(NodeState nodeState, List<Matcher> matchers, ResultCollector collector) { Map<String, ChildNodeEntry> children = Maps.newHashMap(); //Collect potentially matching child nodestates based on matcher name for (Matcher m : matchers){ String nodeName = m.getNodeName(); NodeState child = nodeState.getChildNode(nodeName); if (child.exists()){ children.put(nodeName, new MemoryChildNodeEntry(nodeName, child)); } } matchChildren(matchers, collector, children.values()); }