equal
deleted
inserted
replaced
228 { |
228 { |
229 def is_empty: Boolean = rep.isEmpty |
229 def is_empty: Boolean = rep.isEmpty |
230 def apply(name: Document.Node.Name): Node_Status = rep(name) |
230 def apply(name: Document.Node.Name): Node_Status = rep(name) |
231 def get(name: Document.Node.Name): Option[Node_Status] = rep.get(name) |
231 def get(name: Document.Node.Name): Option[Node_Status] = rep.get(name) |
232 |
232 |
233 def dest: List[(Document.Node.Name, Node_Status)] = |
233 def present: List[(Document.Node.Name, Node_Status)] = |
234 for { name <- nodes.topological_order; node_status <- get(name) } |
234 for { name <- nodes.topological_order; node_status <- get(name) } |
235 yield (name, node_status) |
235 yield (name, node_status) |
236 |
236 |
237 def quasi_consolidated(name: Document.Node.Name): Boolean = |
237 def quasi_consolidated(name: Document.Node.Name): Boolean = |
238 rep.get(name) match { |
238 rep.get(name) match { |