Uses of Interface
org.drools.core.util.Entry

Packages that use Entry

org.drools.core.beliefsystem.defeasible
org.drools.core.beliefsystem.simple
org.drools.core.common
org.drools.core.phreak
org.drools.core.reteoo
org.drools.core.util
org.drools.core.util.index

Uses of Entry in org.drools.core.beliefsystem.defeasible

Classes in org.drools.core.beliefsystem.defeasible that implement Entry

class

DefeasibleLogicalDependency

Uses of Entry in org.drools.core.beliefsystem.simple

Classes in org.drools.core.beliefsystem.simple that implement Entry

class

SimpleLogicalDependency LogicalDependency is a special node for LinkedLists that maintains references for the Activation justifier and the justified FactHandle.

Uses of Entry in org.drools.core.common

Subinterfaces of Entry in org.drools.core.common

interface	LogicalDependency
interface	Memory A super interface for node memories

Classes in org.drools.core.common that implement Entry

class	ActivationGroupNode
class	ActivationNode
class	DefaultFactHandle Implementation of FactHandle.
class	EventFactHandle
class	ScheduledAgendaItem

Uses of Entry in org.drools.core.phreak

Classes in org.drools.core.phreak that implement Entry

class	RuleAgendaItem
class	StackEntry Created with IntelliJ IDEA.

Uses of Entry in org.drools.core.reteoo

Subinterfaces of Entry in org.drools.core.reteoo

interface

LeftTuple

Classes in org.drools.core.reteoo that implement Entry

static class	AccumulateNode.AccumulateMemory
static class	AlphaNode.AlphaMemory
class	BaseLeftTuple A parent class for all specific LeftTuple specializations
class	BetaMemory
static class	CompositeObjectSinkAdapter.FieldIndex
static class	ConditionalBranchNode.ConditionalBranchMemory
static class	EvalConditionNode.EvalMemory
class	EvalNodeLeftTuple
static class	FromNode.FromMemory
class	FromNodeLeftTuple
class	JoinNodeLeftTuple
static class	LeftInputAdapterNode.LiaNodeMemory
class	LeftTupleImpl
class	NotNodeLeftTuple
static class	ObjectTypeNode.ObjectTypeNodeMemory
class	PathMemory
static class	PropagationQueuingNode.PropagationQueueingNodeMemory Memory implementation for the node
static class	QueryElementNode.QueryElementNodeMemory
class	QueryElementNodeLeftTuple
class	QueryRiaFixerNodeLeftTuple
class	RiaPathMemory
static class	RightInputAdapterNode.RiaNodeMemory
class	RightTuple
class	RuleTerminalNodeLeftTuple
class	SegmentMemory
static class	TimerNode.TimerNodeMemory
static class	WindowNode.WindowMemory
class	WindowTuple A specialisation of RightTuples that also belong to a window

Fields in org.drools.core.reteoo declared as Entry

protected Entry	BaseLeftTuple.next
protected Entry	BaseLeftTuple.previous

Methods in org.drools.core.reteoo that return Entry

Entry	JoinNodeLeftTuple.getNext()
Entry	NotNodeLeftTuple.getNext()
Entry	FromNodeLeftTuple.getNext()
Entry	RightTuple.getNext()
Entry	BaseLeftTuple.getNext()
Entry	JoinNodeLeftTuple.getPrevious()
Entry	LeftTuple.getPrevious()
Entry	NotNodeLeftTuple.getPrevious()
Entry	FromNodeLeftTuple.getPrevious()
Entry	RightTuple.getPrevious()
Entry	BaseLeftTuple.getPrevious()
Entry[]	RightTupleMemory.toArray()
Entry[]	LeftTupleMemory.toArray()

Methods in org.drools.core.reteoo with parameters of type Entry

