hash
The clever equal $a ~~ @array is a lot of slower than exists $hash{$a}
Also hashing algorythm is much slower than binary search, so wouldn't be
better if we store key,values to btree structures instead of hashes ?
.
Relevant Pages
- Re: Iterative Password Hashing vs Strong Salt
... I could store hashes in filesystem, ... he wouldn't need those passwords anymore. ... would not use iterative hashing for himself when he is cracking the ...
(sci.crypt) - Re: binary search
... > Given a sorted linked list it is required to perform a binary search ... bunch of arbitrary memory locations hooked together with pointers. ... store the first item "as is". ... Prev by Date: ...
(comp.programming) - Hash salt (was Re: BCRYPT - Why not using it?)
... hashes with a 1:1 ration to text. ... Now add a salt. ... The OS must store the salt somewhere, in order to correctly authenticate the user when he logs in. ... To UNSUBSCRIBE, email to debian-user-REQUEST@xxxxxxxxxxxxxxxx with a subject of "unsubscribe". ...
(Debian-User) - Re: binary search
... >> Given a sorted linked list it is required to perform a binary search ... store the first item "as is". ... > point the first item's "prev" pointer at it. ... This is not in general a list data structure, ...
(comp.programming) - Re: storing and accessing a has in a package
... You are always within a package. ... How does StoreHash() know what to store? ... You cannot store hashes and arrays in elements of other hashes or ...
(comp.lang.perl.misc) |
|
