We can have different set of variables to represent the same constraints. For example, the following two systems are equivalent, {a + b = 0 | a >= 0, b >= 0} and {m - n = 0 | m >= 0, n <= 0} This data structure represents the transformation between two equivalent linear systems. In the above example, src : {a + b = 0 | a >= 0, b >= 0} dst : {m - n = 0 | m >= 0, n <= 0} src_to_dst : {a -> m, b -> -n} dst_to_src : {m -> a, n -> -b}.
More...
#include <int_solver.h>
We can have different set of variables to represent the same constraints. For example, the following two systems are equivalent, {a + b = 0 | a >= 0, b >= 0} and {m - n = 0 | m >= 0, n <= 0} This data structure represents the transformation between two equivalent linear systems. In the above example, src : {a + b = 0 | a >= 0, b >= 0} dst : {m - n = 0 | m >= 0, n <= 0} src_to_dst : {a -> m, b -> -n} dst_to_src : {m -> a, n -> -b}.
- See also
- IntConstraintsTransform
◆ RegisterReflection()
static void tvm::arith::IntConstraintsTransformNode::RegisterReflection |
( |
| ) |
|
|
inlinestatic |
◆ TVM_FFI_DECLARE_OBJECT_INFO_FINAL()
tvm::arith::IntConstraintsTransformNode::TVM_FFI_DECLARE_OBJECT_INFO_FINAL |
( |
"arith.IntConstraintsTransform" |
, |
|
|
IntConstraintsTransformNode |
, |
|
|
Object |
|
|
) |
| |
◆ _type_s_eq_hash_kind
constexpr TVMFFISEqHashKind tvm::arith::IntConstraintsTransformNode::_type_s_eq_hash_kind = kTVMFFISEqHashKindTreeNode |
|
staticconstexpr |
◆ dst
◆ dst_to_src
ffi::Map<Var, PrimExpr> tvm::arith::IntConstraintsTransformNode::dst_to_src |
◆ src
◆ src_to_dst
ffi::Map<Var, PrimExpr> tvm::arith::IntConstraintsTransformNode::src_to_dst |
The documentation for this class was generated from the following file: