HashMap collection

Subscribe to a paid plan to get instant access to this course.

Video time: 29m55s

PREVIOUS

NEXT

Want this course?

HashMap collection

Updated October 24, 2018

HashMaps are the workhorse data structure of Clojure. They're used everywhere to add structure and meaning to data. We go over how to make them, how to use them, and some of the properties that make them so useful.

Next Lesson:

Set collection

Sets are incredibly useful. They give you fast containment checks and they don't remember duplicates. They're very useful for adding idempotence since duplicates are ignored.

Clojure Collections

0 / 34

0 / 34

Introduction to Clojure's Collections

Data structures

Vector collection

HashMap collection

List collection

Queue collection

Sorted Map collection

Sorted Set collection

Access patterns

Sequential Access Pattern

Remembering Duplicates Access Pattern

Lookup by key Access Pattern

Associate key and value Access Pattern

Dissociate a key and value Access Pattern

Count the elements Access Pattern

Equality Comparison Access Pattern

Removing an item from a set Access Pattern

Splitting a sequence Access Pattern

Containment Check Access Pattern

First-in, first-out Access Pattern

Last-in, First-out Access Pattern

Entity Usage Pattern

Index Usage Pattern

Tuple Usage Pattern

Multi-comparison Usage Pattern

Usage in an Atom

Hybrid Collections

Vectors and Lists in syntax

Collections vs sequences