diff --git a/date-fns/index.d.ts b/date-fns/index.d.ts
index d0582c2571..bb78fe74e2 100644
--- a/date-fns/index.d.ts
+++ b/date-fns/index.d.ts
@@ -1,4 +1,4 @@
-// Type definitions for date-fns
+// Type definitions for date-fns v2.5.1
// Project: https://date-fns.org/
// Definitions by: Matt Lewis Two keys are considered equivalent if the properties' comparison object returns false reflexively
+ * (i.e., no matter the order in which the elements are passed as arguments). Default Constructor. Constructs an empty container, with no elements. Initializer list Constructor. Constructs a container with a copy of each of the elements in array, in the same order. Copy Constructor. Constructs a container with a copy of each of the elements in container, in the same order. Range Constructor. Constructs a container with as many elements as the range (begin, end), with each
- * element emplace-constructed from its corresponding element in that range, in the same order. Reconstruction of hash table. Get iterator to previous element. If current iterator is the first item(equal with {@link IContainer.begin IContainer.begin()}),
@@ -4165,7 +4136,7 @@ declare namespace std {
*
* @return A value of the iterator.
*/
- readonly value: T;
+ readonly abstract value: T;
abstract swap(obj: Iterator Return base iterator. Get value of the iterator is pointing. {@link ListContainer}s are sequence containers that allow constant time insert and erase operations anywhere
+ * within the sequence, and iteration in both directions. List containers are implemented as doubly-linked lists; Doubly linked lists can store each of the elements they
+ * contain in different and unrelated storage locations. The ordering is kept internally by the association to each
+ * element of a link to the element preceding it and a link to the element following it. Compared to other base standard sequence containers (array, vector and deque), lists perform generally better
+ * in inserting, extracting and moving elements in any position within the container for which an iterator has already
+ * been obtained, and therefore also in algorithms that make intensive use of these, like sorting algorithms. The main drawback of lists and forward_lists compared to these other sequence containers is that they lack
+ * direct access to the elements by their position; For example, to access the sixth element in a list, one has to
+ * iterate from a known position (like the beginning or the end) to that position, which takes linear time in the
+ * distance between these. They also consume some extra memory to keep the linking information associated to each
+ * element (which may be an important factor for large lists of small-sized elements). Insert an element. The container is extended by inserting a new element before the element at the specified
+ * position. This effectively increases the {@link List.size List size} by the amount of elements
+ * inserted. Unlike other standard sequence containers, {@link List} is specifically designed to be efficient
+ * inserting and removing elements in any position, even in the middle of the sequence. Insert elements by repeated filling. The container is extended by inserting a new element before the element at the specified
+ * position. This effectively increases the {@link List.size List size} by the amount of elements
+ * inserted. Unlike other standard sequence containers, {@link List} is specifically designed to be efficient
+ * inserting and removing elements in any position, even in the middle of the sequence. Insert elements by range iterators. The container is extended by inserting a new element before the element at the specified
+ * position. This effectively increases the {@link List.size List size} by the amount of elements
+ * inserted. Unlike other standard sequence containers, {@link List} is specifically designed to be efficient
+ * inserting and removing elements in any position, even in the middle of the sequence. Erase an element. Removes from the {@link List} either a single element; position. This effectively reduces the container size by the number of element removed. Unlike other standard sequence containers, {@link List} objects are specifically designed to be
+ * efficient inserting and removing elements in any position, even in the middle of the sequence. Erase elements. Removes from the {@link List} container a range of elements. This effectively reduces the container {@link size} by the number of elements removed. Unlike other standard sequence containers, {@link List} objects are specifically designed to be
+ * efficient inserting and removing elements in any position, even in the middle of the sequence. Swap content. Exchanges the content of the container by the content of obj, which is another
+ * {@link List container} object with same type of elements. Sizes and container type may differ. After the call to this member function, the elements in this container are those which were in obj
+ * before the call, and the elements of obj are those which were in this. All iterators, references and
+ * pointers remain valid for the swapped objects. Notice that a non-member function exists with the same name, {@link std.swap swap}, overloading that
+ * algorithm with an optimization that behaves like this member function. An abstract map. {@link rbegin} points to the element preceding the one that would be pointed to by member {@link end}.
- * Samchon-Framework
+ * # Samchon-Framework
*
*
*
*
- * Samchon, a SDN (Software Defined Network) framework.
+ * Samchon, a OON (Object-Oriented Network) framework.
*
* With Samchon Framework, you can implement distributed processing system within framework of OOD like handling S/W
* objects (classes). You can realize cloud and distributed system very easily with provided system templates and even
@@ -355,9 +355,6 @@ declare namespace samchon.collections {
preventDefault(): void;
}
}
-/**
- * @hidden
- */
declare namespace samchon.collections.CollectionEvent {
const INSERT: "insert";
const ERASE: "erase";
@@ -1025,6 +1022,27 @@ declare namespace samchon.collections {
removeEventListener(type: "refresh", listener: CollectionEventListener
+ *
+ *
+ * @see {@link DedicatedWorkerClientDriver}, {@link DedicatedWorkerServerConnector}, {@link IProtocol}
+ * @reference https://developer.mozilla.org/en-US/docs/Web/API/DedicatedWorker
+ * @handbook [Protocol - Basic Components](https://github.com/samchon/framework/wiki/TypeScript-Protocol-Basic_Components#icommunicator)
+ * @author Jeongho Nam
+ *
+ *
+ * @see {@link DedicatedWorkerServer}, {@link IProtocol}
+ * @handbook [Protocol - Basic Components](https://github.com/samchon/framework/wiki/TypeScript-Protocol-Basic_Components#iclientdriver)
+ * @author Jeongho Nam
+ *
+ *
+ * @see {@link DedicatedWorkerClientDriver}, {@link DedicatedWorkerServerBase}
+ * @handbook [Protocol - Basic Components](https://github.com/samchon/framework/wiki/TypeScript-Protocol-Basic_Components#iserver)
+ * @author Jeongho Nam
+ *
+ *
+ * @see {@link DedicatedWorkerServer}, {@link DedicatedWorkerClientDriver}
+ * @handbook [Protocol - Basic Components](https://github.com/samchon/framework/wiki/TypeScript-Protocol-Basic_Components#iserverbase)
+ * @author Jeongho Nam
- *
+ *
+ * - {@link ServerBase}
+ * - {@link WebServerBase}
+ * - {@link SharedWorkerServerBase}
*
* @return A new {@link IServerBase} object.
*/
@@ -7811,14 +8233,14 @@ declare namespace samchon.templates.external {
* @param xml An {@link XML} object represents the child {@link ExternalSystem} object.
* @return null
*/
- createChild(xml: library.XML): ExternalSystem;
+ createChild(xml: library.XML): T;
/**
* Factory method creating a child {@link ExternalSystem} object.
*
* @param driver A communicator with connected client.
* @return A newly created {@link ExternalSystem} object.
*/
- protected abstract createExternalClient(driver: protocol.IClientDriver): ExternalSystem;
+ protected abstract createExternalClient(driver: protocol.IClientDriver): T;
/**
* @inheritdoc
*/
@@ -7921,7 +8343,7 @@ declare namespace samchon.templates.external {
*
* @param systemArray The parent {@link ExternalSystemArray} object.
*/
- constructor(systemArray: ExternalSystemArray);
+ constructor(systemArray: ExternalSystemArray
+ *
+ *
+ * @handbook [Templates - Parallel System](https://github.com/samchon/framework/wiki/TypeScript-Templates-Parallel_System),
+ * [Templates - Distributed System](https://github.com/samchon/framework/wiki/TypeScript-Templates-Distributed_System)
+ * @author Jeongho Nam Container properties
+ *
+ *
+ *
+ * @param
+ *
+ *
+ * @author Jeongho Nam
Construct from source and index number.
* @@ -5415,7 +5687,11 @@ declare namespace std { * @param map The source Set to reference. * @param index Sequence number of the element in the source Set. */ - constructor(source: base.SetContainerThey are very similar to forward_list: The main difference being that forward_list objects are single-linked - * lists, and thus they can only be iterated forwards, in exchange for being somewhat smaller and more efficient.
- * *Compared to other base standard sequence containers (array, vector and deque), lists perform generally better * in inserting, extracting and moving elements in any position within the container for which an iterator has already * been obtained, and therefore also in algorithms that make intensive use of these, like sorting algorithms.
@@ -9309,19 +9576,7 @@ declare namespace std { * @reference http://www.cplusplus.com/reference/list/list/ * @author Jeongho NamDefault Constructor.
* @@ -9365,6 +9620,7 @@ declare namespace std { * @param end Input interator of the final position in a sequence. */ constructor(begin: IteratorInsert an element.
* @@ -9537,18 +9757,6 @@ declare namespace std { * @return An iterator that points to the first of the newly inserted elements. */ insert>(position: ListReverseIteratorErase an element.
* @@ -9615,10 +9823,6 @@ declare namespace std { * This is the {@link rend rend()} if the operation erased the last element in the sequence. */ erase(begin: ListReverseIteratorRemove duplicate values.
* @@ -9889,25 +10093,14 @@ declare namespace std { * * @author Jeongho NamConstruct from the source {@link List container}.
+ * Initializer Constructor. * - *Do not create the iterator directly, by yourself.
- *Use {@link List.begin begin()}, {@link List.end end()} in {@link List container} instead.
+ * #### Note + * Do not create the iterator directly, by yourself. + * + * Use {@link List.begin begin()}, {@link List.end end()} in {@link List container} instead. * * @param source The source {@link List container} to reference. * @param prev A refenrece of previous node ({@link ListIterator iterator}). @@ -9915,7 +10108,6 @@ declare namespace std { * @param value Value to be stored in the node (iterator). */ constructor(source: List