Re: Data Structures and Sorting

your example seems a little bewildering to me. maybe i'm just not reading it right, but i'm not sure what parts of your example refer to what elements of your hash. also, it seems as though you are putting two different kinds of data in the same hash? even if they are similar, you might want to consider splitting the data into two different hashes, so that it is easier to process.

Comment on Re: Data Structures and Sorting

Replies are listed 'Best First'.
Re: Re: Data Structures and Sorting by data67 (Monk) on Jun 11, 2002 at 21:16 UTC
I may have not clarified this but the data is normalized data, not just a data dump. One file contains information relivant to the system. The second file contains information about its owner. A the file which contains the system information has a "primary key" and that is it! This primary key is the identifying number you see in the Data::Dumper example. For you to know what a id means you have to look it up in the "master" file and you get things like Name, Owner, Group etc. Now when you say that to you it looks like two different kinds of data. That is false. The data is INTERDEPENDENT. Example: `File 1: ID, Name, Group, Owner File 2: ID, Oracle, Tibco, AS/400, blah blah blah....` [download] Hope this clarifies it further. Thanks,	[reply] [d/l]

Replies are listed 'Best First'.

Re: Re: Data Structures and Sorting
by data67 (Monk) on Jun 11, 2002 at 21:16 UTC

Now when you say that to you it looks like two different kinds of data. That is false. The data is INTERDEPENDENT.

Example:

File 1:
ID, Name, Group, Owner

File 2:
ID, Oracle, Tibco, AS/400, blah blah blah....
[download]

Hope this clarifies it further. Thanks,

[reply]
[d/l]