Merge pull request #117 from 8471919/fix/typo

Fix the typo from iteartor to iterator

Author: samchon

src/algorithm/heap.ts

@@ -23,7 +23,7 @@ import { advance, distance } from "../iterator/global";
 /**
  * Make a heap.
  *
- * @param first Random access iteartor of the first position.
+ * @param first Random access iterator of the first position.
  * @param last Random access 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*. Default is {@link less}.
  */
@@ -54,7 +54,7 @@ export function make_heap<
 /**
  * Push an element into heap.
  *
- * @param first Random access iteartor of the first position.
+ * @param first Random access iterator of the first position.
  * @param last Random access 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*. Default is {@link less}.
  */
@@ -77,7 +77,7 @@ export function push_heap<
 /**
  * Pop an element from heap.
  *
- * @param first Random access iteartor of the first position.
+ * @param first Random access iterator of the first position.
  * @param last Random access 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*. Default is {@link less}.
  */
@@ -106,7 +106,7 @@ export function pop_heap<
 /**
  * Test whether a range is heap.
  *
- * @param first Bi-directional iteartor of the first position.
+ * @param first Bi-directional iterator of the first position.
  * @param last Bi-directional 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*. Default is {@link less}.
  *
@@ -131,7 +131,7 @@ export function is_heap<
 /**
  * Find the first element not in heap order.
  *
- * @param first Bi-directional iteartor of the first position.
+ * @param first Bi-directional iterator of the first position.
  * @param last Bi-directional 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*. Default is {@link less}.
  *
@@ -164,7 +164,7 @@ export function is_heap_until<
 /**
  * Sort elements of a heap.
  *
- * @param first Random access iteartor of the first position.
+ * @param first Random access iterator of the first position.
  * @param last Random access 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*. Default is {@link less}.
  */

src/algorithm/iterations.ts

