(************************************************************************) (* * The Rocq Prover / The Rocq Development Team *) (* v * Copyright INRIA, CNRS and contributors *) (* <O___,, * (see version control and CREDITS file for authors & dates) *) (* \VV/ **************************************************************) (* // * This file is distributed under the terms of the *) (* * GNU Lesser General Public License Version 2.1 *) (* * (see LICENSE file for the text of the license) *) (************************************************************************)
(** Heaps *)
module type Ordered = sig type t val compare : t -> t -> int end
module type S =sig
(** Type of functional heaps *) type t
(** Type of elements *) type elt
(** The empty heap *) val empty : t
(** [add x h] returns a new heap containing the elements of [h], plus [x];
complexity {% $ %}O(log(n)){% $ %} *) val add : elt -> t -> t
(** [maximum h] returns the maximum element of [h]; raises [EmptyHeap]
when [h] is empty; complexity {% $ %}O(1){% $ %} *) val maximum : t -> elt
(** [remove h] returns a new heap containing the elements of [h], except the maximum of [h]; raises [EmptyHeap] when [h] is empty;
complexity {% $ %}O(log(n)){% $ %} *) val remove : t -> t
(** usual iterators and combinators; elements are presented in
arbitrary order *) val iter : (elt -> unit) -> t -> unit
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
end
exception EmptyHeap
(** {6 Functional implementation. } *)
module Functional(X: Ordered) : S withtype elt=X.t
Die Informationen auf dieser Webseite wurden
nach bestem Wissen sorgfältig zusammengestellt. Es wird jedoch weder Vollständigkeit, noch Richtigkeit,
noch Qualität der bereit gestellten Informationen zugesichert.
Bemerkung:
Die farbliche Syntaxdarstellung ist noch experimentell.
