1 Always check out the latest perl5-porters discussions on these subjects
2 before embarking on an implementation tour.
5 VecArray Implement array using vec()
6 SubstrArray Implement array using substr()
7 VirtualArray Implement array using a file
8 ShiftSplice Defines shift et al in terms of splice method
11 pack "(stuff)*", "(stuff)4", ...
12 contiguous bitfields in pack/unpack
14 bundled perl preprocessor
15 use posix calls internally where possible
16 gettimeofday (possibly best left for a module?)
18 -i rename file only when successfully changed
19 all ARGV input should act like <>
20 report HANDLE [formats].
21 support in perlmain to rerun debugger
22 regression tests using __DIE__ hook
23 lexically scoped functions: my sub foo { ... }
25 wantlvalue? more generalized want()/caller()?
26 named prototypes: sub foo ($foo, @bar) { ... } ?
27 regression/sanity tests for suidperl
28 iterators/lazy evaluation/continuations/first/
29 first_defined/short-circuiting grep/??
30 This is a very thorny and hotly debated subject,
31 tread carefully and do your homework first
32 full 64 bit support (i.e. "long long"). Things to consider:
33 how to store/retrieve 32+ integers into/from Perl scalars?
34 32+ constants in Perl code? (non-portable!)
35 32+ arguments/return values to/from system calls? (seek et al)
36 32+ bit ops (&|^~, currently explicitly disabled)
37 generalise Errno way of extracting cpp symbols and use that in
38 Errno and Fcntl (ExtUtils::CppSymbol?)
39 the _r-problem: for all the {set,get,end}*() system database
40 calls (and a couple more: readdir, *rand*, crypt, *time,
41 tmpnam) there are in many systems the _r versions
42 to be used in re-entrant (=multithreaded) code
43 Icky things: the _r API is not standardized and
44 the _r-forms require per-thread data to store their state
45 memory profiler: turn malloc.c:Perl_dump_mstats() into
46 an extension (Devel::MProf?) that would return the malloc
47 stats in a nice Perl datastructure (also a simple interface
48 to return just the grand total would be good)
49 Unicode: [=bar=], combining characters equivalence
50 (U+4001 + U+0308 should be equal to U+00C4, in other words
51 A+diaereres should equal Ä), Unicode collation
55 optimize (use less qw[memory cpu])
58 constant function cache
61 optimize away constant split at compile time (a la qw[f o o])
62 cache eval tree (unless lexical outer scope used (mark in &compiling?))
64 shrink opcode tables via multiple implementations selected in peep
65 cache hash value? (Not a win, according to Guido)
66 optimize away @_ where possible
67 "one pass" global destruction
68 rewrite regexp parser for better integrated optimization
69 LRU cache of regexp: foreach $pat (@pats) { foo() if /$pat/ }
72 ref function in list context?
73 make tr/// return histogram in list context?
74 loop control on do{} et al
75 explicit switch statements
77 compile to real threaded code