@@ -25,7 +25,7 @@ import { Pair } from "../utility/Pair";
 /**
  * Apply a function to elements in range.
  *
- * @param first Input iteartor of the first position.
+ * @param first Input iterator of the first position.
  * @param last Input iterator of the last position.
  * @param fn The function to apply.
  *
@@ -45,7 +45,7 @@ export function for_each<
 /**
  * Apply a function to elements in steps.
  *
- * @param first Input iteartor of the starting position.
+ * @param first Input iterator of the starting position.
  * @param n Steps to maximum advance.
  * @param fn The function to apply.
  *
@@ -70,7 +70,7 @@ export function for_each_n<
 /**
  * Test whether all elements meet a specific condition.
  *
- * @param first Input iteartor of the first position.
+ * @param first Input iterator of the first position.
  * @param last Input iterator of the last position.
  * @param pred A function predicates the specific condition.
  *
@@ -94,7 +94,7 @@ export function all_of<
 /**
  * Test whether any element meets a specific condition.
  *
- * @param first Input iteartor of the first position.
+ * @param first Input iterator of the first position.
  * @param last Input iterator of the last position.
  * @param pred A function predicates the specific condition.
  *
@@ -118,7 +118,7 @@ export function any_of<
 /**
  * Test whether any element doesn't meet a specific condition.
  *
- * @param first Input iteartor of the first position.
+ * @param first Input iterator of the first position.
  * @param last Input iterator of the last position.
  * @param pred A function predicates the specific condition.
  *
@@ -139,7 +139,7 @@ export function none_of<
 /**
  * Test whether two ranges are equal.
  *
- * @param first1 Input iteartor of the first position of the 1st range.
+ * @param first1 Input iterator of the first position of the 1st range.
  * @param last1 Input iterator of the last position of the 1st range.
  * @param first2 Input iterator of the first position of the 2nd range.
  * @param pred A binary function predicates two arguments are equal.
@@ -162,7 +162,7 @@ export function equal<
 /**
  * Test whether two ranges are equal.
  *
- * @param first1 Input iteartor of the first position of the 1st range.
+ * @param first1 Input iterator of the first position of the 1st range.
  * @param last1 Input iterator of the last position of the 1st range.
  * @param first2 Input iterator of the first position of the 2nd range.
  * @param pred A binary function predicates two arguments are equal.
@@ -214,7 +214,7 @@ export function equal<
 /**
  * Compare lexicographically.
  *
- * @param first1 Input iteartor of the first position of the 1st range.
+ * @param first1 Input iterator of the first position of the 1st range.
  * @param last1 Input iterator of the last position of the 1st range.
  * @param first2 Input iterator of the first position of the 2nd range.
  * @param last2 Input iterator of the last position of the 2nd range.
@@ -253,7 +253,7 @@ export function lexicographical_compare<
 /**
  * Find a value in range.
  *
- * @param first Input iteartor of the first position.
+ * @param first Input iterator of the first position.
  * @param last Input iterator of the last position.
  * @param val The value to find.
  *
@@ -274,7 +274,7 @@ export function find<
 /**
  * Find a matched condition in range.
  *
- * @param first Input iteartor of the first position.
+ * @param first Input iterator of the first position.
  * @param last Input iterator of the last position.
  * @param pred A function predicates the specific condition.
  *
@@ -298,7 +298,7 @@ export function find_if<
 /**
  * Find a mismatched condition in range.
  *
- * @param first Input iteartor of the first position.
+ * @param first Input iterator of the first position.
  * @param last Input iterator of the last position.
  * @param pred A function predicates the specific condition.
  *
@@ -319,7 +319,7 @@ export function find_if_not<
 /**
  * Find the last sub range.
  *
- * @param first1 Input iteartor of the first position of the 1st range.
+ * @param first1 Input iterator of the first position of the 1st range.
  * @param last1 Input iterator of the last position of the 1st range.
  * @param first2 Input iterator of the first position of the 2nd range.
  * @param last2 Input iterator of the last position of the 2nd range.
@@ -343,7 +343,7 @@ export function find_end<
 /**
  * Find the last sub range.
  *
- * @param first1 Input iteartor of the first position of the 1st range.
+ * @param first1 Input iterator of the first position of the 1st range.
  * @param last1 Input iterator of the last position of the 1st range.
  * @param first2 Input iterator of the first position of the 2nd range.
  * @param last2 Input iterator of the last position of the 2nd range.
@@ -409,7 +409,7 @@ export function find_end<
 /**
  * Find the first sub range.
  *
- * @param first1 Input iteartor of the first position of the 1st range.
+ * @param first1 Input iterator of the first position of the 1st range.
  * @param last1 Input iterator of the last position of the 1st range.
  * @param first2 Input iterator of the first position of the 2nd range.
  * @param last2 Input iterator of the last position of the 2nd range.
@@ -433,7 +433,7 @@ export function find_first_of<
 /**
  * Find the first sub range.
  *
- * @param first1 Input iteartor of the first position of the 1st range.
+ * @param first1 Input iterator of the first position of the 1st range.
  * @param last1 Input iterator of the last position of the 1st range.
  * @param first2 Input iterator of the first position of the 2nd range.
  * @param last2 Input iterator of the last position of the 2nd range.
@@ -486,7 +486,7 @@ export function find_first_of<
 /**
  * Find the first adjacent element.
  *
- * @param first Input iteartor of the first position.
+ * @param first Input iterator of the first position.
  * @param last Input iterator of the last position.
  * @param pred A binary function predicates two arguments are equal. Default is {@link equal_to}.
  *
@@ -517,7 +517,7 @@ export function adjacent_find<
 /**
  * Search sub range.
  *
- * @param first1 Forward iteartor of the first position of the 1st range.
+ * @param first1 Forward iterator of the first position of the 1st range.
  * @param last1 Forward iterator of the last position of the 1st range.
  * @param first2 Forward iterator of the first position of the 2nd range.
  * @param last2 Forward iterator of the last position of the 2nd range.
@@ -541,7 +541,7 @@ export function search<
 /**
  * Search sub range.
  *
- * @param first1 Forward iteartor of the first position of the 1st range.
+ * @param first1 Forward iterator of the first position of the 1st range.
  * @param last1 Forward iterator of the last position of the 1st range.
  * @param first2 Forward iterator of the first position of the 2nd range.
  * @param last2 Forward iterator of the last position of the 2nd range.
@@ -604,7 +604,7 @@ export function search<
 /**
  * Search specific and repeated elements.
  *
- * @param first Forward iteartor of the first position.
+ * @param first Forward iterator of the first position.
  * @param last Forward iterator of the last position.
  * @param count Count to be repeated.
  * @param val Value to search.
@@ -641,7 +641,7 @@ export function search_n<
 /**
  * Find the first mistmached position between two ranges.
  *
- * @param first1 Input iteartor of the first position of the 1st range.
+ * @param first1 Input iterator of the first position of the 1st range.
  * @param last1 Input iterator of the last position of the 1st range.
  * @param first2 Input iterator of the first position of the 2nd range.
  *
@@ -663,7 +663,7 @@ export function mismatch<
 /**
  * Find the first mistmached position between two ranges.
  *
- * @param first1 Input iteartor of the first position of the 1st range.
+ * @param first1 Input iterator of the first position of the 1st range.
  * @param last1 Input iterator of the last position of the 1st range.
  * @param first2 Input iterator of the first position of the 2nd range.
  * @param pred A binary function predicates two arguments are equal.
@@ -716,7 +716,7 @@ export function mismatch<
 /**
  * Count matched value in range.
  *
- * @param first Input iteartor of the first position.
+ * @param first Input iterator of the first position.
  * @param last Input iterator of the last position.
  * @param val The value to count.
  *
@@ -737,7 +737,7 @@ export function count<
 /**
  * Count matched condition in range.
  *
- * @param first Input iteartor of the first position.
+ * @param first Input iterator of the first position.
  * @param last Input iterator of the last position.
  * @param pred A function predicates the specific condition.
  *

src/algorithm/mathematics.ts

@@ -184,7 +184,7 @@ export function clamp<T>(v: T, lo: T, hi: T, comp: Comparator<T> = less): T {
 /**
  * Test whether two ranges are in permutation relationship.
  *
- * @param first1 Forward iteartor of the first position of the 1st range.
+ * @param first1 Forward iterator of the first position of the 1st range.
  * @param last1 Forward iterator of the last position of the 1st range.
  * @param first2 Forward iterator of the first position of the 2nd range.
  * @param pred A binary function predicates two arguments are equal. Default is {@link equal_to}.

src/algorithm/merge.ts

@@ -27,7 +27,7 @@ import { copy } from "./modifiers";
 /**
  * Merge two sorted ranges.
  *
- * @param first1 Input iteartor of the first position of the 1st range.
+ * @param first1 Input iterator of the first position of the 1st range.
  * @param last1 Input iterator of the last position of the 1st range.
  * @param first2 Input iterator of the first position of the 2nd range.
  * @param last2 Input iterator of the last position of the 2nd range.
@@ -103,7 +103,7 @@ export function inplace_merge<
 /**
  * Test whether two sorted ranges are in inclusion relationship.
  *
- * @param first1 Input iteartor of the first position of the 1st range.
+ * @param first1 Input iterator of the first position of the 1st range.
  * @param last1 Input iterator of the last position of the 1st range.
  * @param first2 Input iterator of the first position of the 2nd range.
  * @param last2 Input iterator of the last position of the 2nd range.
@@ -138,7 +138,7 @@ export function includes<
 /**
  * Combine two sorted ranges to union relationship.
  *
- * @param first1 Input iteartor of the first position of the 1st range.
+ * @param first1 Input iterator of the first position of the 1st range.
  * @param last1 Input iterator of the last position of the 1st range.
  * @param first2 Input iterator of the first position of the 2nd range.
  * @param last2 Input iterator of the last position of the 2nd range.
@@ -190,7 +190,7 @@ export function set_union<
 /**
  * Combine two sorted ranges to intersection relationship.
  *
- * @param first1 Input iteartor of the first position of the 1st range.
+ * @param first1 Input iterator of the first position of the 1st range.
  * @param last1 Input iterator of the last position of the 1st range.
  * @param first2 Input iterator of the first position of the 2nd range.
  * @param last2 Input iterator of the last position of the 2nd range.
@@ -233,7 +233,7 @@ export function set_intersection<
 /**
  * Combine two sorted ranges to difference relationship.
  *
- * @param first1 Input iteartor of the first position of the 1st range.
+ * @param first1 Input iterator of the first position of the 1st range.
  * @param last1 Input iterator of the last position of the 1st range.
  * @param first2 Input iterator of the first position of the 2nd range.
  * @param last2 Input iterator of the last position of the 2nd range.
@@ -277,7 +277,7 @@ export function set_difference<
 /**
  * Combine two sorted ranges to symmetric difference relationship.
  *
- * @param first1 Input iteartor of the first position of the 1st range.
+ * @param first1 Input iterator of the first position of the 1st range.
  * @param last1 Input iterator of the last position of the 1st range.
  * @param first2 Input iterator of the first position of the 2nd range.
  * @param last2 Input iterator of the last position of the 2nd range.