Code
Hub
Workspaces
Following
Trending
Connect
MCP
copy
Create free account
hub
/
github.com/BartoszMilewski/Okasaki
/ functions
Functions
372 in github.com/BartoszMilewski/Okasaki
⨍
Functions
372
◇
Types & classes
49
↓ 2 callers
Function
lazyPrint
LazyQueue/Test.cpp:5
↓ 2 callers
Method
left
SimpleTree/Tree.h:41
↓ 2 callers
Method
left
Leftist/LeftistHeap.h:40
↓ 2 callers
Method
member
SimpleTree/Tree.h:51
↓ 2 callers
Function
mjoin
Triples/Triple.cpp:62
↓ 2 callers
Function
mkStream
LazyStream/Test.cpp:4
↓ 2 callers
Function
newNode
trie.cpp:25
↓ 2 callers
Method
paint
RBTree/RBTree.h:186
↓ 2 callers
Method
paint
RBMap/RBMap.h:224
↓ 2 callers
Method
popped_front
LazyQueue/LazyStream.h:63
↓ 2 callers
Method
popped_front
LazyQueue/Queue.h:18
↓ 2 callers
Function
print
RBTree/TreeTest.cpp:7
↓ 2 callers
Function
print
Queue/List.h:153
↓ 2 callers
Method
pushed_front
Additional utilities
SimpleList/ListGC.h:45
↓ 2 callers
Method
refine
LazyQueens/Queens.cpp:83
↓ 2 callers
Method
refine
Queens/Queens.cpp:86
↓ 2 callers
Method
refine
Timetable/Timetable.cpp:133
↓ 2 callers
Method
removed1
List/List.h:84
↓ 2 callers
Method
reversed
Lazy reversed
PureStream/PureStream.h:114
↓ 2 callers
Method
right
SimpleTree/Tree.h:46
↓ 2 callers
Method
right
Leftist/LeftistHeap.h:45
↓ 2 callers
Function
timeTable
Timetable/Timetable.cpp:191
↓ 2 callers
Method
val
PureStream/PureStream.h:20
↓ 2 callers
Function
when_all_vec
Helper/Futures.h:16
↓ 1 callers
Function
all
List/List.h:116
↓ 1 callers
Method
assert1
1. No red node has a red child.
RBTree/RBTree.h:93
↓ 1 callers
Function
bench
Timetable/Timetable.cpp:212
↓ 1 callers
Function
blah
PureStream/Test.cpp:200
↓ 1 callers
Method
clashesWith
Timetable/Timetable.cpp:60
↓ 1 callers
Function
combineL
ConcurrentList/Test.cpp:14
↓ 1 callers
Function
combineLists
ConcurrentList/Test.cpp:32
↓ 1 callers
Function
concat
SimpleList/ListGC.h:64
↓ 1 callers
Function
concat
LazyQueue/LazyStream.h:160
↓ 1 callers
Function
concat
LazyStream/LazyStream.h:165
↓ 1 callers
Function
concatAll
PureStream/Test.cpp:152
↓ 1 callers
Method
countB
2. Every path from root to empty node contains the same number of black nodes.
RBTree/RBTree.h:110
↓ 1 callers
Method
drop
LazyStream/LazyStream.h:133
↓ 1 callers
Method
fillSlot
Timetable/Timetable.cpp:83
↓ 1 callers
Function
filter
List/List.h:203
↓ 1 callers
Function
filter
SimpleList/ListGC.h:83
↓ 1 callers
Function
fmap
PureStream/Susp.h:58
↓ 1 callers
Function
fmapv
Triples/Triple.cpp:39
↓ 1 callers
Function
foldl
SimpleList/ListGC.h:107
↓ 1 callers
Function
foldl
ConcurrentList/List.h:110
↓ 1 callers
Function
foldl
Queue/List.h:110
↓ 1 callers
Function
foldr
List/List.h:216
↓ 1 callers
Function
foldr
SimpleList/ListGC.h:96
↓ 1 callers
Function
forEach
SimpleList/ListGC.h:118
↓ 1 callers
Method
front
LazyQueue/Queue.h:16
↓ 1 callers
Function
generate
LazyQueens/Queens.cpp:90
↓ 1 callers
Function
generate
Queens/Queens.cpp:99
↓ 1 callers
Function
generate
Timetable/Timetable.cpp:146
↓ 1 callers
Function
generatePar
LazyQueens/Queens.cpp:113
↓ 1 callers
Function
generatePar
Queens/Queens.cpp:122
↓ 1 callers
Function
generatePar
Timetable/Timetable.cpp:164
↓ 1 callers
Method
getList
List/List.h:161
↓ 1 callers
Function
guard
Use void* for a dummy
Triples/Triple.cpp:89
↓ 1 callers
Method
headCount
For debugging
List/List.h:110
↓ 1 callers
Method
headCount
For debugging
ConcurrentList/List.h:60
↓ 1 callers
Method
headCount
For debugging
OrdList/OrdList.h:46
↓ 1 callers
Method
headCount
For debugging
Queue/List.h:60
↓ 1 callers
Function
inserted
RBTree/RBTree.h:205
↓ 1 callers
Method
inserted
Leftist/LeftistHeap.h:93
↓ 1 callers
Method
insertedAt
List/List.h:68
↓ 1 callers
Method
insertedAt
SimpleList/ListGC.h:49
↓ 1 callers
Function
isConflict
LazyQueens/Queens.cpp:54
↓ 1 callers
Function
isConflict
Queens/Queens.cpp:64
↓ 1 callers
Method
isEmpty
LazyQueue/LazyStream.h:61
↓ 1 callers
Method
isEmpty
LazyQueue/Queue.h:11
↓ 1 callers
Method
isForced
We use it for debugging
PureStream/Susp.h:45
↓ 1 callers
Method
isMaxSlots
Timetable/Timetable.cpp:59
↓ 1 callers
Method
isMaxTracks
Timetable/Timetable.cpp:58
↓ 1 callers
Function
iterateN
List/List.h:291
↓ 1 callers
Method
lenF
for debugging only
PureStream/PureStream.h:200
↓ 1 callers
Method
lenF
for debugging only
LazyQueue/Queue.h:23
↓ 1 callers
Method
lenR
PureStream/PureStream.h:201
↓ 1 callers
Method
lenR
LazyQueue/Queue.h:24
↓ 1 callers
Function
mbind
PureStream/Susp.h:80
↓ 1 callers
Function
mjoin
PureStream/Susp.h:71
↓ 1 callers
Function
mreturn
Triples/Triple.cpp:53
↓ 1 callers
Function
mthen
Triples/Triple.cpp:83
↓ 1 callers
Function
munit
PureStream/Susp.h:92
↓ 1 callers
Method
popped_front
Leftist/LeftistHeap.h:89
↓ 1 callers
Function
print
ConcurrentList/List.h:143
↓ 1 callers
Method
pushed_front
Additional utilities
ConcurrentList/List.h:46
↓ 1 callers
Function
rem_from_list
RBTree/RBTree.h:228
↓ 1 callers
Method
removeTalk
Timetable/Timetable.cpp:79
↓ 1 callers
Function
reversed
List/List.h:322
↓ 1 callers
Function
reversed
Queue/List.h:132
↓ 1 callers
Method
reversed
LazyQueue/LazyStream.h:137
↓ 1 callers
Method
reversed
LazyStream/LazyStream.h:142
↓ 1 callers
Function
run
ConcurrentList/Test.cpp:39
↓ 1 callers
Method
tail
LazyStream/LazyStream.h:49
↓ 1 callers
Method
take
Lazy take
PureStream/PureStream.h:92
↓ 1 callers
Method
take
LazyStream/LazyStream.h:122
↓ 1 callers
Function
test
Triples/Triple.cpp:112
↓ 1 callers
Function
test
ConcurrentList/Test.cpp:57
↓ 1 callers
Function
test
Queue/Qtest.cpp:3
↓ 1 callers
Function
test1
PureStream/Test.cpp:78
↓ 1 callers
Function
test1
List/TestLst.cpp:6
← previous
next →
101–200 of 372, ranked by callers