--- a/src/Pure/General/graph.ML Thu Sep 01 16:19:02 2005 +0200
+++ b/src/Pure/General/graph.ML Thu Sep 01 18:48:50 2005 +0200
@@ -86,11 +86,11 @@
fun maximals (Graph tab) = Table.fold (fn (m, (_, (_, []))) => cons m | _ => I) tab [];
fun get_entry (Graph tab) x =
- (case Table.lookup (tab, x) of
+ (case Table.curried_lookup tab x of
SOME entry => entry
| NONE => raise UNDEF x);
-fun map_entry x f (G as Graph tab) = Graph (Table.update ((x, f (get_entry G x)), tab));
+fun map_entry x f (G as Graph tab) = Graph (Table.curried_update (x, f (get_entry G x)) tab);
(* nodes *)
@@ -142,7 +142,7 @@
(* nodes *)
fun new_node (x, info) (Graph tab) =
- Graph (Table.update_new ((x, (info, ([], []))), tab));
+ Graph (Table.curried_update_new (x, (info, ([], []))) tab);
fun default_node (x, info) (Graph tab) =
Graph (Table.default (x, (info, ([], []))) tab);