Getting Started
Documentation
Organisations
ocaml-multicore
kcas
kcas
https://github.com/ocaml-multicore/kcas
Default Branch
main
Do not assume that maximum array length is a power of two minus 1
939546
-
Apr 14 11:44 +00:00
Passed in 31m15s
Branches (6)
add-optional-capacity-to-queue
Add optional `capacity` argument to `Queue.create` and `Stack.create`
62ca00
-
Apr 14 11:44 +00:00
Passed in 1h08m
add-xt-leftist-heap-benchmark
Add a transaction benchmark using a naïve unscalable leftist heap
f58ca2
-
Apr 14 11:44 +00:00
Passed in 39m40s
expose-dllist-to-allow-matchable-cursors
Expose `Dllist` type to allow matchable cursors Being able to freely point to locations in a double-linked list allows more uses for a double-linked list.
42fef6
-
Apr 14 11:44 +00:00
Passed in 27m05s
queue-using-two-stacks
WIP
9e3a66
-
Apr 14 11:44 +00:00
Passed in 12h25m
sleeping-barbers-example
Sleeping barbers
ebcc56
-
Apr 14 11:44 +00:00
Passed in 1h16m
two-stack-queue
WIP: Two stack queue
b176e4
-
Apr 14 11:44 +00:00
Passed in 1h13m
Refs Branches (6)
Reimplement queue using a new two stack representation
WIP
9e3a66
-
#132
-
Apr 14 11:44 +00:00
Passed in 12h25m
WIP: Two stack queue
WIP: Two stack queue
b176e4
-
#175
-
Apr 14 11:44 +00:00
Passed in 1h13m
Expose `Dllist` type to allow matchable cursors
Expose `Dllist` type to allow matchable cursors Being able to freely point to locations in a double-linked list allows more uses for a double-linked list.
42fef6
-
#183
-
Apr 14 11:44 +00:00
Passed in 27m05s
Add a transaction benchmark using a naïve unscalable leftist heap
Add a transaction benchmark using a naïve unscalable leftist heap
f58ca2
-
#196
-
Apr 14 11:44 +00:00
Passed in 39m40s
Add optional capacity to queue
Add optional `capacity` argument to `Queue.create` and `Stack.create`
62ca00
-
#74
-
Apr 14 11:44 +00:00
Passed in 1h08m
Sleeping barbers example
Sleeping barbers
ebcc56
-
#84
-
Apr 14 11:44 +00:00
Passed in 1h16m