|
Macaulay2 Engine
|
Fixed-size, owned array of ElementTypes for the linear-algebra templates that want a flat buffer of tower-polynomial slots. More...
#include <aring-tower.hpp>
Public Member Functions | |
| ElementArray (const ARingTower &_R, size_t size) | |
| ~ElementArray () | |
| ElementType & | operator[] (size_t idx) |
| const ElementType & | operator[] (size_t idx) const |
| ElementType * | data () |
| const ElementType * | data () const |
Private Attributes | |
| const ARingTower & | R |
| const int | mSize |
| const std::unique_ptr< ElementType[]> | mData |
Fixed-size, owned array of ElementTypes for the linear-algebra templates that want a flat buffer of tower-polynomial slots.
Backed by a std::unique_ptr<ElementType[]>. Slots are zero-initialised at construction and cleared through ARingTower::clear in the destructor, so the array owns its tower polynomials.
Definition at line 162 of file aring-tower.hpp.