hash_t
Synopsis
#include <flint/qsieve.h>hash_tAn entry of the hash table of large primes: the prime, the index of the next entry in its chain, its number of occurrences, and its parent in the union-find forest of the graph of large primes.
Cite this page
The FLINT team, “hash_t (qsieve.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/qsieve/hash_t.html (generated 2026-10-20).
@misc{flint-doc-qsieve-hash-t,
author = {{The FLINT team}},
title = {{hash\_t (qsieve.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/qsieve/hash_t.html},
note = {Generated 2026-10-20}
}