All Data Structures Namespaces Files Functions Variables Typedefs Enumerations Enumerator Macros Groups Pages
type_misc.h File Reference Detailed Descriptiontype definitions for miscellaneous datastructures Definition in file type_misc.h. #include "scip/def.h" Go to the source code of this file.
Macro Definition Documentation
compares two element indices result: < 0: ind1 comes before (is better than) ind2 = 0: both indices have the same value
Definition at line 128 of file type_misc.h.
compares two data element pointers result: < 0: elem1 comes before (is better than) elem2 = 0: both elements have the same value
Definition at line 136 of file type_misc.h.
gets the key of the given element Definition at line 139 of file type_misc.h.
returns TRUE iff both keys are equal Definition at line 142 of file type_misc.h.
returns the hash value of the key Definition at line 145 of file type_misc.h. Typedef Documentation
Definition at line 44 of file type_misc.h.
Sparse solution data structure Definition at line 51 of file type_misc.h.
(circular) Queue data structure Definition at line 57 of file type_misc.h.
Priority queue data structure Definition at line 63 of file type_misc.h.
Hash table element list to store single elements of a hash table Definition at line 72 of file type_misc.h.
Hash map element list to store single mappings of a hash map Definition at line 81 of file type_misc.h.
dynamic array for storing SCIP_Real values Definition at line 84 of file type_misc.h.
dynamic array for storing int values Definition at line 87 of file type_misc.h.
dynamic array for storing SCIP_Bool values Definition at line 90 of file type_misc.h.
dynamic array for storing pointers Definition at line 93 of file type_misc.h.
Resource activity data structure Definition at line 99 of file type_misc.h.
Resource profile data structure Definition at line 105 of file type_misc.h.
Directed graph data structure (stored as adjacency list) Definition at line 111 of file type_misc.h.
Binary tree data structure Definition at line 117 of file type_misc.h.
search node of binary tree Definition at line 120 of file type_misc.h. Enumeration Type Documentation
represents different confidence levels for (one-sided) hypothesis testing; in order to obtain two-sided confidence levels, calculate 2 * c - 1, i.e., if the one-sided confidence level is 90 %, the two-sided level is 80 % Definition at line 36 of file type_misc.h. |