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

Packages that use Entry

org.drools.common
org.drools.core.util
org.drools.core.util.index
org.drools.reteoo

Uses of Entry in org.drools.common

Subinterfaces of Entry in org.drools.common

interface

LogicalDependency

Classes in org.drools.common that implement Entry

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

Methods in org.drools.common with parameters of type Entry

void	ScheduledAgendaItem.setNext(Entry next)

Uses of Entry in org.drools.core.util

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	Entry.getNext()
Entry	LeftTupleRBTree.Node.getNext()
Entry	ObjectHashMap.ObjectEntry.getNext()
Entry	RBTree.Node.getNext()
Entry	TripleImpl.getNext()
Entry	RightTupleRBTree.Node.getNext()
Entry	ObjectHashSet.ObjectEntry.getNext()
Entry[]	AbstractHashTable.getTable()
Entry	LeftTupleRBTree.RangeFastIterator.next(Entry object)
Entry	LinkedList.LinkedListFastIterator.next(Entry object)
Entry	RBTree.RBTreeFastIterator.next(Entry object)
Entry	FastIterator.next(Entry object)
Entry	RightTupleRBTree.RangeFastIterator.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	LeftTupleRBTree.RangeFastIterator.next(Entry object)
Entry	LinkedList.LinkedListFastIterator.next(Entry object)
Entry	RBTree.RBTreeFastIterator.next(Entry object)
Entry	FastIterator.next(Entry object)
Entry	RightTupleRBTree.RangeFastIterator.next(Entry object)
void	Entry.setNext(Entry next)
void	AbstractBaseLinkedListNode.setNext(Entry next)
void	LeftTupleRBTree.Node.setNext(Entry next)
void	ObjectHashMap.ObjectEntry.setNext(Entry next)
void	RBTree.Node.setNext(Entry next)
void	TripleImpl.setNext(Entry next)
void	RightTupleRBTree.Node.setNext(Entry next)
void	ObjectHashSet.ObjectEntry.setNext(Entry next)

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

AbstractHashTable(Entry[] table)

AbstractHashTable(float loadFactor, Entry[] table)

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	ConcurrentRightTupleList
class	LeftTupleList
class	RightTupleList

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

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

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

AtomicReference<Entry>	ConcurrentRightTupleList.next
AtomicReference<Entry>	ConcurrentRightTupleList.previous

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

Entry	RightTupleIndexHashTable.getBucket(Object object)
Entry	LeftTupleIndexHashTable.getBucket(Object object)
Entry	ConcurrentRightTupleList.getNext()
Entry	RightTupleList.getNext()
Entry	LeftTupleList.getNext()
Entry	RightTupleIndexHashTable.FullFastIterator.next(Entry object)
Entry	LeftTupleIndexRangeRBTree.LeftTupleFastIterator.next(Entry object)
Entry	LeftTupleIndexRBTree.LeftTupleFastIterator.next(Entry object)
Entry	RightTupleIndexRangeRBTree.RightTupleBoundedFastIterator.next(Entry object)
Entry	RightTupleIndexRBTree.RightTupleFastIterator.next(Entry object)
Entry	LeftTupleIndexHashTable.FullFastIterator.next(Entry object)
Entry[]	ConcurrentRightTupleList.toArray()
Entry[]	RightTupleIndexHashTable.toArray()
Entry[]	LeftTupleIndexRangeRBTree.toArray()
Entry[]	LeftTupleIndexRBTree.toArray()
Entry[]	RightTupleIndexRangeRBTree.toArray()
Entry[]	RightTupleIndexRBTree.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	RightTupleIndexHashTable.FullFastIterator.next(Entry object)
Entry	LeftTupleIndexRangeRBTree.LeftTupleFastIterator.next(Entry object)
Entry	LeftTupleIndexRBTree.LeftTupleFastIterator.next(Entry object)
Entry	RightTupleIndexRangeRBTree.RightTupleBoundedFastIterator.next(Entry object)
Entry	RightTupleIndexRBTree.RightTupleFastIterator.next(Entry object)
Entry	LeftTupleIndexHashTable.FullFastIterator.next(Entry object)
void	ConcurrentRightTupleList.setNext(Entry next)
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)

Uses of Entry in org.drools.reteoo

Subinterfaces of Entry in org.drools.reteoo

interface

LeftTuple

Classes in org.drools.reteoo that implement Entry

class	BaseLeftTuple A parent class for all specific LeftTuple specializations
static class	CompositeObjectSinkAdapter.FieldIndex
class	ConcurrentRightTuple
class	EvalNodeLeftTuple
class	FromNodeLeftTuple
class	JoinNodeLeftTuple
class	LeftTupleImpl
class	NotNodeLeftTuple
class	QueryElementNodeLeftTuple
class	QueryRiaFixerNodeLeftTuple
class	RightTuple
class	RuleTerminalNodeLeftTuple
class	WindowTuple A specialisation of RightTuples that also belong to a window

Methods in org.drools.reteoo that return Entry

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

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

void	LeftTupleImpl.setNext(Entry next)
void	RightTuple.setNext(Entry next)
void	CompositeObjectSinkAdapter.FieldIndex.setNext(Entry next)
void	ConcurrentRightTuple.setNext(Entry next)
void	BaseLeftTuple.setNext(Entry next)
void	FromNodeLeftTuple.setNext(Entry next)
void	NotNodeLeftTuple.setNext(Entry next)
void	JoinNodeLeftTuple.setNext(Entry next)
void	LeftTupleImpl.setPrevious(Entry previous)
void	RightTuple.setPrevious(Entry previous)
void	LeftTuple.setPrevious(Entry previous)
void	ConcurrentRightTuple.setPrevious(Entry previous)
void	BaseLeftTuple.setPrevious(Entry previous)
void	FromNodeLeftTuple.setPrevious(Entry previous)
void	NotNodeLeftTuple.setPrevious(Entry previous)
void	JoinNodeLeftTuple.setPrevious(Entry previous)