_58: wantarray in void context broken

[perl5.git] / Todo

diff --git a/Todo b/Todo
old mode 100755 (executable)
new mode 100644 (file)
index 6e75f7e..627045c
--- a/Todo
+++ b/Todo
@@ -1,84 +1,58 @@
-Modules
-       POSIX (in progress)
-       X/Motif/Tk etc.
-
 Tie Modules
        VecArray                Implement array using vec()
        SubstrArray             Implement array using substr()
        VirtualArray            Implement array using a file
        ShiftSplice             Defines shift et al in terms of splice method
 
-Bugs
-       Make yyparse recursion longjmp() proof.
-       Make "delete $array{$key} while ($key) = each %array" safe
-       <$handle> doesn't work intuitively if $handle is ARGV
-       Anything in the Bugs directory
-
-Regexp extensions
-       /m  for multiline
-       /\Afoo/ (beginning of string, or where previous g match left off)
-       /foo\Z/ (end of string only)
-       negative regexp assertions?
-       /<>/x for grouping?
-       /f for fixed variable interpolation?
-       Rewrite regexp parser for better integrated optimization
-
 Would be nice to have
-       Profiler
        pack "(stuff)*"
        Contiguous bitfields in pack/unpack
        lexperl
        Bundled perl preprocessor
-       Make $[ compile-time instead of run-time
        Use posix calls internally where possible
-       const variables
        gettimeofday
-       bytecompiler
        format BOTTOM
-       willcall()
        -iprefix.
        -i rename file only when successfully changed
        All ARGV input should act like <>
-       Multiple levels of warning
-       .= shouldn't complain about undefined under -w
        report HANDLE [formats].
-       tie(FILEHANDLE, ...)
-       __DATA__
+       support in perlmain to rerun debugger
+       regression tests using __DIE__ hook
+       reference to compiled regexp
+       lexically scoped functions: my sub foo { ... }
+       lvalue functions
 
-Possible averments
+Possible pragmas
        debugger
-       optimize
+       optimize (use less memory, CPU)
 
 Optimizations
-       Optimize switch statements
-       Optimize foreach on array
-       Optimize foreach (1..1000000)
+       constant function cache
+       switch structures
+       eval qw() at compile time
+       foreach (1..1000000)
+       foreach(reverse...)
        Set KEEP on constant split
        Cache eval tree (unless lexical outer scope used (mark in &compiling?))
        rcatmaybe
        Shrink opcode tables via multiple implementations selected in peep
-       Cache hash value?
+       Cache hash value?  (Not a win, according to Guido)
        Optimize away @_ where possible
-       sfio?
        "one pass" global destruction
        Optimize sort by { $a <=> $b }
-
-Need to think more about
-       ref function in list context
-       Populate %SIG at startup if appropriate
+       Rewrite regexp parser for better integrated optimization
+       LRU cache of regexp: foreach $pat (@pats) { foo() if /$pat/ }
 
 Vague possibilities
-       sub mysplice(@, $, $, ...)
+       ref function in list context
        data prettyprint function?  (or is it, as I suspect, a lib routine?)
-       Nested destructors
        make tr/// return histogram in list context?
-       undef wantarray in void context
        Loop control on do{} et al
        Explicit switch statements
-       perl to C translator
-       multi-thread scheduling
        built-in globbing
        compile to real threaded code
        structured types
-       paren counting in tokener to queue remote expectations
        autocroak?
+       Modifiable $1 et al
+       substr EXPR,OFFSET,LENGTH,STRING
+