Code
Hub
Workspaces
Following
Trending
Connect
MCP
copy
Create free account
hub
/
github.com/cmuparlay/parlaylib
/ functions
Functions
1,507 in github.com/cmuparlay/parlaylib
⨍
Functions
1,507
◇
Types & classes
312
Method
firstIndex
include/parlay/hash_table.h:54
Method
first_index
examples/hash_map.h:32
Function
flatten
include/parlay/internal/delayed/flatten.h:282
Method
flatten_iterator
include/parlay/internal/block_delayed.h:53
Method
for_each
include/parlay/thread_specific.h:212
Function
force
include/parlay/internal/block_delayed.h:216
Method
forward_delayed_sequence
include/parlay/internal/stream_delayed.h:65
Method
free
Free storage obtained by alloc()
include/parlay/alloc.h:250
Function
from_bytes
include/parlay/utilities.h:53
Function
func
test/test_padded.cpp:11
Method
get
test/test_relocate.cpp:23
Method
get
include/parlay/utilities.h:352
Method
get_begin_block
test/range_utils.h:96
Method
get_begin_block
Return an iterator pointing to the beginning of block i
include/parlay/internal/delayed/flatten.h:269
Method
get_begin_block
Return an iterator pointing to the beginning of block i
include/parlay/internal/delayed/map.h:90
Method
get_begin_block
Return an iterator pointing to the beginning of block i
include/parlay/internal/delayed/filter_op.h:61
Method
get_begin_block
Return an iterator pointing to the beginning of block i
include/parlay/internal/delayed/scan.h:140
Method
get_begin_block
Return an iterator pointing to the beginning of block i
include/parlay/internal/delayed/filter.h:75
Method
get_block
include/parlay/internal/block_allocator.h:66
Method
get_bucket
include/parlay/internal/collect_reduce.h:101
Function
get_counts
include/parlay/internal/integer_sort.h:367
Method
get_current_scheduler
If the current thread is a worker of an existing scheduler, or the thread that spawned a scheduler, return the most recent such scheduler. Otherwise,
include/parlay/scheduler.h:103
Method
get_distribution
examples/helper/graph_utils.h:72
Method
get_granularity
include/parlay/scheduler.h:367
Method
get_index
include/parlay/hash_table.h:255
Method
get_job
include/parlay/scheduler.h:237
Method
get_key
include/parlay/internal/group_by.h:237
Method
get_list
Either grab a list from the global pool, or if there is none then allocate a new list
include/parlay/internal/block_allocator.h:113
Method
get_num_blocks
Returns the number of blocks
include/parlay/internal/delayed/flatten.h:266
Method
get_num_blocks
Returns the number of blocks in the range
include/parlay/internal/delayed/map.h:87
Method
get_num_blocks
Returns the number of blocks in the resulting range
include/parlay/internal/delayed/filter_op.h:58
Method
get_num_blocks
Returns the number of blocks in the range
include/parlay/internal/delayed/scan.h:137
Method
get_num_blocks
Returns the number of blocks in the filtered range
include/parlay/internal/delayed/filter.h:72
Method
get_raw_allocator
include/parlay/internal/sequence_base.h:152
Method
get_time
include/parlay/internal/get_time.h:19
Method
global_relabel
This does a BFS to relabel based on distance in the residual graph from the target. Uses ligra for the BFS.
examples/push_relabel_max_flow.h:157
Method
grid_graph
examples/helper/graph_utils.h:147
Function
group_by_index_
include/parlay/internal/group_by.h:290
Method
group_by_key_helper
include/parlay/internal/group_by.h:139
Method
hash
include/parlay/scheduler.h:305
Function
hash32
a 32-bit hash function
include/parlay/utilities.h:149
Function
hash32_2
include/parlay/utilities.h:159
Function
hash32_3
include/parlay/utilities.h:166
Method
hashToRange
include/parlay/hash_table.h:53
Method
hash_map
examples/hash_map.h:47
Method
hashtable
Size is the maximum number of values the hash table will hold. Overfilling the table could put it into an infinite loop.
include/parlay/hash_table.h:65
Method
hazptr_stack
include/parlay/internal/concurrency/hazptr_stack.h:46
Function
head
include/parlay/sequence.h:420
Method
header
include/parlay/internal/sequence_base.h:294
Method
heap_tree
constructor
examples/helper/heap_tree.h:32
Method
heap_tree
include/parlay/internal/heap_tree.h:38
Method
incrementIndex
include/parlay/hash_table.h:55
Method
index
benchmark/trigram_words.h:45
Method
init
include/parlay/alloc.h:277
Method
init
include/parlay/internal/group_by.h:104
Method
init
include/parlay/internal/group_by.h:143
Method
init
include/parlay/internal/group_by.h:176
Method
init
include/parlay/internal/group_by.h:205
Method
initialization_granularity
include/parlay/internal/sequence_base.h:64
Method
initialize
examples/push_relabel_max_flow.h:202
Method
initialize_iterators
include/parlay/internal/delayed/flatten.h:157
Method
initialize_list
include/parlay/internal/block_allocator.h:84
Function
input<double>
benchmark/bench_parsing.cpp:24
Function
input<float>
benchmark/bench_parsing.cpp:23
Function
input<int>
benchmark/bench_parsing.cpp:19
Function
input<long double>
benchmark/bench_parsing.cpp:25
Function
input<long long>
benchmark/bench_parsing.cpp:21
Function
input<long>
benchmark/bench_parsing.cpp:20
Function
insert
include/parlay/sequence.h:300
Method
insert
examples/hash_map.h:52
Function
integer_sort_
include/parlay/internal/integer_sort.h:324
Function
integer_sort_inplace
include/parlay/internal/integer_sort.h:340
Function
integer_sort_r
include/parlay/internal/integer_sort.h:149
Method
interactions_count
examples/nbody_fmm.h:299
Method
interior
examples/oct_tree.h:82
Method
interior
examples/huffman_tree.h:26
Method
interior_expansion
examples/nbody_fmm.h:177
Method
intrusive_acquire_retire
include/parlay/internal/concurrency/acquire_retire.h:78
Method
intrusive_get_next
include/parlay/internal/concurrency/hazptr_stack.h:33
Method
intrusive_set_next
include/parlay/internal/concurrency/hazptr_stack.h:37
Method
is_leaf
examples/radix_tree.h:43
Method
is_root
examples/helper/union_find.h:16
Function
is_whitespace
Return true if the given character is considered whitespace. Whitespace characters are ' ', '\f', '\n', '\r'. '\t'. '\v'.
include/parlay/primitives.h:1025
Method
iter
include/parlay/internal/stream_delayed.h:94
Method
iterator
Copy constructor and copy assignment
include/parlay/delayed_sequence.h:100
Method
iterator
include/parlay/internal/stream_delayed.h:34
Method
iterator_t
Conversion from non-const iterator to const iterator implicit */
test/range_utils.h:69
Method
iterator_t
include/parlay/worker_specific.h:97
Method
iterator_t
Conversion from non-const iterator to const iterator implicit */
include/parlay/internal/delayed/zip.h:76
Method
iterator_t
Conversion from non-const iterator to const iterator implicit */
include/parlay/internal/delayed/flatten.h:124
Method
iterator_t
Conversion from non-const iterator to const iterator implicit */
include/parlay/internal/delayed/map.h:67
Method
iterator_t
Conversion from non-const iterator to const iterator implicit */
include/parlay/internal/delayed/scan.h:110
Method
k_nearest_down
looks for nearest neighbors for p in subtree rooted at T. Can return immediately if radius to current k-th nearest point does not intersect the box.
examples/knn.h:99
Function
kth_smallest
include/parlay/primitives.h:1304
Method
laplacian
examples/spectral_separator.h:63
Method
le_list
examples/le_list.h:44
Method
leaf
examples/oct_tree.h:74
Method
leaf
examples/huffman_tree.h:21
Method
legacy_monoid_adapter
include/parlay/monoid.h:216
Method
lessEqIndex
include/parlay/hash_table.h:60
← previous
next →
901–1,000 of 1,507, ranked by callers