"Camilo Gonzalez" <[EMAIL PROTECTED]> wrote in message news:[EMAIL PROTECTED] > > Okay, this is a beginner's list. What the hell is MVC? How do you hash > an algorithm? >
As far as the hash algorithm, this concerns perl hashes. As you ( probably ) know, perl has a built in data structure called a hash. What this data structure enables, more or less, is the ability to index arbitrary values with arbitrary strings. A hash has certain defined properties. For instance, hashes cannot have duplicate keys, and regardless of hash size ( 1 element or 1 billion elements ) it ( theoretically ) takes ( about ) the same amount of time to map a key to a value. The people that wrote the C code to implement perl hashes did not just sit down and come up with their own ideas from scratch on how to do it. They used several mathematical theories used in computer science, one being called "hashing." As always, perl.com fills in the gory details: http://www.perl.com/pub/a/2002/10/01/hashes.html Todd W -- To unsubscribe, e-mail: [EMAIL PROTECTED] For additional commands, e-mail: [EMAIL PROTECTED]
