Introduction

Quick Index

Goals
Concept Design (From Previous Chapter)

Before starting this chapter we want to browse and understand the concepts in the previous chapter -- 601HashTableConcepts.

In this chapter we aim to assemble the main design pieces that can be delivered to the coding team for coding:

Required class header
Required instance method headers (ADT)
Required construtor method headers
Object diagrams
Concepts and algorithms (including previous chapter)
Additional specific coding tips

Concept Design (From Previous Chapter)

We will start with the concept design from the previous chapter as our starting point.

Here are the highlights of that design:

HashTable Object Diagram

Notes:

The buckets sub-component must have fast indexed access
Each bucket is a very small collection/list that does not need fast indexed access
The elements in each bucket are Association objects where each Association holds a key and value.

More details here...

HashTable
  |
  +------- buckets ------- an Array
  |
  +------- maxLoadRatio -- an integer

Data Structures And Algorithms (DSA) (Chapter 602 - Hash Table Object Design)

Chapter 602 - Hash Table Object Design Introduction

Contents Intro Context Headers Size Normalizing Design Design Docs Tips References Challenge

Chapter Top Search TOC