Package org.locationtech.geogig.api

Examples of org.locationtech.geogig.api.Node$BoundedTreeNode

244
245
246
247
248
249
250
251
252
253
        in.readFully(objectId);
        final byte[] metadataId = new byte[20];
        in.readFully(metadataId);
        final RevObject.TYPE contentType = RevObject.TYPE.valueOf(in.readByte());
        final Envelope bbox = readBBox(in);
        final Node node;
        node = Node.create(name, ObjectId.createNoClone(objectId),
                ObjectId.createNoClone(metadataId), contentType, bbox);
        return node;
    }
View Full Code Here
266
267
268
269
270
271
272
273
274
275
276
        return new DiffEntry(oldNodeRef, newNodeRef);
    }

    public static NodeRef readNodeRef(DataInput in) throws IOException {
        Node node = readNode(in);
        final byte[] metadataId = new byte[20];
        in.readFully(metadataId);
        String parentPath = in.readUTF();
        return new NodeRef(node, parentPath, ObjectId.createNoClone(metadataId));
    }
View Full Code Here
74
75
76
77
78
79
80
81
82
83
84
85
    /**
     * @return the resulting parent path after removing left and right from the stack, or
     *         {@code null} if left and/or right are a root tree.
     */
    public String endTree(@Nullable Node left, @Nullable Node right) {
        final Node popLeft = this.leftTrees.pop();
        final Node popRight = this.rightTrees.pop();
        try {
            Preconditions.checkState(Objects.equal(popLeft, left));
            Preconditions.checkState(Objects.equal(popRight, right));
        } catch (IllegalStateException e) {
            throw e;
View Full Code Here
111
112
113
114
115
116
117
118
119
120
121
122
123
124
            return;
        }
        // start by asking the consumer if go on with the walk at all with the
        // root nodes
        Envelope lbounds = SpatialOps.boundsOf(left);
        Node lnode = Node.create(NodeRef.ROOT, left.getId(), ObjectId.NULL, TYPE.TREE, lbounds);

        Envelope rbounds = SpatialOps.boundsOf(right);
        Node rnode = Node.create(NodeRef.ROOT, right.getId(), ObjectId.NULL, TYPE.TREE, rbounds);

        if (consumer.tree(lnode, rnode)) {
            traverseTree(consumer, left, right, 0);
        }
        consumer.endTree(lnode, rnode);
View Full Code Here
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
    private void traverseLeafLeaf(Consumer consumer, Iterator<Node> leftc, Iterator<Node> rightc) {
        PeekingIterator<Node> li = Iterators.peekingIterator(leftc);
        PeekingIterator<Node> ri = Iterators.peekingIterator(rightc);

        while (li.hasNext() && ri.hasNext()) {
            Node lpeek = li.peek();
            Node rpeek = ri.peek();
            int order = ORDER.compare(lpeek, rpeek);
            if (order < 0) {
                node(consumer, li.next(), null);// removal
            } else if (order == 0) {// change
                // same feature at both sides of the traversal, consume them and check if its
                // changed it or not
                Node l = li.next();
                Node r = ri.next();
                if (!l.equals(r)) {
                    node(consumer, l, r);
                }
            } else {
                node(consumer, null, ri.next());// addition
View Full Code Here
84
85
86
87
88
89
90
91
92
93
94
        toString(this, sb, 0);
        return sb.toString();
    }

    private void toString(MutableTree tree, StringBuilder sb, int indent) {
        Node node = tree.getNode();
        append(sb, node, indent);

        for (MutableTree c : tree.childTrees.values()) {
            toString(c, sb, indent + 1);
        }
View Full Code Here
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
            final Map<String, NodeRef> entries) {

        List<NodeRef> refsByDepth = Lists.newArrayList(entries.values());
        Collections.sort(refsByDepth, DEEPEST_LAST_COMPARATOR);

        Node rootNode = Node.create(ROOT, rootId, ObjectId.NULL, TYPE.TREE, null);
        MutableTree root = new MutableTree(rootNode);

        Envelope bounds = new Envelope();

        for (NodeRef entry : refsByDepth) {
            Node node = entry.getNode();
            node.expand(bounds);
            String parentPath = entry.getParentPath();
            root.setChild(parentPath, node);
        }
        // recreate root node with the appropriate bounds
        rootNode = Node.create(ROOT, rootId, ObjectId.NULL, TYPE.TREE, bounds);
View Full Code Here
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
            ObjectId metadataId;
            Envelope bounds;
            {
                RevTree newChild = childTree.build(origin, target);
                target.put(newChild);
                Node oldNode = childTree.getNode();
                name = oldNode.getName();
                newObjectId = newChild.getId();
                metadataId = oldNode.getMetadataId().or(ObjectId.NULL);
                bounds = SpatialOps.boundsOf(newChild);
            }
            Node newNode = Node.create(name, newObjectId, metadataId, TYPE.TREE, bounds);
            builder.put(newNode);
        }
        RevTree newTree = builder.build();
        if (!this.node.getObjectId().equals(newTree.getId())) {
            target.put(newTree);
View Full Code Here
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
        }
    }

    @Override
    public boolean tree(Node left, Node right) {
        final Node node = left == null ? right : left;
        if (NodeRef.ROOT.equals(node.getName())) {
            // ignore the call on the root tree and follow the traversal
            return true;
        }
        if (left == null || right == null) {
            addTreeFeatures(node.getObjectId(), left != null, right != null);
            if (left == null) {
                count.addedTrees(1);
            } else {
                count.removedTrees(1);
            }
View Full Code Here
88
89
90
91
92
93
94
95
96
97
98
99
100
101
        SortedMap<NodeRef, NodeRef> matches = newTreeMap();

        for (Map.Entry<String, MutableTree> right : entriesOnlyOnRight.entrySet()) {
            for (Map.Entry<String, MutableTree> left : entriesOnlyOnLeft.entrySet()) {

                Node leftNode = left.getValue().getNode();
                Node rightNode = right.getValue().getNode();

                if (rightNode.getObjectId().equals(leftNode.getObjectId())) {
                    String leftParent = NodeRef.parentPath(left.getKey());
                    String rightParent = NodeRef.parentPath(right.getKey());

                    NodeRef leftRef = new NodeRef(leftNode, leftParent, ObjectId.NULL);
                    NodeRef rightRef = new NodeRef(rightNode, rightParent, ObjectId.NULL);
View Full Code Here
TOP

Related Classes of org.locationtech.geogig.api.Node$BoundedTreeNode

  • org.locationtech.geogig.api.plumbing.CatObjectTest
  • org.locationtech.geogig.api.plumbing.DeepMove
  • org.locationtech.geogig.api.plumbing.diff.DiffCountConsumer
  • org.locationtech.geogig.api.plumbing.diff.DiffCountConsumerTest
  • org.locationtech.geogig.api.plumbing.diff.DiffPathTracker
  • org.locationtech.geogig.api.plumbing.diff.MutableTree
  • org.locationtech.geogig.api.plumbing.diff.MutableTreeTest
  • org.locationtech.geogig.api.plumbing.diff.PostOrderDiffWalkTest
  • org.locationtech.geogig.api.plumbing.diff.PreOrderDiffWalk
  • org.locationtech.geogig.api.plumbing.diff.PreOrderDiffWalkTest
    • Copyright © 2018 www.massapicom. All rights reserved.
    All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.