LMCAS
Lamina Computer Algebra System
载入中...
搜索中...
未找到
relation_store.cpp 文件参考
#include "relation_store.hpp"
#include "internal/symbolic_ast.hpp"
#include "internal/expression_analysis.hpp"
#include "property_store.hpp"
#include <algorithm>
#include <queue>
relation_store.cpp 的引用(Include)关系图:

浏览该文件的源代码.

类

struct  LMCAS::RelationStore::TransitiveWork

命名空间

namespace  LMCAS
namespace  LMCAS::anonymous_namespace{relation_store.cpp}

函数

RelationOp LMCAS::anonymous_namespace{relation_store.cpp}::combine_ops (RelationOp op1, RelationOp op2)
 Combine two transitive operators according to the combination rules: GT+GT→GT, GT+GEQ→GT, GEQ+GT→GT, GEQ+GEQ→GEQ.
RelationStoreResult LMCAS::anonymous_namespace{relation_store.cpp}::declare_comparison_sign (const std::string &symbol, RelationOp op, PropertyStore &store)
RelationStoreResult LMCAS::anonymous_namespace{relation_store.cpp}::derive_comparison_sign (const SymbolicExpr &lhs, const SymbolicExpr &rhs, RelationOp op, PropertyStore &store)
bool LMCAS::anonymous_namespace{relation_store.cpp}::expr_equals (const SymbolicExpr &a, const SymbolicExpr &b)
 Check structural equality of two expression roots.
bool LMCAS::anonymous_namespace{relation_store.cpp}::is_transitive_op (RelationOp op)
 Check if an operator participates in transitive closure.