@Nullable @Override public ChildNodeEntry apply(ChildNodeEntry input) { return new MemoryChildNodeEntry(input.getName(), decorate(input.getName(), input.getNodeState())); } });
@Override public Iterable<DocumentNodeState> children(DocumentNodeState root) { return Iterables.transform(() -> root.getBundledChildren(), ce -> (DocumentNodeState)ce.getNodeState()); } }.preOrderTraversal(this)
@Override public String apply(ChildNodeEntry input) { return input.getName(); } });
@Override public Iterable<DocumentNodeState> children(DocumentNodeState root) { return Iterables.transform(() -> root.getBundledChildren(), ce -> (DocumentNodeState)ce.getNodeState()); } }.preOrderTraversal(this)
@Override public String apply(ChildNodeEntry input) { return input.getName(); } });
@Nullable @Override public ChildNodeEntry apply(ChildNodeEntry input) { return new MemoryChildNodeEntry(input.getName(), decorate(input.getName(), input.getNodeState())); } });
@Override protected NodeState getNext() { if (!fillStack()) { return null; } return stack.peekFirst().next().getNodeState(); }
@Override @Nullable public String apply(@Nullable ChildNodeEntry input) { if (input != null) { return input.getName(); } else { return null; } } };
@Nullable @Override public Checkpoint apply(@Nullable ChildNodeEntry input) { return Checkpoint.createFromSegmentNode(input.getName(), input.getNodeState()); } }));
@Override protected NodeState getNext() { if (!fillStack()) { return null; } return stack.peekFirst().next().getNodeState(); }
@Override @Nullable public String apply(@Nullable ChildNodeEntry input) { if (input != null) { return input.getName(); } else { return null; } } };
@Nullable @Override public Checkpoint apply(@Nullable ChildNodeEntry input) { return Checkpoint.createFromSegmentNode(input.getName(), input.getNodeState()); } }));
@Override public boolean apply(@Nullable ChildNodeEntry input) { return input != null && input.getNodeState().exists(); } }
static NodeState getChildNode(Iterable<? extends ChildNodeEntry> entries, String name) { return StreamSupport.stream(entries.spliterator(), false) .filter(e -> e.getName().equals(name)) .map(ChildNodeEntry::getNodeState) .findFirst() .orElse(EmptyNodeState.MISSING_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; } }
@Override public boolean apply(@Nullable ChildNodeEntry input) { return input != null && input.getNodeState().exists(); } }
private String asPath(List<ChildNodeEntry> children) { if (children.isEmpty()) { return ""; } StringBuilder sb = new StringBuilder(); for (ChildNodeEntry child : children) { if (sb.length() != 0) { sb.append("/"); } sb.append(child.getName()); } return sb.toString(); } }
@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; } }
@Override public boolean apply(@Nullable ChildNodeEntry input) { return input != null && input.getNodeState().exists(); } }
private String asPath(List<ChildNodeEntry> children) { if (children.isEmpty()) { return ""; } StringBuilder sb = new StringBuilder(); for (ChildNodeEntry child : children) { if (sb.length() != 0) { sb.append("/"); } sb.append(child.getName()); } return sb.toString(); } }