com.conversantmedia.util.collection.spatial.CounterNode Maven / Gradle / Ivy

Go to download

Show more of this group Show more artifacts with this name
Show all versions of rtree Show documentation

Conversant RTree - N dimensional spatial index

There is a newer version: 1.0.5

package com.conversantmedia.util.collection.spatial;

/*
 * #%L
 * Conversant RTree
 * ~~
 * Conversantmedia.com © 2016, Conversant, Inc. Conversant® is a trademark of Conversant, Inc.
 * ~~
 * Licensed under the Apache License, Version 2.0 (the "License");
 * you may not use this file except in compliance with the License.
 * You may obtain a copy of the License at
 *
 *      http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 * #L%
 */

import java.util.function.Consumer;

/**
 * Created by jcovert on 6/18/15.
 */
final class CounterNode implements Node {
    private final Node node;

    static int searchCount = 0;
    static int bboxEvalCount = 0;

    CounterNode(final Node node) {
        this.node = node;
    }

    @Override
    public boolean isLeaf() {
        return node.isLeaf();
    }

    @Override
    public HyperRect getBound() {
        return node.getBound();
    }

    @Override
    public Node add(T t) {
        return node.add(t);
    }

    @Override
    public Node remove(T t) { return node.remove(t); }

    @Override
    public Node update(T told, T tnew) { return node.update(told, tnew); }

    @Override
    public int search(HyperRect rect, T[] t, int n) {
        searchCount++;
        bboxEvalCount += node.size();
        return node.search(rect, t, n);
    }

    @Override
    public int size() {
        return node.size();
    }

    @Override
    public int totalSize() {
        return node.totalSize();
    }

    @Override
    public void forEach(Consumer consumer) {
        node.forEach(consumer);
    }

    @Override
    public void search(HyperRect rect, Consumer consumer) {
        node.search(rect, consumer);
    }

    @Override
    public int intersects(HyperRect rect, T[] t, int n) {
        return node.intersects(rect, t, n);
    }

    @Override
    public void intersects(HyperRect rect, Consumer consumer) {
        node.intersects(rect, consumer);
    }

    @Override
    public boolean contains(HyperRect rect, T t) {
        return node.contains(rect, t);
    }

    @Override
    public void collectStats(Stats stats, int depth) {
        node.collectStats(stats, depth);
    }

    @Override
    public Node instrument() {
        return this;
    }
}