! * @internal * @brief The implementation for @ref XXH32(). * * @param input , len , seed Directly passed from @ref XXH32(). * @param align Wheth

! * @internal * @brief Processes the last 0-15 bytes of @p ptr. * * There may be up to 15 bytes remaining to consume from the input. * This final

! * @internal * @brief Sets up the initial accumulator state for XXH32(). */

! * @internal * @brief Merges the accumulator lanes together for XXH32() */

! * @internal * @brief Scalar round for @ref XXH3_accumulate_512_scalar(). * * This is extracted to its own function because the NEON path uses a

! * @internal * @brief The implementation for @ref XXH64(). * * @param input , len , seed Directly passed from @ref XXH64(). * @param align Wheth

! * @internal * @brief Processes the last 0-31 bytes of @p ptr. * * There may be up to 31 bytes remaining to consume from the input. * This final

! * @internal * @brief Sets up the initial accumulator state for XXH64(). */

! * @internal * @brief Merges the accumulator lanes together for XXH64() */

gcc needs inline assembly */ Adapted from https://github.com/google/highwayhash/blob/master/highwayhash/hh_vsx.h. */

Erases the element pointed to by `it`. Unlike `std::unordered_set::erase`, this method returns void to reduce algorithmic complexity to O(1). In ord

@brief Checks whether @p elt will be invalidated by increasing the size of the vector by @p n */

@brief Checks whether any part of the range will be invalidated by growing */

@brief Assigns the content of the specified vector */

Span::back() Returns a reference to the last element of this span.

@brief Begin const iterator */

@brief End const iterator */

FIXME: configure is a terrible name

@brief View data */

Decode the next byte of a UTF8 sequence * @param [out] state The decoder state to advance * @param [out] codep The codepoint to fill in * @param [

Returns the window resolution in pixels as a `Vector2i` object

Sends any queued packets on the host specified to its designated peers. * * @param host host to flush * @remarks this function need only be

Force an immediate disconnection from a peer. * @param peer peer to disconnect * @param data data describing the disconnection * @remarks No

"erases" the object from the container, except that it doesn't actually destroy the object. It only updates all the metadata of the class. This can be

@brief Unbounded single-producer single-consumer FIFO queue (ring buffer) When the internal circular buffer becomes full, a new one will be create

@brief Copies @p v or return a reference, depending on @a ValueParamT */

@brief Returns a pointer to the first transit event in the buffer, or `nullptr` if the buffer is empty */