A Finger Tree is a data-structure that supports amortized O(1) addition and removal of elements from either end [1]. It also can support a large number of common sequence operations, including concatenation, very efficiently. Our implementation is based on the Hinze-Paterson structure [2], simplified for use as a Deque. It is possible to implement a […]
Reference Pages
Tag Cloud
actor asynchronous blocking capability channel composition concurrency consistency data-flow deadlock debugging distribution Erlang evaluation extensibility functional grammar Humus imperative JavaScript Kernel lambda-calculus language message-passing object-oriented pair pattern-matching PEG POLA primitive protocol queue recursion scalability Scheme security sequence serializer starvation state-machine streams synchronization synchronous value vau-calculusPost Calendar
December 2024 S M T W T F S 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 Meta