Immutable.js

Immutable data cannot be changed once created, leading to much simpler application development, no defensive copying, and enabling advanced memoization and change detection techniques with simple logic.

Immutable data encourages pure functions (data-in, data-out) and lends itself to much simpler application development and enabling techniques from functional programming such as lazy evaluation.

While designed to bring these powerful functional concepts to JavaScript, it presents an Object-Oriented API familiar to Javascript engineers and closely mirroring that of Array, Map, and Set. It is easy and efficient to convert to and from plain Javascript types.

New here? The Get started guide walks through installing the library and the ideas behind it, in reading order. Otherwise, head straight to the API reference below.

Get started

Add Immutable.js to your project with your package manager or a script tag, with first class TypeScript support built in.

Why Immutable.js?

What persistent data structures are, why they make application state simpler, and what Immutable.js brings to the table.

JavaScript-first API

The collections mirror Array, Map and Set, and convert to and from plain JavaScript objects and arrays.

Nested structures

Read and update deeply nested data with getIn, setIn, updateIn and mergeDeep.

Equality as values

Two collections holding the same values are equal. How that differs from reference equality, and what it costs.

Batching mutations

Apply a batch of changes to a temporary mutable copy with withMutations, and pay for a single new collection.

Chain map, filter and friends without ever building the intermediate collections — even over infinite sequences.

filter, partition & groupBy

Three ways to split a collection into parts, and how to pick the right one.

How to read these docs

The type notation used across the API reference, and a cheatsheet of how the collections inherit from each other.

Tools & resources

Third-party libraries built around Immutable.js, and where to ask questions or contribute.

Collections

Lists are ordered indexed dense collections, much like a JavaScript Array.

Immutable Map is an unordered Collection.Keyed of (key, value) pairs with O(log32 N) gets and O(log32 N) persistent sets.

A type of Map that has the additional guarantee that the iteration order of entries will be the order in which they were set().

A Collection of unique values with O(log32 N) adds and has.

A type of Set that has the additional guarantee that the iteration order of values will be the order in which they were added.

Stacks are indexed collections which support very efficient O(1) addition and removal from the front using unshift(v) and shift().

Returns a Seq.Indexed of numbers from start (inclusive) to end (exclusive), by step, where start defaults to 0, step to 1, and end to infinity. When start is equal to end, returns empty range.

Returns a Seq.Indexed of value repeated times times. When times is not defined, returns an infinite Seq of value.

A record is similar to a JS object, but enforces a specific set of allowed string keys, and has default values.

A Record.Factory is created by the Record() function. Record instances are created by passing it some of the accepted values for that Record type:

Seq describes a lazy operation, allowing them to efficiently chain use of all the higher-order collection methods (such as map and filter) by not creating intermediate collections.

Seq which represents key-value pairs.

Seq which represents an ordered indexed list of values.

Seq which represents a set of values.

The Collection is a set of (key, value) entries which can be iterated, and is the base class for all collections in immutable, allowing them to make use of all the Collection methods (such as map and filter).

Collection.Keyed

Keyed Collections have discrete keys tied to each value.

Collection.Indexed

Indexed Collections have incrementing numeric keys. They exhibit slightly different behavior than Collection.Keyed for some methods in order to better mirror the behavior of JavaScript's Array, and add methods which do not make sense on non-indexed Collections such as indexOf.

Set Collections only represent values. They have no associated keys or indices. Duplicate values are possible in the lazy Seq.Sets, however the concrete Set Collection does not allow duplicate values.

Functions

Value equality check with semantics similar to Object.is, but treats Immutable Collections as values, equal if the second Collection includes equivalent values.

The hash() function is an important part of how Immutable determines if two values are equivalent and is used to determine how to store those values. Provided with any value, hash() will return a 31-bit integer.

True if maybeImmutable is an Immutable Collection or Record.

True if maybeCollection is a Collection, or any of its subclasses.

True if maybeKeyed is a Collection.Keyed, or any of its subclasses.

True if maybeIndexed is a Collection.Indexed, or any of its subclasses.

isAssociative()

True if maybeAssociative is either a Keyed or Indexed Collection.

isValueObject()

True if maybeValue is a JavaScript Object which has both equals() and hashCode() methods.

True if maybeSeq is a Seq.

True if maybeList is a List.

True if maybeMap is a Map.

True if maybeOrderedMap is an OrderedMap.

True if maybeStack is a Stack.

True if maybeSet is a Set.

True if maybeOrderedSet is an OrderedSet.

True if maybeRecord is a Record.

Returns true if the key is defined in the provided collection.

Returns a copy of the collection with the value at the key path removed.

Returns a copy of the collection with the value at the key path set to the provided value.

Returns a copy of the collection with the remaining collections merged in.

Returns a copy of the collection with the remaining collections merged in, calling the merger function whenever an existing value is encountered.

Like merge(), but when two compatible collections are encountered with the same key, it merges them as well, recursing deeply through the nested data. Two collections are considered to be compatible (and thus will be merged together) if they both fall into one of three categories: keyed (e.g., Maps, Records, and objects), indexed (e.g., Lists and arrays), or set-like (e.g., Sets). If they fall into separate categories, mergeDeep will replace the existing collection with the collection being merged in. This behavior can be customized by using mergeDeepWith().

mergeDeepWith()

Like mergeDeep(), but when two non-collections or incompatible collections are encountered at the same key, it uses the merger function to determine the resulting value. Collections are considered incompatible if they fall into separate categories between keyed, indexed, and set-like.