Class Tree

java.lang.Object
org.jacop.constraints.cumulative.Tree
Direct Known Subclasses:
ThetaLambdaTree, ThetaTree

abstract class Tree extends Object
Implements ThetaLambdaTree and operations on this tree for Cumulative constraint
Version:
4.8
  • Field Summary

    Fields
    Modifier and Type
    Field
    Description
    (package private) int
     
    (package private) int
     
  • Constructor Summary

    Constructors
    Constructor
    Description
     
  • Method Summary

    Modifier and Type
    Method
    Description
    (package private) abstract void
    clearNode(int i)
     
    (package private) void
     
    (package private) boolean
    exist(int i)
     
    (package private) boolean
    isLeft(int i)
     
    (package private) boolean
    isRight(int i)
     
    (package private) boolean
    isRoot(int i)
     
    (package private) int
    leafIndex(int i)
     
    (package private) int
    left(int i)
     
    (package private) boolean
    notExist(int i)
     
    (package private) int
    parent(int i)
     
    (package private) int
    plus(int x, int y)
     
    (package private) long
    plus(long x, long y)
     
    (package private) int
    right(int i)
     
    (package private) int
     
    (package private) int
    siblingLeft(int i)
     
    (package private) int
    siblingRight(int i)
     

    Methods inherited from class java.lang.Object

    clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
  • Field Details

    • treeSize

      int treeSize
    • n

      int n
  • Constructor Details

    • Tree

      Tree()
  • Method Details

    • clearNode

      abstract void clearNode(int i)
    • clearTree

      void clearTree()
    • root

      int root()
    • isRoot

      boolean isRoot(int i)
    • parent

      int parent(int i)
    • left

      int left(int i)
    • right

      int right(int i)
    • siblingLeft

      int siblingLeft(int i)
    • siblingRight

      int siblingRight(int i)
    • isLeft

      boolean isLeft(int i)
    • isRight

      boolean isRight(int i)
    • leafIndex

      int leafIndex(int i)
    • notExist

      boolean notExist(int i)
    • exist

      boolean exist(int i)
    • plus

      long plus(long x, long y)
    • plus

      int plus(int x, int y)