package mopsa

  1. Overview
  2. Docs
package mopsa
Legend:
Page
Library
Module
Module type
Parameter
Class
Class type
Source

Source file powerset_sig.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
(****************************************************************************)
(*                                                                          *)
(* This file is part of MOPSA, a Modular Open Platform for Static Analysis. *)
(*                                                                          *)
(* Copyright (C) 2017-2019 The MOPSA Project.                               *)
(*                                                                          *)
(* This program 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 3 of the License, or     *)
(* (at your option) any later version.                                      *)
(*                                                                          *)
(* This program 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 program.  If not, see <http://www.gnu.org/licenses/>.    *)
(*                                                                          *)
(****************************************************************************)

(** Powerset lattice with finite cardinality elements or ⊺. *)

open Mopsa_utils
open Top
open Core

module type S =
sig
  type elt
  module Set : SetExtSig.S with type elt = elt
  type t = Set.t with_top
  val bottom : t
  val top : t
  val is_top : t -> bool
  val subset : t -> t -> bool
  val equal : t -> t -> bool
  val compare : t -> t -> int
  val join : t -> t -> t
  val meet : t -> t -> t
  val union : t -> t -> t
  val inter : t -> t -> t
  val diff : t -> t -> t
  val widen : 'a Core.Context.ctx -> t -> t -> t
  val print : Print.printer -> t -> unit
  val add : Set.elt -> t -> t
  val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
  val remove : elt -> t -> t
  val mem : elt -> t -> bool
  val filter : (Set.elt -> bool) -> t -> t
  val partition : (Set.elt -> bool) -> t -> t * t
  val exists : (Set.elt -> bool) -> t -> bool
  val for_all : (Set.elt -> bool) -> t -> bool
  val cardinal : t -> int
  val find : Set.elt -> t -> elt
  val choose : t -> elt
  val singleton : elt -> t
  val of_list : elt list -> Set.t Top.with_top
  val is_empty : t -> bool
  val empty : t
  val is_bottom : t -> bool
  val is_singleton : t -> bool
  val elements : t -> Set.elt list
  val map : (elt -> elt) -> t -> t
  val iter : (elt -> unit) -> t -> unit
  val apply : (Set.t -> 'a) -> 'a -> t -> 'a
end
OCaml

Innovation. Community. Security.

GitHub Discord Twitter Peertube RSS
About
Changelog Releases Industrial Users Academic Users Why OCaml
Ecosystem
Packages Community Events OCaml Planet Jobs
Resources
Install OCaml Get Started Platform Tools Language Manual Standard Library API Books Exercises Papers OCaml Playground Logo
Policies
Carbon Footprint Governance Privacy Code of Conduct