Re^2: Term document matrix for search engine

Hashing seems a good idea. I should search a file for a specific term and then place the file address into the hash if the term is present. Can you help me with the code please, I am still not good at with hashes.
Thank you

Comment on Re^2: Term document matrix for search engine

Replies are listed 'Best First'.
Re^3: Term document matrix for search engine by SuicideJunkie (Vicar) on Nov 09, 2012 at 17:35 UTC
That sounds like it would defeat the purpose of the assignment. Take a read through perldata, but IMO the best thing to do is have a small test.pl script on the side where you can play around try things out quickly. And to understand what your code is doing, I highly recommend `use Data::Dumper;` and then later in your code, say `print Dumper \%hash;`. The output from dumper is about the same as code which will create the data structure, so it is really handy for learning. Curly brackets for nested hashes, square brackets for nested arrays.	[reply] [d/l] [select]

Replies are listed 'Best First'.

Re^3: Term document matrix for search engine
by SuicideJunkie (Vicar) on Nov 09, 2012 at 17:35 UTC

That sounds like it would defeat the purpose of the assignment.

Take a read through perldata, but IMO the best thing to do is have a small test.pl script on the side where you can play around try things out quickly.

And to understand what your code is doing, I highly recommend use Data::Dumper; and then later in your code, say print Dumper \%hash;. The output from dumper is about the same as code which will create the data structure, so it is really handy for learning. Curly brackets for nested hashes, square brackets for nested arrays.

[reply]
[d/l]
[select]