123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159
//================================================================ /** * @packageDocumentation * @module std   *///================================================================import { IPointer } from "../functional/IPointer";
import { IForwardIterator } from "./IForwardIterator";import { IBidirectionalIterator } from "./IBidirectionalIterator";import { IRandomAccessIterator } from "./IRandomAccessIterator";
import { IEmpty } from "../internal/container/partial/IEmpty";import { ISize } from "../internal/container/partial/ISize";
import { InvalidArgument } from "../exception/InvalidArgument";
/* =========================================================    GLOBAL FUNCTIONS        - ACCESSORS        - MOVERS        - FACTORIES============================================================    ACCESSORS--------------------------------------------------------- *//** * Test whether a container is empty. *  * @param source Target container. * @return Whether empty or not. */export function empty(source: Array<any> | IEmpty): boolean{    if (source instanceof Array)        return source.length !== 0;    else        return source.empty();}
/** * Get number of elements of a container. *  * @param source Target container. * @return The number of elements in the container. */export function size(source: Array<any> | ISize): number{    if (source instanceof Array)        return source.length;    else        return source.size();}
/** * Get distance between two iterators. *  * @param first Input iteartor of the first position. * @param last Input iterator of the last position. *  * @return The distance. */export function distance<InputIterator extends Readonly<IForwardIterator<IPointer.ValueType<InputIterator>, InputIterator>>>    (first: InputIterator, last: InputIterator): number;
export function distance<InputIterator extends Readonly<IRandomAccessIterator<IPointer.ValueType<InputIterator>, InputIterator>>>    (first: InputIterator, last: InputIterator): number{    if (first.index instanceof Function)        return _Distance_via_index(first, last);
    let ret: number = 0;    for (; !first.equals(last); first = first.next())        ++ret;
    return ret;}
function _Distance_via_index<RandomAccessIterator extends IRandomAccessIterator<IPointer.ValueType<RandomAccessIterator>, RandomAccessIterator>>    (first: RandomAccessIterator, last: RandomAccessIterator): number{    let x: number = first.index();    let y: number = last.index();
    if ((first as any).base instanceof Function)        return x - y;    else        return y - x;    }
/* ---------------------------------------------------------    ACCESSORS--------------------------------------------------------- *//** * Advance iterator. *  * @param it Target iterator to advance. * @param n Step to advance. *  * @return The advanced iterator. */export function advance<InputIterator extends IForwardIterator<IPointer.ValueType<InputIterator>, InputIterator>>    (it: InputIterator, n: number): InputIterator;
export function advance<InputIterator extends IRandomAccessIterator<IPointer.ValueType<InputIterator>, InputIterator>>    (it: InputIterator, n: number): InputIterator{    if (n === 0)        return it;    else if (it.advance instanceof Function)        return it.advance(n);
    let stepper: (it: InputIterator) => InputIterator;    if (n < 0)    {        if (!(it.prev instanceof Function))            throw new InvalidArgument("Error on std.advance(): parametric iterator is not a bi-directional iterator, thus advancing to negative direction is not possible.");
        stepper = it => it.prev();        n = -n;    }    else            stepper = it => it.next();
    while (n-- > 0)        it = stepper(it);    return it;}
/** * Get previous iterator. *  * @param it Iterator to move. * @param n Step to move prev. * @return An iterator moved to prev *n* steps. */export function prev<BidirectionalIterator extends IBidirectionalIterator<IPointer.ValueType<BidirectionalIterator>, BidirectionalIterator>>    (it: BidirectionalIterator, n: number = 1): BidirectionalIterator{    if (n === 1)        return it.prev();    else        return advance(it, -n);}
/** * Get next iterator. *  * @param it Iterator to move. * @param n Step to move next. * @return Iterator moved to next *n* steps. */export function next<ForwardIterator extends IForwardIterator<IPointer.ValueType<ForwardIterator>, ForwardIterator>>    (it: ForwardIterator, n: number = 1): ForwardIterator{        if (n === 1)        return it.next();    else        return advance(it, n);}