Compute modular inversion of the whole group

Compute modular inversion of the whole group

This prototype is compatible with stdlib's qsort(). * return : >0 if *h128_1 > *h128_2 * <0 if *h128_1 < *h128_2 * =0 if *h128_

! @ingroup xxh3_family */

! @ingroup xxh3_family */

* A bit slower than XXH3_mix16B, but handles multiply by zero better. */

! @ingroup xxh3_family */

! @ingroup xxh3_family */

* It's important for performance that XXH3_hashLong is not inlined. */

* It's important for performance that XXH3_hashLong is not inlined. */

* It's important for performance that XXH3_hashLong is not inlined. */

* Assumption: `secret` size is >= XXH3_SECRET_SIZE_MIN */

! @ingroup xxh3_family */

! @ingroup xxh3_family */

return : 1 is equal, 0 if different */ ! @ingroup xxh3_family */

! * @ingroup xxh32_family * The default return values from XXH functions are unsigned 32 and 64 bit * integers. * * The canonical representation

! @ingroup xxh32_family */

! @ingroup xxh32_family */

! @ingroup xxh32_family */

! @ingroup xxh32_family */