Commit e0a5c8f3 authored by bguillaum's avatar bguillaum

remove useless flatten function

git-svn-id: svn+ssh://scm.gforge.inria.fr/svn/semagramme/libcaml-grew/trunk@8967 7838e531-6607-4d57-9587-6c381814729c
parent f4ae4109
......@@ -295,7 +295,7 @@ module Grs = struct
~confluent: next.Modul.confluent
next.Modul.rules
next.Modul.filters
(Instance.flatten instance) in
instance in
let good_list = Instance_set.elements good_set
and bad_list = Instance_set.elements bad_set in
{
......@@ -322,7 +322,7 @@ module Grs = struct
~confluent: next.Modul.confluent
next.Modul.rules
next.Modul.filters
(Instance.flatten instance) in
instance in
let inst_list = Instance_set.elements good_set
(* and bad_list = Instance_set.elements bad_set *) in
......
......@@ -44,20 +44,6 @@ module Instance = struct
| Some bs -> Some {bs with Libgrew_types.small_step = List.rev bs.Libgrew_types.small_step }
}
let flatten t = t (* TODO remove *)
(*
let flatten t =
(* [mapping] is list of couple (node_id, node_id) used to flatten the graph *)
let (mapping, new_free) = List.fold_left
(fun (acc_map, next_free) node_id ->
(
(node_id, Gid.Old next_free) :: acc_map,
next_free + 1
)
) ([], t.highest_index) t.actiiivated_node in
{ empty with graph = G_graph.rename mapping t.graph; highest_index = new_free }
*)
(* comparison is done on the list of commands *)
(* only graph rewritten from the same init graph can be "compared" *)
let compare t1 t2 = Pervasives.compare t1.history t2.history
......
......@@ -33,10 +33,6 @@ module Instance : sig
is in the head of the list and the reverse is needed for display. *)
val rev_steps: t -> t
(** [flatten inst] returns a fresh representation of the graph where gid created by node
activation are map to elementary gid. Graphs are flattened after each module. *)
val flatten: t -> t
(** [to_gr t] returns a string which contains the "gr" code of the current graph *)
val to_gr: Domain.t -> t -> string
......
Markdown is supported
0%
or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment