io.lacuna.bifurcan

Interface IForkable<T>

All Known Subinterfaces:

IGraph<V,E>, IList<V>, IMap<K,V>, ISet<V>, ISortedMap<K,V>

All Known Implementing Classes:

DirectedAcyclicGraph, DirectedGraph, FloatMap, Graph, IntMap, LinearList, LinearMap, LinearSet, List, Map, Rope, Set, SortedMap

public interface IForkable<T>

Method Summary

Modifier and Type	Method and Description
T	forked() This represents a data structure which can be made forked, which is equivalent to Clojure's persistent data structures, also sometimes called functional or immutable.

Method Detail

forked

T forked()

This represents a data structure which can be made forked, which is equivalent to Clojure's persistent data structures, also sometimes called functional or immutable. This is called "forked" because it means that multiple functions can make divergent changes to the data structure without affecting each other.

If only a single function or scope uses the data structure, it can be left as a linear data structure, which can have significant performance benefits.

If the data structure is already forked, it will simply return itself.

Returns:

a forked form of the data structure