Hashed array tree
In computer science, a hashed array tree (HAT) is a dynamic array data-structure published by Edward Sitarski in 1996, maintaining an array of separate memory fragments (or "leaves") to store the data elements, unlike simple dynamic arrays which maintain their data in one contiguous memory area. Its primary objective is to reduce the amount of element copying due to automatic array resizing operations, and to improve memory usage patterns.
Wikipage disambiguates
primaryTopic
Hashed array tree
In computer science, a hashed array tree (HAT) is a dynamic array data-structure published by Edward Sitarski in 1996, maintaining an array of separate memory fragments (or "leaves") to store the data elements, unlike simple dynamic arrays which maintain their data in one contiguous memory area. Its primary objective is to reduce the amount of element copying due to automatic array resizing operations, and to improve memory usage patterns.
has abstract
In computer science, a hashed ...... t does not use hash functions.
@en
thumbnail
Wikipage page ID
12,673,184
Wikipage revision ID
737,385,468
subject
comment
In computer science, a hashed ...... improve memory usage patterns.
@en
label
Hashed array tree
@en