X-Git-Url: http://git.shadowcat.co.uk/gitweb/gitweb.cgi?a=blobdiff_plain;f=Todo;h=0db8ae27a66a2bd5b5f041bbef6e339508f5eb87;hb=7f2c89897f1cc260c9f4949731056784f989703f;hp=b8d9012afff2d16539e0b7c5717c5104c0a12aa7;hpb=ed3f4a3244fff06a217247055f3b2140e04309e6;p=p5sagit%2Fp5-mst-13.2.git

diff --git a/Todo b/Todo
index b8d9012..0db8ae2 100644
--- a/Todo
+++ b/Todo
@@ -1,5 +1,5 @@
-Check out always the latest perl5-porters discussions on these subjects
-before embaring on an implementation tour.
+Always check out the latest perl5-porters discussions on these subjects
+before embarking on an implementation tour.
 
 Tie Modules
 	VecArray		Implement array using vec()
@@ -8,72 +8,66 @@ Tie Modules
 	ShiftSplice		Defines shift et al in terms of splice method
 
 Would be nice to have
-	pack "(stuff)*", "(stuff)4", ...
-	Contiguous bitfields in pack/unpack
+	pack "(stuff)*", "(stuff)?", "(stuff)+", "(stuff)4", ...
+	contiguous bitfields in pack/unpack
 	lexperl
-	Bundled perl preprocessor
-	Use posix calls internally where possible
+	bundled perl preprocessor/macro facility
+	    this would solve many of the syntactic nice-to-haves
+	use posix calls internally where possible
 	gettimeofday (possibly best left for a module?)
 	format BOTTOM
 	-i rename file only when successfully changed
-	All ARGV input should act like <>
+	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
-	    wantlvalue?  more generalized want()?
-	named prototypes: sub ($foo, @bar) foo { ... }
+        wantlvalue?  more generalized want()/caller()?
+	named prototypes: sub foo ($foo, @bar) { ... } ?
 	regression/sanity tests for suidperl
 	iterators/lazy evaluation/continuations/first/
 	    first_defined/short-circuiting grep/??
 	    This is a very thorny and hotly debated subject,
-	    tread carefully and do your homework first.
-	Full 64 bit support (i.e. "long long").  Things to consider:
-	    how to store/retrieve 32+ integers into/from Perl scalars?
-	    32+ constants in Perl code? (non-portable!)
-	    32+ arguments/return values to/from system calls? (seek et al)
-	    32+ bit ops (&|^~, currently explicitly disabled)
-	Generalise Errno way of extracting cpp symbols and use that in
-	    Errno and Fcntl (ExtUtils::CppSymbol?)
-	The _r-problem: for all the {set,get,end}*() system database
+	    tread carefully and do your homework first
+	generalise Errno way of extracting cpp symbols and use that in
+	    Errno, Fcntl, POSIX (ExtUtils::CppSymbol?)
+	the _r-problem: for all the {set,get,end}*() system database
 	     calls (and a couple more: readdir, *rand*, crypt, *time,
 	     tmpnam) there are in many systems the _r versions
-	     to be used in re-entrant (=multithreaded) code.
+	     to be used in re-entrant (=multithreaded) code
 	     Icky things: the _r API is not standardized and
-	     the _r-forms require per-thread data to store their state.
-	Memory profiler: turn malloc.c:Perl_dump_mstats() into
+	     the _r-forms require per-thread data to store their state
+	memory profiler: turn malloc.c:Perl_get_mstats() into
 	    an extension (Devel::MProf?) that would return the malloc
 	    stats in a nice Perl datastructure (also a simple interface
-	    to return just the grand total would be good).
+	    to return just the grand total would be good)
+	a way to make << and >> to shift bitvectors instead of numbers
 
 Possible pragmas
 	debugger
-	optimize (use less memory, CPU)
+	optimize (use less qw[memory cpu])
 
 Optimizations
 	constant function cache
 	switch structures
 	foreach(reverse...)
-	Set KEEP on constant split
-	Cache eval tree (unless lexical outer scope used (mark in &compiling?))
+	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
+	shrink opcode tables via multiple implementations selected in peep
+	cache hash value?  (Not a win, according to Guido)
+	optimize away @_ where possible
+	tail recursion removal
 	"one pass" global destruction
-	Rewrite regexp parser for better integrated optimization
+	rewrite regexp parser for better integrated optimization
 	LRU cache of regexp: foreach $pat (@pats) { foo() if /$pat/ }
 
 Vague possibilities
-	ref function in list context
+	ref function in list context?
 	make tr/// return histogram in list context?
-	Loop control on do{} et al
-	Explicit switch statements
+	loop control on do{} et al
+	explicit switch statements
 	built-in globbing
 	compile to real threaded code
 	structured types
 	autocroak?
-	Modifiable $1 et al
-
+	modifiable $1 et al