|
Macaulay2 Engine
|
#include <res-a2.hpp>
Public Member Functions | |
| gb2_comp (FreeModule *Fsyz, stash *mi_stash, gb_node *gens, int lodegree, int orig_syz, int level, int strategy) | |
| ~gb2_comp () | |
| virtual void | set_output (gb_node *p) |
| bool | receive_generator (gbvector *f, int n, const ring_elem denom) |
| void | end_degree () |
| bool | is_done () |
| enum ComputationStatusCode | calc_gb (int deg) |
| enum ComputationStatusCode | calc_gens (int deg) |
| virtual void | reduce (gbvector *&f, gbvector *&fsyz) |
| virtual RingElement * | hilbertNumerator () |
| int | n_gb_elems () const |
| const FreeModule * | output_free_module () const |
| Matrix * | min_gens_matrix () |
| Matrix * | get_matrix () |
| Matrix * | initial_matrix (int n) |
| Matrix * | gb_matrix () |
| Matrix * | change_matrix () |
| void | debug_out (s_pair *q) const |
| void | debug_out (buffer &o, s_pair *q) const |
| virtual void | text_out (buffer &o) const |
| void | stats () const |
| Public Member Functions inherited from gb_node | |
| virtual | ~gb_node () |
Private Member Functions | |
| VECTOR (gb_elem *) gb | |
| VECTOR (monideal_pair *) monideals | |
| void | setup (FreeModule *Fsyz, stash *mi_stash, gb_node *gens, int lodegree, int origsyz, int level, int strategy) |
| s_pair * | new_ring_pair (gb_elem *p, const int *lcm) |
| s_pair * | new_s_pair (gb_elem *p, gb_elem *q, const int *lcm) |
| void | remove_pair (s_pair *&p) |
| void | find_pairs (gb_elem *p) |
| void | compute_s_pair (s_pair *p) |
| void | gb_reduce (gbvector *&f, gbvector *&fsyz) |
| void | gb_geo_reduce (gbvector *&f, gbvector *&fsyz) |
| void | gb_insert (gbvector *f, gbvector *fsyz, int ismin) |
| int | gb_sort_partition (int lo, int hi) |
| void | gb_sort (int lo, int hi) |
| void | flush_pairs () |
| Matrix * | make_lead_term_matrix () |
| void | schreyer_append (gbvector *f) |
| bool | s_pair_step () |
| int | get_pairs () |
Private Attributes | |
| const PolynomialRing * | originalR |
| GBRing * | GR |
| const Monoid * | M |
| const Ring * | K |
| stash * | mi_stash |
| FreeModule * | F |
| FreeModule * | Fsyz |
| int | level |
| int | state |
| int | this_degree |
| int | n_gb_first |
| s_pair_heap * | spairs |
| s_pair * | these_pairs |
| gc_vector< int > | total_pairs |
| gb_node * | syz |
| gb_node * | gens |
| int | n_gb |
| int | n_mingens |
| int | n_subring |
| int | n_syz |
| int | n_pairs |
| int | n_pairs_computed |
| int | n_pairs_syz |
| int | n_pairs_usyz |
| int | n_pairs_gb |
| int | n_pairs_zero |
| int | n_pairs_hilb |
| int | n_pairs_gcd |
| int | orig_syz |
| int | strategy_flags |
| char | use_hilb |
| RingElement * | hf |
| int | hf_numgens_gb |
| int | hf_numgens_F |
| int | n_gb_syz |
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 109 of file res-a2.hpp.