Modifier and Type | Interface and Description |
---|---|
interface |
ModedAssertion<M extends ModedAssertion> |
Modifier and Type | Class and Description |
---|---|
class |
DefeasibleLogicalDependency<M extends DefeasibleMode<M>> |
class |
DefeasibleMode<M extends DefeasibleMode<M>> |
Modifier and Type | Class and Description |
---|---|
class |
JTMSMode<M extends JTMSMode<M>> |
Modifier and Type | Class and Description |
---|---|
class |
SimpleLogicalDependency<T extends ModedAssertion<T>>
LogicalDependency is a special node for LinkedLists that maintains
references for the Activation justifier and the justified FactHandle.
|
class |
SimpleMode |
Modifier and Type | Interface and Description |
---|---|
interface |
LogicalDependency<M extends ModedAssertion<M>> |
interface |
Memory
A super interface for node memories
|
Modifier and Type | Class and Description |
---|---|
class |
ActivationGroupNode |
class |
ActivationNode |
class |
DefaultFactHandle
Implementation of
FactHandle . |
class |
EventFactHandle |
class |
ScheduledAgendaItem<T extends ModedAssertion<T>> |
Modifier and Type | Class and Description |
---|---|
class |
RuleAgendaItem |
class |
StackEntry
Created with IntelliJ IDEA.
|
Modifier and Type | Interface and Description |
---|---|
interface |
LeftTuple |
interface |
RightTuple |
interface |
SegmentNodeMemory |
Modifier and Type | Method and Description |
---|---|
Entry[] |
TupleMemory.toArray() |
Modifier and Type | Interface and Description |
---|---|
interface |
Tuple
Partial matches are propagated through the Rete network as
Tuple s. |
Modifier and Type | Interface and Description |
---|---|
interface |
JobHandle
An interface for Job Handles
|
Modifier and Type | Class and Description |
---|---|
class |
AbstractJobHandle |
class |
DefaultJobHandle
A default implementation for the JobHandle interface
|
static class |
JDKTimerService.JDKJobHandle |
class |
MultiJobHandle
A JobHandle container for scheduling multiple jobs
|
Modifier and Type | Interface and Description |
---|---|
interface |
Entry<T extends Entry> |
Modifier and Type | Interface and Description |
---|---|
interface |
LinkedListNode<T extends LinkedListNode>
Items placed in a
LinkedList |
interface |
Triple |
Modifier and Type | Class and Description |
---|---|
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 |
AbstractHashTable.AbstractIndexTupleList |
static class |
AbstractHashTable.DoubleIndexTupleList |
static class |
AbstractHashTable.SingleIndexTupleList |
static class |
AbstractHashTable.TripleIndexTupleList |
class |
LinkedListEntry<T1 extends LinkedListNode<T1>,T2>
The idea behind
LinkedListNodeWrapper is to be able to add
the same LinkedListNode to multiple LinkedList s
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> |
class |
TripleImpl |
static class |
TupleRBTree.Node<K extends Comparable<? super K>> |
Modifier and Type | Field and Description |
---|---|
protected Entry<TupleList>[] |
AbstractHashTable.table |
Modifier and Type | Method and Description |
---|---|
Entry |
ObjectHashSet.getBucket(Object object) |
Entry |
ObjectHashMap.getBucket(Object object) |
Entry |
RBTree.Node.getNext() |
Entry |
ObjectHashSet.ObjectEntry.getNext() |
Entry |
ObjectHashMap.ObjectEntry.getNext() |
Entry |
TripleImpl.getNext() |
Entry<TupleList>[] |
AbstractHashTable.getTable() |
Entry |
LinkedList.LinkedListFastIterator.next(Entry object) |
Entry |
TupleRBTree.RangeFastIterator.next(Entry object) |
Entry |
FastIterator.next(Entry object) |
Entry |
RBTree.RBTreeFastIterator.next(Entry object) |
Entry[] |
AbstractHashTable.toArray() |
Modifier and Type | Method and Description |
---|---|
int |
TripleStore.getResizeHashcode(Entry entry) |
int |
ObjectHashSet.getResizeHashcode(Entry entry) |
abstract int |
AbstractHashTable.getResizeHashcode(Entry entry) |
int |
ObjectHashMap.getResizeHashcode(Entry entry) |
Entry |
LinkedList.LinkedListFastIterator.next(Entry object) |
Entry |
TupleRBTree.RangeFastIterator.next(Entry object) |
Entry |
FastIterator.next(Entry object) |
Entry |
RBTree.RBTreeFastIterator.next(Entry object) |
void |
RBTree.Node.setNext(Entry next) |
void |
ObjectHashSet.ObjectEntry.setNext(Entry next) |
void |
ObjectHashMap.ObjectEntry.setNext(Entry next) |
void |
TripleImpl.setNext(Entry next) |
Constructor and Description |
---|
AbstractHashTable(Entry[] table) |
AbstractHashTable(float loadFactor,
Entry[] table) |
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) |
Modifier and Type | Class and Description |
---|---|
class |
TupleList |
Modifier and Type | Method and Description |
---|---|
Entry |
RightTupleIndexRangeRBTree.RightTupleBoundedFastIterator.next(Entry object) |
Entry |
TupleIndexHashTable.FullFastIterator.next(Entry object) |
Entry |
TupleIndexRBTree.TupleFastIterator.next(Entry object) |
Entry |
LeftTupleIndexRangeRBTree.TupleFastIterator.next(Entry object) |
Entry[] |
RightTupleIndexRangeRBTree.toArray() |
Entry[] |
TupleIndexRBTree.toArray() |
Entry[] |
LeftTupleIndexRangeRBTree.toArray() |
Modifier and Type | Method and Description |
---|---|
int |
TupleIndexHashTable.getResizeHashcode(Entry entry) |
void |
TupleIndexHashTable.init(Entry[] table,
int size,
int factSize) |
Entry |
RightTupleIndexRangeRBTree.RightTupleBoundedFastIterator.next(Entry object) |
Entry |
TupleIndexHashTable.FullFastIterator.next(Entry object) |
Entry |
TupleIndexRBTree.TupleFastIterator.next(Entry object) |
Entry |
LeftTupleIndexRangeRBTree.TupleFastIterator.next(Entry object) |
void |
TupleIndexHashTable.FullFastIterator.reset(Entry[] table) |
void |
TupleIndexHashTable.FullFastIterator.resume(Entry target,
Entry[] table) |
void |
TupleIndexHashTable.FullFastIterator.resume(Entry target,
Entry[] table) |
Constructor and Description |
---|
FullFastIterator(Entry[] table) |
FullFastIterator(Entry[] table,
int row) |
Copyright © 2001–2017 JBoss by Red Hat. All rights reserved.