Beefy Boxes and Bandwidth Generously Provided by pair Networks
Welcome to the Monastery
 
PerlMonks  

Re^7: Store large hashes more efficiently

by BrowserUk (Patriarch)
on Feb 12, 2013 at 16:38 UTC ( [id://1018407]=note: print w/replies, xml ) Need Help??


in reply to Re^6: Store large hashes more efficiently
in thread Store large hashes more efficiently

Integers are inodes.

Hm. Looking around the web, it seems that inode numbers are of type ino_t; which seems to be typedef'd as unsigned long. Do you really need Q?


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.

Replies are listed 'Best First'.
Re^8: Store large hashes more efficiently
by puterboy (Scribe) on Feb 13, 2013 at 01:56 UTC
    I don't today... but I am writing this software as a utility for an open software project where people may have much larger filesystems. Since one can have 1 inode per 4K block, I was assuming that one might need to go beyond longs when drives/filesystems hit 16TB... but if inodes are type long, then I imagine that mkfs.ext4 (and its ilk) will just enforce a larger minimum bytes-per-inode size.

    Anyway, good to know that I can for now get by with using 'V' and not 'Q'. Thanks!

Log In?
Username:
Password:

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

How do I use this?Last hourOther CB clients
Other Users?
Others goofing around in the Monastery: (3)
As of 2024-03-29 01:51 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found