|
Macaulay2 Engine
|
One of the Resolution computations, based on Schreyer and Lascala. More...
#include <res-a0.hpp>
Public Member Functions | |
| res2_comp (const Matrix *m, int LengthLimit, bool UseDegreeLimit, int SlantedDegreeLimit, int SortStrategy) | |
| virtual | ~res2_comp () |
| void | resize (const Ring *new_ring) |
| void | increase_level (int newmax) |
| enum ComputationStatusCode | skeleton (int level) |
| void | new_pairs (res2_pair *p) |
| enum ComputationStatusCode | do_pairs (int level, int degree) |
| enum ComputationStatusCode | do_all_pairs (int level, int degree) |
| enum ComputationStatusCode | do_pairs_by_level (int level) |
| enum ComputationStatusCode | do_pairs_by_degree (int level, int degree) |
| int | calc (const int *DegreeLimit, int LengthLimit, int SyzygyLimit, int PairLimit, int SyzLimitValue, int SyzLimitLevel, int SyzLimitDegree) |
| bool | stop_conditions_ok () |
| void | start_computation () |
| int | complete_thru_degree () const |
| FreeModule * | free_of (int i) const |
| FreeModule * | minimal_free_of (int i) const |
| Matrix * | make (int i) const |
| Matrix * | make_minimal (int i) const |
| const Matrix * | get_matrix (int level) |
| const FreeModule * | get_free (int level) |
| M2_arrayint | betti_skeleton () const |
| M2_arrayint | betti_remaining () const |
| M2_arrayint | betti_minimal () const |
| M2_arrayint | betti_nmonoms () const |
| M2_arrayint | get_betti (int type) const |
| void | display_order (buffer &o, int sortval) const |
| void | text_out (const res2_pair *p) const |
| void | text_out (buffer &o, const res2_pair *p) const |
| void | stats () const |
| void | text_out (buffer &o) const |
| res2_comp * | cast_to_res2_comp () |
| const Ring * | get_ring () const |
| const Monoid * | getMonoid () const |
| const Ring * | getCoefficientRing () const |
| Public Member Functions inherited from ResolutionComputation | |
| virtual ResolutionComputation * | cast_to_ResolutionComputation () |
| virtual | ~ResolutionComputation () |
| virtual MutableMatrix * | get_matrix (int level, int degree) |
| Public Member Functions inherited from Computation | |
| Computation * | set_stop_conditions (M2_bool always_stop, M2_arrayint degree_limit, int basis_element_limit, int syzygy_limit, int pair_limit, int codim_limit, int subring_limit, M2_bool just_min_gens, M2_arrayint length_limit) |
| enum ComputationStatusCode | status () const |
| virtual GBComputation * | cast_to_GBComputation () |
| virtual void | show () const |
| Public Member Functions inherited from MutableEngineObject | |
| MutableEngineObject () | |
| virtual | ~MutableEngineObject () |
| unsigned int | hash () const |
| Public Member Functions inherited from our_gc_cleanup | |
| our_gc_cleanup () | |
| virtual | ~our_gc_cleanup () |
Private Attributes | |
| const PolynomialRing * | P |
| res2_poly * | R |
| const Monoid * | M |
| const Ring * | K |
| const Matrix * | generator_matrix |
| stash * | res2_pair_stash |
| stash * | mi_stash |
| int | lodegree |
| int | hidegree |
| int | hard_degree_limit |
| bool | have_degree_limit |
| int | length_limit |
| int | projdim |
| int | regularity |
| int | max_mon_degree |
| int | next_component |
| int | next_pair_num |
| int | skeleton_sort |
| int | monorder_sort |
| int | reduction_sort |
| unsigned char | do_by_level |
| unsigned char | do_by_degree |
| unsigned char | use_respolyHeaps |
| int | auto_reduce |
| int | nleft |
| int | npairs |
| int | nminimal |
| int | total_reduce_count |
| int | n_ones |
| int | n_unique |
| int | n_others |
| size_t | exp_size |
| size_t | monom_size |
| int | compare_type |
| int | compare_use_degree |
| int | compare_use_descending |
| int | compare_use_reverse |
Additional Inherited Members | |
| Static Public Member Functions inherited from ResolutionComputation | |
| static void | betti_init (int lo, int hi, int len, int *&bettis) |
| static M2_arrayint | betti_make (int lo, int hi, int len, int *bettis) |
| static void | betti_display (buffer &o, M2_arrayint a) |
| static ResolutionComputation * | choose_res (const Matrix *m, M2_bool resolve_cokernel, int max_level, M2_bool use_max_slanted_degree, int max_slanted_degree, int algorithm, int strategy, int numThreads, M2_bool parallelizeByDegree) |
| 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) |
| Protected Member Functions inherited from ResolutionComputation | |
| ResolutionComputation () | |
| Protected Member Functions inherited from Computation | |
| Computation () | |
| enum ComputationStatusCode | set_status (enum ComputationStatusCode) |
| virtual | ~Computation () |
| Protected Attributes inherited from Computation | |
| StopConditions | stop_ |
One of the Resolution computations, based on Schreyer and Lascala.
Definition at line 119 of file res-a0.hpp.