All Downloads are FREE. Search and download functionalities are using the official Maven repository.

org.neo4j.kernel.impl.index.schema.NativeAllEntriesReader Maven / Gradle / Ivy

Go to download

Neo4j kernel is a lightweight, embedded Java database designed to store data structured as graphs rather than tables. For more information, see http://neo4j.org.

There is a newer version: 5.25.1
Show newest version
/*
 * Copyright (c) "Neo4j"
 * Neo4j Sweden AB [https://neo4j.com]
 *
 * This file is part of Neo4j.
 *
 * Neo4j is free software: you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation, either version 3 of the License, or
 * (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program.  If not, see .
 */
package org.neo4j.kernel.impl.index.schema;

import java.io.IOException;
import java.io.UncheckedIOException;
import java.util.Iterator;
import org.neo4j.index.internal.gbptree.GBPTree;
import org.neo4j.index.internal.gbptree.Layout;
import org.neo4j.index.internal.gbptree.Seeker;
import org.neo4j.internal.helpers.collection.BoundedIterable;
import org.neo4j.internal.helpers.collection.PrefetchingIterator;
import org.neo4j.io.pagecache.context.CursorContext;

public class NativeAllEntriesReader> implements BoundedIterable {
    private final GBPTree tree;
    private final Layout layout;
    private final long fromIdInclusive;
    private final long toIdExclusive;
    private final CursorContext cursorContext;
    private Seeker seeker;

    NativeAllEntriesReader(
            GBPTree tree,
            Layout layout,
            long fromIdInclusive,
            long toIdExclusive,
            CursorContext cursorContext) {
        this.tree = tree;
        this.layout = layout;
        this.fromIdInclusive = fromIdInclusive;
        this.toIdExclusive = toIdExclusive;
        this.cursorContext = cursorContext;
    }

    @Override
    public Iterator iterator() {
        KEY from = layout.newKey();
        from.initialize(Long.MIN_VALUE);
        from.initValuesAsLowest();
        KEY to = layout.newKey();
        to.initialize(Long.MAX_VALUE);
        to.initValuesAsHighest();
        try {
            closeSeeker();
            seeker = tree.seek(from, to, cursorContext);
            return new PrefetchingIterator<>() {
                @Override
                protected Long fetchNextOrNull() {
                    do {
                        try {
                            if (!seeker.next()) {
                                return null;
                            }
                            long id = seeker.key().getEntityId();
                            if (id >= fromIdInclusive && id < toIdExclusive) {
                                return id;
                            }
                        } catch (IOException e) {
                            throw new UncheckedIOException(e);
                        }
                    } while (true);
                }
            };
        } catch (IOException e) {
            throw new UncheckedIOException(e);
        }
    }

    private void closeSeeker() throws IOException {
        if (seeker != null) {
            seeker.close();
            seeker = null;
        }
    }

    @Override
    public void close() throws Exception {
        closeSeeker();
    }

    @Override
    public long maxCount() {
        return UNKNOWN_MAX_COUNT;
    }
}




© 2015 - 2024 Weber Informatics LLC | Privacy Policy