File: bitSet.mli

package info (click to toggle)
extlib 1.7.7-2
  • links: PTS, VCS
  • area: main
  • in suites: bookworm, bullseye, sid
  • size: 632 kB
  • sloc: ml: 6,980; makefile: 128; sh: 42; ansic: 31
file content (101 lines) | stat: -rw-r--r-- 3,334 bytes parent folder | download | duplicates (8)
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
(*
 * Bitset - Efficient bit sets
 * Copyright (C) 2003 Nicolas Cannasse
 *
 * This library is free software; you can redistribute it and/or
 * modify it under the terms of the GNU Lesser General Public
 * License as published by the Free Software Foundation; either
 * version 2.1 of the License, or (at your option) any later version,
 * with the special exception on linking described in file LICENSE.
 *
 * This library is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
 * Lesser General Public License for more details.
 *
 * You should have received a copy of the GNU Lesser General Public
 * License along with this library; if not, write to the Free Software
 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
 *)

(** Efficient bit sets.

 A bitset is an array of boolean values that can be accessed with indexes
 like an array but provides a better memory usage (divided by 8) for a
 very small speed trade-off. *)

type t

exception Negative_index of string
(** When a negative bit value is used for one of the BitSet functions,
 this exception is raised with the name of the function. *)

val empty : unit ->  t
(** Create an empty bitset of size 0, the bitset will automatically expand
 when needed. *)

val create : int -> t
(** Create an empty bitset with an initial size (in number of bits). *)

val copy : t -> t
(** Copy a bitset : further modifications of first one will not affect the
 copy. *)

val clone : t -> t
(** Same as [copy] *)

val set : t -> int -> unit
(** [set s n] sets the nth-bit in the bitset [s] to true. *)

val unset : t -> int -> unit
(** [unset s n] sets the nth-bit in the bitset [s] to false. *)

val put : t -> bool -> int -> unit
(** [put s v n] sets the nth-bit in the bitset [s] to [v]. *)

val toggle : t -> int -> unit
(** [toggle s n] changes the nth-bit value in the bitset [s]. *)

val is_set : t -> int -> bool
(** [is_set s n] returns true if nth-bit in the bitset [s] is set,
 or false otherwise. *)

val compare : t -> t -> int
(** [compare s1 s2] compares two bitsets. Highest bit indexes are
 compared first. *)

val equals : t -> t -> bool
(** [equals s1 s2] returns true if, and only if, all bits values in s1 are
  the same as in s2. *)

val count : t -> int
(** [count s] returns the number of bits set in the bitset [s]. *)

val enum : t -> int Enum.t
(** [enum s] returns an enumeration of bits which are set
  in the bitset [s]. *)

val intersect : t -> t -> unit
(** [intersect s t] sets [s] to the intersection of the sets [s] and [t]. *)

val unite : t -> t -> unit
(** [unite s t] sets [s] to the union of the sets [s] and [t]. *)

val differentiate : t -> t -> unit
(** [differentiate s t] removes the elements of [t] from [s]. *)

val differentiate_sym : t -> t -> unit
(** [differentiate_sym s t] sets [s] to the symmetrical difference of the
  sets [s] and [t]. *)

val inter : t -> t -> t
(** [inter s t] returns the intersection of sets [s] and [t]. *)

val union : t -> t -> t
(** [union s t] return the union of sets [s]  and [t]. *)

val diff : t -> t -> t
(** [diff s t] returns [s]-[t]. *)

val sym_diff : t -> t -> t
(** [sym_diff s t] returns the symmetrical difference of [s] and [t]. *)