|
Macaulay2 Engine
|
Pure-M2 (no-FLINT) aring-style adapter for GF(p^n), using a discrete-log encoding plus an M2-side primitive table. More...
#include <aring-m2-gf.hpp>
Public Types | |
| typedef int | ElementType |
| typedef int | elem |
| typedef std::vector< elem > | ElementContainerType |
Static Public Member Functions | |
| static void | clear (elem &result) |
| 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) |
Static Public Attributes | |
| static const RingID | ringID = ring_GFM2 |
Static Private Member Functions | |
| static int | modulus_add (int a, int b, int p) |
| Arithmetic functions ///////. | |
| static int | modulus_sub (int a, int b, int p) |
Private Attributes | |
| GaloisFieldTable | mGF |
Pure-M2 (no-FLINT) aring-style adapter for GF(p^n), using a discrete-log encoding plus an M2-side primitive table.
Backed by an M2GFTable (the file's other class) that owns the [exp, log, one_table, primitive_element] machinery for the specific extension. Elements are int indices; multiplication and division are integer add / sub mod p^n - 1. ringID = ring_GFM2. Selected when FLINT's ARingGFFlint* rings are unavailable or undesirable (e.g. when reproducing legacy behaviour matters).
Definition at line 124 of file aring-m2-gf.hpp.