acb_mzeta_cache_struct, acb_mzeta_cache_t
Synopsis
#include <flint/acb_mzeta.h>acb_mzeta_cache_structacb_mzeta_cache_tAn opaque store of data that algorithms precompute and may reuse between calls with the same lattice or parameters: the reduced lattice (LLL-reduced basis, Cholesky factors, tail-bound constants), and the tables of the double-precision algorithm (one per value of ). A cache may be shared by different algorithms; the most recent entries of each kind are kept. A cache is not thread-safe: use one per thread.
Cite this page
The FLINT team, “acb_mzeta_cache_struct, acb_mzeta_cache_t (acb_mzeta.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/acb_mzeta/acb_mzeta_cache_struct.html (generated 2026-11-07).
@misc{flint-doc-acb-mzeta-acb-mzeta-cache-struct,
author = {{The FLINT team}},
title = {{acb\_mzeta\_cache\_struct, acb\_mzeta\_cache\_t (acb\_mzeta.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/acb_mzeta/acb_mzeta_cache_struct.html},
note = {Generated 2026-11-07}
}