Index: doc/example-scripts/rosetta-multiple-distinct.html =================================================================== diff -u -rcc85907efa33d1b8505791285175769571f6f9e4 -r8648ec770a59ed911769dd51cf2658045110c748 --- doc/example-scripts/rosetta-multiple-distinct.html (.../rosetta-multiple-distinct.html) (revision cc85907efa33d1b8505791285175769571f6f9e4) +++ doc/example-scripts/rosetta-multiple-distinct.html (.../rosetta-multiple-distinct.html) (revision 8648ec770a59ed911769dd51cf2658045110c748) @@ -814,16 +814,16 @@ } % llength [Klass info instances] -$n; +100; % llength [lsort -unique $theList] -$n; +100;

Index: doc/example-scripts/rosetta-multiple-distinct.tcl =================================================================== diff -u -rcc85907efa33d1b8505791285175769571f6f9e4 -r8648ec770a59ed911769dd51cf2658045110c748 --- doc/example-scripts/rosetta-multiple-distinct.tcl (.../rosetta-multiple-distinct.tcl) (revision cc85907efa33d1b8505791285175769571f6f9e4) +++ doc/example-scripts/rosetta-multiple-distinct.tcl (.../rosetta-multiple-distinct.tcl) (revision 8648ec770a59ed911769dd51cf2658045110c748) @@ -46,5 +46,5 @@ lappend theList [Klass new] } -? {llength [Klass info instances]} $n; -? {llength [lsort -unique $theList]} $n; +? {llength [Klass info instances]} 100; +? {llength [lsort -unique $theList]} 100; Index: doc/example-scripts/rosetta-tree.tcl =================================================================== diff -u -rf769aa3bf33311a58e91f5041130d34daf840e7c -r8648ec770a59ed911769dd51cf2658045110c748 --- doc/example-scripts/rosetta-tree.tcl (.../rosetta-tree.tcl) (revision f769aa3bf33311a58e91f5041130d34daf840e7c) +++ doc/example-scripts/rosetta-tree.tcl (.../rosetta-tree.tcl) (revision 8648ec770a59ed911769dd51cf2658045110c748) @@ -1,5 +1,5 @@ # -# == Rosetta example:https://rosettacode.org/wiki/Tree_traversal +# == Rosetta example: https://rosettacode.org/wiki/Tree_traversal # # # Implement a binary tree structure, with each node carrying an