File: readonly.sml

package info (click to toggle)
mlton 20210117%2Bdfsg-3
  • links: PTS, VCS
  • area: main
  • in suites: sid
  • size: 58,464 kB
  • sloc: ansic: 27,682; sh: 4,455; asm: 3,569; lisp: 2,879; makefile: 2,347; perl: 1,169; python: 191; pascal: 68; javascript: 7
file content (57 lines) | stat: -rw-r--r-- 1,639 bytes parent folder | download | duplicates (5)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
(*
 *  This view make a graph readonly.
 *
 *  -- Allen
 *)

signature READONLY_GRAPH_VIEW =
sig
  
   val readonly_view : ('n,'e,'g) Graph.graph -> ('n,'e,'g) Graph.graph

end

structure ReadOnlyGraphView : READONLY_GRAPH_VIEW =
struct

   structure G = Graph

   fun readonly_view (G.GRAPH G) =
   let fun unimplemented _ = raise G.Readonly
   in
       G.GRAPH
       { name            = #name G,
         graph_info      = #graph_info G,
         new_id          = unimplemented,
         add_node        = unimplemented,
         add_edge        = unimplemented,
         remove_node     = unimplemented,
         set_in_edges    = unimplemented,
         set_out_edges   = unimplemented,
         set_entries     = unimplemented,
         set_exits       = unimplemented,
         garbage_collect = unimplemented,
         nodes           = #nodes G,
         edges           = #edges G,
         order           = #order G,
         size            = #size G,
         capacity        = #capacity G,
         out_edges       = #out_edges G,
         in_edges        = #in_edges G,
         succ            = #succ G,
         pred            = #pred G,
         has_edge        = #has_edge G,
         has_node        = #has_node G,
         node_info       = #node_info G,
         entries         = #entries G,
         exits           = #exits G,
         entry_edges     = #entry_edges G,
         exit_edges      = #exit_edges G,
         forall_nodes    = #forall_nodes G,
         forall_edges    = #forall_edges G
         (* fold_nodes      = #fold_nodes G,
         fold_edges      = #fold_edges G *)
       }
   end
end