Beefy Boxes and Bandwidth Generously Provided by pair Networks
Perl Monk, Perl Meditation

Re: Re: Re: Re: Re: XML probabilistic trees

by dakkar (Hermit)
on Mar 25, 2003 at 11:49 UTC ( #245655=note: print w/replies, xml ) Need Help??

in reply to Re: Re: Re: Re: XML probabilistic trees
in thread XML probabilistic trees

Sorry, I think you lost me there...

Aht do you mean by 'hashed array'? In Perl, a hash is a function from strings to scalars (a dictionary, a map, ...), an array is a function from integers to scalars (some call it a vector)

If you meant 'why is the order of the hash keys not preserved?', then the answer is: it's not supposed to. In a hash the order is not important, only the correspondance between keys (which can't be repeated) and their associated values is.

And for getting the values positionally, read the documentation for XML::Simple, there are various options to specify how to treat repeated elements.

        dakkar - Mobilis in mobile
  • Comment on Re: Re: Re: Re: Re: XML probabilistic trees

Log In?

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

How do I use this? | Other CB clients
Other Users?
Others avoiding work at the Monastery: (3)
As of 2022-05-22 00:59 GMT
Find Nodes?
    Voting Booth?
    Do you prefer to work remotely?

    Results (78 votes). Check out past polls.