Use Pid_t.

[perl5.git] / Todo

diff --git a/Todo b/Todo
index 4752030..2bc1557 100644 (file)
--- a/Todo
+++ b/Todo
@@ -1,3 +1,6 @@
+Check out always the latest perl5-porters discussions on these subjects
+before embarking on an implementation tour.
+

 Tie Modules
        VecArray                Implement array using vec()
        SubstrArray             Implement array using substr()
 Tie Modules
        VecArray                Implement array using vec()
        SubstrArray             Implement array using substr()


@@ -5,14 +8,13 @@ Tie Modules
        ShiftSplice             Defines shift et al in terms of splice method
 
 Would be nice to have
        ShiftSplice             Defines shift et al in terms of splice method
 
 Would be nice to have

-       pack "(stuff)*"
+       pack "(stuff)*", "(stuff)4", ...

        Contiguous bitfields in pack/unpack
        lexperl
        Bundled perl preprocessor
        Use posix calls internally where possible
        Contiguous bitfields in pack/unpack
        lexperl
        Bundled perl preprocessor
        Use posix calls internally where possible

-       gettimeofday
+       gettimeofday (possibly best left for a module?)

        format BOTTOM
        format BOTTOM

-       -iprefix.

        -i rename file only when successfully changed
        All ARGV input should act like <>
        report HANDLE [formats].
        -i rename file only when successfully changed
        All ARGV input should act like <>
        report HANDLE [formats].


@@ -21,7 +23,33 @@ Would be nice to have
        reference to compiled regexp
        lexically scoped functions: my sub foo { ... }
        lvalue functions
        reference to compiled regexp
        lexically scoped functions: my sub foo { ... }
        lvalue functions

-       Full 64 bit support (i.e. "long long")
+           wantlvalue?  more generalized want()?
+       named prototypes: sub ($foo, @bar) foo { ... }
+       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
+            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.
+            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
+           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).
+       Unicode: [=bar=], combining characters equivalence
+           (U+4001 + U+0308 should be equal to U+00C4, in other words
+             A+diaereres should equal Ä), Unicode collation

 
 Possible pragmas
        debugger
 
 Possible pragmas
        debugger


@@ -30,8 +58,6 @@ Possible pragmas
 Optimizations
        constant function cache
        switch structures
 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?))
        foreach(reverse...)
        Set KEEP on constant split
        Cache eval tree (unless lexical outer scope used (mark in &compiling?))


@@ -40,13 +66,11 @@ Optimizations
        Cache hash value?  (Not a win, according to Guido)
        Optimize away @_ where possible
        "one pass" global destruction
        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
        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?
        Loop control on do{} et al
        Explicit switch statements
        make tr/// return histogram in list context?
        Loop control on do{} et al
        Explicit switch statements


@@ -55,5 +79,4 @@ Vague possibilities
        structured types
        autocroak?
        Modifiable $1 et al
        structured types
        autocroak?
        Modifiable $1 et al

-       substr EXPR,OFFSET,LENGTH,STRING