# HG changeset patch
# User wenzelm
# Date 1003170785 -7200
# Node ID d4f9de0bde28392df4eed43aba56c5d3321fcbc1
# Parent  e7eeca372b7c7dcfb97df5b202d3d05b1254ee74
support weight;

diff -r e7eeca372b7c -r d4f9de0bde28 src/Pure/Isar/net_rules.ML
--- a/src/Pure/Isar/net_rules.ML	Mon Oct 15 20:32:13 2001 +0200
+++ b/src/Pure/Isar/net_rules.ML	Mon Oct 15 20:33:05 2001 +0200
@@ -10,15 +10,16 @@
 sig
   type 'a T
   val rules: 'a T -> 'a list
-  val may_unify: 'a T -> term -> 'a list
-  val init: ('a * 'a -> bool) -> ('a -> term) -> 'a T
+  val retrieve: 'a T -> term -> 'a list
+  val retrieve_weighted: 'a T -> term -> 'a list
+  val init: ('a * 'a -> bool) -> ('a -> int) -> ('a -> term) -> 'a T
   val merge: 'a T * 'a T -> 'a T
   val delete: 'a -> 'a T -> 'a T
   val insert: 'a -> 'a T -> 'a T
   val deletes: 'a list -> 'a T -> 'a T
   val inserts: 'a list -> 'a T -> 'a T
-  val init_intro: thm T
-  val init_elim: thm T
+  val intro: thm T
+  val elim: thm T
 end;
 
 structure NetRules: NET_RULES =
@@ -29,36 +30,46 @@
 datatype 'a T =
   Rules of {
     eq: 'a * 'a -> bool,
+    weight: 'a -> int,
     index: 'a -> term,
     rules: 'a list,
     next: int,
-    net: (int * 'a) Net.net};
+    net: ((int * int) * 'a) Net.net};
 
-fun mk_rules eq index rules next net =
-  Rules {eq = eq, index = index, rules = rules, next = next, net = net};
+fun mk_rules eq weight index rules next net =
+  Rules {eq = eq, weight = weight, index = index, rules = rules, next = next, net = net};
 
 fun rules (Rules {rules = rs, ...}) = rs;
-fun may_unify (Rules {rules, net, ...}) tm = Tactic.orderlist (Net.unify_term net tm);
+
+
+(* retrieve rules *)
+
+fun gen_retrieve order (Rules {rules, net, ...}) tm =
+  Tactic.untaglist (map (fn ((_, k), x) => (k, x))
+    (sort (order o pairself #1) (Net.unify_term net tm)));
+
+fun retrieve x = gen_retrieve (int_ord o pairself snd) x;
+fun retrieve_weighted x = gen_retrieve (prod_ord int_ord int_ord) x;
 
 
 (* build rules *)
 
-fun init eq index = mk_rules eq index [] ~1 Net.empty;
+fun init eq weight index = mk_rules eq weight index [] ~1 Net.empty;
 
-fun add rule (Rules {eq, index, rules, next, net}) =
-  mk_rules eq index (rule :: rules) (next - 1)
-    (Net.insert_term ((index rule, (next, rule)), net, K false));
+fun add rule (Rules {eq, weight, index, rules, next, net}) =
+  mk_rules eq weight index (rule :: rules) (next - 1)
+    (Net.insert_term ((index rule, ((weight rule, next), rule)), net, K false));
 
-fun make eq index rules = foldr (uncurry add) (rules, init eq index);
+fun make eq weight index rules = foldr (uncurry add) (rules, init eq weight index);
 
 
-fun merge (Rules {eq, index, rules = rules1, ...}, Rules {rules = rules2, ...}) =
-  make eq index (Library.generic_merge eq I I rules1 rules2);
+fun merge (Rules {eq, weight, index, rules = rules1, ...}, Rules {rules = rules2, ...}) =
+  make eq weight index (Library.generic_merge eq I I rules1 rules2);
 
-fun delete rule (rs as Rules {eq, index, rules, next, net}) =
+fun delete rule (rs as Rules {eq, weight, index, rules, next, net}) =
   if not (Library.gen_mem eq (rule, rules)) then rs
-  else mk_rules eq index (Library.gen_rem eq (rules, rule)) next
-    (Net.delete_term ((index rule, (0, rule)), net, eq o pairself #2));
+  else mk_rules eq weight index (Library.gen_rem eq (rules, rule)) next
+    (Net.delete_term ((index rule, ((0, 0), rule)), net, eq o pairself #2));
 
 fun insert rule rs = add rule (delete rule rs);    (*ensure new rule gets precedence*)
 
@@ -68,8 +79,8 @@
 
 (* intro/elim rules *)
 
-val init_intro = init Thm.eq_thm Thm.concl_of;
-val init_elim = init Thm.eq_thm Thm.major_prem_of;
+val intro = init Thm.eq_thm Thm.nprems_of Thm.concl_of;
+val elim = init Thm.eq_thm Thm.nprems_of Thm.major_prem_of;
 
 
 end;