• policy-engine-study
  • Introduction
  • Kafka
  • Flink
  • Maven
    • Local Maven Repository
  • Examples
    • kafka + drools
    • Drools
    • kafka + mvn + drools
  • Spring
    • herbinate validator
      • @NotNull vs @NotEmpty vs @NotBlank
  • Antlr
    • Install
  • 录像
  • Drools
    • Rete
      • call
      • Production Matching for Large Learning Systems
        • Input&Output
        • How to create alpha network
        • How to create alpha network 124?
        • How to create beta network?
    • API
      • stateless
      • stateful
  • Java 8
    • util
      • Collection
        • List
          • ArrayList
            • trimToSize()
            • ensureCapacity(int minCapacity)
            • int size()
            • boolean isEmpty()
            • boolean contains(Object o)
            • int indexOf(Object o)
            • int lastIndexOf(Object o)
            • Object clone()
            • Object[] toArray()
            • T[] toArray(T[] a)
            • E get(int index)
            • E set(int index, E element)
            • boolean add(E e)
            • void add(int index, E element)
            • E remove(int index)
            • boolean remove(Object o)
            • void clear()
            • boolean addAll(Collection c)
            • boolean addAll(int index, Collection c)
            • boolean removeAll(Collection c)
            • boolean retainAll(Collection c)
            • ListIterator listIterator(int index)
            • ListIterator listIterator()
            • Iterator iterator()
            • List subList(int fromIndex, int toIndex)
            • void forEach(Consumer action)
            • Spliterator spliterator()
            • boolean removeIf(Predicate filter)
            • void replaceAll(UnaryOperator operator)
            • void sort(Comparator c)
          • LinkedList
            • boolean addAll(Collection e)
            • boolean addAll(int index, Collection c
            • boolean add(E e)
            • void add(int index, E element)
            • void addFirst(E e)
            • void addLast(E e)
            • E getFirst()
            • E getLast()
            • E removeFirst()
            • E removeLast()
            • boolean remove(Object o)
            • E remove(int index)
            • boolean contains(Object o)
            • int indexOf(Object o)
            • int lastIndexOf(Object o)
            • int size()
            • void clear()
            • E get(int index)
            • E set(int index, E element)
            • E peek()
            • E element()
            • E poll()
            • E remove()
            • boolean offer(E e)
            • boolean offerFirst(E e)
            • offerLast(E e)
            • E peekFirst()
            • E peekLast()
            • E pollFirst()
            • E pollLast()
            • void push(E e)
            • E pop()
            • boolean removeFirstOccurrence(Object o)
            • boolean removeLastOccurrence(Object o)
            • ListIterator listIterator(int index)
            • Iterator descendingIterator()
            • Object clone()
            • Object[] toArray()
            • T[] toArray(T[] a)
            • Spliterator spliterator()
          • Vector
            • synchronized void copyInto(Object[] anArray)
            • synchronized void trimToSize()
            • synchronized void ensureCapacity(int minCapacity)
            • synchronized void setSize(int newSize)
            • synchronized int capacity()
            • synchronized int size()
            • synchronized boolean isEmpty()
            • Enumeration elements()
            • boolean contains(Object o)
            • int indexOf(Object o)
            • synchronized int indexOf(Object o, int index)
            • synchronized int lastIndexOf(Object o)
            • synchronized int lastIndexOf(Object o, int index)
            • synchronized E elementAt(int index)
            • synchronized E firstElement()
            • synchronized E lastElement()
            • synchronized void setElementAt(E obj, int index)
            • synchronized void removeElementAt(int index)
            • synchronized void insertElementAt(E obj, int index)
            • synchronized void addElement(E obj)
            • synchronized boolean removeElement(Object obj)
            • synchronized void removeAllElements()
            • synchronized Object clone()
            • synchronized Object[] toArray()
            • synchronized T[] toArray(T[] a)
            • synchronized E get(int index)
            • synchronized E set(int index, E element)
            • synchronized boolean add(E e)
            • boolean remove(Object o)
            • void clear()
            • synchronized boolean containsAll(Collection c)
            • void add(int index, E element)
            • synchronized E remove(int index)
            • synchronized boolean addAll(Collection c)
            • synchronized boolean removeAll(Collection c)
            • synchronized boolean retainAll(Collection c)
            • synchronized boolean addAll(int index, Collection c)
            • synchronized boolean equals(Object o)
            • synchronized int hashCode()
            • synchronized String toString()
            • synchronized List subList(int fromIndex, int toIndex)
            • synchronized ListIterator listIterator(int index)
            • synchronized ListIterator listIterator()
            • synchronized Iterator iterator()
            • synchronized void forEach(Consumer action)
            • synchronized boolean removeIf(Predicate filter)
            • synchronized void replaceAll(UnaryOperator operator)
            • synchronized void sort(Comparator c)
            • Spliterator spliterator()
        • Set
          • HashSet
            • Iterator iterator()
            • int size()
            • boolean isEmpty()
            • boolean contains(Object o)
            • boolean add(E e)
            • boolean remove(Object o)
            • void clear()
            • Object clone()
            • Spliterator spliterator()
          • LinkedHashSet
            • Spliterator spliterator()
          • TreeSet
            • Iterator iterator()
            • Iterator descendingIterator()
            • NavigableSet descendingSet()
            • int size()
            • boolean isEmpty()
            • boolean contains(Object o)
            • boolean add(E e)
            • boolean remove(Object o)
            • void clear()
            • boolean addAll(Collection c)
            • NavigableSet subSet(E fromElement, boolean fromInclusive,E toElement, boolean toInclusive)
            • NavigableSet headSet(E toElement, boolean inclusive)
            • NavigableSet tailSet(E fromElement, boolean inclusive)
            • SortedSet subSet(E fromElement, E toElement)
            • SortedSet headSet(E toElement)
            • SortedSet tailSet(E fromElement)
            • Comparator comparator()
            • E first()
            • E last()
            • E lower(E e)
            • E floor(E e)
            • E ceiling(E e)
            • E higher(E e)
            • E pollFirst()
            • E pollLast()
            • Object clone()
            • Spliterator spliterator()
        • Queue
          • PriorityQueue
      • Map
        • HashMap
          • int size()
          • boolean isEmpty()
          • V get(Object key)
          • boolean containsKey(Object key)
          • V put(K key, V value)
          • void putAll(Map m)
          • V remove(Object key)
          • void clear()
          • boolean containsValue(Object value)
          • Set keySet()
          • Collection values()
          • Set> entrySet()
          • V getOrDefault(Object key, V defaultValue)
          • V putIfAbsent(K key, V value)
          • boolean remove(Object key, Object value)
          • boolean replace(K key, V oldValue, V newValue)
          • V replace(K key, V value)
          • V computeIfAbsent(K key, Function mappingFunction)
          • V computeIfPresent(K key, BiFunction remappingFunction)
          • V compute(K key, BiFunction remappingFunction)
          • V merge(K key, V value, BiFunction remappingFunction)
          • void forEach(BiConsumer action)
          • void replaceAll(BiFunction function)
          • Object clone()
          • 红黑树
        • LinkedHashMap
          • boolean containsValue(Object value)
          • V get(Object key)
          • V getOrDefault(Object key, V defaultValue)
          • void clear()
          • Set keySet()
          • Collection values()
          • Set> entrySet()
          • void forEach(BiConsumer action)
          • void replaceAll(BiFunction function)
        • TreeMap
          • int size()
          • boolean containsKey(Object key)
          • boolean containsValue(Object value)
        • ConcurrentHashMap vs Hashtable
    • akka
    • extends vs super
    • Thread
      • 创建线程
      • 阻塞线程
      • 异常捕获
      • 共享资源竞争
        • synchronized
        • lock
  • 数据结构
    • 红黑树
Powered by GitBook

Rete

Reference:

http://reports-archive.adm.cs.cmu.edu/anon/1995/CMU-CS-95-113.pdf

http://docs.jboss.org/drools/release/6.0.0.Final/drools-docs/html/HybridReasoningChapter.html#ReteOO

results matching ""

    No results matching ""