[Stackless-checkins] CVS: slpdev/src/2.2/src/Tools/scripts dutree.doc, 1.1.1.1, 1.2

[Christian Tismer]

Update of /home/cvs/slpdev/src/2.2/src/Tools/scripts
In directory centera.de:/tmp/cvs-serv13270/src/Tools/scripts

Modified Files:
	dutree.doc 
Log Message:
checking Python 2.2.3 back in, almost unmodified.
The only modifications are in PCbuild, and the additon of the
new Stackless for 2.3.3 trunk.

Purpose: I will apply all current changes to 2.3.3 back to 2.2.3.
Since I'm unsure how to do this on the current dev trunk by CVS,
and since I never imported 2.2.3 before, I prefer to do it this
way, using the merge program explicitly.


Index: dutree.doc
===================================================================
RCS file: /home/cvs/slpdev/src/2.2/src/Tools/scripts/dutree.doc,v
retrieving revision 1.1.1.1
retrieving revision 1.2
diff -C2 -d -r1.1.1.1 -r1.2
*** dutree.doc	21 Jan 2002 01:01:45 -0000	1.1.1.1
--- dutree.doc	30 Apr 2004 22:11:28 -0000	1.2
***************
*** 1,54 ****
! Path: cwi.nl!sun4nl!mcsun!uunet!cs.utexas.edu!convex!usenet
! From: tchrist at convex.COM (Tom Christiansen)
! Newsgroups: comp.lang.perl
! Subject: Re: The problems of Perl (Re: Question (silly?))
! Message-ID: <1992Jan17.053115.4220 at convex.com>
! Date: 17 Jan 92 05:31:15 GMT
! References: <17458 at ector.cs.purdue.edu> <1992Jan16.165347.25583 at cherokee.uswest.com> <=#Hues+4 at cs.psu.edu>
! Sender: usenet at convex.com (news access account)
! Reply-To: tchrist at convex.COM (Tom Christiansen)
! Organization: CONVEX Realtime Development, Colorado Springs, CO
! Lines: 83
! Nntp-Posting-Host: pixel.convex.com
! 
! From the keyboard of flee at cs.psu.edu (Felix Lee):
! :And Perl is definitely awkward with data types.  I haven't yet found a
! :pleasant way of shoving non-trivial data types into Perl's grammar.
! 
! Yes, it's pretty aweful at that, alright.  Sometimes I write perl programs
! that need them, and sometimes it just takes a little creativity.  But
! sometimes it's not worth it.  I actually wrote a C program the other day
! (gasp) because I didn't want to deal with a game matrix with six links per node.
! 
! :Here's a very simple problem that's tricky to express in Perl: process
! :the output of "du" to produce output that's indented to reflect the
! :tree structure, and with each subtree sorted by size.  Something like:
! :    434 /etc
! :      |     344 .
! :      |      50 install
! :      |      35 uucp
! :      |       3 nserve
! :      |       |       2 .
! :      |       |       1 auth.info
! :      |       1 sm
! :      |       1 sm.bak
! 
! At first I thought I could just keep one local list around
! at once, but this seems inherently recursive.  Which means 
! I need an real recursive data structure.  Maybe you could
! do it with one of the %assoc arrays Larry uses in the begat
! programs, but I broke down and got dirty.  I think the hardest
! part was matching Felix's desired output exactly.  It's not 
! blazingly fast: I should probably inline the &childof routine,
! but it *was* faster to write than I could have written the 
! equivalent C program.
! 
! 
! --tom
! 
! --
! "GUIs normally make it simple to accomplish simple actions and impossible
! to accomplish complex actions."   --Doug Gwyn  (22/Jun/91 in comp.unix.wizards)
! 
!      Tom Christiansen           tchrist at convex.com      convex!tchrist
! 
--- 1,54 ----
! Path: cwi.nl!sun4nl!mcsun!uunet!cs.utexas.edu!convex!usenet
! From: tchrist at convex.COM (Tom Christiansen)
! Newsgroups: comp.lang.perl
! Subject: Re: The problems of Perl (Re: Question (silly?))
! Message-ID: <1992Jan17.053115.4220 at convex.com>
! Date: 17 Jan 92 05:31:15 GMT
! References: <17458 at ector.cs.purdue.edu> <1992Jan16.165347.25583 at cherokee.uswest.com> <=#Hues+4 at cs.psu.edu>
! Sender: usenet at convex.com (news access account)
! Reply-To: tchrist at convex.COM (Tom Christiansen)
! Organization: CONVEX Realtime Development, Colorado Springs, CO
! Lines: 83
! Nntp-Posting-Host: pixel.convex.com
! 
! From the keyboard of flee at cs.psu.edu (Felix Lee):
! :And Perl is definitely awkward with data types.  I haven't yet found a
! :pleasant way of shoving non-trivial data types into Perl's grammar.
! 
! Yes, it's pretty aweful at that, alright.  Sometimes I write perl programs
! that need them, and sometimes it just takes a little creativity.  But
! sometimes it's not worth it.  I actually wrote a C program the other day
! (gasp) because I didn't want to deal with a game matrix with six links per node.
! 
! :Here's a very simple problem that's tricky to express in Perl: process
! :the output of "du" to produce output that's indented to reflect the
! :tree structure, and with each subtree sorted by size.  Something like:
! :    434 /etc
! :      |     344 .
! :      |      50 install
! :      |      35 uucp
! :      |       3 nserve
! :      |       |       2 .
! :      |       |       1 auth.info
! :      |       1 sm
! :      |       1 sm.bak
! 
! At first I thought I could just keep one local list around
! at once, but this seems inherently recursive.  Which means 
! I need an real recursive data structure.  Maybe you could
! do it with one of the %assoc arrays Larry uses in the begat
! programs, but I broke down and got dirty.  I think the hardest
! part was matching Felix's desired output exactly.  It's not 
! blazingly fast: I should probably inline the &childof routine,
! but it *was* faster to write than I could have written the 
! equivalent C program.
! 
! 
! --tom
! 
! --
! "GUIs normally make it simple to accomplish simple actions and impossible
! to accomplish complex actions."   --Doug Gwyn  (22/Jun/91 in comp.unix.wizards)
! 
!      Tom Christiansen           tchrist at convex.com      convex!tchrist
! 


_______________________________________________
Stackless-checkins mailing list
Stackless-checkins at stackless.com
http://www.stackless.com/mailman/listinfo/stackless-checkins