Beefy Boxes and Bandwidth Generously Provided by pair Networks
The stupid question is the question not asked

Re: Re: Re: writing an address book program

by andreychek (Parson)
on Jun 07, 2001 at 01:30 UTC ( #86403=note: print w/replies, xml ) Need Help??

in reply to Re: Re: writing an address book program
in thread writing an address book program

Osmosis.... MMmmmmmm... :-)

Yeah, I actually picked up XML not too long ago myself.
With the method you mentioned you are looking to use, XML::Simple
might be your best bet.. you just point it to a XML
file, and it will slurp the thing in and make it a
hash of hashes (...of hashes of hashes, etc).

However, just think how big this thing might get.. slurping the whole
address book into a hash is loads of fun, but you might regret it later ;-)
But you have to start somewhere, and XML::Simple is.. well.. simple :-) Have fun,
  • Comment on Re: Re: Re: writing an address book program

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://86403]
[erix]: the annoying thing is that during setup of the 'foreign table' you have to specify all the columns. But that is reasonably automatable (just reading header line, and contruct the needed CREATE FOREIGN TABLE' statement)
[erix]: it may be easier to just slurp your fils into regular tables. Has other infrastructure advantages also (indexes, constraints etc)

How do I use this? | Other CB clients
Other Users?
Others taking refuge in the Monastery: (9)
As of 2018-02-23 15:36 GMT
Find Nodes?
    Voting Booth?
    When it is dark outside I am happiest to see ...

    Results (302 votes). Check out past polls.