Undirected and directed graphs and associated algorithms.

Maps associate keys with values.

Queues store items in the order in which they are added.

Sets store unique items.

Stacks store items in order, like a stack of plates.

A tree-like structure of branches and leaves.

Applies fn to both start and end fields, returning a new event.

Converts a collection of IndexedEventItem back into an array of EventItem, placing items at their original index.

Returns how b overlaps with a.

Gets the range of events: the smallest 'start' and the largest 'end'.

Lays out events end-to-end, removing gaps between them and having the first start at 0. Duration of events is maintained.

Creates an EventItem from an EventItemAsDuration by calculating the end as start + duration.

Punches a hole in sortedEvents which overlap hole. It does this by splitting/trimming events, or removing an event entirely it is fully covered by the hole.

Inserts space within sortedEvents. It does this by shifting events forward.

Returns the intervals between pairs of events.

Returns true if item has zero duration (start and end are the same), false otherwise.

Yields every item in eventsByEnd that has the specified end value. Return item is a wrapped object consisting of the event as well as its index.

Yields every item in sortedEvents that has the specified start value

Yields all events that overlap with point. By default event end is considered exclusive, meaning that if point == event.end, it is not considered overlapping. If endInclusive is true, event end is considered inclusive, and the aforementioned would be considered ovlerapping.

Removes toRemove from sortedEvents.

Returns a new array of events ordered by their end time (ascending)

Returns a new array of events ordered by their start time (ascending)

Splits event into two events by either a percentange of duration or by a specific start position.

Returns the total duration of all events. Doesn't take into account the spacing between events, just sums the duration of each one.

Creats an EventItemAsDuration from an EventItem by calculating the duration as end - start.

Translates an event by adding amount to both start and end, returning a new event.

A circular array keeps a maximum number of values, overwriting older values as needed. Immutable.

A map that can have a capacity limit. The elapsed time for each get/set operation is maintained allowing for items to be automatically removed. has() does not affect the last access time.

Queue (immutable). See also QueueMutable.

Mutable queue that fires events when manipulated.

Stores values in a table of rows (vertical) and columns (horizontal)

A Set which stores unique items determined by their value, rather than object reference (unlike the default JS Set). Create with Sets.mutable. Immutable.

A Set which stores unique items determined by their value, rather than object reference (unlike the default JS Set). Create with Sets.mutable. Mutable.

Key-value pairs in an array

Type that represents key-values in object or array form

A node with an accompanying label

A value that is labelled

A labelled single value or array of values

A label for any number of values

Key-value pairs in object form

Queue options.

A simplified node has its parentage stripped.

A row of table values

A table value or undefined

Traversable Tree.

Options for parsing a path

Array-backed tree node.

Wraps a TreeNode for a more object-oriented means of access.

Sorts by end, such that 'end' values are ascending.

Sorts by start, such that 'start' values are ascending.