equal
deleted
inserted
replaced
389 val graph1 = Nodes.init(graph, name) |
389 val graph1 = Nodes.init(graph, name) |
390 graph1.is_maximal(name) && graph1.get_node(name).is_empty |
390 graph1.is_maximal(name) && graph1.get_node(name).is_empty |
391 } |
391 } |
392 |
392 |
393 def purge_suppressed: Option[Nodes] = |
393 def purge_suppressed: Option[Nodes] = |
394 graph.keys_iterator.filter(suppressed).toList match { |
394 names_iterator.filter(suppressed).toList match { |
395 case Nil => None |
395 case Nil => None |
396 case del => Some(new Nodes(del.foldLeft(graph)(_.del_node(_)))) |
396 case del => Some(new Nodes(del.foldLeft(graph)(_.del_node(_)))) |
397 } |
397 } |
398 |
398 |
399 def + (entry: (Node.Name, Node)): Nodes = { |
399 def + (entry: (Node.Name, Node)): Nodes = { |
409 def domain: Set[Node.Name] = graph.domain |
409 def domain: Set[Node.Name] = graph.domain |
410 |
410 |
411 def iterator: Iterator[(Node.Name, Node)] = |
411 def iterator: Iterator[(Node.Name, Node)] = |
412 graph.iterator.map({ case (name, (node, _)) => (name, node) }) |
412 graph.iterator.map({ case (name, (node, _)) => (name, node) }) |
413 |
413 |
|
414 def names_iterator: Iterator[Node.Name] = graph.keys_iterator |
|
415 |
414 def theory_name(theory: String): Option[Node.Name] = |
416 def theory_name(theory: String): Option[Node.Name] = |
415 graph.keys_iterator.find(name => name.theory == theory) |
417 names_iterator.find(name => name.theory == theory) |
416 |
418 |
417 def commands_loading(file_name: Node.Name): List[Command] = |
419 def commands_loading(file_name: Node.Name): List[Command] = |
418 (for { |
420 (for { |
419 (_, node) <- iterator |
421 (_, node) <- iterator |
420 cmd <- node.load_commands.iterator |
422 cmd <- node.load_commands.iterator |