diff options
| author | Raymond Hettinger <python@rcn.com> | 2015-09-08 00:36:56 -0400 |
|---|---|---|
| committer | Raymond Hettinger <python@rcn.com> | 2015-09-08 00:36:56 -0400 |
| commit | 6a97f4d4add4a048b03db0576a3da6522a02e176 (patch) | |
| tree | a0eb3c2cf7546b895a6f47b5e6b9404a6cc45b62 /Tools/scripts/dutree.doc | |
| parent | ba1b338c7060bb018ad015964d7da94621fc18ca (diff) | |
| parent | a505c27518b3bc7e2c088dd7d4db802956e1155d (diff) | |
| download | cpython-6a97f4d4add4a048b03db0576a3da6522a02e176.tar.gz | |
merge
Diffstat (limited to 'Tools/scripts/dutree.doc')
| -rw-r--r-- | Tools/scripts/dutree.doc | 6 |
1 files changed, 3 insertions, 3 deletions
diff --git a/Tools/scripts/dutree.doc b/Tools/scripts/dutree.doc index 2a094261b1..97bd2e2e47 100644 --- a/Tools/scripts/dutree.doc +++ b/Tools/scripts/dutree.doc @@ -34,13 +34,13 @@ sometimes it's not worth it. I actually wrote a C program the other day : | 1 sm.bak At first I thought I could just keep one local list around -at once, but this seems inherently recursive. Which means +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 +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 +but it *was* faster to write than I could have written the equivalent C program. |