diff options
Diffstat (limited to 'Todo')
-rwxr-xr-x | Todo | 47 |
1 files changed, 19 insertions, 28 deletions
@@ -1,6 +1,6 @@ -Modules - POSIX (in progress) +Modules needed X/Motif/Tk etc. + Curses Tie Modules VecArray Implement array using vec() @@ -8,34 +8,18 @@ Tie Modules 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() + $obj->can("method") to probe method inheritance -iprefix. -i rename file only when successfully changed All ARGV input should act like <> @@ -44,30 +28,33 @@ Would be nice to have report HANDLE [formats]. tie(FILEHANDLE, ...) __DATA__ + support in perlmain to rerun debugger + make 'r' print return value like gdb 'fini' -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 + foreach(@array) + 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 } + Rewrite regexp parser for better integrated optimization -Need to think more about +Vague possibilities ref function in list context Populate %SIG at startup if appropriate - -Vague possibilities sub mysplice(@, $, $, ...) data prettyprint function? (or is it, as I suspect, a lib routine?) Nested destructors @@ -82,3 +69,7 @@ Vague possibilities structured types paren counting in tokener to queue remote expectations autocroak? + Modifiable $1 et al + substr EXPR,OFFSET,LENGTH,STRING + locally capture warnings into an array + |