MAC_key()
for each byte i in array
MAC_add(array[i])
mac = MAC_finalize()
To verify perform the same operations, and compare the result.
Joe
Can you please further define the MAC_add function, if you are using element
i as the input the the hash, wouldnt the hash still spit out a full hash? or
are you creating a string from the byte array and using that to hash?
Duck Typed Concepts for Ruby (was Re: A use case for an ordered hash) ... An Sequencable mixin can be defined that implements all sorts of operations such as append, concat, splice, sort, etc. ... extending an instance of Array with Sorted if the array is known to be sorted. ... Now returning to the thread at hand we can see that the difference between the associative array and hash hierarchies is that the hash hierarchy depends upon Hashable keys. ... (comp.lang.ruby)
Re: Suggestions for double-hashing scheme ... >> The items that are being moved are the items in the hash table itself, ... >> which are of fixed size (they are in an array,... > typedef struct { ... One "uchar" aka 'unsigned char' is plenty to hold a probe... (comp.programming)
Re: quickly comparing blocks of ints ... If you are able to compare the idexes with the higest chance of difference first, ... if the array contains only a few distinct values, and/or small values, you could maybe compact it into ... each bit in the hash is a flag indicating whether one of the integers is ...int compute_hash ... (comp.programming)
[SUMMARY] Index and Query (#54) ... This was a fun quiz for me because I really don't know anything about indexing... We see in initializethat the index is just a Hash.... an Array of symbolic document names where the word can be found ). ... (comp.lang.ruby)
script to find most common last names in a file ... Here's what I've got,, hope it makes some sort of sense ... # then creat a hash table of first and last names, ... # names array to the hash table ... # I don't know how to sort the contents of infile into a hash or compare... (perl.beginners)
