Editing Pigeonhole principle (section)

===Hashing===

[[Hash_function|Hashing]] in [[computer science]] is the process of mapping an arbitrarily large set of data {{math|''n''}} to {{math|''m''}} fixed-size values. This has applications in [[caching]] whereby large data sets can be stored by a reference to their representative values (their "hash codes") in a "hash table" for fast recall. Typically, the number of unique objects in a data set {{math|''n''}} is larger than the number of available unique hash codes {{math|''m''}}, and the pigeonhole principle holds in this case that hashing those objects is no guarantee of uniqueness, since if you hashed all objects in the data set {{math|''n''}}, some objects must necessarily share the same hash code.{{Citation needed|date=February 2025}}