n_poly_stack_struct, n_poly_stack_t, n_bpoly_stack_struct, n_bpoly_stack_t, n_polyun_stack_struct, n_polyun_stack_t, n_poly_bpoly_stack_struct, n_poly_bpoly_stack_t, n_poly_polyun_stack_struct, n_poly_polyun_stack_t
Synopsis
#include <flint/n_poly.h>n_poly_stack_structn_poly_stack_tn_bpoly_stack_structn_bpoly_stack_tn_polyun_stack_structn_polyun_stack_tn_poly_bpoly_stack_structn_poly_bpoly_stack_tn_poly_polyun_stack_structn_poly_polyun_stack_tStacks of reusable temporaries: an array of pointers to initialised objects (array, alloc) and the index top of the first free one. Objects taken from a stack keep their memory when given back, so that loops do not allocate. The combined types hold one stack of each kind.
Cite this page
The FLINT team, “n_poly_stack_struct, n_poly_stack_t, n_bpoly_stack_struct, n_bpoly_stack_t, n_polyun_stack_struct, n_polyun_stack_t, n_poly_bpoly_stack_struct, n_poly_bpoly_stack_t, n_poly_polyun_stack_struct, n_poly_polyun_stack_t (n_poly.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/n_poly/n_poly_stack_struct.html (generated 2026-10-20).
@misc{flint-doc-n-poly-n-poly-stack-struct,
author = {{The FLINT team}},
title = {{n\_poly\_stack\_struct, n\_poly\_stack\_t, n\_bpoly\_stack\_struct, n\_bpoly\_stack\_t, n\_polyun\_stack\_struct, n\_polyun\_stack\_t, n\_poly\_bpoly\_stack\_struct, n\_poly\_bpoly\_stack\_t, n\_poly\_polyun\_stack\_struct, n\_poly\_polyun\_stack\_t (n\_poly.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/n_poly/n_poly_stack_struct.html},
note = {Generated 2026-10-20}
}