if there's a pending marker from the entropy stream, return that otherwise, fetch from the stream and get a marker. if there's no marker, return 0xff,

/// Dot Product //////// 16 >> 32

16 >> 32

8 >> 32

* Clears the heap. */

@brief Rounds floating-point number to the nearest integer not smaller than the original. The function computes an integer i such that: \f[i \le \t

* Insert a new element in the heap. * * We select the next empty leaf node, and then keep moving any larger * parents down until the ri

set a bit to true * @param index the index of the bit to set to 1 */

* Starts the timer. */

initialize a callback-based context

initialize a callback-based context

initialize a callback-based context

* Stops the timer and updates timer value. */

16 >> 32

16 >> 32

8 >> 32

///////// Lookup table access ////////////////////

Reduce **/

Remove all elements in the set */

@brief Rounds floating-point number to the nearest integer not larger than the original. The function computes an integer i such that: \f[i \le \te

* Return a distinct random integer in greater or equal to 0 and less * than 'n' on each call. It should be called maximum 'n' times. * Retur

clean up the temporary component buffers

clean up the temporary component buffers

clean up the temporary component buffers