From 286abd141d415a621cc8ea98055d8dc744c8b752 Mon Sep 17 00:00:00 2001
From: Maxime Dénès
Date: Thu, 26 Dec 2013 15:52:50 -0500
Subject: Refining match subterm and commutative cut rules. The parameters that
 are instantiated in the return predicate are now taken into account. The
 resulting recargs tree is the intersection between the one of the branches
 and the appearing in the return predicate. Both the domain and co-domain are
 filtered.

---
 lib/rtree.mli | 2 ++
 1 file changed, 2 insertions(+)

(limited to 'lib/rtree.mli')

diff --git a/lib/rtree.mli b/lib/rtree.mli
index c3ec3a0c51..b1cfc35bcc 100644
--- a/lib/rtree.mli
+++ b/lib/rtree.mli
@@ -66,6 +66,8 @@ val equiv :
     then by logical equivalence [Rtree.equiv eq eq] *)
 val equal : ('a -> 'a -> bool) -> 'a t -> 'a t -> bool
 
+val inter : ('a -> 'a -> 'a option) -> 'a -> 'a t -> 'a t -> 'a t
+
 (** Iterators *)
 
 val map : ('a -> 'b) -> 'a t -> 'b t
-- 
cgit v1.2.3