to a different set of tables when we cross boundries between
opcode peices.
I'm going to set about implementing this now.
-=- James Mastros
seems like
it'd have a /lot/ of overhead. But we'll see. (It shouldn't be /too/ bad,
because in a real system, we won't be loading all that many oplibs, I should
think).
-=- James Mastros
Hey all. Attached is the latest edition of the chr and ord opcodes patch,
updated and enhanced for the New Way of Strings.
Let me know of any changes I need to make.
-=- James Mastros
On Fri, Nov 02, 2001 at 11:26:37PM -0300, Daniel Grunblatt wrote:
You forgot the attachment.
Whoops.
-=- James Mastros
? chr5.diff
? chrord4.diff
? chrord5.diff
? core.ops.mine
? mops.c
? ops.chrord.diff
? ord3.diff
? examples/assembly/chr_table.pasm
? examples/assembly/ord.pasm
must be able to convert to utf32.)
Powers-that-be (I'm looking at you, Dan), is that good?
-=- James Mastros
attention, I'm waiting on this discussion for my
chr/ord patch, since I want them in terms of charsets, not encodings.)
-=- James Mastros
, and the encodings list being static.)
Chr and Ord aren't implemented for utf8 and utf16, only for native and
utf32. I'd much appreciate it if sombody who knew what they were doing did
this.
The tests are woefuly incomplete.
The style of the example is poor.
-=- James Mastros
Index
as an s|sc parameter. Ideas?
-=- James Mastros
Index: core.ops
===
RCS file: /home/perlcvs/parrot/core.ops,v
retrieving revision 1.17
diff -u -r1.17 core.ops
--- core.ops2001/10/22 23:34:47 1.17
+++ core.ops2001/10/23
characters above this)
- Both assume that the byteorder of an INTVAL is the same as a utf32
character. (I think the core string code does the same thing, though.)
-=- James Mastros
-=- James Mastros
8 bit characters or INTVAL
sized characters. (So utf16 probably won't work).
- Both chr and ord assume that the byteorder of a UTF32 string matches the
byteorder of an INTVAL.
-=- James Mastros
Index: core.ops
===
RCS file
address into an I
register, and then push it and ret, or jmp to it.
-=- James Mastros
/glossary/)
Whoops. What I meant was that characters requiring surrogate pairs aren't
supported. According to http://www.unicode.org/unicode/faq/utf_bom.html,
there are none currently assigned.
-=- James Mastros
--
Put bin Laden out like a bad cigar: http://www.fieler.com/terror
You know
are for.
It's rather unfornate that we've run out of characters to use
for operators, but we've got to deal with it better then flipping
around operators willy-nilly.
-=- James Mastros
) Used for what it is intended for, it seems like a very concise,
expressive way to do multiple relationship tests without needing all those
s and such.
Indeed. (Though, as defined above, this won't work on the string
operations, only the numerics.)
-=- James Mastros
.
-=- James Mastros
. It will
be extremely confusing.
Yes, it will be, and /I/ wouldn't do it if I could avoid it.
OTOH, we're already talking about having support for multiple languages
(parsers) within one file, and having perl5 being another parser. Put them
together, and you get exactly this.
-=- James
element),
and lets us keep continuity.
Anyway, I'm fairly certian that I'll use iterators more then qw lists.
-=- James Mastros
).
-=- James Mastros
. Especialy that we don't need a qw() alternative.
However, I don't think Larry's in a convincable mood -- coughdotcough.
-=- James Mastros
glance at the 98. Basicly, if you assign to a list of lvalues, @returnlist,
it
will stop looking after it has found scalar(@returnlist) matches or
end-of-input.
-=- James Mastros
in many fonts.
BTW, I think that considering no-whitespace cases of indirect object is
quite silly -- does anybody acatualy use that?
This is the first I thought it wasn't a syntax error.
-=- James Mastros
a URL an explicit act.
But I really mustn't spill too many half-digested beans here. :-)
If you have to, at least do it in the toilet.
P.S. Larry's Second Law of Language Redesign: Larry gets the colon.
May He (or You) do Good Things with it.
-=- James Mastros
--
The most beautiful
?
We want to make it as fast as reasonably possible. Writing a native
compiler might not be _reasonably_ possible. And an advanced GC will almost
certianly be part of perl6; they're orthogonal issues.
-=- James Mastros
--
The most beautiful thing we can experience is the mysterious
, bingo. That's what a number of people (inculding me) are suggesting --
a :functional / :pure / :stateless / :somthingelseIdontrecall attribute
attachable to a sub.
-=- James Mastros
--
The most beautiful thing we can experience is the mysterious. It is the
source of all true art
initive, IE
nounal, form of a verb).
CCow-speak and Cspeak Cow both translate into english as a command
form, telling the Cow to speak. (If you translate both - and ' ' into a
comma.)
Anyway, I'm trying to argue lingustics in a perl ML, with zero training.
Is there a linguist in the house? (Hm, di
ough there's more to it then that).
Note that only the sign of the answer is gaurnteed, so it doesn't even have
to be internaly stateless -- but it probably doesn't make sense for it not
to be.
Give the braindead no head.
You might want to change that to "heed".
-=- James Mast
every time they are accessed, for example.)
I think that the difference between 43 dosn't matter. We only have things
in 4 and not 3 that vary in abs(), but not sign.
We're left with 12, and for 1, the sort won't work anyway.
So long as we consider 2 Just Plain Silly, we're OK memonizing.
-=- Jam
be spoken, so let it be done.
This isn't any more preverse then the "you can't assign to constants" rule.
-=- James Mastros
--
The most beautiful thing we can experience is the mysterious. It is the
source of all true art and science. He to whom this emotion is a stranger,
who
On Wed, Mar 28, 2001 at 05:57:30PM -0500, James Mastros wrote:
[A bunch of stuff]
Oh, and I agree with sombody else on this thread that unless otherwise
stated, the sort should always assume statelessness (and thus the ability to
cache at will). If it's trivial to see that the sort function
56
The functon is not idempotent. Even if you checked f(x)==x (function is the
identity), an input of "123456" would work.
-=- James Mastros
--
The most beautiful thing we can experience is the mysterious. It is the
source of all true art and science. He to whom this emoti
. Twisted, even.
-=- James Mastros
--
The most beautiful thing we can experience is the mysterious. It is the
source of all true art and science. He to whom this emotion is a stranger,
who can no longer pause to wonder and stand wrapt in awe, is as good as dead.
-=- Albert Einstein
) as doing things, then
they normaly are the subject, and _not_ the indirect-object (in the english
sense).
(Note, BTW, that both my german and my lingustics aren't so hot.)
-=- James Mastros
--
The most beautiful thing we can experience is the mysterious. It is the
source of al
On Mon, Mar 26, 2001 at 06:31:22PM -0500, Dan Sugalski wrote:
At 04:04 PM 3/26/2001 -0500, James Mastros wrote:
The only way f(a) can not be stable and f(a) = f(b) can be is somthing of
a corner case. In fact, it's a lot of a corner case.
You're ignoring side-effects.
Damm. I hate it when I
, it might not be as
effecent as a hand-crafted schwartzian, but will be at least as efficent as
a naieve straight sort (except in pathalogical cases, like tsort((^_),
(^_=^_), @list)).
-=- James Mastros
--
The most beautiful thing we can experience is the mysterious. It is the
source of all
_)], @list;
does what I intendeded. (Where ex $sort = sub {$_[0] cmp $_[1]}, and
$attrib = sub {lc $_}.) (Of course, this doesn't always use the optimal
form.)
-=- James Mastros
--
The most beautiful thing we can experience is the mysterious. It is the
source of all true art and sc
code from RSA. However, it shouldn't be a problem, since RSA's
pattent (in the US, anyway, and I don't think they pattented anywhere else)
has timed out.
-=- James Mastros
--
"All I really want is somebody to curl up with and pretend the world is a
safe place."
AIM: theorbtwo
cial things with
files in that directory (like set up symlinks from the normal man dirs).
BTW, this plan would make it painful to do with perl5 setups, since they
commonly have odd dir structures.
-=- James Mastros
--
"All I really want is somebody to curl up with and prete
(for me) to think of when you'd want an AUTOLOADed DESTROY,
since if you create /any/ objects of the class, DESTROY will be called.
"It isn't possible to AUTOLOAD DESTROY." --perlmem(6)
-=- James Mastros
--
"All I really want is somebody to curl up with and pretend the world is a
s
t (IE a CATCH/POST/catch/finaly/whathaveyou) returns. (And if
it does, that blocks all execption processing.)
You can mess with the return arbitrarly if we support return-stack visiblity.
-=- James Mastros
--
"All I really want is somebody to curl up with and pretend the world is a
safe place."
AIM: theorbtwo homepage: http://www.rtweb.net/theorb/
that hard.)
-=- James Mastros
--
"All I really want is somebody to curl up with and pretend the world is a
safe place."
AIM: theorbtwo homepage: http://www.rtweb.net/theorb/
e
extended to doing recursive calls without having to say the subs own
name, again.
I agree, making the magic variable be the name of the sub is a bad idea.
Your idea for a name for the currently executing sub is interesting, I
think. I'm going to fork the thread.
-=- James Mastros
--
&quo
real array, only a list. (I
don't think that will be a problem, though.)
[stuff about manual vs. automatic return-stack elminition]
Yeah, you're probably right. But return-as-assignment has certian nice
features from a stylistic viewpoint as well as an optimizational one.
-=- James Mastros
--
any scope not a do, require, eval, or
sub-call.)
-=- James Mastros
--
"My country 'tis of thee, of y'all i'm rappin'! Lan where my brothers
fought, land where our King was shot -- from every building top, let freedom
happen!"
-=- Monique, Sinfest[.net]
AIM:
On Sun, Feb 04, 2001 at 05:30:59PM +0100, Johan Vromans wrote:
James Mastros [EMAIL PROTECTED] writes:
And I always hated that about VB and Pascal -- you can assign to the magic
variable, but can't modify it.
That was before the invention of auto-assignment operators. In the
70s
).
I think the current method is probably best for us.
-=- James Mastros
--
"My country 'tis of thee, of y'all i'm rappin'! Lan where my brothers
fought, land where our King was shot -- from every building top, let freedom
happen!"
-=- Monique, Sinfest[.net]
AIM:
nd I
don't even know what XPG4 is.)
Speaking of contract names, is Damien about?
-=- James Mastros
--
"My country 'tis of thee, of y'all i'm rappin'! Lan where my brothers
fought, land where our King was shot -- from every building top, let freedom
happen!"
-=- Monique
t;'"s, but that's going to be thrown out, I assume).
-=- James Mastros
--
"My country 'tis of thee, of y'all i'm rappin'! Lan where my brothers
fought, land where our King was shot -- from every building top, let freedom
happen!"
-=- Monique, Sinfest[.net]
AIM: theo
o we claim to never autoderef?) Is assigning to @__ the same
as assigning to @{$__}? Nope. Does @$__ have any meaning if $__ is an
alias, not a reference? Nope.
I'm quickly getting more confused here then I want to be, so I'm going to
stop now.
-=- James Mastros
--
AIM: theorbtwo
of time() slightly without changing to a
different function name? Yes, it will silently break some existing code,
but that's OK -- remember, 90% with traslation, 75% without. being in that
middle 15% isn't a bad thing.
-=- James Mastros
--
"My country 'tis of thee, of y'all i'm rappin'!
that in
the vast majority of all cases, you'd need to compile (or at the very least,
parse) the entire regex. Also, you can get /vast/ efficency gains by
compiling a regex, so you can check the easy things first.
-=- James Mastros
--
midendian: She never sleeps.
mousetrout: But I do. I just regret
ller app:
/([$matchingpairs])(.*?)(?{local $_=eat 1; $_ eq ${$matchingpairs[$1]}
\$1)/
It doesn't handle nesting thingies, but it's close.
(Assumes $matchingpairs{'('}=')'..., and $matchingpairs=join '', keys
%matchingpairs.)
-=- James Mastros
-language* lists
as well as I probably should. Too much trafic, to little time.
-=- James Mastros
--
-BEGIN GEEK CODE BLOCK-
Version: 3.1
GUCS d--- s-:- a20 C++ UL+++@ P L++@ E-() N o? K? w@ M-- !V
PS++ PE Y+ PGP(-) t++@ 5+ X+++ R+ tv+ b+++ DI+ D+ G e++ h! r- y?
--END
end-user's account. Think
cgi_wrapper without spawning a new interpreter.
-=- James Mastros
--
-BEGIN GEEK CODE BLOCK-
Version: 3.1
GUCS d--- s-:- a20 C++ UL+++@ P L++@ E-() N o? K? w@ M-- !V
PS++ PE Y+ PGP(-) t++@ 5+ X+++ R+ tv+ b+++ DI+ D+ G e++ h! r- y?
--END GEEK CODE BLOCK--
and not where the sub being autoloaded
was acatualy written.
Most of the rest would require siginificant overhead on all programs that
might get debugged (the debugger is a module; you don't necessarly have to
start it from the commandline). Use a tags program. G
-=- James Mastros
--
-BEGIN
at you're "joining" the thread
back into the "tapestry" of the program, so the join()d point should behaive
like the original function did.
-=- James Mastros
asic types will always m/^[A-Z]+$/.
This makes it such that we have to say my INT $n, but that's quite
consistant with the rest of perl. (It also makes it so that all-uppercase
module names without any colons might behave oddly. This is bad for CGI,
but if it becomes WWW::CGI, then it's all OK...)
-=- James Mastros
It appears that the RFC Librarian doesn't work weekends, so I'm going to
post this directly. Hopefuly, it doesn't have any glaringly obvious errors...
=head1 TITLE
Automatic accessors for hash-based objects
=head1 VERSION
Maintainer: James Mastros [EMAIL PROTECTED]
Date: 25 Aug 2000
ed feature, that leaves hH, iI, jJ, kK, mM, oO, vV,
none of which strike me as particularly intuitive.
\M and \m seem perfect to me -- \m finds things in Matched pairs. "P" would
have been better, but alas!
-=- James Mastros
st the
first one should be quite useful, and not too difficult or expensive to
implement. I'm not big on implementation of regexes, however.
Also, you should specify that [\G] and [\g] match any grouping "character",
and also that grouping "characters" need not be one character long.
-=- James Mastros
ay as their final GV, which is
passed into the assignment, and is then assigned to the rvalue.
CUT
(Note that "stay as their final GV" is equivlent to that whole long
paragraph, I think. I'm not too good at internals yet (but I'm trying to
learn).)
-=- James Mastros
way I read this, even modify the value of existing keys. While
this hardly makes it useless, it doesn't make it nearly as useful as it
could/should be.
Making the CODE(ref/HOF) parameter get aliases rather then values helps a
little, but not enough -- you still couldn't create new keys in the hash.
-=- James Mastros
that
it's goodness is self-evident.
-=- James Mastros
On Sat, Aug 19, 2000 at 07:57:34AM +1000, Jeremy Howard wrote:
The choice of algorithms is a great idea, but why do we need a modifier?
Isn't it a pretty straightforward set of rules that allow us to decide if a
DFA matcher will work?
clintonWell, that all depends what the meaning of the word
Do we want a language RFC on regex engines? Do we want some way of writing
a regex engine in pure perl that can be used normaly?
-=- James Mastros
, but
won't allow as much expressiveness.
-=- James Mastros
--
-BEGIN GEEK CODE BLOCK-
Version: 3.1
GUCS d--- s-:- a20 C++ UL+++@ P L++@ E-() N o? K? w@ M-- !V
PS++ PE Y+ PGP(-) t++@ 5+ X+++ R+ tv+ b+++ DI+ D+ G e++ h! r- y?
--END GEEK CODE BLOCK--
101 - 165 of 165 matches
Mail list logo
