That's appropriate, because hashing for hash tables has entirely different requirements than cryptographic hashing. For a hash table you want a function that e

That's appropriate, because hashing for hash tables has entirely different requirements than cryptographic hashing. For a hash table you want a function that evaluates really fast, is short, but produces as little collisions as possible given that constraint. A cryptographic hash can be slower and have more steps, but it should be extremely hard to find a plaintext with a pre-defined hash value, or produce collisions, or one of the many other threat scenarios.