Re: scalar %hash



Hi,

This is the number of buckets in use and the total number of buckets in the hash.

For more info please refer to the following url:

http://www.perlmonks.org/?node_id=173677

-srini


jonatan perry wrote:
Hi you all :-)
my name is Jonatan, I am new it this lists.

I was wondering, why do
print scalar %hash;
return
x/y
result? what it mean?

thanks :-)


.



Relevant Pages

  • Re: Perl hashing speedup ?
    ... I feel that disbalanced bucket usage / and less number of hash buckets ... Now I have some queries regarding way perl hashing mechanism maps keys ... about how perl hashes work internally; but I guess we will be needing ...
    (comp.lang.perl.moderated)
  • Re: Hashing
    ... What you have to keep in mind is that a hash table for words in by ... linear testing of buckets. ... What is important is to ensure that you have an effective collision ... memory for the table, you need two arrays, one is the pointers to the ...
    (alt.lang.asm)
  • Re: Hash table in C++? STL?
    ... > a tree-like structure instead of lists for the buckets). ... > the standard will require equality or a relational comparator. ... the hashing function is where all the complexity lies and I'd be ... But we need hash only the first maxchars characters. ...
    (comp.lang.cpp)
  • Re: Hash tables
    ... A hash table is an obvious and thus common way of implementing this. ... array of buckets with buckets that are arrays with up to 500 elements due ... So I would certainly represent buckets as arrays and not lists. ... That should still be a *lot* faster than a tree, ...
    (comp.lang.functional)
  • Re: SGI hash_map
    ... >> studied hash functions you'll find on the web. ... > And before inserting into the map, each hash value is calculated with: ... a uniform distribution. ... a program to count the number of buckets that contain multiple items. ...
    (comp.lang.cpp)