On Wed, 8 Jun 2005 18:57:30 -0700, [EMAIL PROTECTED] (Larry Wall) wrote:
On Wed, Jun 08, 2005 at 11:04:30PM +0300, Gaal Yahas wrote:
: On Wed, Jun 08, 2005 at 12:29:33PM -0700, Larry Wall wrote:
: To take a notorious example, you mentioned fork() -- if this event manager
: becomes part of
Further thoughts on the questions in comments invited.
njs
win32-exec.c.patch
Description: Binary data
Apologies for the wrong list. Should I resend to the correct one?
njs
This patch informs win32 users that nmake v1.5 is not capable of building
Parrot.
READM.win32.patch
Description: Binary data
The parrot makefile has several places where nmake baulks at the length of the
expanded command lines.
I've found that I can work around this is some places using inline files, but
I'm having trouble working out where/how to make the adjustments.
I also have my doubts whether this would be
On Tue, 31 May 2005 07:07:28 -0700, [EMAIL PROTECTED] (Jerry Gay) wrote:
On 5/31/05, Nigel Sandever [EMAIL PROTECTED] wrote:
The parrot makefile has several places where nmake baulks at the length o=
f the
expanded command lines.
=20
though you weren't explicit, i suspect you're using
On 27 Apr 2005 08:21:27 -, [EMAIL PROTECTED] (Rafael Garcia-Suarez)
wrote:
Autrijus Tang wrote in perl.perl6.language :
4. Software Transaction Memory
Like GHC Haskell, Fortress introduces the `atomic` operator that takes a
block, and ensures that any code running inside the block,
On Sat, 23 Apr 2005 21:00:11 -0700, [EMAIL PROTECTED] (Larry Wall) wrote:
On Sun, Apr 24, 2005 at 03:37:23AM +, Nigel Sandever wrote:
: On Sun, 24 Apr 2005 03:47:42 +0800, [EMAIL PROTECTED] (Autrijus Tang)
wrote:
:
: Oh well. At least the same code can be salvaged to make iThreads
On Sun, 24 Apr 2005 03:47:42 +0800, [EMAIL PROTECTED] (Autrijus Tang) wrote:
Oh well. At least the same code can be salvaged to make iThreads
Please. No iThreads behaviour in Perl 6.
Nobody uses them and whilst stable, the implementation is broken in so many way.
But worse, the underlying
On Thu, 21 Apr 2005 08:36:28 -0700, [EMAIL PROTECTED] (Larry Wall) wrote:
Hmm, maybe that's not such a bad policy. I wonder what other dangerous
modules we might have. Ada had UNCHECKED_TYPE_CONVERSION, for instance.
How about
use RE_EVAL; # or should that be REALLY_EVIL?
Larry
On Thu, 31 Mar 2005 21:17:39 -0500, [EMAIL PROTECTED] (MrJoltCola)
wrote:
At 05:57 PM 3/31/2005, Nigel Sandever wrote:
Is Parrot bytecode reentrant?
Yes.
That is, if I want to have two instances of a class in each of two
threads, will
the bytecode for the class need to be loaded twice
15/04/2005 10:35:56, Leopold Toetsch [EMAIL PROTECTED] wrote:
Nigel Sandever [EMAIL PROTECTED] wrote:
When a sub that closes over a variable
my $closure = 0;
sub do_something {
return $closure++:
}
is called from two threads, do the threads share a single
Is Parrot bytecode reentrant?
That is, if I want to have two instances of a class in each of two threads,
will
the bytecode for the class need to be loaded twice?
Also, will it be possible to pass objects (handles/references) between threads?
Thanks njs.
On Sun, 27 Feb 2005 02:20:59 -0700, [EMAIL PROTECTED] (Luke Palmer) wrote:
Luke Palmer writes:
Autrijus Tang writes:
Just a quick question: Is Hash keys still Strings, or can they be
arbitary values?
They can be declared to be arbitrary:
my %hash is shape(Any);
If
On Sun, 27 Feb 2005 15:36:42 -0700, [EMAIL PROTECTED] (Luke Palmer) wrote:
Nigel Sandever writes:
On Sun, 27 Feb 2005 02:20:59 -0700, [EMAIL PROTECTED] (Luke Palmer) wrote:
I forgot an important concretity. Hashes should compare based on the
generic equal operator, which knows how
On Sun, 27 Feb 2005 15:36:42 -0700, [EMAIL PROTECTED] (Luke Palmer) wrote:
Nigel Sandever writes:
When we're talking about hashes of everything, there are a couple of
routes we can take. We can go Java's way and define a .hash method on
every object. We can go C++'s way and not hash at all
On Sat, 19 Feb 2005 18:42:36 +1100, [EMAIL PROTECTED] (Damian Conway) wrote:
the Awesome Power of Junctions:
As I tried to express elsehwere, this what I'm looking for.
Instinctively, and for a long time since I first came across Q::S, I thought
that the killer app of Junctions is there
On Wed, 16 Feb 2005 12:17:35 +1100, [EMAIL PROTECTED] (Damian Conway) wrote:
..values tells you what raw values are inside the junction. The other kind of
introspection that's desirable is: what raw values can *match* this
junction. There would probably be a .states method for that.
To
On Wed, 16 Feb 2005 09:18:42 -0600, [EMAIL PROTECTED] (Patrick R. Michaud)
wrote:
On Wed, Feb 16, 2005 at 01:06:22PM +, Nigel Sandever wrote:
Any chance that you could provide one or two simple but realistic examples
of
using Junctions and their operators?
I'll give it a shot
On Sat, 04 Dec 2004 08:01:46 -0700, [EMAIL PROTECTED] (David Green) wrote:
In article [EMAIL PROTECTED],
[EMAIL PROTECTED] (Larry Wall) wrote:
S9 talk about it. We current have things like:
my Cat %pet is shape(Str);
and parameters to types are in square brackets, so it's more like:
On Fri, 3 Sep 2004 17:08:00 -0700, [EMAIL PROTECTED] (Larry Wall) wrote:
On Fri, Sep 03, 2004 at 05:45:12PM -0600, John Williams wrote:
: On Thu, 2 Sep 2004, Larry Wall wrote:
:
: The argument to a shape specification is a semicolon list, just like
: the inside of a multidimensional
On the basis of what is known so far, will p6 be able to detect undefined subs
at compile time?
Regards, Nigel.
On Tue, 02 Mar 2004 02:31:47 -0800, [EMAIL PROTECTED]
(Nigelsandever @ Btconnect . Com) wrote:
=_1078223508-4945-0
Content-Type: text/plain; charset=utf-8
# New Ticket Created by [EMAIL PROTECTED]
# Please include the string: [perl #27301]
# in the subject line of all future
05/01/04 04:51:20, Sam Vilain [EMAIL PROTECTED] wrote:
On Mon, 05 Jan 2004 15:43, Nigel Sandever wrote;
I accept that it may not be possible on all platforms, and it may
be too expensive on some others. It may even be undesirable in the
context of Parrot, but I have seen no argument
On Sun, 4 Jan 2004 15:47:35 -0500, [EMAIL PROTECTED] (Dan Sugalski) wrote:
*) INTERPRETER - those bits of the Parrot_Interp structure that are
absolutely required to be thread-specific. This includes the current
register sets and stack pointers, as well as security context
information.
05/01/04 01:22:32, Sam Vilain [EMAIL PROTECTED] wrote:
[STUFF] :)
In another post you mentions intel hyperthreading.
Essentially, duplicate sets of registers within a single CPU.
Do these need to apply lock on every machine level entity that
they access?
No.
Why not?
Because they can only
that obviously not a simple project and is beyond the scope of
this list.
Thanks for taking the time to review this.
Nigel Sandever.
On Sat, 3 Jan 2004 11:35:37 +0100, [EMAIL PROTECTED] (Leopold Toetsch) wrote:
Nigel Sandever [EMAIL PROTECTED] wrote:
VIRTUAL MACHINE INTERPRETER
At any given point in the running of the interpreter, the VM register
set, program counter and stack must represent the entire state
On Sat, 3 Jan 2004 21:00:31 +0100, [EMAIL PROTECTED] (Leopold Toetsch) wrote:
That's exactly, what a ParrotInterpreter is: the entire state for a
thread.
This is only true if a thread == interpreter.
If a single interpreter can run 2 threads then that single interpreter
cannot
On Thu, 01 Jan 2004 21:32:22 -0500, [EMAIL PROTECTED] (Uri Guttman) wrote:
UG Uri Guttman
NS Nigel Sandever. (Mostly not reproduced here!)
NS REENTRANCY
UG this is true for c level threads but not necessarily true for VM level
UG threads. f the VM is atomic at its operation level and can't
rather than a flame war.
Regards, Nigel Sandever.
PS. Sorry if this gets posted twice.
THE BASIS OF THE IDEA
Modern OSs succeed in having multiple threads of execution share a single copy of
process memory without the operations of one thread being able to
interfere
://www.smidgeonsoft.com/].
Regards, Nigel Sandever.
Ps. Sorry if this ends up getting posted twice. I didn;t realise I had to do the
confirmation step after subscribing.
On Wed, 31 Dec 2003 12:17:21 -0500, [EMAIL PROTECTED] (Dan Sugalski) wrote:
If so, how do I enable it?
It is possible to configure DrWatson (Stupid cutesy name) to create a dump file,
though I haven't ever found it very useful.
If not, I presume there's some reasonably
There are several very
rather than a flame war.
Regards, Nigel Sandever.
THE BASIS OF THE IDEA
Modern OSs succeed in having multiple threads of execution share a single copy of
process memory without the operations of one
thread being able to interfere with the state of another. The state
34 matches
Mail list logo
