Legend:
Page
Library
Module
Module type
Parameter
Class
Class type
Source
Page
Library
Module
Module type
Parameter
Class
Class type
Source
ring.ml
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 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89
(*****************************************************************************) (* *) (* Open Source License *) (* Copyright (c) 2018 Dynamic Ledger Solutions, Inc. <contact@tezos.com> *) (* *) (* Permission is hereby granted, free of charge, to any person obtaining a *) (* copy of this software and associated documentation files (the "Software"),*) (* to deal in the Software without restriction, including without limitation *) (* the rights to use, copy, modify, merge, publish, distribute, sublicense, *) (* and/or sell copies of the Software, and to permit persons to whom the *) (* Software is furnished to do so, subject to the following conditions: *) (* *) (* The above copyright notice and this permission notice shall be included *) (* in all copies or substantial portions of the Software. *) (* *) (* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR*) (* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, *) (* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL *) (* THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER*) (* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING *) (* FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER *) (* DEALINGS IN THE SOFTWARE. *) (* *) (*****************************************************************************) type 'a raw = | Empty of int | Inited of {data : 'a array; mutable pos : int} type 'a t = 'a raw ref let create capacity = if capacity <= 0 then invalid_arg "Ring.create: capacity must be positive" else ref (Empty capacity) let capacity r = match !r with | Empty capacity -> capacity | Inited {data;_} -> Array.length data let add r v = match !r with | Empty size -> r := Inited {data = Array.make size v; pos = 0} | Inited s -> let size = Array.length s.data in begin if s.pos = (2 * size) - 1 then s.pos <- size else s.pos <- s.pos + 1 end; s.data.(s.pos mod size) <- v let add_and_return_erased r v = let replaced = match !r with | Empty _ -> None | Inited s -> let size = Array.length s.data in if s.pos >= size - 1 then Some s.data.((s.pos + 1) mod size) else None in add r v; replaced let clear r = match !r with | Empty _ -> () | Inited {data; _} -> r := Empty (Array.length data) let add_list r l = List.iter (add r) l let fold r ~init ~f = match !r with | Empty _ -> init | Inited {data; pos} -> let size = Array.length data in let acc = ref init in for i = 0 to min pos (size - 1) do acc := f !acc data.((pos - i) mod size) done ; !acc let elements t = fold t ~init:[] ~f:(fun acc elt -> elt :: acc)