Macaulay2 Engine
Loading...
Searching...
No Matches

◆ sub_space() [1/2]

SchreyerOrder * SchreyerOrder::sub_space ( int n) const

Definition at line 154 of file schorder.cpp.

155{
156 if (n < 0 || n > rank())
157 {
158 ERROR("sub schreyer order: index out of bounds");
159 return nullptr;
160 }
162 for (int i = 0; i < n; i++) result->append(compare_num(i), base_monom(i));
163 return result;
164}
const Monoid * M
Definition schorder.hpp:69
SchreyerOrder(const Monoid *m)
Definition schorder.hpp:77
int rank() const
Definition schorder.hpp:89
int compare_num(int i) const
Definition schorder.hpp:90
const_monomial base_monom(int i) const
Definition schorder.hpp:91
const int ERROR
Definition m2-mem.cpp:55
VALGRIND_MAKE_MEM_DEFINED & result(result)

References base_monom(), compare_num(), ERROR, M, rank(), result(), and SchreyerOrder().