Commit e6e55b40 authored by POTTIER Francois's avatar POTTIER Francois
Browse files

Rename [CompressedBitSet] to [SparseBitSet].

parent e17c5c7f
......@@ -11,10 +11,11 @@
(* *)
(******************************************************************************)
(* A compressed (or should we say sparse?) bit set is a list of pairs
of integers. The first component of every pair is an index, while
the second component is a bit field. The list is sorted by order
of increasing indices. *)
(* This data structure implements sets of integers (of unbounded magnitude). *)
(* A sparse bit set is a list of pairs of integers. The first component of
every pair is an index, while the second component is a bit field. The list
is sorted by order of increasing indices. *)
type t =
| N
......@@ -235,4 +236,3 @@ let rec disjoint s1 s2 =
disjoint qs1 s2
else
disjoint s1 qs2
......@@ -11,8 +11,8 @@
(* *)
(******************************************************************************)
(* This is a stripped down version of [GSet] that describes both [Patricia]
and [CompressedBitSet]. The full version of [GSet] is in [AlphaLib]. *)
(* This signature describes several implementations of sets, including
[Patricia], [AtomicBitSet], and [SparseBitSet]. *)
module type S = sig
......@@ -112,4 +112,3 @@ module type S = sig
val subset: (t -> t -> bool)
end
......@@ -403,7 +403,7 @@ end
module TerminalSet = struct
include CompressedBitSet
include SparseBitSet
let print toks =
Misc.separated_iter_to_string Terminal.print " " (fun f -> iter f toks)
......
......@@ -23,7 +23,7 @@ module InfiniteArray =
terminal symbols and of a number of set variables. Set variables as
encoded as integers. *)
module VarSet = CompressedBitSet
module VarSet = SparseBitSet
module SymbolicLookahead = struct
......
Markdown is supported
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment