Unnamed: 0 int64 0 6.7k | func stringlengths 12 89.6k | target bool 2
classes | project stringlengths 45 151 |
|---|---|---|---|
6,100 | public interface PathFinder<P extends Path>
{
/**
* Tries to find a single path between {@code start} and {@code end}
* nodes. If a path is found a {@link Path} is returned with that path
* information, else {@code null} is returned. If more than one path is
* found, the implementation can decid... | false | community_graph-algo_src_main_java_org_neo4j_graphalgo_PathFinder.java |
6,101 | public interface WeightedPath extends Path
{
/**
* Returns the weight of the path.
*
* @return the weight of the path.
*/
double weight();
} | false | community_graph-algo_src_main_java_org_neo4j_graphalgo_WeightedPath.java |
6,102 | enum Rels implements RelationshipType
{
contains
} | false | community_graph-algo_src_test_java_org_neo4j_graphalgo_impl_ancestor_AncestorTestCase.java |
6,103 | public interface CostDivider<CostType>
{
/**
* @return c / d
*/
CostType divideCost( CostType c, Double d );
/**
* @return d / c
*/
CostType divideByCost( Double d, CostType c );
} | false | community_graph-algo_src_main_java_org_neo4j_graphalgo_impl_centrality_CostDivider.java |
6,104 | public interface EigenvectorCentrality
{
/**
* This can be used to retrieve the result for every node. Might return null
* if the node is not contained in the node set initially given, or doesn't
* receive a result because no relationship points to it.
* @param node
* The node fo... | false | community_graph-algo_src_main_java_org_neo4j_graphalgo_impl_centrality_EigenvectorCentrality.java |
6,105 | private static interface HitDecider
{
boolean isHit( int depth );
boolean canVisitRelationship( Collection<Long> rels, Relationship rel );
} | false | community_graph-algo_src_main_java_org_neo4j_graphalgo_impl_path_ShortestPath.java |
6,106 | public interface DijkstraPriorityQueue<CostType>
{
/**
* Used to insert a new value into the queue.
* @param node
* @param value
*/
public void insertValue( Node node, CostType value );
/**
* Used to update a value in the queue (or insert it).
* @param node
* @param newVa... | false | community_graph-algo_src_main_java_org_neo4j_graphalgo_impl_shortestpath_DijkstraPriorityQueue.java |
6,107 | public interface SingleSourceShortestPath<CostType>
{
/**
* This resets the calculation if we for some reason would like to redo it.
*/
public void reset();
/**
* This sets the start node. The found paths will start in this node.
* @param node
* The start node.
*/
... | false | community_graph-algo_src_main_java_org_neo4j_graphalgo_impl_shortestpath_SingleSourceShortestPath.java |
6,108 | public interface SingleSourceSingleSinkShortestPath<CostType>
{
/**
* This resets the calculation if we for some reason would like to redo it.
*/
public void reset();
/**
* This sets the start node. The found paths will start in this node.
* @param node
* The start node.... | false | community_graph-algo_src_main_java_org_neo4j_graphalgo_impl_shortestpath_SingleSourceSingleSinkShortestPath.java |
6,109 | public interface Converter<T, S>
{
T convert( S source );
} | false | community_graph-algo_src_main_java_org_neo4j_graphalgo_impl_util_PriorityMap.java |
6,110 | public static enum RelationshipTypes implements RelationshipType
{
CONNECTION;
} | false | community_graph-algo_src_test_java_org_neo4j_graphalgo_path_GeoDataGenerator.java |
6,111 | private enum RelTypes implements RelationshipType
{
SomeRelType
} | false | community_graph-algo_src_test_java_org_neo4j_graphalgo_path_PathExplosionIT.java |
6,112 | private interface PathFinderTester
{
void test( PathFinder<Path> finder );
} | false | community_graph-algo_src_test_java_org_neo4j_graphalgo_path_TestShortestPath.java |
6,113 | enum RelTypes implements RelationshipType {
ASD
} | false | community_kernel_src_test_java_org_neo4j_graphdb_CreateAndDeleteNodesIT.java |
6,114 | public interface DependencyResolver
{
/**
* Tries to resolve a dependency that matches a given class. No specific
* {@link SelectionStrategy} is used, so the first encountered matching dependency will be returned.
*
* @param type the type of {@link Class} that the returned instance must impleme... | false | community_kernel_src_main_java_org_neo4j_graphdb_DependencyResolver.java |
6,115 | interface SelectionStrategy
{
/**
* Given a set of candidates, select an appropriate one. Even if there are candidates this
* method may throw {@link IllegalArgumentException} if there was no suitable candidate.
*
* @param type the type of items.
* @param ca... | false | community_kernel_src_main_java_org_neo4j_graphdb_DependencyResolver.java |
6,116 | public enum Direction
{
/**
* Defines outgoing relationships.
*/
OUTGOING,
/**
* Defines incoming relationships.
*/
INCOMING,
/**
* Defines both incoming and outgoing relationships.
*/
BOTH;
/**
* Reverses the direction returning {@link #INCOMING} if this ... | false | community_kernel_src_main_java_org_neo4j_graphdb_Direction.java |
6,117 | public interface Expander extends RelationshipExpander
{
// Expansion<Relationship> expand( Node start );
Expander reversed();
/**
* Add a {@link RelationshipType} to the {@link Expander}.
*
* @param type relationship type
* @return new instance
*/
Expander add( RelationshipTy... | false | community_kernel_src_main_java_org_neo4j_graphdb_Expander.java |
6,118 | public interface GraphDatabaseService
{
/**
* Creates a new node.
*
* @return the created node.
*/
Node createNode();
/**
* Creates a new node and adds the provided labels to it.
*
* @param labels {@link Label labels} to add to the created node.
* @return the created... | false | community_kernel_src_main_java_org_neo4j_graphdb_GraphDatabaseService.java |
6,119 | public interface Label
{
/**
* Returns the name of the label. The name uniquely identifies a
* label, i.e. two different Label instances with different object identifiers
* (and possibly even different classes) are semantically equivalent if they
* have {@link String#equals(Object) equal} names.... | false | community_kernel_src_main_java_org_neo4j_graphdb_Label.java |
6,120 | private static enum Labels implements Label
{
First,
Second,
Third
} | false | community_kernel_src_test_java_org_neo4j_graphdb_LabelScanStoreIT.java |
6,121 | private enum Labels implements Label
{
MY_LABEL,
MY_OTHER_LABEL
} | false | community_kernel_src_test_java_org_neo4j_graphdb_LabelsAcceptanceTest.java |
6,122 | public interface Lock
{
/**
* Releases this lock before the transaction finishes. It is an optional
* operation and if not called, this lock will be released when the owning
* transaction finishes.
*
* @throws IllegalStateException if this lock has already been released.
*/
void r... | false | community_kernel_src_main_java_org_neo4j_graphdb_Lock.java |
6,123 | private static enum Labels implements Label
{
First,
Second,
Third;
} | false | community_lucene-index_src_test_java_org_neo4j_graphdb_LuceneLabelScanStoreChaosIT.java |
6,124 | public interface Node extends PropertyContainer
{
/**
* Returns the unique id of this node. Ids are garbage collected over time
* so they are only guaranteed to be unique during a specific time span: if
* the node is deleted, it's likely that a new node at some point will get
* the old id. <b>No... | false | community_kernel_src_main_java_org_neo4j_graphdb_Node.java |
6,125 | public interface Path extends Iterable<PropertyContainer>
{
/**
* Returns the start node of this path. It's also the first node returned
* from the {@link #nodes()} iterable.
* @return the start node.
*/
Node startNode();
/**
* Returns the end node of this path. It's also the last ... | false | community_kernel_src_main_java_org_neo4j_graphdb_Path.java |
6,126 | public interface PathExpander<STATE>
{
/**
* Returns relationships for a {@link Path}, most commonly from the
* {@link Path#endNode()}.
*
* @param path the path to expand (most commonly the end node).
* @param state the state of this branch in the current traversal.
* {@link BranchStat... | false | community_kernel_src_main_java_org_neo4j_graphdb_PathExpander.java |
6,127 | public interface PropertyContainer
{
/**
* Get the {@link GraphDatabaseService} that this {@link Node} or
* {@link Relationship} belongs to.
*
* @return The GraphDatabase this Node or Relationship belongs to.
*/
GraphDatabaseService getGraphDatabase();
/**
* Returns <code... | false | community_kernel_src_main_java_org_neo4j_graphdb_PropertyContainer.java |
6,128 | public interface Relationship extends PropertyContainer
{
/**
* Returns the unique id of this relationship. Ids are garbage collected
* over time so they are only guaranteed to be unique during a specific time
* span: if the relationship is deleted, it's likely that a new relationship
* at some ... | false | community_kernel_src_main_java_org_neo4j_graphdb_Relationship.java |
6,129 | public interface RelationshipExpander
{
/**
* Returns relationships for a {@link Node}.
*
* @param node the node to expand.
* @return the relationships to return for the {@code node}.
*/
Iterable<Relationship> expand( Node node );
/**
* Returns a new instance with the exact ex... | false | community_kernel_src_main_java_org_neo4j_graphdb_RelationshipExpander.java |
6,130 | public interface RelationshipType
{
/**
* Returns the name of the relationship type. The name uniquely identifies a
* relationship type, i.e. two different RelationshipType instances with
* different object identifiers (and possibly even different classes) are
* semantically equivalent if they h... | false | community_kernel_src_main_java_org_neo4j_graphdb_RelationshipType.java |
6,131 | public interface Resource extends AutoCloseable
{
@Override
public void close();
/**
* Empty resource that doesn't {@link #close() close} anything.
*/
public static final Resource EMPTY = new Resource()
{
@Override
public void close()
{ // Nothing to close
... | false | community_kernel_src_main_java_org_neo4j_graphdb_Resource.java |
6,132 | public interface ResourceIterable<T> extends Iterable<T>
{
/**
* Returns an {@link ResourceIterator iterator} with associated resources that may be managed.
*/
@Override
ResourceIterator<T> iterator();
} | false | community_kernel_src_main_java_org_neo4j_graphdb_ResourceIterable.java |
6,133 | public interface ResourceIterator<T> extends Iterator<T>, Resource
{
/**
* Close the iterator early, freeing associated resources
*
* It is an error to use the iterator after this has been called.
*/
@Override
void close();
} | false | community_kernel_src_main_java_org_neo4j_graphdb_ResourceIterator.java |
6,134 | public interface ReturnableEvaluator
{
/**
* A returnable evaluator that returns all nodes encountered.
*/
ReturnableEvaluator ALL = new ReturnableEvaluator()
{
public boolean isReturnableNode( final TraversalPosition currentPosition )
{
return true;
}
};
... | false | community_kernel_src_main_java_org_neo4j_graphdb_ReturnableEvaluator.java |
6,135 | private enum Labels implements Label
{
MY_LABEL,
MY_OTHER_LABEL
} | false | community_kernel_src_test_java_org_neo4j_graphdb_SchemaAcceptanceTest.java |
6,136 | public interface StopEvaluator
{
/**
* Traverse until the end of the graph. This evaluator returns
* <code>false</code> all the time.
*/
StopEvaluator END_OF_GRAPH = new StopEvaluator()
{
public boolean isStopNode( final TraversalPosition currentPosition )
{
return... | false | community_kernel_src_main_java_org_neo4j_graphdb_StopEvaluator.java |
6,137 | public interface Transaction extends AutoCloseable
{
/**
* Marks this transaction as failed, which means that it will
* unconditionally be rolled back when {@link #close()} is called. Once
* this method has been invoked, it doesn't matter if
* {@link #success()} is invoked afterwards -- the tran... | false | community_kernel_src_main_java_org_neo4j_graphdb_Transaction.java |
6,138 | public interface TraversalPosition
{
/**
* Returns the current node.
*
* @return The current node
*/
Node currentNode();
/**
* Returns the previous node.
*
* If this TraversalPosition represents the start node <code>null</code> is
* returned.
*
* @return T... | false | community_kernel_src_main_java_org_neo4j_graphdb_TraversalPosition.java |
6,139 | public interface Traverser extends Iterable<Node>
{
/**
* Defines a traversal order as used by the traversal framework.
* <p>
* Nodes can be traversed either {@link #BREADTH_FIRST breadth first} or
* {@link #DEPTH_FIRST depth first}. A depth first traversal is often more
* likely to find on... | false | community_kernel_src_main_java_org_neo4j_graphdb_Traverser.java |
6,140 | static enum Order
{
/**
* Sets a depth first traversal meaning the traverser will go as deep as
* possible (increasing depth for each traversal) before traversing next
* relationship on same depth.
*/
DEPTH_FIRST,
/**
* Sets a breadth first t... | false | community_kernel_src_main_java_org_neo4j_graphdb_Traverser.java |
6,141 | public interface Setting<T>
extends Function<Function<String, String>, T>
{
/**
* Get the name of the setting. This typically corresponds to a key in a properties file, or similar.
*
* @return the name
*/
String name();
/**
* Get the default value of this setting, as a stri... | false | community_kernel_src_main_java_org_neo4j_graphdb_config_Setting.java |
6,142 | public enum ErrorState
{
/**
* The Graph Database failed since the storage media where the graph
* database data is stored is full and cannot be written to.
*/
STORAGE_MEDIA_FULL,
/**
* Not more transactions can be started or committed during this session
* and the database nee... | false | community_kernel_src_main_java_org_neo4j_graphdb_event_ErrorState.java |
6,143 | public interface KernelEventHandler
{
/**
* This method is invoked during the shutdown process of a Neo4j Graph
* Database. It is invoked while the {@link GraphDatabaseService} is still
* in an operating state, after the processing of this event has terminated
* the Neo4j Graph Database will ter... | false | community_kernel_src_main_java_org_neo4j_graphdb_event_KernelEventHandler.java |
6,144 | enum ExecutionOrder
{
/**
* Says that the event handler must be executed before the compared
* event handler.
*/
BEFORE,
/**
* Says that the event handler must be executed after the compared
* event handler.
*/
AFTER,
... | false | community_kernel_src_main_java_org_neo4j_graphdb_event_KernelEventHandler.java |
6,145 | public interface PropertyEntry<T extends PropertyContainer>
{
/**
* Get the entity that this property was modified on. The entity is either a
* {@link Node} or a {@link Relationship}, depending on the generic type of
* this instance.
*
* @return the {@link Node} or {@link Relationship} that... | false | community_kernel_src_main_java_org_neo4j_graphdb_event_PropertyEntry.java |
6,146 | public interface TransactionData
{
/**
* Get the nodes that were created during the transaction.
*
* @return all nodes that were created during the transaction.
*/
Iterable<Node> createdNodes();
/**
* Get the nodes that were deleted during the transaction.
*
* @return all... | false | community_kernel_src_main_java_org_neo4j_graphdb_event_TransactionData.java |
6,147 | public interface TransactionEventHandler<T>
{
/**
* Invoked when a transaction is about to be committed.
*
* If this method throws an exception the transaction will be rolled back
* and a {@link TransactionFailureException} will be thrown from
* {@link Transaction#close()}.
*
* Th... | false | community_kernel_src_main_java_org_neo4j_graphdb_event_TransactionEventHandler.java |
6,148 | @Retention( RetentionPolicy.RUNTIME )
@Target( {ElementType.TYPE, ElementType.FIELD} )
public @interface Description
{
String value();
} | false | community_kernel_src_main_java_org_neo4j_graphdb_factory_Description.java |
6,149 | public interface DatabaseCreator
{
GraphDatabaseService newDatabase( Map<String, String> config );
} | false | community_kernel_src_main_java_org_neo4j_graphdb_factory_GraphDatabaseBuilder.java |
6,150 | public interface AutoIndexer<T extends PropertyContainer>
{
/**
* Sets the AutoIndexer as enabled or not. Enabled means that appropriately
* configured properties are auto indexed and hits can be returned, disabled
* means that no index additions happen but the index can be queried.
*
* @pa... | false | community_kernel_src_main_java_org_neo4j_graphdb_index_AutoIndexer.java |
6,151 | public interface Index<T extends PropertyContainer> extends ReadableIndex<T>
{
/**
* Adds a key/value pair for {@code entity} to the index. If that key/value
* pair for the entity is already in the index it's up to the
* implementation to make it so that such an operation is idempotent.
*
*... | false | community_kernel_src_main_java_org_neo4j_graphdb_index_Index.java |
6,152 | public interface IndexHits<T> extends ResourceIterator<T>, ResourceIterable<T>
{
/**
* Returns the size of this iterable, in most scenarios this value is accurate
* while in some scenarios near-accurate.
*
* There's no cost in calling this method. It's considered near-accurate if this
* {@... | false | community_kernel_src_main_java_org_neo4j_graphdb_index_IndexHits.java |
6,153 | public interface IndexImplementation
{
/**
* Returns the name of the XA data source coupled with this index provider.
* @return the name of the XA data source coupled with this index provider.
*/
String getDataSourceName();
/**
* Returns an {@link Index} for {@link Node}s for the name
... | false | community_kernel_src_main_java_org_neo4j_graphdb_index_IndexImplementation.java |
6,154 | public interface IndexManager
{
/**
* The configuration key to use for specifying which provider an index
* will have, i.e. which implementation will be used to back that index.
*/
String PROVIDER = "provider";
/**
* Returns whether or not there exists a node index with the name
* ... | false | community_kernel_src_main_java_org_neo4j_graphdb_index_IndexManager.java |
6,155 | public interface IndexProviders
{
void registerIndexProvider( String name, IndexImplementation indexImplementation );
boolean unregisterIndexProvider( String name );
} | false | community_kernel_src_main_java_org_neo4j_graphdb_index_IndexProviders.java |
6,156 | public interface ReadableIndex<T extends PropertyContainer>
{
/**
* @return the name of the index, i.e. the name this index was
* created with.
*/
String getName();
/**
* @return the type of entities are managed by this index.
*/
Class<T> getEntityType();
/**
* Return... | false | community_kernel_src_main_java_org_neo4j_graphdb_index_ReadableIndex.java |
6,157 | public interface ReadableRelationshipIndex extends ReadableIndex<Relationship>
{
/**
* Returns exact matches from this index, given the key/value pair. Matches
* will be for key/value pairs just as they were added by the
* {@link Index#add(org.neo4j.graphdb.PropertyContainer, String, Object)} method.... | false | community_kernel_src_main_java_org_neo4j_graphdb_index_ReadableRelationshipIndex.java |
6,158 | public interface RelationshipAutoIndexer extends AutoIndexer<Relationship>
{
ReadableRelationshipIndex getAutoIndex();
} | false | community_kernel_src_main_java_org_neo4j_graphdb_index_RelationshipAutoIndexer.java |
6,159 | public interface RelationshipIndex extends ReadableRelationshipIndex,
Index<Relationship>
{
} | false | community_kernel_src_main_java_org_neo4j_graphdb_index_RelationshipIndex.java |
6,160 | public interface FileSystemGuard
{
public enum OperationType
{
WRITE, READ;
}
/**
* Called back on file channel operations. Expect this to change as it is used more.
* @param operationType The type of operation performed.
* @param onFile The filename on which the operation happen... | false | community_kernel_src_test_java_org_neo4j_graphdb_mockfs_FileSystemGuard.java |
6,161 | public enum OperationType
{
WRITE, READ;
} | false | community_kernel_src_test_java_org_neo4j_graphdb_mockfs_FileSystemGuard.java |
6,162 | public interface ConstraintCreator
{
/**
* Imposes a uniqueness constraint for the given property, such that
* there can be at most one node, having the given label, for any set value of that property key.
*
* @return a {@link ConstraintCreator} instance to be used for further interaction.
... | false | community_kernel_src_main_java_org_neo4j_graphdb_schema_ConstraintCreator.java |
6,163 | public interface ConstraintDefinition
{
/**
* @return the {@link Label} this constraint is associated with.
*/
Label getLabel();
/**
* @return the property keys this constraint is about.
*/
Iterable<String> getPropertyKeys();
/**
* Drops this constraint.
*/
vo... | false | community_kernel_src_main_java_org_neo4j_graphdb_schema_ConstraintDefinition.java |
6,164 | public enum ConstraintType
{
UNIQUENESS,
;
} | false | community_kernel_src_main_java_org_neo4j_graphdb_schema_ConstraintType.java |
6,165 | public interface IndexCreator
{
/**
* Includes the given {@code propertyKey} in this index, such that {@link Node nodes} with
* the assigned {@link Label label} and this property key will have its values indexed.
*
* NOTE: currently only a single property key per index is supported.
*
... | false | community_kernel_src_main_java_org_neo4j_graphdb_schema_IndexCreator.java |
6,166 | public interface IndexDefinition
{
/**
* @return the {@link Label label} this index definition is associated with.
*/
Label getLabel();
/**
* @return the property keys this index was created on.
*/
Iterable<String> getPropertyKeys();
/**
* Drops this index. {@link ... | false | community_kernel_src_main_java_org_neo4j_graphdb_schema_IndexDefinition.java |
6,167 | public interface Schema
{
/**
* The states that an index can be in. This mostly relates to tracking the background
* population of an index, to tell when it is done populating and is online serving
* requests.
*/
public static enum IndexState
{
ONLINE,
POPULATING,
... | false | community_kernel_src_main_java_org_neo4j_graphdb_schema_Schema.java |
6,168 | public static enum IndexState
{
ONLINE,
POPULATING,
FAILED
} | false | community_kernel_src_main_java_org_neo4j_graphdb_schema_Schema.java |
6,169 | public interface BidirectionalTraversalDescription
{
/**
* Sets the start side {@link TraversalDescription} of this bidirectional
* traversal. The point of a bidirectional traversal is that the start
* and end side will meet (or collide) in the middle somewhere and
* generate paths evaluated and... | false | community_kernel_src_main_java_org_neo4j_graphdb_traversal_BidirectionalTraversalDescription.java |
6,170 | public interface BidirectionalUniquenessFilter extends UniquenessFilter {
/**
* Checks {@link Path} alone to see if it follows the uniqueness contract
* provided by this {@link UniquenessFilter}.
*
* @param path the {@link Path} to examine.
* @return {@code true} if the {@code path} fulfill... | false | community_kernel_src_main_java_org_neo4j_graphdb_traversal_BidirectionalUniquenessFilter.java |
6,171 | public interface BranchCollisionDetector
{
/**
* Evaluate the given {@code branch} coming from either the start side or the
* end side. Which side the branch represents is controlled by the {@code direction}
* argument, {@link Direction#OUTGOING} means the start side and {@link Direction#INCOMING}
... | false | community_kernel_src_main_java_org_neo4j_graphdb_traversal_BranchCollisionDetector.java |
6,172 | public enum BranchCollisionPolicies implements BranchCollisionPolicy
{
STANDARD
{
@Override
public BranchCollisionDetector create( Evaluator evaluator )
{
return new StandardBranchCollisionDetector( evaluator );
}
},
SHORTEST_PATH
{
@Override
... | false | community_kernel_src_main_java_org_neo4j_graphdb_traversal_BranchCollisionPolicies.java |
6,173 | public interface BranchCollisionPolicy
{
BranchCollisionDetector create( Evaluator evaluator );
} | false | community_kernel_src_main_java_org_neo4j_graphdb_traversal_BranchCollisionPolicy.java |
6,174 | public enum BranchOrderingPolicies implements BranchOrderingPolicy
{
PREORDER_DEPTH_FIRST
{
public BranchSelector create( TraversalBranch startSource, PathExpander expander )
{
return new PreorderDepthFirstSelector( startSource, expander );
}
},
POSTORDER_DEPTH_FIRST
... | false | community_kernel_src_main_java_org_neo4j_graphdb_traversal_BranchOrderingPolicies.java |
6,175 | public interface BranchOrderingPolicy
{
/**
* Instantiates a {@link BranchSelector} with {@code startBranch} as the
* first branch to base a decision on "where to go next".
*
* @param startBranch the {@link TraversalBranch} to start from.
* @param expander {@link PathExpander} to use for ex... | false | community_kernel_src_main_java_org_neo4j_graphdb_traversal_BranchOrderingPolicy.java |
6,176 | public interface BranchSelector
{
/**
* Decides the next position ("where to go from here") from the current
* position, based on the {@code rules}. Since {@link TraversalBranch}
* has the {@link TraversalBranch#endNode()} of the position and the
* {@link TraversalBranch#lastRelationship()} to h... | false | community_kernel_src_main_java_org_neo4j_graphdb_traversal_BranchSelector.java |
6,177 | public interface BranchState<STATE>
{
/**
* @return the associated state for a {@link TraversalBranch}.
*/
STATE getState();
/**
* Sets the {@link TraversalBranch} state for upcoming children of that
* branch.
* @param state the {@link TraversalBranch} state to set for upcoming... | false | community_kernel_src_main_java_org_neo4j_graphdb_traversal_BranchState.java |
6,178 | public enum Evaluation
{
INCLUDE_AND_CONTINUE( true, true ),
INCLUDE_AND_PRUNE( true, false ),
EXCLUDE_AND_CONTINUE( false, true ),
EXCLUDE_AND_PRUNE( false, false );
private final boolean includes;
private final boolean continues;
private Evaluation( boolean includes, boolean continue... | false | community_kernel_src_main_java_org_neo4j_graphdb_traversal_Evaluation.java |
6,179 | public interface Evaluator
{
/**
* Evaluates a {@link Path} and returns an {@link Evaluation} containing
* information about whether or not to include it in the traversal result,
* i.e return it from the {@link Traverser}. And also whether or not to
* continue traversing down that {@code path} o... | false | community_kernel_src_main_java_org_neo4j_graphdb_traversal_Evaluator.java |
6,180 | public interface InitialBranchState<STATE> extends InitialStateFactory<STATE>
{
@SuppressWarnings( "rawtypes" )
InitialBranchState NO_STATE = new InitialBranchState()
{
@Override
public Object initialState( Path path )
{
return null;
}
public Init... | false | community_kernel_src_main_java_org_neo4j_graphdb_traversal_InitialBranchState.java |
6,181 | public interface InitialStateFactory<STATE>
{
/**
* An {@link InitialStateFactory} which returns {@code null} as state.
*/
@SuppressWarnings( "rawtypes" )
InitialStateFactory NO_STATE = new InitialStateFactory()
{
@Override
public Object initialState( Path path )
{
... | false | community_kernel_src_main_java_org_neo4j_graphdb_traversal_InitialStateFactory.java |
6,182 | public interface PathEvaluator<STATE> extends Evaluator
{
/**
* Evaluates a {@link Path} and returns an {@link Evaluation} containing
* information about whether or not to include it in the traversal result,
* i.e return it from the {@link Traverser}. And also whether or not to
* continue traver... | false | community_kernel_src_main_java_org_neo4j_graphdb_traversal_PathEvaluator.java |
6,183 | enum PrimitiveTypeFetcher
{
NODE
{
@Override
long getId( Path source )
{
return source.endNode().getId();
}
@Override
boolean idEquals( Path source, long idToCompare )
{
return getId( source ) == idToCompare;
}
... | false | community_kernel_src_main_java_org_neo4j_graphdb_traversal_PrimitiveTypeFetcher.java |
6,184 | public interface PruneEvaluator
{
/**
* Default {@link PruneEvaluator}, does not prune any parts of the
* traversal.
*/
PruneEvaluator NONE = new PruneEvaluator()
{
public boolean pruneAfter( Path position )
{
return false;
}
};
/**
* Decides ... | false | community_kernel_src_main_java_org_neo4j_graphdb_traversal_PruneEvaluator.java |
6,185 | public interface SideSelector extends BranchSelector
{
/**
* @return the side to traverse next on, {@link Direction#OUTGOING} for start side
* and {@link Direction#INCOMING} for end side.
*/
Direction currentSide();
} | false | community_kernel_src_main_java_org_neo4j_graphdb_traversal_SideSelector.java |
6,186 | public enum SideSelectorPolicies implements SideSelectorPolicy
{
LEVEL
{
@Override
public SideSelector create( BranchSelector start, BranchSelector end, int maxDepth )
{
return new LevelSelectorOrderer( start, end, false, maxDepth );
}
},
LEVEL_STOP_DESCENT_ON... | false | community_kernel_src_main_java_org_neo4j_graphdb_traversal_SideSelectorPolicies.java |
6,187 | public interface SideSelectorPolicy
{
/**
* Creates a new {@link SideSelector} given the {@code start}/{@code end}
* {@link BranchSelector}s and an optional {@code maxDepth}.
*
* @param start the start side {@link BranchSelector} of this
* bidirectional traversal.
* @param end the end... | false | community_kernel_src_main_java_org_neo4j_graphdb_traversal_SideSelectorPolicy.java |
6,188 | public interface TraversalBranch extends Path
{
/**
* The parent expansion source which created this {@link TraversalBranch}.
* @return the parent of this expansion source.
*/
TraversalBranch parent();
/**
* Returns the next expansion source from the expanded relationships
* from t... | false | community_kernel_src_main_java_org_neo4j_graphdb_traversal_TraversalBranch.java |
6,189 | public interface TraversalContext extends TraversalMetadata
{
/**
* Reports that one more relationship has been traversed in this
* traversal.
*/
void relationshipTraversed();
/**
* Reports that one more relationship has been traversed, albeit
* a relationship that hasn't provi... | false | community_kernel_src_main_java_org_neo4j_graphdb_traversal_TraversalContext.java |
6,190 | public interface TraversalDescription
{
/**
* Sets the {@link UniquenessFactory} for creating the
* {@link UniquenessFilter} to use.
*
* @param uniqueness the {@link UniquenessFactory} the creator
* of the desired {@link UniquenessFilter} to use.
* @return a new traversal description w... | false | community_kernel_src_main_java_org_neo4j_graphdb_traversal_TraversalDescription.java |
6,191 | public interface TraversalMetadata
{
/**
* @return number of paths returned up to this point in the traversal.
*/
int getNumberOfPathsReturned();
/**
* @return number of relationships traversed up to this point in the traversal.
* Some relationships in this counter might be unnecess... | false | community_kernel_src_main_java_org_neo4j_graphdb_traversal_TraversalMetadata.java |
6,192 | public interface Traverser extends ResourceIterable<Path>
{
/**
* Represents the traversal in the form of {@link Node}s. This is a
* convenient way to iterate over {@link Path}s and get the
* {@link Path#endNode()} for each position.
*
* @return the traversal in the form of {@link Node} obj... | false | community_kernel_src_main_java_org_neo4j_graphdb_traversal_Traverser.java |
6,193 | public enum Uniqueness implements UniquenessFactory
{
/**
* A node cannot be traversed more than once. This is what the legacy
* traversal framework does.
*/
NODE_GLOBAL
{
public UniquenessFilter create( Object optionalParameter )
{
... | false | community_kernel_src_main_java_org_neo4j_graphdb_traversal_Uniqueness.java |
6,194 | public interface UniquenessFactory
{
/**
* Creates a new {@link UniquenessFilter} optionally with a parameter
* to it, otherwise null if no parameter should be handed to it.
*
* @param optionalParameter an optional parameter to control the behavior
* of the returned {@link UniquenessFilter... | false | community_kernel_src_main_java_org_neo4j_graphdb_traversal_UniquenessFactory.java |
6,195 | public interface UniquenessFilter
{
/**
* The check whether or not to expand the first branch is a separate
* method because it may contain checks which would be unnecessary for
* all other checks. So it's purely an optimization.
*
* @param branch the first branch to check, i.e. the branch ... | false | community_kernel_src_main_java_org_neo4j_graphdb_traversal_UniquenessFilter.java |
6,196 | @Deprecated
public interface ValueMatcher
{
/**
* Tries to match {@code value} to see if it matches an expected value.
* {@code value} is {@code null} if the property wasn't found on the
* {@link Node} or {@link Relationship} it came from.
*
* The value can be of type array, where {@link A... | false | community_graph-matching_src_main_java_org_neo4j_graphmatching_ValueMatcher.java |
6,197 | @Deprecated
public interface FilterExpression
{
/**
* Matches a value from a {@code valueGetter} and returns whether or not
* there was a match.
* @param valueGetter the getter which fetches the value to match.
* @return whether or not the value from {@code valueGetter} matches
* the criter... | false | community_graph-matching_src_main_java_org_neo4j_graphmatching_filter_FilterExpression.java |
6,198 | @Deprecated
public interface FilterValueGetter
{
/**
* Returns an array of values.
* @param label the {@link PatternNode} label.
* @return an array of values.
*/
Object[] getValues( String label );
} | false | community_graph-matching_src_main_java_org_neo4j_graphmatching_filter_FilterValueGetter.java |
6,199 | interface ClusterAction
{
public Iterable<ClusterAction> perform( ClusterState state ) throws Exception;
} | false | enterprise_ha_src_test_java_org_neo4j_ha_correctness_ClusterAction.java |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.