|
Macaulay2 Engine
|
#include <gb-toric.hpp>
Classes | |
| struct | s_pair_degree_list |
| struct | s_pair_lcm_list |
| struct | s_pair_elem |
Public Member Functions | |
| binomial_s_pair_set (const binomial_ring *R) | |
| ~binomial_s_pair_set () | |
| void | enlarge (const binomial_ring *R) |
| void | insert (binomial_gb_elem *p) |
| void | insert (binomial_s_pair p) |
| bool | next (const int *d, binomial_s_pair &result, int &result_deg) |
| int | lowest_degree () const |
| int | n_elems (int d) const |
| int | n_elems () const |
| void | stats () const |
Private Member Functions | |
| void | remove_lcm_list (s_pair_lcm_list *p) |
| void | remove_pair_list (s_pair_degree_list *p) |
| void | insert_pair (s_pair_degree_list *q, binomial_s_pair &s) |
Private Attributes | |
| const binomial_ring * | R |
| monomial0 | _prev_lcm |
| s_pair_degree_list * | _pairs |
| int | _n_elems |
| int | _max_degree |
| gc_vector< int > | _npairs |
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 165 of file gb-toric.hpp.