Implementation of Hash Sets

In course

Aute voluptate ex eiusmod sit reprehenderit ad ad exercitation aliquip officia. Nulla ad ad aliquip velit adipisicing veniam ut. Aliqua ipsum officia eiusmod minim do in ad in. Qui sint duis eiusmod ut cillum esse enim dolore officia. Cillum adipisicing eu ipsum occaecat.

Description

This lecture covers the implementation details of hash sets, including concepts such as hashing, table structure, resizing, and methods like add, remove, and rehashing. The instructor demonstrates the code structure using IntelliJ IDEA.

Instructor

esse irure tempor cupidatat

Velit laboris laboris velit exercitation. Dolore ut Lorem minim aliqua cupidatat Lorem. Sit laborum magna elit in magna nostrud sit incididunt in sint.

Official source

https://mediaspace.epfl.ch/media/0_bvnchs7o

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Ontological neighbourhood

Computer engineering

Computer security: Hash functions

Theoretical computer science

Programming language theory: High-level programming languages

Related lectures (40)