Beefy Boxes and Bandwidth Generously Provided by pair Networks
go ahead... be a heretic
 
PerlMonks  

Re: (FoxUni) Re: Nested data structures... nasty?

by theorbtwo (Prior)
on May 28, 2002 at 20:47 UTC ( #169902=note: print w/ replies, xml ) Need Help??


in reply to Re: Nested data structures... nasty?
in thread Nested data structures... nasty?

I agree pretty much totaly. ("Never say never".)

This is going to be one of the nice things about perl6 -- you can nicely mix both styles, and declare a hash with limited namespace, each entry of which has a specific type, and thus get somthing like a C struct with known size and thus more optimizable.

You can also have limited namespace but not declare the types of the entries strictly. Or pretty well anything else you can think of.

Because the parrot virtual machine resembles a real machine, we can pull on all the experince with compiler optimization to real (register) machines.


We are using here a powerful strategy of synthesis: wishful thinking. -- The Wizard Book


Comment on Re: (FoxUni) Re: Nested data structures... nasty?

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://169902]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others lurking in the Monastery: (8)
As of 2014-12-22 02:31 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    Is guessing a good strategy for surviving in the IT business?





    Results (110 votes), past polls