From 6bac888419048aa8fe06b49bf94f64893228bb00 Mon Sep 17 00:00:00 2001 From: gareuselesinge Date: Thu, 8 Aug 2013 18:50:39 +0000 Subject: Searchable stack data structure It is like Stack but one can search without popping git-svn-id: svn+ssh://scm.gforge.inria.fr/svn/coq/trunk@16670 85f007b7-540e-0410-9357-904b9bb8a0f7 --- lib/searchstack.mli | 25 +++++++++++++++++++++++++ 1 file changed, 25 insertions(+) create mode 100644 lib/searchstack.mli (limited to 'lib/searchstack.mli') diff --git a/lib/searchstack.mli b/lib/searchstack.mli new file mode 100644 index 0000000000..6c81a2a9c9 --- /dev/null +++ b/lib/searchstack.mli @@ -0,0 +1,25 @@ +(************************************************************************) +(* v * The Coq Proof Assistant / The Coq Development Team *) +(* 'a t +val push : 'a -> 'a t -> unit +val find : ('c -> 'a -> ('c, 'b) search) -> 'c -> 'a t -> 'b +val is_empty : 'a t -> bool +val iter : ('a -> unit) -> 'a t -> unit +val clear : 'a t -> unit +val length : 'a t -> int + +(* may raise Stack.Empty *) +val pop : 'a t -> 'a +val top : 'a t -> 'a + +(* Extra *) +val to_list : 'a t -> 'a list -- cgit v1.2.3