MCPcopy Create free account

hub / github.com/arximboldi/immer / functions

Functions2,869 in github.com/arximboldi/immer

Methodbegin
! * Returns an iterator pointing at the first element of the * collection. It does not allocate memory and its complexity is * @f$ O(1)
immer/array_transient.hpp:64
Methodbegin
! * Returns an iterator pointing at the first element of the * collection. It does not allocate memory and its complexity is * @f$ O(1)
immer/vector.hpp:147
Methodbegin
! * Returns an iterator pointing at the first element of the * collection. It does not allocate memory and its complexity is * @f$ O(1)
immer/map_transient.hpp:74
Methodbegin
! * Returns an iterator pointing at the first element of the * collection. It does not allocate memory and its complexity is * @f$ O(1)
immer/table.hpp:240
Methodbegin
! * Returns an iterator pointing at the first element of the * collection. It does not allocate memory and its complexity is * @f$ O(1)
immer/array.hpp:109
Methodbegin
! * Returns an iterator pointing at the first element of the * collection. It does not allocate memory and its complexity is * @f$ O(1)
immer/set_transient.hpp:63
Methodbegin
! * Returns an iterator pointing at the first element of the * collection. It does not allocate memory and its complexity is * @f$ O(1)
immer/table_transient.hpp:65
Methodbegin
! * Returns an iterator pointing at the first element of the * collection. It does not allocate memory and its complexity is * @f$ O(1)
immer/flex_vector.hpp:146
Methodbegin
! * Returns an iterator pointing at the first element of the * collection. It does not allocate memory and its complexity is * @f$ O(1)
immer/vector_transient.hpp:79
Methodbegin
! * Returns an iterator pointing at the first element of the * collection. It does not allocate memory and its complexity is * @f$ O(1)
immer/set.hpp:122
Methodbegin
immer/detail/hamts/bits.hpp:169
Functionbenchmark_access
benchmark/set/access.hpp:80
Functionbenchmark_access_coro
benchmark/vector/access.hpp:110
Functionbenchmark_access_hamt
benchmark/set/access.hpp:55
Functionbenchmark_access_idx
benchmark/vector/access.hpp:136
Functionbenchmark_access_idx_std
benchmark/vector/access.hpp:55
Functionbenchmark_access_iter
benchmark/vector/access.hpp:92
Functionbenchmark_access_iter
benchmark/set/iter.hpp:87
Functionbenchmark_access_iter_std
benchmark/vector/access.hpp:40
Functionbenchmark_access_random
benchmark/vector/access.hpp:190
Functionbenchmark_access_random_std
benchmark/vector/access.hpp:73
Functionbenchmark_access_reduce
benchmark/vector/access.hpp:156
Functionbenchmark_access_reduce
benchmark/set/iter.hpp:68
Functionbenchmark_access_reduce_chunkedseq
benchmark/vector/access.hpp:22
Functionbenchmark_access_reduce_range
benchmark/vector/access.hpp:173
Functionbenchmark_access_std
benchmark/set/access.hpp:33
Functionbenchmark_access_std_iter
benchmark/set/iter.hpp:49
Functionbenchmark_assoc
benchmark/vector/assoc.hpp:53
Functionbenchmark_assoc_move
benchmark/vector/assoc.hpp:74
Functionbenchmark_assoc_mut
benchmark/vector/assoc.hpp:119
Functionbenchmark_assoc_mut_random
benchmark/vector/assoc.hpp:140
Functionbenchmark_assoc_random
benchmark/vector/assoc.hpp:97
Functionbenchmark_assoc_random_std
benchmark/vector/assoc.hpp:33
Functionbenchmark_assoc_std
benchmark/vector/assoc.hpp:16
Functionbenchmark_bad_access
benchmark/set/access.hpp:147
Functionbenchmark_bad_access_hamt
benchmark/set/access.hpp:123
Functionbenchmark_bad_access_std
benchmark/set/access.hpp:102
Functionbenchmark_concat
benchmark/vector/concat.hpp:18
Functionbenchmark_concat_incr
benchmark/vector/concat.hpp:42
Functionbenchmark_concat_incr_chunkedseq
benchmark/vector/concat.hpp:109
Functionbenchmark_concat_incr_mut
benchmark/vector/concat.hpp:61
Functionbenchmark_concat_incr_mut2
benchmark/vector/concat.hpp:80
Functionbenchmark_drop
benchmark/vector/drop.hpp:16
Functionbenchmark_drop_lin
benchmark/vector/drop.hpp:33
Functionbenchmark_drop_move
benchmark/vector/drop.hpp:52
Functionbenchmark_drop_mut
benchmark/vector/drop.hpp:71
Functionbenchmark_erase
benchmark/set/erase.hpp:44
Functionbenchmark_erase_move
benchmark/set/erase.hpp:65
Functionbenchmark_erase_mut_std
benchmark/set/erase.hpp:23
Functionbenchmark_insert
benchmark/set/insert.hpp:39
Functionbenchmark_insert_move
benchmark/set/insert.hpp:55
Functionbenchmark_insert_mut_std
benchmark/set/insert.hpp:23
Functionbenchmark_memory_basic
benchmark/set/memory/memory.hpp:140
Functionbenchmark_memory_basic_std
benchmark/set/memory/memory.hpp:118
Functionbenchmark_memory_exp
benchmark/set/memory/memory.hpp:205
Functionbenchmark_memory_exp_std
benchmark/set/memory/memory.hpp:178
Functionbenchmark_memory_lin
benchmark/set/memory/memory.hpp:287
Functionbenchmark_memory_lin_std
benchmark/set/memory/memory.hpp:250
Functionbenchmark_push
benchmark/vector/push.hpp:67
Functionbenchmark_push_front_librrb
benchmark/vector/push_front.hpp:30
Functionbenchmark_push_librrb
benchmark/vector/push.hpp:83
Functionbenchmark_push_move
benchmark/vector/push.hpp:50
Functionbenchmark_push_mut
benchmark/vector/push.hpp:33
Functionbenchmark_push_mut_librrb
benchmark/vector/push.hpp:95
Functionbenchmark_push_mut_std
benchmark/vector/push.hpp:16
Functionbenchmark_take
benchmark/vector/take.hpp:16
Functionbenchmark_take_lin
benchmark/vector/take.hpp:33
Functionbenchmark_take_move
benchmark/vector/take.hpp:52
Functionbenchmark_take_mut
benchmark/vector/take.hpp:71
Methodbig_object
test/extra/persist/test_vectors.cpp:552
Functionbind_vector
extra/js/immer.cpp:56
Methodbox
immer/box.hpp:56
Functionbucket_print
tools/include/prettyprint.hpp:420
Methodbucket_print_wrapper
tools/include/prettyprint.hpp:402
Methodcan_mutate
immer/transience/no_transience_policy.hpp:35
Methodcan_mutate
immer/transience/gc_transience_policy.hpp:99
Functioncan_relax
immer/detail/rbts/node.hpp:870
Functioncancel
()
extra/js/lib/lodash.js:9916
FunctioncastArray
* Casts `value` as an array if it's not one. * * @static * @memberOf _ * @since 4.4.0 * @category Lang * @param {*} valu
extra/js/lib/lodash.js:10523
FunctioncastArrayLikeObject
* Casts `value` to an empty array if it's not an array like object. * * @private * @param {*} value The value to inspect. * @retur
extra/js/lib/lodash.js:4119
Functioncereal_load_with_pools
immer/extra/persist/cereal/load.hpp:21
Functionch
(a,b,c)
extra/js/lib/mori.js:347
Methodchamp
immer/detail/hamts/champ.hpp:152
Methodchamp_iterator
immer/detail/hamts/champ_iterator.hpp:31
Functioncheck_call_once
extra/guile/scm/detail/util.hpp:27
Methodchildren
(self)
tools/gdb_pretty_printers/printers.py:397
Methodchildren
(self)
tools/gdb_pretty_printers/printers.py:413
Methodchildren
(self)
tools/gdb_pretty_printers/printers.py:429
Methodchildren
(self)
tools/gdb_pretty_printers/printers.py:442
Methodchildren
(self)
tools/gdb_pretty_printers/printers.py:456
Methodchildren_count_corrupted_exception
immer/extra/persist/detail/champ/input.hpp:17
Functionchunk
* Creates an array of elements split into groups the length of `size`. * If `array` can't be split evenly, the final chunk will be the remaining
extra/js/lib/lodash.js:6322
Functionclamp
* Clamps `number` within the inclusive `lower` and `upper` bounds. * * @static * @memberOf _ * @since 4.0.0 * @category Numbe
extra/js/lib/lodash.js:13483
Methodclearlsbit
immer/detail/hamts/bits.hpp:136
Functionclone
* Creates a new benchmark using the same test and options. * * @memberOf Benchmark * @param {Object} options Options object to overwrit
extra/js/lib/benchmark.js:1367
Functionclone
* Creates a shallow clone of `value`. * * **Note:** This method is loosely based on the * [structured clone algorithm](https://mdn.io/S
extra/js/lib/lodash.js:10557
FunctioncloneDeepWith
* This method is like `_.cloneWith` except that it recursively clones `value`. * * @static * @memberOf _ * @since 4.0.0 * @ca
extra/js/lib/lodash.js:10646
FunctioncloneSuite
* Creates a new suite with cloned benchmarks. * * @name clone * @memberOf Benchmark.Suite * @param {Object} options Options object
extra/js/lib/benchmark.js:1087
FunctioncloneWith
* This method is like `_.clone` except that it accepts `customizer` which * is invoked to produce the cloned value. If `customizer` returns `unde
extra/js/lib/lodash.js:10592
Functioncompact
* Creates an array with all falsey values removed. The values `false`, `null`, * `0`, `""`, `undefined`, and `NaN` are falsey. * * @sta
extra/js/lib/lodash.js:6357
← previousnext →1,401–1,500 of 2,869, ranked by callers