remove node_modules and .gitignore them

node_modules/tstl/container/TreeMap.d.ts

@@ -1,81 +0,0 @@
-/**
- * @packageDocumentation
- * @module std
- */
-import { UniqueTreeMap } from "../internal/container/associative/UniqueTreeMap";
-import { MapElementList } from "../internal/container/associative/MapElementList";
-import { Comparator } from "../internal/functional/Comparator";
-import { IForwardIterator } from "../iterator/IForwardIterator";
-import { IPair } from "../utility/IPair";
-/**
- * Unique-key Map based on Tree.
- *
- * @author Jeongho Nam - https://github.com/samchon
- */
-export declare class TreeMap<Key, T> extends UniqueTreeMap<Key, T, TreeMap<Key, T>, TreeMap.Iterator<Key, T>, TreeMap.ReverseIterator<Key, T>> {
-    private tree_;
-    /**
-     * Default Constructor.
-     *
-     * @param comp A binary function predicates *x* element would be placed before *y*. When returns `true`, then *x* precedes *y*. Note that, because *equality* is predicated by `!comp(x, y) && !comp(y, x)`, the function must not cover the *equality* like `<=` or `>=`. It must exclude the *equality* like `<` or `>`. Default is {@link less}.
-     */
-    constructor(comp?: Comparator<Key>);
-    /**
-     * Initializer Constructor.
-     *
-     * @param items Items to assign.
-     * @param comp A binary function predicates *x* element would be placed before *y*. When returns `true`, then *x* precedes *y*. Note that, because *equality* is predicated by `!comp(x, y) && !comp(y, x)`, the function must not cover the *equality* like `<=` or `>=`. It must exclude the *equality* like `<` or `>`. Default is {@link less}.
-     */
-    constructor(items: IPair<Key, T>[], comp?: Comparator<Key>);
-    /**
-     * Copy Constructor.
-     *
-     * @param obj Object to copy.
-     */
-    constructor(obj: TreeMap<Key, T>);
-    /**
-     * Range Constructor.
-     *
-     * @param first Input iterator of the first position.
-     * @param last Input iterator of the last position.
-     * @param comp A binary function predicates *x* element would be placed before *y*. When returns `true`, then *x* precedes *y*. Note that, because *equality* is predicated by `!comp(x, y) && !comp(y, x)`, the function must not cover the *equality* like `<=` or `>=`. It must exclude the *equality* like `<` or `>`. Default is {@link less}.
-     */
-    constructor(first: Readonly<IForwardIterator<IPair<Key, T>>>, last: Readonly<IForwardIterator<IPair<Key, T>>>, comp?: Comparator<Key>);
-    /**
-     * @inheritDoc
-     */
-    clear(): void;
-    /**
-     * @inheritDoc
-     */
-    swap(obj: TreeMap<Key, T>): void;
-    /**
-     * @inheritDoc
-     */
-    key_comp(): Comparator<Key>;
-    /**
-     * @inheritDoc
-     */
-    lower_bound(key: Key): TreeMap.Iterator<Key, T>;
-    /**
-     * @inheritDoc
-     */
-    upper_bound(key: Key): TreeMap.Iterator<Key, T>;
-    protected _Handle_insert(first: TreeMap.Iterator<Key, T>, last: TreeMap.Iterator<Key, T>): void;
-    protected _Handle_erase(first: TreeMap.Iterator<Key, T>, last: TreeMap.Iterator<Key, T>): void;
-}
-/**
- *
- */
-export declare namespace TreeMap {
-    /**
-     * Iterator of {@link TreeMap}
-     */
-    type Iterator<Key, T> = MapElementList.Iterator<Key, T, true, TreeMap<Key, T>>;
-    /**
-     * Reverse iterator of {@link TreeMap}
-     */
-    type ReverseIterator<Key, T> = MapElementList.ReverseIterator<Key, T, true, TreeMap<Key, T>>;
-    const Iterator: typeof MapElementList.Iterator;
-    const ReverseIterator: typeof MapElementList.ReverseIterator;
-}