on a 128 CPU machine... now I know
that's not entirely realistic, but it should be able to run at least say
60 times faster.
Amdahl's law applies here: "no amount of paralellism will speed up
an inheirently sequential algorithm"
--
Mark Biggar
[EMAIL PROTECTED]
o to all the bother
of transforing the "grep"s and "map"s to lazy iterator forms?
--
Mark Biggar
[EMAIL PROTECTED]
r ways
proposed will only lead to mysterious bugs and programmer
missunderstandings.
--
Mark Biggar
[EMAIL PROTECTED]
oo-woo)" in there. Just a plain old
primitive array.
I imagine that each primative type will have a default default :-)
int0
str''
num0.0
etc.
and if we define a prop "is no_default" then you get what ever
junk happens to be in memory. (this for even more speed)
--
Mark Biggar
[EMAIL PROTECTED]
claration is only a suggestion and
often there is a real version of the sub in addition to any
inlined copies. Besides a wrapped inline sub is in no different
situation as a inlined sub being called in another inlined sub,
this seem to be all part of what the compiler has to be able to do
to deal with a recursive sub that is also declared inline.
--
Mark Biggar
[EMAIL PROTECTED]
my cat_table %pet;
sub feed (cat_table %cats) {...}
--
Mark Biggar
[EMAIL PROTECTED]
[EMAIL PROTECTED]
gnums work with the printf formating
facility would be nice.
The current BigFloat.pm uses length(divisor)+length(dividend)+2
for the maximum precesion of the result of a divide as opposed
to max(divisor, dividend) stated in the pdd.
--
Mark Biggar
[EMAIL PROTECTED]
[EMAIL PROTECTED]
; # goes to f
myprint "Differnet World!\n";# goes to IO:STDOUT
although maybe what I really want is := instead.
--
Mark Biggar
[EMAIL PROTECTED]
[EMAIL PROTECTED]
IMCC should also. Second we need to handle
BigFloat values and I don't really want to have to express 1e12345
as a 12345+ length char string. On a related note does IMCC have a
token or line length limit?
--
Mark Biggar
[EMAIL PROTECTED]
[EMAIL PROTECTED]
t the thunk
may need to be an lvalue clouser to handle is rw paramenters.
Side effects happen each time the thunk is called. Also changes
to the thunks environment can effect its value when called.
Either of those can have threading added as well.
--
Mark Biggar
[EMAIL PROTECTED]
[EMAIL PROTECTED]
motion and demotion between the various types.
--
Mark Biggar
Perl'sMaternal Uncle
[EMAIL PROTECTED]
[EMAIL PROTECTED]
), but constants aren't the
interesting case, one(@a) is. I suppose we could define a
:uniq(true|false) adverb to modify the meaning of one() so we could
have both interpretations.
Mark Biggar
that something is not impure is an
NP-complete problem.
Worse it's equivalent to the halting problem (I.e., not solvable). In
general any non-trivial
property of a program of the form "Does this program ever do ..." is
equivalent to the halting problem.
Mark Biggar
--
m...@b
Darren Duncan wrote:
In reply to Jon Lang,
What I'm proposing here in the general case, is a generic collection
type, "Interval" say, that can represent a discontinuous interval of an
ordered type. A simple way of defining such a type is that it is a "Set
of Pair of Ordered", where each Pair
On 4/9/2010 4:53 AM, Moritz Lenz wrote:
Am 09.04.2010 13:34, schrieb Mark J. Reed:
The date still corresponds to an actual day. If I set it to Feb 31, I
should get back Mar 2 or 3 depending on the year. While I'm having
trouble thinking of a good specific example, it's a capability I've
taken ad
t makes
this the same as
for 0 ...7 -> $i { say $i }
so as long as those are the right precedence levels for those operators
this is not a bug
Mark Biggar
--
m...@biggar.org
mark.a.big...@comcast.net
16 matches
Mail list logo
