diff options
| author | Serhiy Storchaka <storchaka@gmail.com> | 2015-04-03 16:42:32 (GMT) |
|---|---|---|
| committer | Serhiy Storchaka <storchaka@gmail.com> | 2015-04-03 16:42:32 (GMT) |
| commit | 45ec3288d0e181334efcaeac7ce6ef44771a2689 (patch) | |
| tree | a6d36ce2e0931bc869ad0529ad88cef617937ebe /Tools/scripts/dutree.doc | |
| parent | 50ef0f41afd313ed3c433f724e6aaa79d7e55c02 (diff) | |
| download | cpython-45ec3288d0e181334efcaeac7ce6ef44771a2689.zip cpython-45ec3288d0e181334efcaeac7ce6ef44771a2689.tar.gz cpython-45ec3288d0e181334efcaeac7ce6ef44771a2689.tar.bz2 | |
Removed trailing whitespaces in miscalenous files.
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 2a09426..97bd2e2 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. |