Beefy Boxes and Bandwidth Generously Provided by pair Networks
Perl: the Markov chain saw
 
PerlMonks  

Re^2: tying a hash from a big dictionary

by Anonymous Monk
on Oct 31, 2011 at 13:53 UTC ( [id://934880]=note: print w/replies, xml ) Need Help??


in reply to Re: tying a hash from a big dictionary
in thread tying a hash from a big dictionary

That was a nice one thanks! Although I still have memory problem, but this tip saved me a lot as well!
  • Comment on Re^2: tying a hash from a big dictionary

Replies are listed 'Best First'.
Re^3: tying a hash from a big dictionary
by BrowserUk (Patriarch) on Oct 31, 2011 at 13:56 UTC

    How many lines has your file? How many of those are you succeeding in loading before you run out of memory?


    With the rise and rise of 'Social' network sites: 'Computers are making people easier to use everyday'
    Examine what is said, not who speaks -- Silence betokens consent -- Love the truth but pardon error.
    "Science is about questioning the status quo. Questioning authority".
    In the absence of evidence, opinion is indistinguishable from prejudice.
      I have around 200m lines. I don't know after how many lines I go out of memory since I haven't calculated yet.

        The addition of the following 3 lines should tell you with sufficient accuracy after a single run:

        sub read_dict{ local $| = 1; ##! my $file = shift; my %dict; open( my $fh, "<:encoding(utf5)", $file ); my $c = 0; ##! while( <FILE> ) { printf "\r%d\t", $c unless ++$c % 1000; ##! chomp; ## no need to chomp twice my ($p1, $p2) = split /\t/; push( @{ $dict{ $p1 } }, $p2 ); } close $fh; return \%dict; ## main space saving change; return a ref to the ha +sh }

        With the rise and rise of 'Social' network sites: 'Computers are making people easier to use everyday'
        Examine what is said, not who speaks -- Silence betokens consent -- Love the truth but pardon error.
        "Science is about questioning the status quo. Questioning authority".
        In the absence of evidence, opinion is indistinguishable from prejudice.
Re^3: tying a hash from a big dictionary
by Anonymous Monk on Oct 31, 2011 at 14:55 UTC
    on a 4gb machine, it will run out of memory after 5m of dictionary lines.

Log In?
Username:
Password:

What's my password?
Create A New User
Domain Nodelet?
Node Status?
node history
Node Type: note [id://934880]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this?Last hourOther CB clients
Other Users?
Others contemplating the Monastery: (4)
As of 2024-04-25 13:11 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found