last update 20 Sep 2009 |
Go to the source code of this file.
Defines | |
#define | _CVR_PERFORMANCE_MATRIX_MATRIX_MULTIPLY 65 |
#define | _CVR_PERFORMANCE_QR_DECOMPOSITION 50 |
#define | _CVR_PERFORMANCE_SORT_STOP_QUICKSORT 10 |
#define | _CVR_PERFORMANCE_SMALLOBJECTLIST_HEAP_SEGMENT_SIZE 100 |
#define | _CVR_PERFORMANCE_LIST_OBJECT_SIZE_THRESHOLD 16 |
Usually, these constants are architecture dependent, mostly cache. The default values in this file were determined on a P4 1600 with 512 RAM.
#define _CVR_PERFORMANCE_LIST_OBJECT_SIZE_THRESHOLD 16 |
Object size threshold value for cvr::list (in bytes).
The list will be implemented as a smallObjectList for types whose size is less than or equal to this value, and as a std::list for all other types.
#define _CVR_PERFORMANCE_MATRIX_MATRIX_MULTIPLY 65 |
Multiplication of two matrices in cvr::matrix is faster if the second matrix is transposed first when that matrix is large.
Large is defined below.
#define _CVR_PERFORMANCE_QR_DECOMPOSITION 50 |
The QR decomposition algorithm (cvr::qrDecomposition) accesses the data matrix column wise.
Depending on the size it is faster to transpose first and transpose the results again.
#define _CVR_PERFORMANCE_SMALLOBJECTLIST_HEAP_SEGMENT_SIZE 100 |
The segment size of the heap in a smallObjectList.
Indicates the amount of nodes that will be allocated at once when there is no more available memory.
#define _CVR_PERFORMANCE_SORT_STOP_QUICKSORT 10 |
cvr::sort uses quicksort down to a certain number of elements to sort after which it uses a simple sorting algorithm.
The value below sets that threshold.