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

org.neo4j.kernel.impl.newapi.CursorPredicates 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 [http://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.newapi;

import java.util.function.Predicate;

import org.neo4j.internal.kernel.api.NodeCursor;
import org.neo4j.internal.kernel.api.PropertyCursor;
import org.neo4j.internal.kernel.api.PropertyIndexQuery;
import org.neo4j.internal.kernel.api.RelationshipScanCursor;

public class CursorPredicates
{

    public static boolean propertiesMatch( PropertyCursor propertyCursor, PropertyIndexQuery[] queries )
    {
        int targetCount = queries.length;
        while ( propertyCursor.next() )
        {
            for ( PropertyIndexQuery query : queries )
            {
                if ( propertyCursor.propertyKey() == query.propertyKeyId() )
                {
                    if ( query.acceptsValueAt( propertyCursor ) )
                    {
                        targetCount--;
                        if ( targetCount == 0 )
                        {
                            return true;
                        }
                    }
                    else
                    {
                        return false;
                    }
                }
            }
        }
        return false;
    }

    public static Predicate hasLabel( int labelId )
    {
        return cursor -> cursor.hasLabel( labelId );
    }

    public static Predicate hasType( int typeId )
    {
        return cursor -> cursor.type() == typeId;
    }

    public static Predicate nodeMatchProperties( PropertyIndexQuery[] queries, PropertyCursor propertyCursor )
    {
        return cursor ->
        {
            cursor.properties( propertyCursor );
            return propertiesMatch( propertyCursor, queries );
        };
    }

    public static Predicate relationshipMatchProperties( PropertyIndexQuery[] queries, PropertyCursor propertyCursor )
    {
        return cursor ->
        {
            cursor.properties( propertyCursor );
            return propertiesMatch( propertyCursor, queries );
        };
    }
}




© 2015 - 2024 Weber Informatics LLC | Privacy Policy