Detailed Description
type definitions for miscellaneous datastructures
Definition in file type_misc.h.
#include "scip/def.h"
Go to the source code of this file.
Macros | |
#define | SCIP_DECL_SORTINDCOMP(x) int x (void* dataptr, int ind1, int ind2) |
#define | SCIP_DECL_SORTPTRCOMP(x) int x (void* elem1, void* elem2) |
#define | SCIP_DECL_HASHGETKEY(x) void* x (void* userptr, void* elem) |
#define | SCIP_DECL_HASHKEYEQ(x) SCIP_Bool x (void* userptr, void* key1, void* key2) |
#define | SCIP_DECL_HASHKEYVAL(x) uint64_t x (void* userptr, void* key) |
Enumerations | |
enum | SCIP_Confidencelevel { SCIP_CONFIDENCELEVEL_MIN = 0, SCIP_CONFIDENCELEVEL_LOW = 1, SCIP_CONFIDENCELEVEL_MEDIUM = 2, SCIP_CONFIDENCELEVEL_HIGH = 3, SCIP_CONFIDENCELEVEL_MAX = 4 } |
enum | SCIP_Hashmaptype { SCIP_HASHMAPTYPE_UNKNOWN = 0, SCIP_HASHMAPTYPE_POINTER = 1, SCIP_HASHMAPTYPE_REAL = 2, SCIP_HASHMAPTYPE_INT = 3 } |
Macro Definition Documentation
◆ SCIP_DECL_SORTINDCOMP
compares two element indices result: < 0: ind1 comes before (is better than) ind2 = 0: both indices have the same value
0: ind2 comes after (is worse than) ind2
Definition at line 164 of file type_misc.h.
◆ SCIP_DECL_SORTPTRCOMP
compares two data element pointers result: < 0: elem1 comes before (is better than) elem2 = 0: both elements have the same value
0: elem2 comes after (is worse than) elem2
Definition at line 172 of file type_misc.h.
◆ SCIP_DECL_HASHGETKEY
gets the key of the given element
Definition at line 175 of file type_misc.h.
◆ SCIP_DECL_HASHKEYEQ
returns TRUE iff both keys are equal
Definition at line 178 of file type_misc.h.
◆ SCIP_DECL_HASHKEYVAL
returns the hash value of the key
Definition at line 181 of file type_misc.h.
Typedef Documentation
◆ SCIP_CONFIDENCELEVEL
typedef enum SCIP_Confidencelevel SCIP_CONFIDENCELEVEL |
Definition at line 44 of file type_misc.h.
◆ SCIP_HASHMAPTYPE
typedef enum SCIP_Hashmaptype SCIP_HASHMAPTYPE |
Definition at line 54 of file type_misc.h.
◆ SCIP_SPARSESOL
typedef struct SCIP_SparseSol SCIP_SPARSESOL |
Sparse solution data structure
Definition at line 60 of file type_misc.h.
◆ SCIP_QUEUE
typedef struct SCIP_Queue SCIP_QUEUE |
(circular) Queue data structure
Definition at line 66 of file type_misc.h.
◆ SCIP_PQUEUE
typedef struct SCIP_PQueue SCIP_PQUEUE |
Priority queue data structure
Definition at line 72 of file type_misc.h.
◆ SCIP_HASHTABLE
typedef struct SCIP_HashTable SCIP_HASHTABLE |
◆ SCIP_MULTIHASH
typedef struct SCIP_MultiHash SCIP_MULTIHASH |
Hash table data structure which allows multiple occurences of an element
Definition at line 84 of file type_misc.h.
◆ SCIP_MULTIHASHLIST
typedef struct SCIP_MultiHashList SCIP_MULTIHASHLIST |
Hash table element list to store single elements of a multi hash table
Definition at line 87 of file type_misc.h.
◆ SCIP_HASHMAPENTRY
typedef struct SCIP_HashMapEntry SCIP_HASHMAPENTRY |
Hash map entry
Definition at line 90 of file type_misc.h.
◆ SCIP_HASHMAP
typedef struct SCIP_HashMap SCIP_HASHMAP |
◆ SCIP_HASHSET
typedef struct SCIP_HashSet SCIP_HASHSET |
◆ SCIP_REALARRAY
typedef struct SCIP_RealArray SCIP_REALARRAY |
dynamic array for storing SCIP_Real values
Definition at line 105 of file type_misc.h.
◆ SCIP_INTARRAY
typedef struct SCIP_IntArray SCIP_INTARRAY |
dynamic array for storing int values
Definition at line 108 of file type_misc.h.
◆ SCIP_BOOLARRAY
typedef struct SCIP_BoolArray SCIP_BOOLARRAY |
dynamic array for storing SCIP_Bool values
Definition at line 111 of file type_misc.h.
◆ SCIP_PTRARRAY
typedef struct SCIP_PtrArray SCIP_PTRARRAY |
dynamic array for storing pointers
Definition at line 114 of file type_misc.h.
◆ SCIP_RANDNUMGEN
typedef struct SCIP_RandNumGen SCIP_RANDNUMGEN |
random number generator
Definition at line 117 of file type_misc.h.
◆ SCIP_RESOURCEACTIVITY
typedef struct SCIP_ResourceActivity SCIP_RESOURCEACTIVITY |
Resource activity data structure
Definition at line 123 of file type_misc.h.
◆ SCIP_PROFILE
typedef struct SCIP_Profile SCIP_PROFILE |
Resource profile data structure
Definition at line 129 of file type_misc.h.
◆ SCIP_DIGRAPH
typedef struct SCIP_Digraph SCIP_DIGRAPH |
Directed graph data structure (stored as adjacency list)
Definition at line 135 of file type_misc.h.
◆ SCIP_BT
Binary tree data structure
Definition at line 141 of file type_misc.h.
◆ SCIP_BTNODE
typedef struct SCIP_BtNode SCIP_BTNODE |
search node of binary tree
Definition at line 144 of file type_misc.h.
◆ SCIP_REGRESSION
typedef struct SCIP_Regression SCIP_REGRESSION |
regression data structure to compute an incremental linear regression of paired observations
Definition at line 150 of file type_misc.h.
◆ SCIP_DISJOINTSET
typedef struct SCIP_DisjointSet SCIP_DISJOINTSET |
disjoint set (disjoint set (union find)) data structure for querying and updating connectedness of a graph with integer vertices 0,...,n - 1
Definition at line 156 of file type_misc.h.
Enumeration Type Documentation
◆ SCIP_Confidencelevel
enum SCIP_Confidencelevel |
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.
◆ SCIP_Hashmaptype
enum SCIP_Hashmaptype |
type of hashmap: are pointers, reals or ints stored, or unknown
Definition at line 47 of file type_misc.h.