The goal of this project would be to implement a fast open-addressed hash table inspired from Google’s flat_hash_map. In addition to this, I propose to work on getting an ordered version of hash tables, based on OrderedDict. All of these would be supplemented with proper benchmarks. Finally, I plan to work on getting several tree-based data-structures implemented and adding it to DataStructures.jl.

Organization

Student

Koustav Chowdhury

Mentors

  • oxinabox
  • Jameson Nash
close

2020