@Override public void expand(Envelope env) { if (!isBoundsNull()) { boundsInternal().expand(env); } }
/** * Constructor to use the provided {@code GeoGIG} instance and never try to close it. */ public GeogigCLI(final GeoGIG geogig, final Console consoleReader) { this.consoleReader = consoleReader; this.platform = new DefaultPlatform(); this.providedGeogig = geogig; }
/** * Factory method to create a tree builder that clusters subtrees and nodes according to * {@link CanonicalNodeNameOrder} */ public static CanonicalTreeBuilder create(final ObjectStore store) { return create(store, RevTree.EMPTY); }
/** * Only for testing: allows to return a {@link RevFeature} with the specified id instead of the * one resulting from {@link HashObject} */ public static RevFeature featureForceId(ObjectId forceId, Object... rawValues) { RevFeatureBuilder builder = RevFeatureBuilder.builder().addAll(rawValues); RevFeature revFeature = builder.build(forceId); return revFeature; }
public static RevTreeBuilder createLargeFeaturesTreeBuilder(ObjectDatabase source, final String namePrefix, final int numEntries, final int startIndex, boolean randomIds) { RevTreeBuilder tree = CanonicalTreeBuilder.create(source); for (int i = startIndex; i < startIndex + numEntries; i++) { tree.put(featureNode(namePrefix, i, randomIds)); } return tree; }
private void addNode(RevTreeBuilder tree, int i) { Node ref = createNode(i); tree.put(ref); }
/** * @return a new instance of a properly "named" empty tree (as in with a proper object id after * applying {@link HashObject}) */ public static RevTree empty() { RevTree theEmptyTree = new LegacyTreeBuilder().build(); return theEmptyTree; }
public static RevTree createTreesTree(ObjectStore source, int numSubTrees, int featuresPerSubtre, ObjectId metadataId) { RevTree tree = createTreesTreeBuilder(source, numSubTrees, featuresPerSubtre, metadataId) .build(); source.put(tree); return tree; }
public static RevTree createFeaturesTree(ObjectStore source, final String namePrefix, final int numEntries, final int startIndex, boolean randomIds) { RevTree tree = createFeaturesTreeBuilder(source, namePrefix, numEntries, startIndex, randomIds).build(); source.put(tree); return tree; }
private RevTreeBuilder createTree(final int numEntries, final boolean insertInAscendingKeyOrder) { RevTreeBuilder tree = createBuiler(); final int increment = insertInAscendingKeyOrder ? 1 : -1; final int from = insertInAscendingKeyOrder ? 0 : numEntries - 1; final int breakAt = insertInAscendingKeyOrder ? numEntries : -1; for (int i = from; i != breakAt; i += increment) { addNode(tree, i); } return tree; }
protected ObjectId createAndSaveTree(final int numEntries, final boolean insertInAscendingKeyOrder) throws Exception { List<Node> nodes = createNodes(numEntries); ObjectId treeId = createAndSaveTree(nodes, insertInAscendingKeyOrder); return treeId; }
@SuppressWarnings("deprecation") @Override protected RevTreeBuilder createBuiler() { return new LegacyTreeBuilder(objectStore); }
/** * Gets an entry by key, this is potentially slow. * * @param key * @return */ public Optional<Node> get(final String key) { return getInternal(key, true); }
@Override protected Node createNode(int i) { Node node = createRandomSmallRectNode(i); return node; }
/** * @return the {@code RevCommit} as a readable string */ @Override public String toString() { return "Commit[" + getId() + ", '" + message + "']"; }
/** * @return the author's time stamp */ public long getAuthorTimestamp() { return authorTimestamp == 0L ? getCommitterTimestamp() : authorTimestamp; }
public static RevTreeBuilder createFeaturesTreeBuilder(ObjectStore source, final String namePrefix, final int numEntries, final int startIndex, boolean randomIds) { RevTreeBuilder tree = CanonicalTreeBuilder.create(source); for (int i = startIndex; i < startIndex + numEntries; i++) { tree.put(featureNode(namePrefix, i, randomIds)); } return tree; }
/** * Factory method to create a tree builder that clusters subtrees and nodes according to * {@link CanonicalNodeNameOrder} */ public static CanonicalTreeBuilder create(final ObjectStore store) { return create(store, RevTree.EMPTY); }
private RevTreeBuilder createTree(final int numEntries, final boolean insertInAscendingKeyOrder) { RevTreeBuilder tree = createBuiler(); final int increment = insertInAscendingKeyOrder ? 1 : -1; final int from = insertInAscendingKeyOrder ? 0 : numEntries - 1; final int breakAt = insertInAscendingKeyOrder ? numEntries : -1; for (int i = from; i != breakAt; i += increment) { addNode(tree, i); } return tree; }
@Override protected Node createNode(int i) { Node node = createRandomSmallRectNode(i); return node; }