if the values you are storing in floats are known to be integers of a size less
then the mantissa for he floating type then exact comparisons work just as
expected. Storing 10 digit phone numbers as floats is an example of this.
There must be some way to access exact comparisons in the languag
Has any FOSS developer ever been found liable (or even sued)?
Not that I have any objections to this plan but it might be worth
considering that it's much easier to sue a single entity then it is to
file a tort against a few tens or hundreds of contributors.
Yes, the guy who wrote an open sou
Joshua Hoblitt wrote:
a) live with it
b) change the magic number to be two identical bytes so the byte
ordering doesn't matter
c) shrink the magic number to be a single byte
d) use a magic number that can also be used as the byte order indicator.
--
[EMAIL PROTECTED]
[EMAIL PROTECTED]
Dino Morelli wrote:
I'm working on more p6rules unit tests.
Having some trouble. First, understanding when :w means \s* and when it
means \s+
Also, these tests are failing when I use :: to separate the modifier
from the pattern. But they work when I do ':w blah' (separate with a
space). I'm not sur
Luke Palmer wrote:
Jeff Clites writes:
On Sep 7, 2004, at 6:26 AM, Dan Sugalski wrote:
*) Namespaces are hierarchical
So we can have ["foo"; "bar"; "baz"] for a namespace. Woo hoo and all
that. It'd map to the equivalent perl namespace of foo::bar::baz.
How does this hierarchical nature manifest?
Dan Sugalski wrote:
At 11:03 PM -0700 8/21/04, Steve Fink wrote:
I am experimenting with registering my own compiler for the "regex"
language, but the usage is confusing. It seems that the intention is
that compilers will return a code object that gets invoked, at which
time it runs until it hits a
Yeah, but I believe that at least Unicode has one of the four that they suggest
be used for non-locale specific comparisons (canonical decomposition form).
So pick that one for the core and provide the others (if necessary) as library
functions.
--
Mark Biggar
[EMAIL PROTECTED]
[EMAIL PROTECTED
Do we want a Normalization function here as well. If you have that you can use a
binary compare (at least for eq/ne).
--
Mark Biggar
[EMAIL PROTECTED]
> The charset vtable needs to handle get/set grapheme, get/set
> substring, up/down/titlecase, and (possibly) comparison. Charsets
> also ha
You wrote:
>i don't think there is a need for all those variants. why would alarm
>need any special opcode when it is just a timer with a delay of abs_time
>- NOW? let the coder handle that and lose the extra op codes.
No, you don't want to do it that way. Becasue you want to make the latency
bet
Dan wrote:
> At the moment I'm thinking of the load path as an array of subs that
> get passed in the file being looked for and return... something. I'm
> not sure what, though.
Don't reinvent the wheel here. Obviously what should be return is an URI.
If we start off only supporting "file://...
The real problem is that you always want to use exactly the same code for
ALL cases of string-to-float conversion. The first public example of this
problem was the FORTRAN II compiler from IBM in the 60's. The compiler and
the IO library was written by two different people and so constants in
pro
Don't forget about cache invalidation on dynamic method redefinition.
--
Mark Biggar
[EMAIL PROTECTED]
> Okay, so it's method cache time.
>
> First important note: I've never done this before (I think my
> antipathy towards objects might've given everyone just the tiniest
> clue :) so pointers
> What I'm thinking we may want to do is provide a minimal
> interface--turn the time integer into a string rep or split out into
> an array, something like:
>
> localtime Sx, Iy
> gmtime Sx, Iy
>
You almost have to provide at least these, as you have to deal with
how various OS's ha
Leopold Toetsch wrote:
Jonathan Worthington <[EMAIL PROTECTED]> wrote:
The other question is does Parrot care about the memory being zero'd out?
Isn't necessary. Executable mem is filled with ops anyway. Currently it
is zeroed to aid debugging a bit. It should be filled up with trap
operations o
Mark A. Biggar wrote:
0x (Unicode as code-points up to 0x10FFF), as either two 16 bit
Oops that should be 0x10^^^
--
[EMAIL PROTECTED]
[EMAIL PROTECTED]
Nicholas Clark wrote:
On Wed, Nov 12, 2003 at 01:57:14PM -0500, Dan Sugalski wrote:
You're going to run into problems no matter what you do, and as
transcoding could happen with each comparison arguably you need to make a
local copy of the string for each comparison, as otherwise you run the
ris
Dan Sugalski wrote:
Okay, here's an issue for everyone. I'm writing the MMD subsystem, at
least the parts needed for operator overloading, and I'm coming across the
need to defer adding functions. For example, the Float class has functions
for the Integer class, and vice versa, and we can't guaran
Nicholas Clark wrote:
On Thu, Jul 17, 2003 at 08:40:44PM -0400, Benjamin Goldberg wrote:
Actually, I'm thinking of something like the following... suppose the
original code is like:
label_foo:
loop body
branch_address:
branch label_foo
Add in the following:
e_handler_foo:
.local Perl
Dan Sugalski wrote:
Well, we can make objects and we can call methods on objects (at least
the interface is specified, if not actually implemented) but actually
building classes to make objects out of is still unspecified. So, time
to remedy that, after which I hope we can build at least a simpl
19 matches
Mail list logo
