* if set is -1, append to previous set, 0 'a new one', and 1, prepend to the * guy we are about to stomp on. */

* Not strictly speaking an "up_ref" as a STACK doesn't have a reference * count but it has the same effect by duping the STACK and upping the ref of

Creates copies of all the items in another list and adds them to this one. This will use the ObjectType's copy constructor to try to create copies o

Inserts a new element into the array, assuming that the array is sorted. This will use the DefaultElementComparator class for sorting, so your Elem

Given an ASN1_ITEM CHOICE type return the selector value */

bit_range returns a |uint8_t| with bits |start|, inclusive, to |end|, * exclusive, set. */

* This processes one or more 64-byte data blocks, but does NOT update * the bit counters. There are no alignment requirements. */

Returns true if the array contains at least one occurrence of an object. @param elementToLookFor the value or object to look for @returns

copy_small_conditional copies in to out iff mask is all ones. */

BN_mod_exp_mont_consttime() stores the precomputed powers in a specific * layout so that accessing any of these table values shows the same access *

discardHandshakeBuffer is called when there is no more need to buffer the entirety of the handshake messages.

encrypt encrypts and macs the data in b.

Compare while ASCII ignoring case. */

feCSwap replaces (f,g) with (g,f) if b == 1; replaces (f,g) with (f,g) if b == 0. Preconditions: b in {0,1}.

Replace (f,g) with (g,f) if b == 1; * replace (f,g) with (f,g) if b == 0. * * Preconditions: b in {0,1}. */

h = -f * * Preconditions: * |f| bounded by 1.1*2^25,1.1*2^24,1.1*2^25,1.1*2^24,etc. * * Postconditions: * |h| bounded by 1.1*2^25,1.1*2^24

An alternative felem_diff for larger inputs |in| * felem_diff_zero107 subtracts |in| from |out| * On entry: * in[i] < 2^106 * On exit: * out[

Multiply a field element by a scalar: out = out * scalar * The scalars we actually use are small, so results fit without overflow */

=========================================================================== * Fill the window when the lookahead becomes insufficient. * Updates str

To preserve endianness when using BN_bn2bin and BN_bin2bn. */

To preserve endianness when using BN_bn2bin and BN_bin2bn */

r = p + q */

r = p */

Returns the last element in the array, or 0 if the array is empty. @see operator[], getUnchecked, getFirst */

Returns the object's current reference count. */

Returns the block's current allocated size, in bytes. */

========================================================================= */

========================================================================= */

Initialize state for writing a gzip file. Mark initialization by setting state->size to non-zero. Return -1 on failure or 0 on success. */