All Classes

Class	Description
AbstractConditionalTupleLifecycle<Tuple_ extends AbstractTuple>
AbstractFlattenLastNode<InTuple_ extends AbstractTuple,OutTuple_ extends AbstractTuple,EffectiveItem_,FlattenedItem_>
AbstractForEachUniNode<A>	Filtering nodes are expensive.
AbstractGroupNode<InTuple_ extends AbstractTuple,OutTuple_ extends AbstractTuple,GroupKey_,ResultContainer_,Result_>
AbstractIfExistsNode<LeftTuple_ extends AbstractTuple,Right_>	This class has two direct children: AbstractIndexedIfExistsNode and AbstractUnindexedIfExistsNode.
AbstractIfExistsNode.FilteringTracker<LeftTuple_ extends AbstractTuple>
AbstractIndexedIfExistsNode<LeftTuple_ extends AbstractTuple,Right_>	There is a strong likelihood that any change to this class, which is not related to indexing, should also be made to AbstractUnindexedIfExistsNode.
AbstractIndexedJoinNode<LeftTuple_ extends AbstractTuple,Right_,OutTuple_ extends AbstractTuple>	There is a strong likelihood that any change to this class, which is not related to indexing, should also be made to AbstractUnindexedJoinNode.
AbstractJoinNode<LeftTuple_ extends AbstractTuple,Right_,OutTuple_ extends AbstractTuple>	This class has two direct children: AbstractIndexedJoinNode and AbstractUnindexedJoinNode.
AbstractMapNode<InTuple_ extends AbstractTuple,OutTuple_ extends AbstractTuple>
AbstractNode
AbstractScorer<Tuple_ extends AbstractTuple>
AbstractTuple	A tuple is an out tuple in exactly one node and an in tuple in one or more nodes.
AbstractUnindexedIfExistsNode<LeftTuple_ extends AbstractTuple,Right_>	There is a strong likelihood that any change made to this class should also be made to AbstractIndexedIfExistsNode.
AbstractUnindexedJoinNode<LeftTuple_ extends AbstractTuple,Right_,OutTuple_ extends AbstractTuple>	There is a strong likelihood that any change made to this class should also be made to AbstractIndexedJoinNode.
BavetAbstractBiConstraintStream<Solution_,A,B>
BavetAbstractConstraintStream<Solution_>
BavetAbstractQuadConstraintStream<Solution_,A,B,C,D>
BavetAbstractTriConstraintStream<Solution_,A,B,C>
BavetAbstractUniConstraintStream<Solution_,A>
BavetAftBridgeBiConstraintStream<Solution_,A,B>
BavetAftBridgeQuadConstraintStream<Solution_,A,B,C,D>
BavetAftBridgeTriConstraintStream<Solution_,A,B,C>
BavetAftBridgeUniConstraintStream<Solution_,A>
BavetConstraint<Solution_>
BavetConstraintFactory<Solution_>
BavetConstraintSession<Score_ extends Score<Score_>>	The type is public to make it easier for Bavet-specific minimal bug reproducers to be created.
BavetConstraintSessionFactory<Solution_,Score_ extends Score<Score_>>
BavetConstraintStreamScoreDirector<Solution_,Score_ extends Score<Score_>>	FP streams implementation of ScoreDirector, which only recalculates the Score of the part of the working solution that changed, instead of the going through the entire PlanningSolution.
BavetConstraintStreamScoreDirectorFactory<Solution_,Score_ extends Score<Score_>>
BavetConstraintStreamScoreDirectorFactoryService<Solution_,Score_ extends Score<Score_>>
BavetForEachUniConstraintStream<Solution_,A>
BavetForeBridgeBiConstraintStream<Solution_,A,B>
BavetForeBridgeTriConstraintStream<Solution_,A,B,C>
BavetForeBridgeUniConstraintStream<Solution_,A>
BavetIfExistsConstraintStream<Solution_>
BavetJoinBiConstraintStream<Solution_,A,B>
BavetJoinConstraintStream<Solution_>
BavetJoinQuadConstraintStream<Solution_,A,B,C,D>
BavetJoinTriConstraintStream<Solution_,A,B,C>
BavetScoringConstraintStream<Solution_>
BiTuple<A,B>
ExistsCounter<Tuple_ extends AbstractTuple>
ForEachExcludingNullVarsUniNode<A>
ForEachIncludingNullVarsUniNode<A>
GroupNodeConstructor<Tuple_ extends AbstractTuple>
GroupNodeConstructor.NodeConstructorWithAccumulate<Tuple_ extends AbstractTuple>
GroupNodeConstructor.NodeConstructorWithoutAccumulate<Tuple_ extends AbstractTuple>
Indexer<T>	An indexer for entity or fact X, maps a property or a combination of properties of X, denoted by indexProperties, to all instances of X that match those properties, depending on the the indexer type (equal, lower than, ...).
IndexerFactory
IndexProperties	Index properties are cached in tuples and each tuple carries its unique instance.
JoinerUtils
LeftTupleLifecycle<Tuple_ extends AbstractTuple>
NodeBuildHelper<Score_ extends Score<Score_>>
PropagationQueue<T>	A propagation queue is an ordered collection of items that need to be sent to the next node.
Propagator	Propagator is an interface that exposes the PropagationQueue to BavetConstraintSession.
QuadTuple<A,B,C,D>
RightTupleLifecycle<Tuple_ extends AbstractTuple>
StaticPropagationQueue<Tuple_ extends AbstractTuple>	The implementation moves tuples directly into an either retract, update or insert queue, without any option of moving between the queues.
TriTuple<A,B,C>
TupleLifecycle<Tuple_ extends AbstractTuple>
TupleSource
TupleState
UniTuple<A>