Get element values

A vector containing the minor indices of the elements in the packed matrix. Note that there might be gaps in this list, entries that do not

@name Get methods. */ @{ Get the size

\returns a const pointer to the array of inner indices. * This function is aimed at interoperability with other libraries. * \sa valuePtr(

------------------------------------------------------------------- insert cuts into collection ------------------------------------------------------

Getter for whether the node is the root of the tree. The parent of the root of the tree is the leftmost node in the tree which is guaranteed to be a l

Return handler

\returns the number of rows of the matrix */

\returns the size of a side of the respective square matrix, i.e., the number of indices */

Number of literals in the clause.

Returns solver - has current state

\returns a const pointer to the array of values. * This function is aimed at interoperability with other libraries. * \sa innerIndexPtr(),

Field accessors. Note: All but year() return an int.

Returns the number of words needed to store size bits.

Copies src to dst interpreting as flag value type pointers.

This is used during the deterministic time computation to convert a given number of floating-point operations to something in the same order of magnit

Returns a pointer to a control byte group that can be used by empty tables.

Returns a view of the line.

Extracts the H2 portion of a hash: the 7 bits not used for H1. These are used as an occupied control byte.

Check whether or not the AnyInvocable is in the empty state.

TODO(user): This is one of the rare case where it is better to use Equality() rather than two Implications(). Maybe we should modify our internal impl

Returns -1 if the element is not in the vector, or its unique index if it is.

Returns true if the given value is finite, that means for a double: not a NaN and not +/- infinity.

Small utility functions to deal with negative variable/literal references.

The number of elements that are split into shards.

Used for tags, could read up to 5 bytes which must be available. Additionally it makes sure the unsigned value fits a int32_t, otherwise returns nullp

Returns kNilArc if the graph has no arcs arc if it has at least one arc. Useful for initializing iterators correctly in the case of empty graphs.

Returns kNilNode if the graph has no nodes or node if it has at least one node. Useful for initializing iterators correctly in the case of empty graph