void	JoinNodeLeftTuple.setNext(Entry next)
void	NotNodeLeftTuple.setNext(Entry next)
void	FromNodeLeftTuple.setNext(Entry next)
void	RightTuple.setNext(Entry next)
void	BaseLeftTuple.setNext(Entry next)
void	JoinNodeLeftTuple.setPrevious(Entry previous)
void	LeftTuple.setPrevious(Entry previous)
void	NotNodeLeftTuple.setPrevious(Entry previous)
void	FromNodeLeftTuple.setPrevious(Entry previous)
void	RightTuple.setPrevious(Entry previous)
void	BaseLeftTuple.setPrevious(Entry previous)

Uses of Entry in org.drools.core.util

Classes in org.drools.core.util with type parameters of type Entry

interface

Entry<T extends Entry<T>>

Subinterfaces of Entry in org.drools.core.util

interface	LinkedListNode<T extends LinkedListNode<T>> Items placed in a LinkedList must implement this interface .
interface	Triple

Classes in org.drools.core.util that implement Entry

class	AbstractBaseLinkedListNode<T extends LinkedListNode<T>> Provides a abstract base implementation that an object can extend so that it can be used in a LinkedList.
static class	LeftTupleRBTree.Node<K extends Comparable<? super K>>
class	LinkedListEntry<T> The idea behind LinkedListNodeWrapper is to be able to add the same LinkedListNode to multiple LinkedLists where the node can have different previous and next nodes in each list.
static class	ObjectHashMap.ObjectEntry
static class	ObjectHashSet.ObjectEntry
static class	RBTree.Node<K extends Comparable<? super K>,V>
static class	RightTupleRBTree.Node<K extends Comparable<? super K>>
class	TripleImpl

Fields in org.drools.core.util declared as Entry

protected Entry[]

AbstractHashTable.table

Methods in org.drools.core.util that return Entry

protected Entry	AbstractHashTable.getBucket(int hashCode)
Entry	ObjectHashMap.getBucket(Object object)
abstract Entry	AbstractHashTable.getBucket(Object object)
Entry	TripleStore.getBucket(Object object)
Entry	ObjectHashSet.getBucket(Object object)
Entry	ObjectHashMap.ObjectEntry.getNext()
Entry	RightTupleRBTree.Node.getNext()
Entry	LeftTupleRBTree.Node.getNext()
Entry	RBTree.Node.getNext()
Entry	ObjectHashSet.ObjectEntry.getNext()
Entry	TripleImpl.getNext()
Entry[]	AbstractHashTable.getTable()
Entry	LinkedList.LinkedListFastIterator.next(Entry object)
Entry	RightTupleRBTree.RangeFastIterator.next(Entry object)
Entry	LeftTupleRBTree.RangeFastIterator.next(Entry object)
Entry	FastIterator.next(Entry object)
Entry	RBTree.RBTreeFastIterator.next(Entry object)
Entry[]	AbstractHashTable.toArray()

Methods in org.drools.core.util with parameters of type Entry

int	ObjectHashMap.getResizeHashcode(Entry entry)
abstract int	AbstractHashTable.getResizeHashcode(Entry entry)
int	TripleStore.getResizeHashcode(Entry entry)
int	ObjectHashSet.getResizeHashcode(Entry entry)
Entry	LinkedList.LinkedListFastIterator.next(Entry object)
Entry	RightTupleRBTree.RangeFastIterator.next(Entry object)
Entry	LeftTupleRBTree.RangeFastIterator.next(Entry object)
Entry	FastIterator.next(Entry object)
Entry	RBTree.RBTreeFastIterator.next(Entry object)
void	ObjectHashMap.ObjectEntry.setNext(Entry next)
void	RightTupleRBTree.Node.setNext(Entry next)
void	LeftTupleRBTree.Node.setNext(Entry next)
void	RBTree.Node.setNext(Entry next)
void	ObjectHashSet.ObjectEntry.setNext(Entry next)
void	TripleImpl.setNext(Entry next)

Constructors in org.drools.core.util with parameters of type Entry

AbstractHashTable(Entry[] table)

AbstractHashTable(float loadFactor, Entry[] table)

