Package org.locationtech.geogig.storage.GraphDatabase

Examples of org.locationtech.geogig.storage.GraphDatabase.GraphEdge

85
86
87
88
89
90
91
92
93
94
95
96
        Iterator<GraphEdge> outgoing = node.getEdges(Direction.OUT);
        if (outgoing.hasNext()) {
            boolean node_sparse = node.isSparse();
            boolean combined_sparse = false;
            while (outgoing.hasNext()) {
                GraphEdge parent = outgoing.next();
                GraphNode parentNode = parent.getToNode();
                combined_sparse = combined_sparse
                        || isSparsePath(parentNode, end, sparse || node_sparse);
            }
            return combined_sparse;
        }
View Full Code Here
158
159
160
161
162
163
164
165
166
167
168
169
                stopAncestryPath(commit, theirQueue, theirSet);
                return true;
            }
            Iterator<GraphEdge> edges = commit.getEdges(Direction.OUT);
            while (edges.hasNext()) {
                GraphEdge parentEdge = edges.next();
                GraphNode parent = parentEdge.getToNode();
                myQueue.add(parent);
            }
        }
        return false;
View Full Code Here
186
187
188
189
190
191
192
193
194
195
196
197
        Set<GraphNode> processed = new HashSet<GraphNode>();
        while (!ancestorQueue.isEmpty()) {
            GraphNode ancestor = ancestorQueue.poll();
            Iterator<GraphEdge> edges = ancestor.getEdges(Direction.OUT);
            while (edges.hasNext()) {
                GraphEdge relationship = edges.next();
                GraphNode parentNode = relationship.getToNode();
                if (theirSet.contains(parentNode)) {
                    if (!processed.contains(parentNode)) {
                        ancestorQueue.add(parentNode);
                        processed.add(parentNode);
                    }
View Full Code Here
223
224
225
226
227
228
229
230
231
232
233
234
            ancestorQueue.add(v);
            while (!ancestorQueue.isEmpty()) {
                GraphNode ancestor = ancestorQueue.poll();
                Iterator<GraphEdge> edges = ancestor.getEdges(Direction.OUT);
                while (edges.hasNext()) {
                    GraphEdge parent = edges.next();
                    GraphNode parentNode = parent.getToNode();
                    if (parentNode.getIdentifier() != ancestor.getIdentifier()) {
                        if (leftSet.contains(parentNode) || rightSet.contains(parentNode)) {
                            if (!processed.contains(parentNode)) {
                                ancestorQueue.add(parentNode);
                                processed.add(parentNode);
View Full Code Here
TOP

Related Classes of org.locationtech.geogig.storage.GraphDatabase.GraphEdge

  • org.locationtech.geogig.api.plumbing.CheckSparsePath
  • org.locationtech.geogig.api.plumbing.FindCommonAncestor
    • 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.