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, specially if we are working with big matrix and hash tables.
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, that brings this functionality to all Parrot languages.
You can also get at a C-level struct using the ManagedStruct and UnManagedStruct PMCs, though access is a bit clumsy IIRC.
With NCI it should be possible to create a Piddle PMC, that hooks into the shared library
of PDL for Perl5. Of course, one could also just steal the code or roll your own code.
CU, Bernhard
-- ************************************************** Dipl.-Physiker Bernhard Schmalhofer Senior Developer Biomax Informatics AG Lochhamer Str. 11 82152 Martinsried, Germany Tel: +49 89 895574-839 Fax: +49 89 895574-825 eMail: [EMAIL PROTECTED] Website: www.biomax.com **************************************************