MCPcopy Create free account

hub / github.com/cmuparlay/parlaylib / functions

Functions1,507 in github.com/cmuparlay/parlaylib

↓ 4 callersFunctionnum_workers
include/parlay/internal/scheduler_plugins/tbb.h:17
↓ 4 callersFunctionpowers
examples/fast_fourier_transform.h:38
↓ 4 callersMethodpush
Insert the object t at the top of the stack This operation is safe to perform concurrently with other operations
include/parlay/internal/concurrency/hazptr_stack.h:58
↓ 4 callersFunctionrandom_shuffle
examples/knuth_shuffle.h:21
↓ 4 callersFunctionremove_duplicate_integers
include/parlay/internal/group_by.h:269
↓ 4 callersFunctionscan
include/parlay/primitives.h:118
↓ 4 callersFunctionscan
include/parlay/internal/block_delayed.h:150
↓ 4 callersFunctionseq_sort_inplace
include/parlay/internal/sample_sort.h:77
↓ 4 callersFunctionsequence
creates an empty sequence
include/parlay/sequence.h:107
↓ 4 callersMethodsize
Returns the number of elements in the flattened range
include/parlay/internal/delayed/flatten.h:144
↓ 4 callersFunctionsplit
include/parlay/internal/transpose.h:31
↓ 4 callersFunctionto_short_sequence
include/parlay/sequence.h:743
↓ 4 callersMethodupdate
include/parlay/internal/group_by.h:240
↓ 4 callersMethodword
generates a string until the next space (space not included)
benchmark/trigram_words.h:89
↓ 3 callersFunctionBFS
examples/BFS.h:13
↓ 3 callersFunction__cxx_atomic_notify_all
include/parlay/internal/atomic_wait.h:229
↓ 3 callersFunction__do_direct_wait
include/parlay/internal/atomic_wait.h:127
↓ 3 callersFunction__do_direct_wake
include/parlay/internal/atomic_wait.h:131
↓ 3 callersMethodacquire
include/parlay/internal/concurrency/acquire_retire.h:82
↓ 3 callersMethodbegin
test/range_utils.h:121
↓ 3 callersFunctioncbegin
include/parlay/sequence.h:139
↓ 3 callersFunctioncend
include/parlay/sequence.h:140
↓ 3 callersFunctionchars_to_int
include/parlay/io.h:246
↓ 3 callersFunctionchars_to_stream
Writes a character sequence to a stream
include/parlay/io.h:56
↓ 3 callersMethodclear
include/parlay/internal/pool_allocator.h:185
↓ 3 callersFunctionclear_relocated
if all elements have been relocated out of this sequence then don't destroy them (it would not only be inefficient, but incorrect). Note that this is
include/parlay/sequence.h:363
↓ 3 callersFunctioncut
include/parlay/sequence.h:428
↓ 3 callersMethoddestroy
Destroy an object obtained by create(...) and deallocate its storage
include/parlay/alloc.h:264
↓ 3 callersFunctiondot
examples/2d_linear_program.h:37
↓ 3 callersFunctionempty
include/parlay/sequence.h:171
↓ 3 callersMethodend
test/range_utils.h:122
↓ 3 callersMethodequal
include/parlay/internal/collect_reduce.h:195
↓ 3 callersFunctionexecute_with_scheduler
include/parlay/parallel.h:219
↓ 3 callersFunctionfind
examples/suffix_tree.h:33
↓ 3 callersFunctionfind_end
include/parlay/primitives.h:695
↓ 3 callersFunctionflatten
include/parlay/primitives.h:977
↓ 3 callersFunctionflatten
include/parlay/internal/block_delayed.h:232
↓ 3 callersMethodfree_buffer
This unfortunately can not go in the destructor and be done automatically because we need a reference to the allocator to deallocate the buffer, and w
include/parlay/internal/sequence_base.h:312
↓ 3 callersFunctionget_bucket_counts
include/parlay/internal/sample_sort.h:41
↓ 3 callersMethodget_end_block
Returns an interator pointing to the end of block i
include/parlay/internal/delayed/common.h:191
↓ 3 callersFunctionget_global_transform
examples/nbody_fmm.h:121
↓ 3 callersFunctionget_matrices
test/test_monoid.cpp:45
↓ 3 callersFunctionget_range
examples/ray_trace.h:43
↓ 3 callersMethodget_string
examples/radix_tree.h:45
↓ 3 callersFunctionhash64_2
a slightly cheaper, but possibly not as good version based on splitmix64
include/parlay/utilities.h:190
↓ 3 callersMethodinitialize_explicit
include/parlay/internal/sequence_base.h:498
↓ 3 callersFunctioninsert_range
include/parlay/sequence.h:649
↓ 3 callersFunctioninteger_sort
include/parlay/internal/integer_sort.h:349
↓ 3 callersFunctionintersect
intersection point of two (non-parallel) constraints
examples/2d_linear_program.h:43
↓ 3 callersMethodis_end
examples/box_kdtree.h:43
↓ 3 callersFunctionis_partitioned
include/parlay/primitives.h:932
↓ 3 callersFunctionis_sorted_until
include/parlay/primitives.h:914
↓ 3 callersFunctionkdtree_from_boxes
examples/box_kdtree.h:223
↓ 3 callersFunctionlcp
examples/longest_common_prefix.h:18
↓ 3 callersFunctionmap_reduce
examples/lasso_regression.h:38
↓ 3 callersFunctionmap_split_at
include/parlay/primitives.h:1146
↓ 3 callersFunctionminmax_element
include/parlay/primitives.h:837
↓ 3 callersFunctionmismatch
include/parlay/primitives.h:652
↓ 3 callersFunctionnone_of
include/parlay/primitives.h:580
↓ 3 callersFunctionnum_blocks_and_size
include/parlay/internal/block_delayed.h:80
↓ 3 callersFunctionnum_blocks_from_size
include/parlay/internal/delayed/common.h:68
↓ 3 callersFunctionp_free
Free a block of memory obtained by p_malloc
include/parlay/alloc.h:130
↓ 3 callersFunctionp_malloc
Allocate size bytes of uninitialized storage. Optionally ask for an aligned buffer of memory with the given alignment. By default, the alignment is a
include/parlay/alloc.h:112
↓ 3 callersFunctionpack_index
include/parlay/primitives.h:238
↓ 3 callersFunctionrandom_shuffle
include/parlay/random.h:143
↓ 3 callersFunctionreduce
include/parlay/internal/sequence_ops.h:192
↓ 3 callersFunctionreduce_serial
include/parlay/internal/sequence_ops.h:179
↓ 3 callersMethodrelease
include/parlay/internal/concurrency/acquire_retire.h:94
↓ 3 callersFunctionrelocate_or_move_and_destroy
include/parlay/relocation.h:61
↓ 3 callersFunctionscan_
include/parlay/internal/sequence_ops.h:241
↓ 3 callersFunctionscan_serial
include/parlay/internal/sequence_ops.h:214
↓ 3 callersFunctionseq_count_
include/parlay/internal/counting_sort.h:36
↓ 3 callersFunctionseq_radix_sort_
include/parlay/internal/integer_sort.h:46
↓ 3 callersFunctionstable_integer_sort_inplace
include/parlay/primitives.h:437
↓ 3 callersFunctionsum_bools_serial
include/parlay/internal/sequence_ops.h:287
↓ 3 callersMethodswap
include/parlay/internal/file_map.h:86
↓ 3 callersFunctionz_tree
examples/oct_tree.h:123
↓ 2 callersFunctionHeapInt
test/test_integer_sort.cpp:45
↓ 2 callersFunctionLeaf
allocate and initialize a leaf
examples/decision_tree_c45.h:55
↓ 2 callersFunction__cxx_atomic_try_wait_slow_fallback
include/parlay/internal/atomic_wait.h:211
↓ 2 callersFunction__cxx_atomic_wait
include/parlay/internal/atomic_wait.h:336
↓ 2 callersFunctionadjacent_find
include/parlay/primitives.h:632
↓ 2 callersFunctionappend_n
include/parlay/sequence.h:590
↓ 2 callersFunctionappend_range
include/parlay/sequence.h:602
↓ 2 callersFunctionbase_sort
include/parlay/internal/bucket_sort.h:120
↓ 2 callersMethodbegin
include/parlay/internal/posix/file_map_impl_posix.h:36
↓ 2 callersFunctionbinary_search
include/parlay/internal/binary_search.h:23
↓ 2 callersFunctionbit_reverse
examples/fast_fourier_transform.h:87
↓ 2 callersFunctionbound_box
examples/oct_tree.h:55
↓ 2 callersFunctionbuild_tree
examples/nbody_fmm.h:245
↓ 2 callersFunctioncartesian_tree
examples/cartesian_tree.h:47
↓ 2 callersMethodcenter
examples/nbody_fmm.h:210
↓ 2 callersFunctionchars_to_file
Writes a character sequence to a file, returns 0 if successful
include/parlay/io.h:61
↓ 2 callersFunctionchars_to_long_long
include/parlay/io.h:248
↓ 2 callersMethodcheck_reset
examples/helper/speculative_for.h:33
↓ 2 callersMethodcleanup
include/parlay/internal/concurrency/acquire_retire.h:46
↓ 2 callersFunctionclosest_point
examples/kmeans_pp.h:38
↓ 2 callersFunctioncount_if_index
include/parlay/primitives.h:502
↓ 2 callersFunctioncounting_sort_by_keys
include/parlay/primitives.h:488
↓ 2 callersMethodcross
examples/ray_trace.h:28
← previousnext →201–300 of 1,507, ranked by callers