bend-kit-concurrency

Releases (2)

• 0.2.0.0 indexed
• 0.1.0.0 unindexed

Definitions (30)

concurrency.bend

• def count.consThe length of xs, beside xs.
• def count
• def split.consThe first n elements of xs, and the rest.
• def split
• def par_map.list.golr holds two halves of nl and nr elements.
• def par_map.list.top
• def par_mapList.map(f, xs), on at most `workers` parallel parts.
• def fold
• def par_reduce.list.go
• def par_reduce.list.top
• def par_reduceThe left fold of xs from z, on at most `workers` parallel parts.
• def par_map.array.goAn Array is a balanced tree, so each ANode above depth d is a parallel call.
• def par_map.arrayf on every slot of a, on at most `workers` parallel parts.
• def par_reduce.array.go
• def par_reduce.arrayThe slots of a combined in index order with an associative f, on at most `workers` parallel parts.
• type WorkerA pool worker between channel steps.
• def pool.workerTakes jobs until the queue is closed and empty, then answers its state.
• def pool.putQueues each job with its own reply channel, and answers the replies in order.
• def pool.start
• def pool.join
• def pool.run
• def poolRuns work(s, x) for every x in xs, on one worker per state in states.
• type RelayA select relay between channel steps.
• def select.relayForwards each value of src to out as (i, value), then reports on done.
• def select.startponytail: relay fuel is the largest Nat literal, and a value takes three steps, so a relay stops after about 1.4 billion values.
• def select.closeCloses out once all n relays have reported.
• def select.go
• def selectOne channel that carries (i, value) for each value received on chans[i], in the order they arrive.
• def timeout.won
• def timeoutSome{result} if act finishes within ms milliseconds, else None at the deadline.