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
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
|
(*---------------------------------------------------------------------------*
INTERFACE cf_heap.mli
Copyright (c) 2004-2006, James H. Woodyatt
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in
the documentation and/or other materials provided with the
distribution
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
COPYRIGHT HOLDERS OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT,
INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
OF THE POSSIBILITY OF SUCH DAMAGE.
*---------------------------------------------------------------------------*)
(** A module type for functional heap implementations. *)
(** {6 Module Type} *)
(**
This module defines the common interface to functional heaps in the {!Cf}
library.
*)
module type T = sig
(** The heap type *)
type t
(** A module defining the type of the element. Some heap implementations
may define more functions in this module for disambiguating elements
from one another.
*)
module Element: sig type t end
(** The empty heap. *)
val nil: t
(** Use [empty h] to test whether the heap [h] is empty. *)
val empty: t -> bool
(** Use [size h] to count the number of elements in the heap [h]. Runs
in O(n) time and O(log N) space.
*)
val size: t -> int
(** Use [head h] to obtain the element on the top of the heap [h]. Raises
[Not_found] if the heap is empty.
*)
val head: t -> Element.t
(** Use [tail h] to obtain the heap produced by discarding the element on
the top of heap [h]. If [h] is the empty heap, then the empty heap is
returned.
*)
val tail: t -> t
(** Use [pop h] to obtain the head and the tail of a heap [h] in one
operation. Returns [None] if the [h] is empty.
*)
val pop: t -> (Element.t * t) option
(** Use [put e h] to obtain a new heap that is the result of inserting
the element [e] into the heap [h].
*)
val put: Element.t -> t -> t
(** Use [merge h1 h2] to obtain a new heap that is the result of merging
all the elements of [h1] and [h2] into a single heap.
*)
val merge: t -> t -> t
(** Use [iterate f h] to apply [f] to every element in the heap [h] in an
arbitrary order (not top to bottom). Runs in O(n) time and O(1) space.
*)
val iterate: (Element.t -> unit) -> t -> unit
(** Use [predicate f h] to test whether all the elements in heap [h]
satisfy the predicate function [f]. Runs in O(n) time (with a short
cut when an element is found to fail the predicate) and O(1) space.
Visits the elements in the heap in arbitrary order (not top to bottom).
*)
val predicate: (Element.t -> bool) -> t -> bool
(** Use [fold f s h] to produce the result of folding a value [s] into
the elements of heap [h] with the folding function [f] in an arbitrary
order (not top to bottom). Runs in O(n) time and O(1) space.
*)
val fold: ('b -> Element.t -> 'b) -> 'b -> t -> 'b
(** Use [filter f h] to apply [f] to each element in the heap [h] in an
arbitrary order (not to top bottom), and produce a new heap that
contains only those elements for which [f pair] returned [true].
*)
val filter: (Element.t -> bool) -> t -> t
(** Use [partition f h] to obtain a pair of new heaps that are the result
of applying the partitioning function [f] to each element in the heap
[h] in an arbitrary order (not top to bottom). The first heap returned
will contain all the elements for which [f pair] returned true, and the
second heap will return all the remaining elements.
*)
val partition: (Element.t -> bool) -> t -> t * t
(** Use [of_seq z] to construct a heap from a sequence of elements.
Evaluates the whole sequence. Runs in O(n) time and O(1) space.
*)
val of_seq: Element.t Cf_seq.t -> t
(** Use [of_list s] to construct a heap from a list of elements. Runs in
O(n) time and O(1) space.
*)
val of_list: Element.t list -> t
(** Use [to_seq h] to produce a sequence of elements in top to bottom order
from the heap [h].
*)
val to_seq: t -> Element.t Cf_seq.t
(** Use [to_seq2 h] to produce a sequence of elements from the heap [h]
where the first element of each pair is a key-value pair obtained from
the head of the heap, and the second element of the pair is the
corresponding tail of the heap.
*)
val to_seq2: t -> (Element.t * t) Cf_seq.t
end
(*--- End of File [ cf_heap.mli ] ---*)
|
