Re^4: Fetching data from DB and complex data structures

Thank you very much for the links and for the fish as well. If i can, what about the original order of the text? a1->b2->c3? Unfortunately, since the lines are indexed in a more complicated fashion than the one I reported, I cannot simply sort hash keys. In fact the original order is governed by Postgres only.

Comment on Re^4: Fetching data from DB and complex data structures

Replies are listed 'Best First'.
Re^5: Fetching data from DB and complex data structures by choroba (Cardinal) on Dec 15, 2015 at 13:12 UTC
the original order is governed by Postgres only That is a very bad design. See the documentation: If sorting is not chosen, the rows will be returned in an unspecified order. The actual order in that case will depend on the scan and join plan types and the order on disk, but it must not be relied on. A particular output ordering can only be guaranteed if the sort step is explicitly chosen. If you don't want to build a hash, use an array. ($q=q:Sq=~/;[c](.)(.)/;chr(-\|\|-\|5+lengthSq)`"S\|oS2"`map{chr \|+ord }map{substrSq`S_+\|`\|}3E\|-\|`7**2-3:)=~y+S\|`+$1,++print+eval$q,q,a, [download]	[reply] [d/l]
Re^6: Fetching data from DB and complex data structures by frasco (Beadle) on Dec 15, 2015 at 13:58 UTC
Sorry, I mean that the order is governed by the ORDER BY clause of Postgres, thus data retrieved from postgres of course are ordered correctly. I only mean that I have to rely on that order and I cannot sort the keys of the hashref.	[reply]