_fmpz_mpoly_radix_sort1, _fmpz_mpoly_radix_sort
Synopsis
#include <flint/fmpz_mpoly.h>void _fmpz_mpoly_radix_sort1(fmpz_mpoly_t A, slong left, slong right, flint_bitcnt_t pos, ulong cmpmask, ulong totalmask)sourcevoid _fmpz_mpoly_radix_sort(fmpz_mpoly_t A, slong left, slong right, flint_bitcnt_t pos, slong N, ulong * cmpmask)sourceThe recursive steps of fmpz_mpoly_sort_terms: sort the terms of index in [\mathit{left}, \mathit{right}) by the bits of their monomials at positions \mathit{pos}, \mathit{pos} - 1, \ldots, 0, assuming the higher bits are equal. The first version is for one-word monomials and skips the bit positions not set in totalmask.
Cite this page
The FLINT team, “_fmpz_mpoly_radix_sort1, _fmpz_mpoly_radix_sort (fmpz_mpoly.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/fmpz_mpoly/_fmpz_mpoly_radix_sort1.html (generated 2026-10-20).
@misc{flint-doc-fmpz-mpoly-fmpz-mpoly-radix-sort1,
author = {{The FLINT team}},
title = {{\_fmpz\_mpoly\_radix\_sort1, \_fmpz\_mpoly\_radix\_sort (fmpz\_mpoly.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/fmpz_mpoly/_fmpz_mpoly_radix_sort1.html},
note = {Generated 2026-10-20}
}