Brent 'Dax' Royal-Gordon wrote:
Graciliano M. P. [EMAIL PROTECTED] wrote:
What I'm thinking is that in Parrot, as is in Perl, we have dynamic data
structures, like dynamic HASH and ARRAYs, with SCALARs that can grow as they
want. To write our code this help a lot, but some parts of our algorithms
Bernhard Schmalhofer writes:
This sounds somewhat like a Piddle, which is the data structure of the
Perl Data Language, http://pdl.perl.org/. AFAIK there is already a hook,
that allows you to use your own data lying somewhere in your memory.
It might be worthwile to create a Piddle PMC,
Graciliano M. P. [EMAIL PROTECTED] wrote:
What I'm thinking is that in Parrot, as is in Perl, we have dynamic data
structures, like dynamic HASH and ARRAYs, with SCALARs that can grow as they
want. To write our code this help a lot, but some parts of our algorithms
need memory and speed,
Graciliano M. P. wrote:
Will be nice to can write this directly on Perl6:
int the_matrix[10][10] ;
Perl6 and thus Parrot supports arrays of native types like int and
bitarrays.
Also, will be nice to can use the same idea with hash tables:
int , bool static_hash{1000} ;
But while plain
Graciliano M. P. writes:
Will be nice to can write this directly on Perl6:
int the_matrix[10][10] ;
Or rather:
my int @matrix is dim(10,10);
Perl 6 has been planning support for such naive data structures for a
long time.
I'm not sure about hashes. They have enough internal
Hello,
I don't know if this is the best place to post this.
Recently with Perl5 I had a big problem with big data structure using Perl5
HASHes. The problem was with a search in a big database, where to make this
search we used a group of threads with a random entry. Bascially we need to
search
