X-Git-Url: http://git.shadowcat.co.uk/gitweb/gitweb.cgi?a=blobdiff_plain;f=Todo;h=5e48ba62448f9dc1b96edaa7e45ba6d0d73c3a48;hb=451e086022facb7867a6764d6ffca2b71e86ff73;hp=3393a7fdfe706b1c2fc7038c2104d4dc8ad6e23e;hpb=93a17b20b6d176db3f04f51a63b0a781e5ffd11c;p=p5sagit%2Fp5-mst-13.2.git

diff --git a/Todo b/Todo
old mode 100755
new mode 100644
index 3393a7f..5e48ba6
--- a/Todo
+++ b/Todo
@@ -1,31 +1,59 @@
-POSIX compatibility
-hash binding
-pack(P)
-fix gv refcnts
+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
 
-/\Afoo/ (beginning of string, or where previous g match left off)
-/foo\Z/ (end of string only)
-Make specialized allocators
-Optimize switch statements
-Optimize foreach on array
-Optimize foreach (1..1000000)
-Set KEEP on constant split
-Cache eval tree (unless lexical outer scope used (mark in &compiling?))
-rcatmaybe
-Cache method lookup
-Shrink opcode tables via multiple implementations selected in peep
-Straighten out the RS stuff in BEGIN
-Make yyparse recursion longjmp() proof.
+Would be nice to have
+	pack "(stuff)*"
+	Contiguous bitfields in pack/unpack
+	lexperl
+	Bundled perl preprocessor
+	Use posix calls internally where possible
+	gettimeofday
+	format BOTTOM
+	-iprefix.
+	-i rename file only when successfully changed
+	All ARGV input should act like <>
+	report HANDLE [formats].
+	support in perlmain to rerun debugger
+	regression tests using __DIE__ hook
+	reference to compiled regexp
+	lexically scoped functions: my sub foo { ... }
+	lvalue functions
+
+Possible pragmas
+	debugger
+	optimize (use less memory, CPU)
+
+Optimizations
+	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?  (Not a win, according to Guido)
+	Optimize away @_ where possible
+	"one pass" global destruction
+	Optimize sort by { $a <=> $b }
+	Rewrite regexp parser for better integrated optimization
+	LRU cache of regexp: foreach $pat (@pats) { foo() if /$pat/ }
+
+Vague possibilities
+	ref function in list context
+	data prettyprint function?  (or is it, as I suspect, a lib routine?)
+	make tr/// return histogram in list context?
+	undef wantarray in void context
+	Loop control on do{} et al
+	Explicit switch statements
+	built-in globbing
+	compile to real threaded code
+	structured types
+	autocroak?
+	Modifiable $1 et al
+	substr EXPR,OFFSET,LENGTH,STRING
 
-sub mysplice(@, $, $, ...)?
-pretty function?  (or is it, as I suspect, a lib routine?)
-perlex function?
-X Perl?  Motif Perl?
-give DOG $bone?
-Nested destructors?
-make tr/// return histogram in list context?
-Implement eval once?  (Unnecessary with cache?)
-When does split() go to @_?
-undef wantarray in void context?
-goto &coroutine?
-filehandle references?