public void addChild(T childTree) { getChildren().put(childTree.getPath().getSegment(), childTree); }
@Override public void serialize(T value, JsonGenerator gen, SerializerProvider serializers) throws IOException { gen.writeStartObject(); serializers.defaultSerializeField("hash", value.getHash(), gen); gen.writeObjectFieldStart("children"); for (T child : value.getChildren()) { gen.writeFieldName(segmentToString(child.getPath().getSegment())); serialize(child, gen, serializers); } //children gen.writeEndObject(); //whole object gen.writeEndObject(); }
EntityType structureType = EntityType.of(newStructurePath.getSegment().getElementType());
private Set<SyncHash.Tree> sortByType(Collection<SyncHash.Tree> col) { Set<SyncHash.Tree> set = new TreeSet<>((a, b) -> { InventoryStructure.EntityType aType = InventoryStructure.EntityType.of(a.getPath().getSegment().getElementType()); InventoryStructure.EntityType bType = InventoryStructure.EntityType.of(b.getPath().getSegment().getElementType()); int ret = aType.ordinal() - bType.ordinal(); if (ret == 0) { //this is actually not important.. we only need to make sure we have a total ordering and that //the entities are sorted by their type.. ret = a.getHash().compareTo(b.getHash()); } return ret; }); set.addAll(col); return set; }
a.getPath().getSegment().getElementId().compareTo(b.getPath().getSegment().getElementId())); Hashes.Tree h = treeChildren.get(j); int cmp = p.path.getElementId().compareTo(h.getPath().getSegment().getElementId()); if (cmp == 0) {
if (originLabel != null) { apply(filter.getPaths()[0].getSegment(), query); String candidateLabel = nextRandomLabel(); query.as(candidateLabel); Arrays.setAll(candidates, i -> { GraphTraversal<?, ?> n = __.start(); apply(filter.getPaths()[i].getSegment(), n); return n; });