Fermat
|
This module implements a statically sized array using registers as backing storage. The ability to be placed in registers is achieved by avoiding dynamic indexing, replacing that by an explicit O(log(N)) binary-search.
Classes | |
struct | cugar::register_array< Iterator, SIZE > |
struct | cugar::register_array< Iterator, 4 > |
struct | cugar::register_array< Iterator, 5 > |
struct | cugar::register_array< Iterator, 8 > |
struct | cugar::register_array< Iterator, 16 > |
Functions | |
template<uint32 SIZE, typename iterator_type > | |
iterator_traits< iterator_type >::reference | cugar::dynamic_index (const iterator_type &T, const uint32 i) |
iterator_traits<iterator_type>::reference cugar::dynamic_index | ( | const iterator_type & | T, |
const uint32 | i | ||
) |
a free function to perform dynamic indexing on vectors / iterators using a statically compiled binary search