18#ifndef RAW_SQUARE_FREE_IDEAL_GUARD
19#define RAW_SQUARE_FREE_IDEAL_GUARD
37class RawSquareFreeIdeal {
39 static RawSquareFreeIdeal* construct(
void* buffer,
size_t varCount = 0);
40 static RawSquareFreeIdeal* construct(
void* buffer,
const Ideal& ideal);
41 static RawSquareFreeIdeal* construct(
void* buffer,
42 const RawSquareFreeIdeal& ideal);
55 RawSquareFreeIdeal&
operator=(
const RawSquareFreeIdeal& ideal)
56 {
return *construct(
this, ideal);}
85 void print(FILE* file)
const;
88 void print(ostream& out)
const;
102 void insertIdentity();
105 bool insert(
const std::vector<std::string>& term);
107 void colon(
const Word* by);
108 void colon(
size_t var);
124 size_t getGeneratorCount()
const {
return _genCount;}
125 size_t getVarCount()
const {
return _varCount;}
126 size_t getWordsPerTerm()
const {
return _wordsPerTerm;}
201 void swap(
size_t a,
size_t b);
206 bool operator==(
const RawSquareFreeIdeal& ideal)
const;
207 bool operator!=(
const RawSquareFreeIdeal& ideal)
const {
208 return !(*
this == ideal);
219 class const_iterator {
221 const_iterator(
const Word* term,
size_t wordsPerTerm):
222 _term(term), _wordsPerTerm(wordsPerTerm) {
224 const_iterator(
const const_iterator&) =
default;
226 const Word* operator*()
const {
return _term;}
227 const_iterator operator++() {_term += _wordsPerTerm;
return *
this;}
228 const_iterator operator--() {_term -= _wordsPerTerm;
return *
this;}
230 bool operator==(
const const_iterator& it)
const {
231 ASSERT(_wordsPerTerm == it._wordsPerTerm);
232 return _term == it._term;
234 bool operator!=(
const const_iterator& it)
const {
235 ASSERT(_wordsPerTerm == it._wordsPerTerm);
236 return _term != it._term;
239 ptrdiff_t operator-(
const const_iterator& it)
const {
240 ASSERT(_wordsPerTerm == it._wordsPerTerm);
241 return (_term - it._term) / _wordsPerTerm;
243 const_iterator operator+(ptrdiff_t i)
const {
244 return const_iterator(_term + i * _wordsPerTerm, _wordsPerTerm);
247 const_iterator& operator=(
const const_iterator& it) {
248 ASSERT(it._wordsPerTerm == _wordsPerTerm);
255 const size_t _wordsPerTerm;
262 iterator(
Word* term,
size_t wordsPerTerm):
263 _term(term), _wordsPerTerm(wordsPerTerm) {
265 iterator(
const iterator&) =
default;
271 Word* operator*()
const {
return _term;}
272 iterator operator++() {_term += _wordsPerTerm;
return *
this;}
273 iterator operator--() {_term -= _wordsPerTerm;
return *
this;}
275 bool operator==(
const iterator& it)
const {
276 ASSERT(_wordsPerTerm == it._wordsPerTerm);
277 return _term == it._term;
279 bool operator!=(
const iterator& it)
const {
280 ASSERT(_wordsPerTerm == it._wordsPerTerm);
281 return _term != it._term;
284 ptrdiff_t operator-(
const iterator& it)
const {
285 ASSERT(_wordsPerTerm == it._wordsPerTerm);
286 return (_term - it._term) / _wordsPerTerm;
288 iterator operator+(ptrdiff_t i)
const {
289 return iterator(_term + i * _wordsPerTerm, _wordsPerTerm);
291 iterator& operator=(
const iterator& it) {
292 ASSERT(it._wordsPerTerm == _wordsPerTerm);
299 const size_t _wordsPerTerm;
303 {
return iterator(_memory, getWordsPerTerm());}
304 const_iterator begin()
const
305 {
return const_iterator(_memory, getWordsPerTerm());}
308 {
return iterator(_memoryEnd, getWordsPerTerm());}
317 RawSquareFreeIdeal();
318 RawSquareFreeIdeal(
const RawSquareFreeIdeal&);
321 size_t _wordsPerTerm;
353 ASSERT(index < getGeneratorCount());
354 return _memory + index * getWordsPerTerm();
358 ASSERT(index < getGeneratorCount());
359 return _memory + index * getWordsPerTerm();
365 return _memory + index * getWordsPerTerm();
371 return _memory + index * getWordsPerTerm();
Represents a monomial ideal with int exponents.
Definition Ideal.h:27
Definition RawSquareFreeIdeal.h:219
Definition RawSquareFreeIdeal.h:260
Definition RawSquareFreeIdeal.h:37
void sortLexAscending()
Definition RawSquareFreeIdeal.cpp:623
size_t getNotRelativelyPrime(const Word *term)
Definition RawSquareFreeIdeal.cpp:513
bool isValid() const
Definition RawSquareFreeIdeal.cpp:774
bool hasFullSupport(const Word *ignore) const
Definition RawSquareFreeIdeal.cpp:545
void getGcdOfMultiples(Word *gcd, size_t var) const
Definition RawSquareFreeIdeal.cpp:455
bool operator==(const RawSquareFreeIdeal &ideal) const
Definition RawSquareFreeIdeal.cpp:597
size_t getExclusiveVarGenerator()
Definition RawSquareFreeIdeal.cpp:521
void getLcm(Word *lcm) const
Definition RawSquareFreeIdeal.cpp:765
size_t getMinSupportGen() const
Definition RawSquareFreeIdeal.cpp:435
void getVarDividesCounts(vector< size_t > &counts) const
Definition RawSquareFreeIdeal.cpp:366
void compact(const Word *remove)
Definition RawSquareFreeIdeal.cpp:264
void removeGenerator(size_t index)
Definition RawSquareFreeIdeal.cpp:480
void print(FILE *file) const
Definition RawSquareFreeIdeal.cpp:179
static size_t getBytesOfMemoryFor(size_t varCount, size_t generatorCount)
Definition RawSquareFreeIdeal.cpp:110
RawSquareFreeIdeal & operator=(const RawSquareFreeIdeal &ideal)
Definition RawSquareFreeIdeal.h:55
size_t getMaxSupportGen() const
Definition RawSquareFreeIdeal.cpp:415
Word * getGenerator(size_t index)
Definition RawSquareFreeIdeal.h:352
void colonReminimize(const Word *colon)
Definition RawSquareFreeIdeal.cpp:675
size_t getNonMultiple(size_t var) const
Definition RawSquareFreeIdeal.cpp:404
Word * getGeneratorUnsafe(size_t index)
Definition RawSquareFreeIdeal.h:362
size_t getMultiple(size_t var) const
Definition RawSquareFreeIdeal.cpp:393
size_t insert(const Ideal &ideal)
Definition RawSquareFreeIdeal.cpp:196
void transpose(Word *eraseVars=0)
Definition RawSquareFreeIdeal.cpp:168
void swap01Exponents()
Definition RawSquareFreeIdeal.cpp:651
void setToTransposeOf(const RawSquareFreeIdeal &ideal, Word *eraseVars=0)
Definition RawSquareFreeIdeal.cpp:140
bool isMinimallyGenerated() const
Definition RawSquareFreeIdeal.cpp:579
void getLcmOfNonMultiples(Word *lcm, size_t var) const
Definition RawSquareFreeIdeal.cpp:304
void insertNonMultiples(const Word *term, const RawSquareFreeIdeal &ideal)
Definition RawSquareFreeIdeal.cpp:490
unsigned long Word
Definition stdinc.h:60