Dash Core Source Documentation (0.16.0.1)
Find detailed information regarding the Dash Core source code.
immer Namespace Reference
Namespaces | |
detail | |
Classes | |
class | array |
class | array_transient |
class | atom |
class | box |
struct | cpp_heap |
struct | disowned |
class | dvektor |
class | enable_intrusive_ptr |
struct | enable_optimized_heap_policy |
class | flex_vector |
class | flex_vector_transient |
struct | free_list_heap |
struct | free_list_heap_policy |
struct | free_list_node |
class | gc_heap |
struct | gc_transience_policy |
struct | get_prefer_fewer_bigger_objects |
struct | get_transience_policy |
struct | get_use_transient_rvalues |
struct | heap_policy |
struct | identity_heap |
struct | malloc_heap |
class | map |
class | map_transient |
struct | memory_policy |
struct | no_refcount_policy |
struct | no_spinlock |
struct | no_transience_policy |
struct | norefs_tag |
struct | refcount_policy |
class | set |
class | set_transient |
struct | spinlock |
struct | split_heap |
struct | thread_local_free_list_heap |
struct | unsafe_free_list_heap |
struct | unsafe_free_list_heap_policy |
struct | unsafe_refcount_policy |
class | vector |
class | vector_transient |
struct | with_data |
struct | with_free_list_node |
Typedefs | |
template<typename Base > | |
using | debug_size_heap = identity_heap< Base > |
template<typename T > | |
using | get_transience_policy_t = typename get_transience_policy< T >::type |
using | default_heap_policy = free_list_heap_policy< cpp_heap > |
using | default_refcount_policy = refcount_policy |
using | default_memory_policy = memory_policy< default_heap_policy, default_refcount_policy > |
Functions | |
template<typename Range , typename Fn > | |
void | for_each_chunk (const Range &r, Fn &&fn) |
template<typename Iterator , typename Fn > | |
void | for_each_chunk (const Iterator &first, const Iterator &last, Fn &&fn) |
template<typename T , typename Fn > | |
void | for_each_chunk (const T *first, const T *last, Fn &&fn) |
template<typename Range , typename Fn > | |
bool | for_each_chunk_p (const Range &r, Fn &&fn) |
template<typename Iterator , typename Fn > | |
bool | for_each_chunk_p (const Iterator &first, const Iterator &last, Fn &&fn) |
template<typename T , typename Fn > | |
bool | for_each_chunk_p (const T *first, const T *last, Fn &&fn) |
template<typename Range , typename T > | |
T | accumulate (Range &&r, T init) |
template<typename Range , typename T , typename Fn > | |
T | accumulate (Range &&r, T init, Fn fn) |
template<typename Iterator , typename T > | |
T | accumulate (Iterator first, Iterator last, T init) |
template<typename Iterator , typename T , typename Fn > | |
T | accumulate (Iterator first, Iterator last, T init, Fn fn) |
template<typename Range , typename Fn > | |
Fn && | for_each (Range &&r, Fn &&fn) |
template<typename Iterator , typename Fn > | |
Fn && | for_each (Iterator first, Iterator last, Fn &&fn) |
template<typename Range , typename OutIter > | |
OutIter | copy (Range &&r, OutIter out) |
template<typename InIter , typename OutIter > | |
OutIter | copy (InIter first, InIter last, OutIter out) |
template<typename Range , typename Pred > | |
bool | all_of (Range &&r, Pred p) |
template<typename Iter , typename Pred > | |
bool | all_of (Iter first, Iter last, Pred p) |
Variables | |
const auto | default_bits = 5 |
const auto | default_free_list_size = 1 << 10 |
template<typename T > | |
constexpr auto | get_prefer_fewer_bigger_objects_v |
template<typename T > | |
constexpr auto | get_use_transient_rvalues_v = get_use_transient_rvalues<T>::value |
Typedef Documentation
◆ debug_size_heap
template<typename Base >
using immer::debug_size_heap = typedef identity_heap<Base> |
Definition at line 50 of file debug_size_heap.hpp.
◆ default_heap_policy
using immer::default_heap_policy = typedef free_list_heap_policy<cpp_heap> |
The default heap policy just uses the standard heap with a free_list_heap_policy. If IMMER_NO_FREE_LIST
is defined to 1
then it just uses the standard heap.
Definition at line 118 of file memory_policy.hpp.
◆ default_memory_policy
using immer::default_memory_policy = typedef memory_policy< default_heap_policy, default_refcount_policy> |
The default memory policy.
Definition at line 136 of file memory_policy.hpp.
◆ default_refcount_policy
using immer::default_refcount_policy = typedef refcount_policy |
By default we use thread safe reference counting.
Definition at line 128 of file memory_policy.hpp.
◆ get_transience_policy_t
template<typename T >
using immer::get_transience_policy_t = typedef typename get_transience_policy<T>::type |
Definition at line 35 of file memory_policy.hpp.
Variable Documentation
◆ default_bits
const auto immer::default_bits = 5 |
Definition at line 63 of file config.hpp.
◆ default_free_list_size
const auto immer::default_free_list_size = 1 << 10 |
Definition at line 64 of file config.hpp.
◆ get_prefer_fewer_bigger_objects_v
template<typename T >
constexpr auto immer::get_prefer_fewer_bigger_objects_v |
Initial value:
=
get_prefer_fewer_bigger_objects<T>::value
Definition at line 51 of file memory_policy.hpp.
◆ get_use_transient_rvalues_v
template<typename T >
constexpr auto immer::get_use_transient_rvalues_v = get_use_transient_rvalues<T>::value |
Definition at line 67 of file memory_policy.hpp.