Represent integer grouped bounds which are classified into lower bounds (inclusive), upper bounds (inclusive) and equalities. It also contains coefficient as a multiplier for the bounds, i.e., coef * var >= lower coef * var == equal coef * var <= upper.
More...
#include <int_solver.h>
|
static constexpr TVMFFISEqHashKind | _type_s_eq_hash_kind = kTVMFFISEqHashKindTreeNode |
|
static constexpr const char * | _type_key = "arith.IntGroupBounds" |
|
Represent integer grouped bounds which are classified into lower bounds (inclusive), upper bounds (inclusive) and equalities. It also contains coefficient as a multiplier for the bounds, i.e., coef * var >= lower coef * var == equal coef * var <= upper.
- See also
- IntGroupBounds
◆ RegisterReflection()
static void tvm::arith::IntGroupBoundsNode::RegisterReflection |
( |
| ) |
|
|
inlinestatic |
◆ TVM_DECLARE_FINAL_OBJECT_INFO()
tvm::arith::IntGroupBoundsNode::TVM_DECLARE_FINAL_OBJECT_INFO |
( |
IntGroupBoundsNode |
, |
|
|
Object |
|
|
) |
| |
◆ _type_key
constexpr const char* tvm::arith::IntGroupBoundsNode::_type_key = "arith.IntGroupBounds" |
|
staticconstexpr |
◆ _type_s_eq_hash_kind
constexpr TVMFFISEqHashKind tvm::arith::IntGroupBoundsNode::_type_s_eq_hash_kind = kTVMFFISEqHashKindTreeNode |
|
staticconstexpr |
◆ coef
PrimExpr tvm::arith::IntGroupBoundsNode::coef |
◆ equal
Array<PrimExpr> tvm::arith::IntGroupBoundsNode::equal |
◆ lower
Array<PrimExpr> tvm::arith::IntGroupBoundsNode::lower |
◆ upper
Array<PrimExpr> tvm::arith::IntGroupBoundsNode::upper |
The documentation for this class was generated from the following file: