Node for an omega lambda tree.
More...
#include <unary.hh>
|
int | lp |
| Processing times for subtree.
|
int | lect |
| Earliest completion times for subtree.
|
int | resEct |
| Node which is responsible for lect.
|
int | resLp |
| Node which is responsible for lp.
|
int | p |
| Processing time for subtree.
|
int | ect |
| Earliest completion time for subtree.
|
|
static const int | undef = -1 |
| Undefined task.
|
Node for an omega lambda tree.
Definition at line 695 of file unary.hh.
◆ init()
Initialize node from left child l and right child r.
Definition at line 106 of file tree.hpp.
◆ update()
Update node from left child l and right child r.
Definition at line 112 of file tree.hpp.
◆ undef
const int Gecode::Int::Unary::OmegaLambdaNode::undef = -1 |
|
static |
Undefined task.
Definition at line 698 of file unary.hh.
◆ lp
int Gecode::Int::Unary::OmegaLambdaNode::lp |
Processing times for subtree.
Definition at line 700 of file unary.hh.
◆ lect
int Gecode::Int::Unary::OmegaLambdaNode::lect |
Earliest completion times for subtree.
Definition at line 702 of file unary.hh.
◆ resEct
int Gecode::Int::Unary::OmegaLambdaNode::resEct |
Node which is responsible for lect.
Definition at line 704 of file unary.hh.
◆ resLp
int Gecode::Int::Unary::OmegaLambdaNode::resLp |
Node which is responsible for lp.
Definition at line 706 of file unary.hh.
The documentation for this class was generated from the following files: