X-Git-Url: http://git.shadowcat.co.uk/gitweb/gitweb.cgi?a=blobdiff_plain;f=Todo;h=3340e4fbf5052e9dfebcbe2a437f2b40f58cd5c9;hb=134ca994cfefe0f613d43505a885e4fc2100b05c;hp=6e75f7ea37168afea07f2a75aaff3d92e1680b3b;hpb=85e6fe838fb25b257a1b363debf8691c0992ef71;p=p5sagit%2Fp5-mst-13.2.git

diff --git a/Todo b/Todo
old mode 100755
new mode 100644
index 6e75f7e..3340e4f
--- a/Todo
+++ b/Todo
@@ -1,84 +1,57 @@
-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__
-
-Possible averments
+	support in perlmain to rerun debugger
+	regression tests using __DIE__ hook
+	reference to compiled regexp
+	lexically scoped functions: my sub foo { ... }
+	lvalue functions
+	regression/sanity tests for suidperl
+	Full 64 bit support (i.e. "long long")
+
+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(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(@, $, $, ...)
-	data prettyprint function?  (or is it, as I suspect, a lib routine?)
-	Nested destructors
+	ref function in list context
 	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
+