package containers
A modular, clean and powerful extension of the OCaml standard library
Install
Dune Dependency
Authors
Maintainers
Sources
v2.8.1.tar.gz
md5=d84e09c5d0abc501aa17cd502e31a038
sha512=8b832f4ada6035e80d81be0cfb7bdffb695ec67d465ed6097a144019e2b8a8f909095e78019c3da2d8181cc3cd730cd48f7519e87d3162442562103b7f36aabb
doc/src/containers.data/CCBV.ml.html
Source file CCBV.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 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562
(** {2 Imperative Bitvectors} *) let width_ = Sys.word_size - 1 (** We use OCamls ints to store the bits. We index them from the least significant bit. We create masks to zero out the most significant bits that aren't used to store values. This is necessary when we are constructing or negating a bit vector. *) let lsb_masks_ = let a = Array.make (width_ + 1) 0 in for i = 1 to width_ do a.(i) <- a.(i-1) lor (1 lsl (i - 1)) done; a let all_ones_ = lsb_masks_.(width_) (* count the 1 bits in [n]. See https://en.wikipedia.org/wiki/Hamming_weight *) let count_bits_ n = let rec recurse count n = if n = 0 then count else recurse (count+1) (n land (n-1)) in recurse 0 n (* Can I access the "private" members in testing? $Q (Q.int_bound (Sys.word_size - 1)) (fun i -> count_bits_ lsb_masks_.(i) = i) *) type t = { mutable a : int array; mutable size : int; } let length t = t.size let empty () = { a = [| |] ; size = 0 } let array_length_of_size size = if size mod width_ = 0 then size / width_ else (size / width_) + 1 let create ~size default = if size = 0 then { a = [| |]; size } else ( let n = array_length_of_size size in let a = if default then Array.make n all_ones_ else Array.make n 0 in (* adjust last bits *) let r = size mod width_ in if default && r <> 0 then ( Array.unsafe_set a (n-1) lsb_masks_.(r); ); { a; size } ) (*$Q (Q.pair Q.small_int Q.bool) (fun (size, b) -> create ~size b |> length = size) *) (*$T create ~size:17 true |> cardinal = 17 create ~size:32 true |> cardinal = 32 create ~size:132 true |> cardinal = 132 create ~size:200 false |> cardinal = 0 create ~size:29 true |> to_sorted_list = CCList.range 0 28 *) let copy bv = { bv with a = Array.copy bv.a } (*$Q (Q.list Q.small_int) (fun l -> \ let bv = of_list l in to_list bv = to_list (copy bv)) *) let capacity bv = width_ * Array.length bv.a let cardinal bv = if bv.size = 0 then 0 else ( let n = ref 0 in for i = 0 to Array.length bv.a - 1 do n := !n + count_bits_ bv.a.(i) (* MSB of last element are all 0 *) done; !n ) (*$Q Q.small_int (fun size -> create ~size true |> cardinal = size) *) let really_resize_ bv ~desired ~current size = let a' = Array.make desired 0 in Array.blit bv.a 0 a' 0 current; bv.a <- a'; bv.size <- size let grow_ bv size = if size <= capacity bv (* within capacity *) then bv.size <- size else ( (* beyond capacity *) let desired = array_length_of_size size in let current = Array.length bv.a in assert (desired > current); really_resize_ bv ~desired ~current size ) let shrink_ bv size = let desired = array_length_of_size size in let current = Array.length bv.a in really_resize_ bv ~desired ~current size let resize bv size = if size < 0 then invalid_arg "resize: negative size"; if size < bv.size (* shrink *) then shrink_ bv size else if size = bv.size then () else grow_ bv size (*$R let bv1 = CCBV.create ~size:87 true in assert_equal ~printer:string_of_int 87 (CCBV.cardinal bv1); *) (*$Q Q.small_int (fun n -> CCBV.cardinal (CCBV.create ~size:n true) = n) *) let is_empty bv = try for i = 0 to Array.length bv.a - 1 do if bv.a.(i) <> 0 then raise Exit (* MSB of last element are all 0 *) done; true with Exit -> false let get bv i = if i < 0 then invalid_arg "get: negative index"; let n = i / width_ in let i = i mod width_ in if n < Array.length bv.a then (Array.unsafe_get bv.a n) land (1 lsl i) <> 0 else false (*$R let bv = CCBV.create ~size:99 false in assert_bool "32 must be false" (not (CCBV.get bv 32)); assert_bool "88 must be false" (not (CCBV.get bv 88)); assert_bool "5 must be false" (not (CCBV.get bv 5)); CCBV.set bv 32; CCBV.set bv 88; CCBV.set bv 5; assert_bool "32 must be true" (CCBV.get bv 32); assert_bool "88 must be true" (CCBV.get bv 88); assert_bool "5 must be true" (CCBV.get bv 5); assert_bool "33 must be false" (not (CCBV.get bv 33)); assert_bool "44 must be false" (not (CCBV.get bv 44)); assert_bool "1 must be false" (not (CCBV.get bv 1)); *) let set bv i = if i < 0 then invalid_arg "set: negative index" else ( let n = i / width_ in let j = i mod width_ in if i >= bv.size then grow_ bv (i+1); Array.unsafe_set bv.a n ((Array.unsafe_get bv.a n) lor (1 lsl j)) ) (*$T let bv = create ~size:3 false in set bv 0; get bv 0 let bv = create ~size:3 false in set bv 1; not (get bv 0) *) let reset bv i = if i < 0 then invalid_arg "reset: negative index" else ( let n = i / width_ in let j = i mod width_ in if i >= bv.size then grow_ bv (i+1); Array.unsafe_set bv.a n ((Array.unsafe_get bv.a n) land (lnot (1 lsl j))) ) (*$T let bv = create ~size:3 false in set bv 0; reset bv 0; not (get bv 0) *) let flip bv i = if i < 0 then invalid_arg "reset: negative index" else ( let n = i / width_ in let j = i mod width_ in if i >= bv.size then grow_ bv (i+1); Array.unsafe_set bv.a n ((Array.unsafe_get bv.a n) lxor (1 lsl j)) ) (*$R let bv = of_list [1;10; 11; 30] in flip bv 10; assert_equal ~printer:Q.Print.(list int) [1;11;30] (to_sorted_list bv); assert_equal ~printer:Q.Print.bool false (get bv 10); flip bv 10; assert_equal ~printer:Q.Print.bool true (get bv 10); flip bv 5; assert_equal ~printer:Q.Print.(list int) [1;5;10;11;30] (to_sorted_list bv); assert_equal ~printer:Q.Print.bool true (get bv 5); flip bv 100; assert_equal ~printer:Q.Print.(list int) [1;5;10;11;30;100] (to_sorted_list bv); assert_equal ~printer:Q.Print.bool true (get bv 100); *) let clear bv = Array.fill bv.a 0 (Array.length bv.a) 0 (*$T let bv = create ~size:37 true in cardinal bv = 37 && (clear bv; cardinal bv= 0) *) (*$R let bv = CCBV.of_list [1; 5; 200] in assert_equal ~printer:string_of_int 3 (CCBV.cardinal bv); CCBV.clear bv; assert_equal ~printer:string_of_int 0 (CCBV.cardinal bv); assert_bool "must be empty" (CCBV.is_empty bv); *) let iter bv f = let len = array_length_of_size bv.size in assert (len <= Array.length bv.a); for n = 0 to len - 2 do let j = width_ * n in for i = 0 to width_ - 1 do f (j+i) (bv.a.(n) land (1 lsl i) <> 0) done done; if bv.size > 0 then ( let j = width_ * (len - 1) in let r = bv.size mod width_ in let final_length = if r = 0 then width_ else r in for i = 0 to final_length - 1 do f (j + i) (bv.a.(len - 1) land (1 lsl i) <> 0) done ) (*$R List.iter (fun size -> let bv = create ~size false in set bv 5; let n = ref 0 in iter bv (fun i b -> incr n; assert_equal b (i=5)); assert_bool "exactly size" (!n = size)) [30; 100; 255; 256;10_000] *) (*$inject let seq_zip s k = s (fun x y -> k(x,y)) *) (*$= & ~printer:Q.Print.(list (pair int bool)) [] (iter (create ~size:0 false) |> seq_zip |> Iter.to_list) [0, false; 1, true; 2, false] \ (iter (let bv = create ~size:3 false in set bv 1; bv) |> seq_zip |> Iter.to_list) *) (*$Q Q.(small_int) (fun n -> \ assert (n >= 0); \ let bv = create ~size:n true in \ let l = iter bv |> seq_zip |> Iter.to_list in \ List.length l = n && List.for_all (fun (_,b) -> b) l) *) let iter_true bv f = iter bv (fun i b -> if b then f i else ()) (*$T of_list [1;5;7] |> iter_true |> Iter.to_list |> List.sort CCOrd.compare = [1;5;7] *) (*$inject let _gen = Q.Gen.(map of_list (list nat)) let _pp bv = Q.Print.(list string) (List.map string_of_int (to_list bv)) let _small bv = length bv let gen_bv = Q.make ~small:_small ~print:_pp _gen *) (*$QR gen_bv (fun bv -> let l' = Iter.to_rev_list (CCBV.iter_true bv) in let bv' = CCBV.of_list l' in CCBV.cardinal bv = CCBV.cardinal bv' ) *) let to_list bv = let l = ref [] in iter_true bv (fun i -> l := i :: !l); !l (*$R let bv = CCBV.of_list [1; 5; 156; 0; 222] in assert_equal ~printer:string_of_int 5 (CCBV.cardinal bv); CCBV.set bv 201; assert_equal ~printer:string_of_int 6 (CCBV.cardinal bv); let l = CCBV.to_list bv in let l = List.sort compare l in assert_equal [0;1;5;156;201;222] l; *) let to_sorted_list bv = List.rev (to_list bv) (* Interpret these as indices. *) let of_list l = let size = (List.fold_left max 0 l) + 1 in let bv = create ~size false in List.iter (fun i -> set bv i) l; bv (*$T of_list [1;32;64] |> CCFun.flip get 64 of_list [1;32;64] |> CCFun.flip get 32 of_list [1;31;63] |> CCFun.flip get 63 *) exception FoundFirst of int let first_exn bv = try iter_true bv (fun i -> raise (FoundFirst i)); raise Not_found with FoundFirst i -> i let first bv = try Some (first_exn bv) with Not_found -> None (*$T of_list [50; 10; 17; 22; 3; 12] |> first = Some 3 *) let filter bv p = iter_true bv (fun i -> if not (p i) then reset bv i) (*$T let bv = of_list [1;2;3;4;5;6;7] in filter bv (fun x->x mod 2=0); \ to_sorted_list bv = [2;4;6] *) let negate_self b = let len = Array.length b.a in for n = 0 to len - 1 do Array.unsafe_set b.a n (lnot (Array.unsafe_get b.a n)) done; let r = b.size mod width_ in if r <> 0 then let l = Array.length b.a - 1 in Array.unsafe_set b.a l (lsb_masks_.(r) land (Array.unsafe_get b.a l)) (*$T let v = of_list [1;2;5;7;] in negate_self v; \ cardinal v = (List.length [0;3;4;6]) *) let negate b = let a = Array.map (lnot) b.a in let r = b.size mod width_ in if r <> 0 then ( let l = Array.length b.a - 1 in Array.unsafe_set a l (lsb_masks_.(r) land (Array.unsafe_get a l)) ); { a ; size = b.size } (*$Q Q.small_int (fun size -> create ~size false |> negate |> cardinal = size) *) (* Underlying size grows for union. *) let union_into ~into bv = if into.size < bv.size then ( grow_ into bv.size; ); for i = 0 to (Array.length into.a) - 1 do Array.unsafe_set into.a i ((Array.unsafe_get into.a i) lor (Array.unsafe_get bv.a i)) done (* To avoid potentially 2 passes, figure out what we need to copy. *) let union b1 b2 = if b1.size <= b2.size then ( let into = copy b2 in for i = 0 to (Array.length b1.a) - 1 do Array.unsafe_set into.a i ((Array.unsafe_get into.a i) lor (Array.unsafe_get b1.a i)) done; into ) else ( let into = copy b1 in for i = 0 to (Array.length b1.a) - 1 do Array.unsafe_set into.a i ((Array.unsafe_get into.a i) lor (Array.unsafe_get b2.a i)) done; into ) (*$R let bv1 = CCBV.of_list [1;2;3;4] in let bv2 = CCBV.of_list [4;200;3] in let bv = CCBV.union bv1 bv2 in let l = List.sort compare (CCBV.to_list bv) in assert_equal [1;2;3;4;200] l; () *) (*$T union (of_list [1;2;3;4;5]) (of_list [7;3;5;6]) |> to_sorted_list = CCList.range 1 7 *) (* Underlying size shrinks for inter. *) let inter_into ~into bv = if into.size > bv.size then ( shrink_ into bv.size; ); for i = 0 to (Array.length into.a) - 1 do Array.unsafe_set into.a i ((Array.unsafe_get into.a i) land (Array.unsafe_get bv.a i)) done let inter b1 b2 = if b1.size <= b2.size then ( let into = copy b1 in for i = 0 to (Array.length b1.a) - 1 do Array.unsafe_set into.a i ((Array.unsafe_get into.a i) land (Array.unsafe_get b2.a i)) done; into ) else ( let into = copy b2 in for i = 0 to (Array.length b2.a) - 1 do Array.unsafe_set into.a i ((Array.unsafe_get into.a i) land (Array.unsafe_get b1.a i)) done; into ) (*$T inter (of_list [1;2;3;4]) (of_list [2;4;6;1]) |> to_sorted_list = [1;2;4] *) (*$R let bv1 = CCBV.of_list [1;2;3;4] in let bv2 = CCBV.of_list [4;200;3] in CCBV.inter_into ~into:bv1 bv2; let l = List.sort compare (CCBV.to_list bv1) in assert_equal [3;4] l; *) (* Underlying size depends on the 'in_' set for diff, so we don't change it's size! *) let diff_into ~into bv = let n = min (Array.length into.a) (Array.length bv.a) in for i = 0 to n - 1 do Array.unsafe_set into.a i ((Array.unsafe_get into.a i) land (lnot (Array.unsafe_get bv.a i))) done let diff in_ not_in = let into = copy in_ in diff_into ~into not_in; into (*$T diff (of_list [1;2;3]) (of_list [1;2;3]) |> to_list = []; diff (of_list [1;2;3]) (of_list [1;2;3;4]) |> to_list = []; diff (of_list [1;2;3;4]) (of_list [1;2;3]) |> to_list = [4]; diff (of_list [1;2;3]) (of_list [1;2;3;400]) |> to_list = []; diff (of_list [1;2;3;400]) (of_list [1;2;3]) |> to_list = [400]; *) let select bv arr = let l = ref [] in begin try iter_true bv (fun i -> if i >= Array.length arr then raise Exit else l := arr.(i) :: !l) with Exit -> () end; !l (*$R let bv = CCBV.of_list [1;2;5;400] in let arr = [|"a"; "b"; "c"; "d"; "e"; "f"|] in let l = List.sort compare (CCBV.select bv arr) in assert_equal ["b"; "c"; "f"] l; *) let selecti bv arr = let l = ref [] in begin try iter_true bv (fun i -> if i >= Array.length arr then raise Exit else l := (arr.(i), i) :: !l) with Exit -> () end; !l (*$R let bv = CCBV.of_list [1;2;5;400] in let arr = [|"a"; "b"; "c"; "d"; "e"; "f"|] in let l = List.sort compare (CCBV.selecti bv arr) in assert_equal [("b",1); ("c",2); ("f",5)] l; *) (*$= & ~printer:Q.Print.(list (pair int int)) [1,1; 3,3; 4,4] (selecti (of_list [1;4;3]) [| 0;1;2;3;4;5;6;7;8 |] \ |> List.sort CCOrd.compare) *) type 'a sequence = ('a -> unit) -> unit let to_seq bv k = iter_true bv k (*$Q Q.(small_int) (fun i -> \ let i = max 1 i in \ let bv = create ~size:i true in \ i = (to_seq bv |> Iter.length)) *) let of_seq seq = let l = ref [] and maxi = ref 0 in seq (fun x -> l := x :: !l; maxi := max !maxi x); let bv = create ~size:(!maxi+1) false in List.iter (fun i -> set bv i) !l; bv (*$T CCList.range 0 10 |> CCList.to_seq |> of_seq |> to_seq \ |> CCList.of_seq |> List.sort CCOrd.compare = CCList.range 0 10 *) let pp out bv = Format.pp_print_string out "bv {"; iter bv (fun _i b -> Format.pp_print_char out (if b then '1' else '0') ); Format.pp_print_string out "}"
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>