package core_extended
Extra components that are not as closely vetted or as stable as Core
Install
Dune Dependency
Authors
Maintainers
Sources
v0.17.0.tar.gz
sha256=17de5f7cf59818d757bb0625c55f0afc84509122645b7782fb522ac98c3be446
doc/src/core_extended.bitarray/bitarray.ml.html
Source file bitarray.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 90 91 92 93 94 95 96 97 98
open Core (* a single 63 bit chunk of the array, bounds checking is left to the main module. We can only use 62 bits, because of the sign bit *) module Int63_chunk : sig type t val empty : t val get : t -> int -> bool val set : t -> int -> bool -> t val popcount : t -> int val count : t -> int -> int end = struct open Int63 type t = Int63.t let empty = zero let get t i = bit_and t (shift_left one i) > zero let set t i v = if v then bit_or t (shift_left one i) else bit_and t (bit_xor minus_one (shift_left one i)) ;; let popcount = popcount let count t i = bit_and t (shift_left one Int.(i + 1) - one) |> popcount end type t = { data : Int63_chunk.t Array.t ; length : int } (* We can't use the sign bit, so we only get to use 62 bits *) let bits_per_bucket = 62 let create sz = let len = 1 + (sz / bits_per_bucket) in if sz < 0 || len > Array.max_length then invalid_argf "invalid size" (); { data = Array.create ~len Int63_chunk.empty; length = sz } ;; let length t = t.length let bucket i = i / bits_per_bucket let index i = i mod bits_per_bucket let bounds_check t i = if i < 0 || i >= t.length then invalid_argf "Bitarray: out of bounds" () ;; let get t i = bounds_check t i; Int63_chunk.get t.data.(bucket i) (index i) ;; let set t i v = bounds_check t i; let bucket = bucket i in t.data.(bucket) <- Int63_chunk.set t.data.(bucket) (index i) v ;; let clear t = Array.fill t.data ~pos:0 ~len:(Array.length t.data) Int63_chunk.empty let fold = let rec loop t n ~init ~f = if n < t.length then loop t (n + 1) ~init:(f init (get t n)) ~f else init in fun t ~init ~f -> loop t 0 ~init ~f ;; let iter t ~f = fold t ~init:() ~f:(fun _ v -> f v) let sexp_of_t t = Array.sexp_of_t Bool.sexp_of_t (Array.init t.length ~f:(fun i -> get t i)) ;; let t_of_sexp sexp = let a = Array.t_of_sexp Bool.t_of_sexp sexp in let t = create (Array.length a) in Array.iteri a ~f:(fun i v -> set t i v); t ;; let count ?len t = match Option.value ~default:(length t) len with | 0 -> 0 | len -> let max_index = len - 1 in bounds_check t max_index; let bucket = bucket max_index in let c = ref 0 in for b = 0 to bucket - 1 do c := !c + Int63_chunk.popcount t.data.(b) done; !c + Int63_chunk.count t.data.(bucket) (index max_index) ;;
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>