lichess.org
Donate

hastable size explanation

Hello, can someone help me explain what is hastable size exactly? thanks
Chess programs need to store huge amounts of data.
Hash table is a data structure adressing two points :
- the amount of data may be large ;
- but its size is not known in advance.
And the time to search an element is rather small.

By contrast : vectors have a maximum size ; linked lists must be scanned in sequence to find an element.

This topic has been archived and can no longer be replied to.