Another update from ingydotnet^djgoku
This commit is contained in:
parent
91df62d461
commit
948b86eafa
7604 changed files with 108452 additions and 22726 deletions
|
|
@ -27,18 +27,18 @@ module IntSet :
|
|||
val max_elt : t -> elt
|
||||
val choose : t -> elt
|
||||
val split : elt -> t -> t * bool * t
|
||||
val find : elt -> t -> elt
|
||||
val of_list : elt list -> t
|
||||
end
|
||||
# IntSet.empty;; (* Empty set. A set is an abstract type that will not display in the interpreter *)
|
||||
- : IntSet.t = <abstr>
|
||||
# IntSet.elements (IntSet.empty);; (* Get the previous set into a list *)
|
||||
- : IntSet.elt list = []
|
||||
# let from_list lst = List.fold_right IntSet.add lst IntSet.empty;; (* Convenience function for constructing a set from a list *)
|
||||
val from_list : IntSet.elt list -> IntSet.t = <fun>
|
||||
# let s1 = from_list [1;2;3;4;3];;
|
||||
# let s1 = IntSet.of_list [1;2;3;4;3];;
|
||||
val s1 : IntSet.t = <abstr>
|
||||
# IntSet.elements s1;;
|
||||
- : IntSet.elt list = [1; 2; 3; 4]
|
||||
# let s2 = from_list [3;4;5;6];;
|
||||
# let s2 = IntSet.of_list [3;4;5;6];;
|
||||
val s2 : IntSet.t = <abstr>
|
||||
# IntSet.elements s2;;
|
||||
- : IntSet.elt list = [3; 4; 5; 6]
|
||||
|
|
@ -50,9 +50,9 @@ val s2 : IntSet.t = <abstr>
|
|||
- : IntSet.elt list = [1; 2]
|
||||
# IntSet.subset s1 s1;; (* Subset *)
|
||||
- : bool = true
|
||||
# IntSet.subset (from_list [3;1]) s1;;
|
||||
# IntSet.subset (IntSet.of_list [3;1]) s1;;
|
||||
- : bool = true
|
||||
# IntSet.equal (from_list [3;2;4;1]) s1;; (* Equality *)
|
||||
# IntSet.equal (IntSet.of_list [3;2;4;1]) s1;; (* Equality *)
|
||||
- : bool = true
|
||||
# IntSet.equal s1 s2;;
|
||||
- : bool = false
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue