* @param posBounds bottom and top positions.

* @param right Next cell.

* @example * Anchor(p) is just before p * There not exists another position between Anchor(p) and p * * @param ref position to whi

* @param lowerPos First position of the block. * @param content Content of the block.

* @param index Insertion index. * @param content Inserted elements.

* @param index Removal index. * @param items Number of removed elements.

* @param lower Lower bound. * @param length Number of elements in the range.

* @param length {@link Concat#length}

* @param block {@link Cell#block } * @param right {@link Linkable#right }

* New empty list.

* @param factory strategy of block generation.

* @param root {@see EditableOpAvlList#root }

* @param root {@see EditableOpAvlList#root } * @param factory {@see EditableOpAvlList#factory }

* @param priority {@link SimplePosPart#priority } * @param replica {@link SimplePosPart#replica } * @param nth {@link SimplePosPart#nth }

* @param parts {@link SimplePos#parts }

* @param posBounds {@link SimpleBlockFactory#replica } * @param seq {@link SimpleBlockFactory#seq } * @param randState random generator's st

* @param priority {@link SimpleDotPosPart#priority } * @param replica {@link SimpleDotPosPart#replica } * @param seq {@link SimpleDotPosPart

* @param parts {@link SimpleDotPos#parts }

* @param posBounds {@link SimpleBlockFactory#replica } * @param seq {@link SimpleBlockFactory#seq } * @param randState random generator's st

* @return Deep copy of this.

* @param items * @return New block with {@link items } as {@link Block#items }.

* @param priority {@link SimplePosPart#priority } * ∉ {U32_BOTTOM, U32_TOP} * @param replica {@link SimplePosPart#replica } *

* @param priority {@link SimpleDotPosPart#priority } * ∉ {U32_BOTTOM, U32_TOP} * @param replica {@link SimpleDotPosPart#replica }

* @param x candidate * @return object from `x', or undefined if `x' is not valid.

* @param opFromPlain * @return function that accepts a value and attempt to build a list. * It returns the built list if it succeeds, or un

* @param opFromPlain * @return function that accepts a value and attempt to build a list. * It returns the built list if it succeeds, or un

* @param x candidate * @return object from `x', or undefined if `x' is not valid.

* @param blockFromPlain * @return function that accepts a value and returns a Sentinel from * the value, or undefined if the value is mal-f

* @param f * @param itemsFromPlain * @return function that accepts a value and attempt to build a list. * It returns the built list if

* * @param f * @param itemsFromPlain * @return function that accepts a value and attempt to build a list. * It returns the built

* @param blockFromPlain * @return function that accepts a value and returns a Node from * the value, or undefined if the value is mal-forme

* @note {@link SimplePosPart#BOTTOM} and {@link SimplePosPart#TOP} * are not valid candidates. * * @param x candidate * @return ob

* @note {@link SimplePos#BOTTOM } and {@link SimplePos#TOP } * are not valid candidates. * * @param x candidate * @return object f

* @note {@link SimpleDotPosPart#BOTTOM} and {@link SimpleDotPosPart#TOP} * are not valid candidates. * * @param x candidate * @ret

* @note {@link SimpleDotPos#BOTTOM } and {@link SimpleDotPos#TOP } * are not valid candidates. * * @param x candidate * @return ob

* Some factories can store generated positions for differents purposes. * This method enables to garbage collect these positions when they *

* See {@link BlockFactory#garbageCollect } * * @param l lower position * @param length number of positions after l (including l) to rem

* Non-cryptographic way to approximate object identity.

* Non-cryptographic way to approximate object identity.

@override

* Increase {@link SimpleBlockFactory#seq } by {@link by } * * @param by

* @param anchor * @param minIndex minimal index in the current sub-list. * @return index of `anchor`.

* @param anchor * @param minIndex minimal index in the current sub-list. * @return index of `anchor`.

* @param anchor * @return index of `anchor`.

* @param iBlock block to insert. * @param minIndex minimal index in the current sub-list. * @return Performed modifications in terms of loca

* [Mutation] * Insert the parts of {@link iBlock } which are not already inserted. * * @param iBlock block to insert. * @param ind

* @param relIndex relative index * @param items elements to insert * @param factory [mutated] block factory * @return block generated w

* [Mutation] * Insert {@link items } at {@link index}. * * @param index 0-based index; Where to insert. * @param items elements to

* [Mutation] * Insert {@link items } at {@link index}. * * @param index 0-based index; Where to insert. * @param items elements to

@Override

@Override

* [Mutation] * Insert {@link rblock } to right and preserve the chain. * * @param rblock block to insert. * @return inserted cell

* @param iBlock * @return segments of `iBlock` that can be inserted in the current * sub-list.

* @param iBlock * @return segments of `iBlock` that can be inserted in the current * sub-list.

@override

* @param other * this and {@link other } intersect. * @return Intersection part between this and {@link other }.

@override

* Length of {@link Block#content }

* Number of inserted elements.

@Override