#Hashing ( Hashing Values ) - Dietmar Kühl [ACCU 2019]

Hashing values is an important technique for efficient associative containers. It has multiple independent dimensions of considerations. None of these considerations is generally well understood. This presentation scratches the surface of the following areas:

Using hash functions for associative containers.

Hashing byte sequences into hash values and assessing the quality of hash functions.

Extracting byte sequences from values and hashing the resulting byte sequences.

Things to consider for a default hashing function.

The creation of containers and hashing functions is typically done by specialists. The primary intention of discussing them is to give an idea why applications should stay away from custom implementations. On the other hand provision of hash values for user-defined types is rather common-place to support their use as keys of associative containers. Thus, this presentation will have an emphasis on the important aspects for providing hash values for user-defined types:

The relation between equality and hash values.

Taking care of sequences to avoid collisions for empty sequences.

Interaction of hash values between different types ("transparency").

The code examples use C++. However, the various considerations are language independent and their understanding will be useful when using other programming languages, too.

-------------------------

-------------------------
Future Conferences:
ACCU 2019 Autumn Conference, Belfast (UK):
2019-11-11 and 2019-11-12.
ACCU 2020 Spring Conference, Bristol (UK), Marriott City Centre:
2020-03-24 to 2020-03-28.
-------------------------
ACCU Twitter: @ACCUConf

[ACCUConf]

Due to the huge volume of footage/material related to these talk videos we are unable to review each video in its entirety. We try our best to catch any errors, mistakes or issues with the videos prior to their release online, but sometimes they do slip through. If you notice an error with this video, or you feel any part of it is not up to scratch, please inform us by leaving a comment and we will do our very best to correct the issue and upload a new version as soon as possible.

We also welcome any feedback related to the videos. If you think there's something we can do better, or perhaps just differently, then please do let us know so that we can adapt our processes for future videos.

[botetescribavicentej.]

At 2:20 when finding on a ordered vector with lower_bound there is is typo, the condition must be it->first != k