Beefy Boxes and Bandwidth Generously Provided by pair Networks
laziness, impatience, and hubris

Re: Re: Re: Re: XML probabilistic trees

by matth (Monk)
on Mar 25, 2003 at 10:13 UTC ( #245637=note: print w/replies, xml ) Need Help??

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

Out of interest. Can anyone tell me why, when I print out with the command:
print XMLout(\%nodes);
That the hashed array is not printed out, as the XML form, in the order that it is presented within the program. Also. Can anyone please inform me whether it is easy (with an XML Perl module) to retrieve data, that is nested within tags, with reference to the ordered position in which identical and tandem tags are presented.

Replies are listed 'Best First'.
Re: Re: Re: Re: Re: XML probabilistic trees
by dakkar (Hermit) on Mar 25, 2003 at 11:49 UTC

    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

Log In?

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

How do I use this? | Other CB clients
Other Users?
Others browsing the Monastery: (2)
As of 2022-06-27 11:35 GMT
Find Nodes?
    Voting Booth?
    My most frequent journeys are powered by:

    Results (88 votes). Check out past polls.