comment on

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

In reply to Re: Re: Re: Re: Re: XML probabilistic trees by dakkar
in thread XML probabilistic trees by Anonymous Monk

Are you posting in the right place? Check out Where do I post X? to know for sure.
Posts may use any of the Perl Monks Approved HTML tags. Currently these include the following:
<code> <a> <b> <big> <blockquote> <br /> <dd> <dl> <dt> <em> <font> <h1> <h2> <h3> <h4> <h5> <h6> <hr /> <i> <li> <nbsp> <ol> <p> <small> <strike> <strong> <sub> <sup> <table> <td> <th> <tr> <tt> <u> <ul>
Snippets of code should be wrapped in <code> tags not <pre> tags. In fact, <pre> tags should generally be avoided. If they must be used, extreme care should be taken to ensure that their contents do not have long lines (<70 chars), in order to prevent horizontal scrolling (and possible janitor intervention).
Want more info? How to link or How to display code and escape characters are good places to start.


Problems? Is your data what you think it is?
	PerlMonks