v1.7.10 Publish

package.json

@@ -6,7 +6,7 @@
     "email": "samchon@samchon.org",
     "url": "http://samchon.org"
   },
-  "version": "1.7.10-dev.20180321",
+  "version": "1.7.10",
   "main": "./lib/tstl.js",
   "typings": "./lib/tstl.d.ts",
   "scripts": {

src/std/base/containers/AdaptorContainer.ts

@@ -3,7 +3,9 @@
 namespace std.base
 {
 	/**
-	 * @hidden
+	 * Base class for Adaptor Containers.
+	 * 
+	 * @author Jeongho Nam <http://samchon.org>
 	 */
 	export abstract class AdaptorContainer<T, 
 			Source extends _IEmpty & _ISize & _IPush<T>,

src/std/base/containers/IContainer.ts

@@ -25,7 +25,7 @@ namespace std.base
 			(first: InputIterator, last: InputIterator): void;
 
 		/**
-		 * Clear elements.
+		 * @inheritDoc
 		 */
 		clear(): void;
 
@@ -50,37 +50,27 @@ namespace std.base
 			ITERATORS
 		--------------------------------------------------------- */
 		/**
-		 * Iterator to the first element.
-		 * 
-		 * @return Iterator to the first element.
+		 * @inheritDoc
 		 */
 		begin(): IteratorT;
 
 		/**
-		 * Iterator to the end.
-		 * 
-		 * @return Iterator to the end.
+		 * @inheritDoc
 		 */
 		end(): IteratorT;
 
 		/**
-		 * Reverse iterator to the first element in reverse.
-		 * 
-		 * @return Reverse iterator to the first.
+		 * @inheritDoc
 		 */
 		rbegin(): ReverseIteratorT;
 
 		/**
-		 * Reverse iterator to the reverse end.
-		 * 
-		 * @return Reverse iterator to the end.
+		 * @inheritDoc
 		 */
 		rend(): ReverseIteratorT;
 
 		/**
-		 * Native function for `for ... of` iteration.
-		 * 
-		 * @return For ... of iterator
+		 * @inheritDoc
 		 */
 		[Symbol.iterator](): IterableIterator<T>;
 

src/std/base/containers/IDequeContainer.ts

@@ -1,20 +1,12 @@
 namespace std.base
 {
 	/**
-	 * Interface for deque containers.
-	 * 
-	 * @author Jeongho Nam <http://samchon.org>
+	 * @hidden
 	 */
-	export interface IDequeContainer<T,
-			SourceT extends IContainer<T, SourceT, IteratorT, ReverseIteratorT>, 
-			IteratorT extends Iterator<T, SourceT, IteratorT, ReverseIteratorT>, 
-			ReverseIteratorT extends ReverseIterator<T, SourceT, IteratorT, ReverseIteratorT>>
-		extends ILinearContainer<T, SourceT, IteratorT, ReverseIteratorT>
+	export interface _IDeque<T> extends _IPushFront<T>
 	{
 		/**
-		 * Insert an element at the first.
-		 * 
-		 * @param val Value to insert.
+		 * @inheritDoc
 		 */
 		push_front(val: T): void;
 
@@ -23,4 +15,17 @@ namespace std.base
 		 */
 		pop_front(): void;
 	}
+
+	/**
+	 * Interface for deque containers.
+	 * 
+	 * @author Jeongho Nam <http://samchon.org>
+	 */
+	export interface IDequeContainer<T,
+			SourceT extends IContainer<T, SourceT, IteratorT, ReverseIteratorT>, 
+			IteratorT extends Iterator<T, SourceT, IteratorT, ReverseIteratorT>, 
+			ReverseIteratorT extends ReverseIterator<T, SourceT, IteratorT, ReverseIteratorT>>
+		extends ILinearContainer<T, SourceT, IteratorT, ReverseIteratorT>, _IDeque<T>
+	{
+	}
 }

src/std/base/containers/ILinearContainer.ts

@@ -1,5 +1,25 @@
 namespace std.base
 {
+	/**
+	 * @hidden
+	 */
+	export interface _IFront<T>
+	{
+		/**
+		 * Get the first element.
+		 * 
+		 * @return The first element.
+		 */
+		front(): T;
+
+		/**
+		 * Change the first element.
+		 * 
+		 * @param val The value to change.
+		 */
+		front(val: T): void;
+	}
+
 	/**
 	 * Interface for linear containers.
 	 * 
@@ -9,7 +29,8 @@ namespace std.base
 			SourceT extends IContainer<T, SourceT, IteratorT, ReverseIteratorT>, 
 			IteratorT extends Iterator<T, SourceT, IteratorT, ReverseIteratorT>, 
 			ReverseIteratorT extends ReverseIterator<T, SourceT, IteratorT, ReverseIteratorT>>
-		extends IContainer<T, SourceT, IteratorT, ReverseIteratorT>
+		extends IContainer<T, SourceT, IteratorT, ReverseIteratorT>, 
+			_IPushBack<T>
 	{
 		/* ---------------------------------------------------------
 			CONSTRUCTORS
@@ -41,18 +62,6 @@ namespace std.base
 		/* ---------------------------------------------------------
 			ACCESSORS
 		--------------------------------------------------------- */
-		/**
-		 * Get the first element.
-		 * 
-		 * @return The first element.
-		 */
-		front(): T;
-
-		/**
-		 * Change the first element.
-		 */
-		front(val: T): void;
-
 		/**
 		 * Get the last element.
 		 * 
@@ -62,16 +71,16 @@ namespace std.base
 
 		/**
 		 * Change the last element.
+		 * 
+		 * @param val The value to change.
 		 */
 		back(val: T): void;
 
 		/* ---------------------------------------------------------
 			ELEMENTS I/O
 		--------------------------------------------------------- */
 		/**
-		 * Insert an element at the end.
-		 * 
-		 * @param val Value to insert.
+		 * @inheritDoc
 		 */
 		push_back(val: T): void;
 

src/std/base/disposable/IBidirectionalContainer.ts

@@ -8,7 +8,18 @@ namespace std.base
 			ReverseIteratorT extends IReverseIterator<T, IteratorT, ReverseIteratorT>>
 		extends IForwardContainer<T, IteratorT>
 	{
+		/**
+		 * Reverse iterator to the first element in reverse.
+		 * 
+		 * @return Reverse iterator to the first.
+		 */
 		rbegin(): ReverseIteratorT;
+
+		/**
+		 * Reverse iterator to the reverse end.
+		 * 
+		 * @return Reverse iterator to the end.
+		 */
 		rend(): ReverseIteratorT;
 	}
 }

src/std/base/disposable/IForwardContainer.ts

@@ -5,7 +5,18 @@ namespace std.base
 	 */
 	export interface IForwardContainer<T, Iterator extends IForwardIterator<T, Iterator>>
 	{
+		/**
+		 * Iterator to the first element.
+		 * 
+		 * @return Iterator to the first element.
+		 */
 		begin(): Iterator;
+
+		/**
+		 * Iterator to the end.
+		 * 
+		 * @return Iterator to the end.
+		 */
 		end(): Iterator;
 	}
 }

src/std/base/disposable/IListAlgorithm.ts

@@ -0,0 +1,59 @@
+namespace std.base
+{
+	export interface _IListAlgorithm<T, Source>
+	{
+		/* ---------------------------------------------------------
+			UNIQUE & REMOVE
+		--------------------------------------------------------- */
+		/**
+		 * Remove duplicated elements.
+		 * 
+		 * @param binary_pred A binary function predicates two arguments are equal. Default is {@link equal_to}.
+		 */
+		unique(binary_pred?: (x: T, y: T) => boolean): void;
+
+		/**
+		 * Remove elements with specific value.
+		 * 
+		 * @param val The value to remove.
+		 */
+		remove(val: T): void;
+
+		/**
+		 * Remove elements with specific function.
+		 * 
+		 * @param pred A unary function determines whether remove or not.
+		 */
+		remove_if(pred: (val: T) => boolean): void;
+
+		/* ---------------------------------------------------------
+			SEQUENCE
+		--------------------------------------------------------- */
+		/**
+		 * Merge two *sorted* containers.
+		 * 
+		 * @param source Source container to transfer.
+		 * @param comp A binary function predicates *x* element would be placed before *y*. When returns `true`, then *x* precedes *y*. Default is {@link less}.
+		 */
+		merge(from: Source, comp?: (x: T, y: T) => boolean): void;
+
+		/**
+		 * Sort elements.
+		 * 
+		 * @param comp A binary function predicates *x* element would be placed before *y*. When returns `true`, then *x* precedes *y*. Default is {@link less}.
+		 */
+		sort(comp?: (x: T, y: T) => boolean): void;
+
+		/**
+		 * Reverse elements.
+		 */
+		reverse(): void;
+
+		/**
+		 * Swap elements.
+		 * 
+		 * @param obj Target container to swap.
+		 */
+		swap(obj: Source): void;
+	}
+}

src/std/base/disposable/IPartialContainers.ts

@@ -3,6 +3,17 @@ namespace std.base
 	/* ---------------------------------------------------------
 		CAPACITY
 	--------------------------------------------------------- */
+	/**
+	 * @hidden
+	 */
+	export interface _IClear
+	{
+		/**
+		 * Clear elements.
+		 */
+		clear(): void;
+	}
+
 	/**
 	 * @hidden
 	 */
@@ -55,6 +66,11 @@ namespace std.base
 	 */
 	export interface _IPushFront<T>
 	{
+		/**
+		 * Insert an element at the first.
+		 * 
+		 * @param val Value to insert.
+		 */
 		push_front(val: T): void;
 	}
 
@@ -63,6 +79,11 @@ namespace std.base
 	 */
 	export interface _IPushBack<T>
 	{
+		/**
+		 * Insert an element at the end.
+		 * 
+		 * @param val Value to insert.
+		 */
 		push_back(val: T): void;
 	}
 }