summaryrefslogtreecommitdiff
path: root/lib/tsort.rb
diff options
context:
space:
mode:
authorakr <akr@b2dd03c8-39d4-4d8f-98ff-823fe69b080e>2002-09-11 12:29:17 +0000
committerakr <akr@b2dd03c8-39d4-4d8f-98ff-823fe69b080e>2002-09-11 12:29:17 +0000
commitc47f24027a3473fbdf9510cc300565fb1e6f1db8 (patch)
tree8c9773ba66d0c783ebe8b867db5c410fba9a4b17 /lib/tsort.rb
parentbfb17752441e7d0106dff08c74a6fcd01131a6f8 (diff)
* pp.rb (ARGF.pretty_print): implemented.
(PP.pp): arguments reordered. git-svn-id: svn+ssh://ci.ruby-lang.org/ruby/trunk@2851 b2dd03c8-39d4-4d8f-98ff-823fe69b080e
Diffstat (limited to 'lib/tsort.rb')
-rw-r--r--lib/tsort.rb4
1 files changed, 4 insertions, 0 deletions
diff --git a/lib/tsort.rb b/lib/tsort.rb
index 0dd68c6..21adeaa 100644
--- a/lib/tsort.rb
+++ b/lib/tsort.rb
@@ -78,9 +78,13 @@ TSort uses Hash internally.
--- tsort_each_node {|node| ...}
should be implemented by a extended class.
+ (({tsort_each_node})) is used to iterate for all nodes over a graph.
+
--- tsort_each_child(node) {|child| ...}
should be implemented by a extended class.
+ (({tsort_each_child})) is used to iterate for child nodes of ((|node|)).
+
== More Realistic Example
Very simple `make' like tool can be implemented as follows: