|
LMCAS
Lamina Computer Algebra System
|
#include "internal/solver_groebner_internal.hpp"#include <algorithm>#include <functional>#include <queue>命名空间 | |
| namespace | LMCAS |
| namespace | LMCAS::groebner_detail |
| namespace | LMCAS::groebner_detail::anonymous_namespace{solver_groebner_basis.cpp} |
类型定义 | |
| using | LMCAS::groebner_detail::anonymous_namespace{solver_groebner_basis.cpp}::PairQueue = std::priority_queue<SugarPair, std::vector<SugarPair>, std::greater<SugarPair>> |
函数 | |
| void | LMCAS::groebner_detail::buchberger (std::vector< Poly > &basis, size_t num_vars) |
| PairQueue | LMCAS::groebner_detail::anonymous_namespace{solver_groebner_basis.cpp}::initial_pairs (const std::vector< Poly > &basis) |
| void | LMCAS::groebner_detail::anonymous_namespace{solver_groebner_basis.cpp}::initialize_sugar (std::vector< Poly > &basis) |
| void | LMCAS::groebner_detail::anonymous_namespace{solver_groebner_basis.cpp}::make_monic (Poly &polynomial) |
| std::vector< Poly > | LMCAS::groebner_detail::anonymous_namespace{solver_groebner_basis.cpp}::minimal_basis (const std::vector< Poly > &basis) |
| void | LMCAS::groebner_detail::reduce_basis (std::vector< Poly > &basis) |