|
Macaulay2 Engine
|
#include <res-f4-monlookup.hpp>
Classes | |
| struct | mi_node |
Public Member Functions | |
| ResF4MonomialLookupTableT (int nvars, stash *mi_stash=nullptr) | |
| ~ResF4MonomialLookupTableT () | |
| void | insert_minimal_vp (long comp, const_varpower_monomial m, Key k) |
| bool | insert_vp (long comp, const_varpower_monomial m, Key &k) |
| bool | find_one_divisor_vp (long comp, const_varpower_monomial m, Key &result_k) const |
| bool | find_one_divisor_packed (const ResMonoid *M, const_packed_monomial m, Key &result_k) const |
| void | find_all_divisors_vp (long comp, const_varpower_monomial m, VECTOR(Key) &result_k) const |
| void | find_all_divisors_packed (const ResMonoid *M, const_packed_monomial m, VECTOR(Key) &result_k) const |
| void | text_out (buffer &o) const |
| int | length () const |
Private Types | |
| typedef res_varpower_word | varpower_word |
| typedef res_varpower_monomial | varpower_monomial |
| typedef res_const_varpower_monomial | const_varpower_monomial |
| typedef res_ntuple_word | ntuple_word |
| typedef res_ntuple_monomial | ntuple_monomial |
| typedef res_const_ntuple_monomial | const_ntuple_monomial |
| typedef res_packed_monomial | packed_monomial |
| typedef res_const_packed_monomial | const_packed_monomial |
Private Member Functions | |
| VECTOR (mi_node *) mis | |
| mi_node * | new_mi_node (varpower_word v, varpower_word e, mi_node *d) |
| mi_node * | new_mi_node (varpower_word v, varpower_word e, Key k) |
| void | delete_mi_node (mi_node *p) |
| void | update_expvector (int topvar, const_varpower_monomial m) |
| void | reset_expvector (const_varpower_monomial m) |
| bool | find_one_divisor1 (mi_node *mi, const_ntuple_monomial exp, Key &result_k) const |
| void | find_all_divisors1 (mi_node *mi, const_ntuple_monomial exp, VECTOR(Key) &result_k) const |
| void | insert1 (mi_node *&p, const_varpower_monomial m, Key k) |
| mi_node * | next (mi_node *p) const |
| mi_node * | prev (mi_node *p) const |
| void | do_node (mi_node *p, int indent, int disp) const |
| void | do_tree (mi_node *p, int depth, int indent, int disp) const |
| int | debug_check (mi_node *p, const mi_node *up) const |
| void | debug_out (int disp=1) const |
| void | debug_check () const |
Private Attributes | |
| stash * | mi_stash |
| int | count |
| int | size_of_exp |
| ntuple_word * | exp0 |
Additional Inherited Members | |
| Static Public Member Functions inherited from our_new_delete | |
| static void * | operator new (size_t size) |
| static void * | operator new[] (size_t size) |
| static void | operator delete (void *obj) |
| static void | operator delete[] (void *obj) |
| static void * | operator new (size_t size, void *existing_memory) |
| static void * | operator new[] (size_t size, void *existing_memory) |
| static void | operator delete (void *obj, void *existing_memory) |
| static void | operator delete[] (void *obj, void *existing_memory) |
Definition at line 50 of file res-f4-monlookup.hpp.