FastIterator.IteratorAdapter(FastIterator fastIterator, Entry first)

ObjectHashMap(Entry[] table)

ObjectHashMap(float loadFactor, Entry[] table)

ObjectHashSet(Entry[] table)

ObjectHashSet(float loadFactor, Entry[] table)

TripleStore(Entry[] table)

TripleStore(float loadFactor, Entry[] table)

Uses of Entry in org.drools.core.util.index

Classes in org.drools.core.util.index that implement Entry

class	LeftTupleList
class	RightTupleList

Fields in org.drools.core.util.index declared as Entry

Entry	RightTupleList.next
Entry	LeftTupleList.next
Entry	RightTupleList.previous

Methods in org.drools.core.util.index that return Entry

Entry	RightTupleIndexHashTable.getBucket(Object object)
Entry	LeftTupleIndexHashTable.getBucket(Object object)
Entry	RightTupleList.getNext()
Entry	LeftTupleList.getNext()
Entry	LeftTupleIndexRangeRBTree.LeftTupleFastIterator.next(Entry object)
Entry	RightTupleIndexHashTable.FullFastIterator.next(Entry object)
Entry	RightTupleIndexRangeRBTree.RightTupleBoundedFastIterator.next(Entry object)
Entry	LeftTupleIndexHashTable.FullFastIterator.next(Entry object)
Entry	RightTupleIndexRBTree.RightTupleFastIterator.next(Entry object)
Entry	LeftTupleIndexRBTree.LeftTupleFastIterator.next(Entry object)
Entry[]	LeftTupleIndexRangeRBTree.toArray()
Entry[]	RightTupleIndexHashTable.toArray()
Entry[]	RightTupleIndexRangeRBTree.toArray()
Entry[]	RightTupleIndexRBTree.toArray()
Entry[]	LeftTupleIndexRBTree.toArray()

Methods in org.drools.core.util.index with parameters of type Entry

int	RightTupleIndexHashTable.getResizeHashcode(Entry entry)
int	LeftTupleIndexHashTable.getResizeHashcode(Entry entry)
void	RightTupleIndexHashTable.init(Entry[] table, int size, int factSize)
void	LeftTupleIndexHashTable.init(Entry[] table, int size, int factSize)
Entry	LeftTupleIndexRangeRBTree.LeftTupleFastIterator.next(Entry object)
Entry	RightTupleIndexHashTable.FullFastIterator.next(Entry object)
Entry	RightTupleIndexRangeRBTree.RightTupleBoundedFastIterator.next(Entry object)
Entry	LeftTupleIndexHashTable.FullFastIterator.next(Entry object)
Entry	RightTupleIndexRBTree.RightTupleFastIterator.next(Entry object)
Entry	LeftTupleIndexRBTree.LeftTupleFastIterator.next(Entry object)
void	RightTupleIndexHashTable.FullFastIterator.reset(Entry[] table)
void	LeftTupleIndexHashTable.FullFastIterator.reset(Entry[] table)
void	RightTupleIndexHashTable.FullFastIterator.resume(Entry target, Entry[] table)
void	RightTupleIndexHashTable.FullFastIterator.resume(Entry target, Entry[] table)
void	LeftTupleIndexHashTable.FullFastIterator.resume(Entry target, Entry[] table)
void	LeftTupleIndexHashTable.FullFastIterator.resume(Entry target, Entry[] table)
void	RightTupleList.setNext(Entry next)
void	LeftTupleList.setNext(Entry next)

Constructors in org.drools.core.util.index with parameters of type Entry

LeftTupleIndexHashTable.FullFastIterator(Entry[] table)

LeftTupleIndexHashTable.FullFastIterator(Entry[] table, int row)

RightTupleIndexHashTable.FullFastIterator(Entry[] table)

RightTupleIndexHashTable.FullFastIterator(Entry[] table, int row)

RightTupleList(AbstractHashTable.Index index, int hashCode, Entry next)

RightTupleList(RightTupleList p, Entry next)