package core-and-more

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

Source file my_maximals.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
open Core
open Util

module type PartialOrdered = sig
  include Data
  val po : t -> t -> int option
end

module DataToPO(D:Data) = struct
  include D
  let po = Option.some %% D.compare
end

module MaxForestOf(PO:PartialOrdered) = struct
  type t = PO.t list

  let empty = []

  let rec insert
      (mf:t)
      (x:PO.t)
    : t =
    begin match mf with
      | [] -> [x]
      | h::t ->
        begin match PO.po x h with
          | None -> h::(insert t x)
          | Some c ->
            if c > 0 then
              insert t x
            else
              mf
        end
    end

  let insert_list
      (mf:t)
      (xs:PO.t list)
    : t =
    List.fold
      ~f:insert
      ~init:mf
      xs

  let of_list
      (xs:PO.t list)
    : t =
    insert_list
      empty
      xs

  let singleton
      (x:PO.t)
    : t =
    [x]

  let to_list
      (mf:t)
    : PO.t list =
    mf

  let merge
      (mf1:t)
      (mf2:t)
    : t =
    insert_list mf1 mf2

  let multi_merge
      (mfs:t list)
    : t =
    List.fold
      ~f:merge
      ~init:empty
      mfs

  let cartesian_map
      ~(f:PO.t -> PO.t -> PO.t)
      (mf1:t)
      (mf2:t)
    : t =
    of_list
      (cartesian_map
         ~f
         mf1
         mf2)

  let map
      ~(f:PO.t -> PO.t)
      (mf:t)
    : t =
    List.map
      ~f
      mf
end
OCaml

Innovation. Community. Security.