Fix list item style and indentation

Planeshifter · Planeshifter · commit 0cc85da2ff65 · 2018-01-05T12:57:41.000+01:00
diff --git a/lib/node_modules/@stdlib/utils/append/lib/append_typed_array.js b/lib/node_modules/@stdlib/utils/append/lib/append_typed_array.js
@@ -13,8 +13,8 @@ var ceil2 = require( '@stdlib/math/base/special/ceil2' ); // TODO: nextpow2
 *
 * ## Notes
 *
-* * If the underlying `ArrayBuffer` is too short, we need to copy the data to a new `ArrayBuffer`. To do so, we allocate a new `ArrayBuffer` in a manner similar to how `Arrays` are resized (i.e., allocate enough memory to hold `nextpow2(n)` elements).
-* * Beware that, if an ArrayBuffer view is followed by one or more other views, the created view may contain elements from those views, thus resulting in possible mutation. Accordingly, providing a typed array view having a shared underlying `ArrayBuffer` may have unintended consequences (including security vulnerabilities).
+* -   If the underlying `ArrayBuffer` is too short, we need to copy the data to a new `ArrayBuffer`. To do so, we allocate a new `ArrayBuffer` in a manner similar to how `Arrays` are resized (i.e., allocate enough memory to hold `nextpow2(n)` elements).
+* -   Beware that, if an ArrayBuffer view is followed by one or more other views, the created view may contain elements from those views, thus resulting in possible mutation. Accordingly, providing a typed array view having a shared underlying `ArrayBuffer` may have unintended consequences (including security vulnerabilities).
 *
 * @private
 * @param {TypedArray} arr - input array
diff --git a/lib/node_modules/@stdlib/utils/bifurcate-by/lib/return_pairs.js b/lib/node_modules/@stdlib/utils/bifurcate-by/lib/return_pairs.js
@@ -7,7 +7,7 @@
 *
 * ## Notes
 *
-* * We need to cache the collection value to prevent the edge case where, during the invocation of the predicate function, the element at index `i` is swapped for some other value. For some, that might be a feature; here, we take the stance that one should be less clever.
+* -   We need to cache the collection value to prevent the edge case where, during the invocation of the predicate function, the element at index `i` is swapped for some other value. For some, that might be a feature; here, we take the stance that one should be less clever.
 *
 *
 * @private
diff --git a/lib/node_modules/@stdlib/utils/every-by-right/lib/every_by_right.js b/lib/node_modules/@stdlib/utils/every-by-right/lib/every_by_right.js
@@ -13,7 +13,7 @@ var isFunction = require( '@stdlib/assert/is-function' );
 *
 * ## Notes
 *
-* * For dynamic array resizing, the only behavior made intentionally consistent with `every` (iterating from left to right) is when elements are pushed onto the beginning (end) of an array. In other words, for `every()`, `[].push()` behavior is consistent with `everyByRight()` `[].unshift()` behavior.
+* -   For dynamic array resizing, the only behavior made intentionally consistent with `every` (iterating from left to right) is when elements are pushed onto the beginning (end) of an array. In other words, for `every()`, `[].push()` behavior is consistent with `everyByRight()` `[].unshift()` behavior.
 *
 * @param {Collection} collection - input collection
 * @param {Function} predicate - test function
diff --git a/lib/node_modules/@stdlib/utils/for-each-right/lib/for_each_right.js b/lib/node_modules/@stdlib/utils/for-each-right/lib/for_each_right.js
@@ -13,7 +13,7 @@ var isFunction = require( '@stdlib/assert/is-function' );
 *
 * ## Notes
 *
-* * For dynamic array resizing, the only behavior made intentionally consistent with `forEach` (iterating from left to right) is when elements are pushed onto the beginning (end) of an array. In other words, for `forEach()`, `[].push()` behavior is consistent with `forEachRight()` `[].unshift()` behavior.
+* -   For dynamic array resizing, the only behavior made intentionally consistent with `forEach` (iterating from left to right) is when elements are pushed onto the beginning (end) of an array. In other words, for `forEach()`, `[].push()` behavior is consistent with `forEachRight()` `[].unshift()` behavior.
 *
 *
 * @param {Collection} collection - input collection
diff --git a/lib/node_modules/@stdlib/utils/group-by/lib/return_indices.js b/lib/node_modules/@stdlib/utils/group-by/lib/return_indices.js
@@ -12,7 +12,7 @@ var hasOwnProp = require( '@stdlib/assert/has-own-property' );
 *
 * ## Notes
 *
-* * Checking for an "own" property is necessary to guard against the edge case where an indicator function returns a group identifier which matches a method or property on the `Object` prototype.
+* -   Checking for an "own" property is necessary to guard against the edge case where an indicator function returns a group identifier which matches a method or property on the `Object` prototype.
 *
 *
 * @private
diff --git a/lib/node_modules/@stdlib/utils/group-by/lib/return_pairs.js b/lib/node_modules/@stdlib/utils/group-by/lib/return_pairs.js
@@ -12,8 +12,8 @@ var hasOwnProp = require( '@stdlib/assert/has-own-property' );
 *
 * ## Notes
 *
-* * We need to cache the collection value to prevent the edge case where, during the invocation of the indicator function, the element at index `i` is swapped for some other value. For some, that might be a feature; here, we take the stance that one should be less clever.
-* * Checking for an "own" property is necessary to guard against the edge case where an indicator function returns a group identifier which matches a method or property on the `Object` prototype.
+* -   We need to cache the collection value to prevent the edge case where, during the invocation of the indicator function, the element at index `i` is swapped for some other value. For some, that might be a feature; here, we take the stance that one should be less clever.
+* -   Checking for an "own" property is necessary to guard against the edge case where an indicator function returns a group identifier which matches a method or property on the `Object` prototype.
 *
 *
 * @private
diff --git a/lib/node_modules/@stdlib/utils/group-by/lib/return_values.js b/lib/node_modules/@stdlib/utils/group-by/lib/return_values.js
@@ -12,8 +12,8 @@ var hasOwnProp = require( '@stdlib/assert/has-own-property' );
 *
 * ## Notes
 *
-* * We need to cache the collection value to prevent the edge case where, during the invocation of the indicator function, the element at index `i` is swapped for some other value. For some, that might be a feature; here, we take the stance that one should be less clever.
-* * Checking for an "own" property is necessary to guard against the edge case where an indicator function returns a group identifier which matches a method or property on the `Object` prototype.
+* -   We need to cache the collection value to prevent the edge case where, during the invocation of the indicator function, the element at index `i` is swapped for some other value. For some, that might be a feature; here, we take the stance that one should be less clever.
+* -   Checking for an "own" property is necessary to guard against the edge case where an indicator function returns a group identifier which matches a method or property on the `Object` prototype.
 *
 *
 * @private
diff --git a/lib/node_modules/@stdlib/utils/group-in/lib/return_pairs.js b/lib/node_modules/@stdlib/utils/group-in/lib/return_pairs.js
@@ -12,7 +12,7 @@ var hasOwnProp = require( '@stdlib/assert/has-own-property' );
 *
 * ## Notes
 *
-* * We need to cache the object value to prevent the edge case where, during the invocation of the indicator function, the value at key `k` is swapped for some other value. For some, that might be a feature; here, we take the stance that one should be less clever.
+* -   We need to cache the object value to prevent the edge case where, during the invocation of the indicator function, the value at key `k` is swapped for some other value. For some, that might be a feature; here, we take the stance that one should be less clever.
 *
 *
 * @private
diff --git a/lib/node_modules/@stdlib/utils/group-in/lib/return_values.js b/lib/node_modules/@stdlib/utils/group-in/lib/return_values.js
@@ -12,7 +12,7 @@ var hasOwnProp = require( '@stdlib/assert/has-own-property' );
 *
 * ## Notes
 *
-* * We need to cache the object value to prevent the edge case where, during the invocation of the indicator function, the value at key `k` is swapped for some other value. For some, that might be a feature; here, we take the stance that one should be less clever.
+* -   We need to cache the object value to prevent the edge case where, during the invocation of the indicator function, the value at key `k` is swapped for some other value. For some, that might be a feature; here, we take the stance that one should be less clever.
 *
 *
 * @private
diff --git a/lib/node_modules/@stdlib/utils/group-own/lib/return_pairs.js b/lib/node_modules/@stdlib/utils/group-own/lib/return_pairs.js
@@ -12,7 +12,7 @@ var hasOwnProp = require( '@stdlib/assert/has-own-property' );
 *
 * ## Notes
 *
-* * We need to cache the object value to prevent the edge case where, during the invocation of the indicator function, the value at key `k` is swapped for some other value. For some, that might be a feature; here, we take the stance that one should be less clever.
+* -   We need to cache the object value to prevent the edge case where, during the invocation of the indicator function, the value at key `k` is swapped for some other value. For some, that might be a feature; here, we take the stance that one should be less clever.
 *
 *
 * @private
diff --git a/lib/node_modules/@stdlib/utils/group-own/lib/return_values.js b/lib/node_modules/@stdlib/utils/group-own/lib/return_values.js
@@ -12,7 +12,7 @@ var hasOwnProp = require( '@stdlib/assert/has-own-property' );
 *
 * ## Notes
 *
-* * We need to cache the object value to prevent the edge case where, during the invocation of the indicator function, the value at key `k` is swapped for some other value. For some, that might be a feature; here, we take the stance that one should be less clever.
+* -   We need to cache the object value to prevent the edge case where, during the invocation of the indicator function, the value at key `k` is swapped for some other value. For some, that might be a feature; here, we take the stance that one should be less clever.
 *
 *
 * @private
diff --git a/lib/node_modules/@stdlib/utils/group/lib/return_indices.js b/lib/node_modules/@stdlib/utils/group/lib/return_indices.js
@@ -12,7 +12,7 @@ var hasOwnProp = require( '@stdlib/assert/has-own-property' );
 *
 * ## Notes
 *
-* * Checking for an "own" property is necessary to guard against the edge case where a group identifier which matches a method or property on the `Object` prototype.
+* -   Checking for an "own" property is necessary to guard against the edge case where a group identifier which matches a method or property on the `Object` prototype.
 *
 *
 * @private
diff --git a/lib/node_modules/@stdlib/utils/group/lib/return_pairs.js b/lib/node_modules/@stdlib/utils/group/lib/return_pairs.js
@@ -12,7 +12,7 @@ var hasOwnProp = require( '@stdlib/assert/has-own-property' );
 *
 * ## Notes
 *
-* * Checking for an "own" property is necessary to guard against the edge case where a group identifier which matches a method or property on the `Object` prototype.
+* -   Checking for an "own" property is necessary to guard against the edge case where a group identifier which matches a method or property on the `Object` prototype.
 *
 *
 * @private
diff --git a/lib/node_modules/@stdlib/utils/group/lib/return_values.js b/lib/node_modules/@stdlib/utils/group/lib/return_values.js
@@ -12,7 +12,7 @@ var hasOwnProp = require( '@stdlib/assert/has-own-property' );
 *
 * ## Notes
 *
-* * Checking for an "own" property is necessary to guard against the edge case where a group identifier which matches a method or property on the `Object` prototype.
+* -   Checking for an "own" property is necessary to guard against the edge case where a group identifier which matches a method or property on the `Object` prototype.
 *
 *
 * @private

Original file line number	Diff line number	Diff line change
`@@ -13,8 +13,8 @@ var ceil2 = require( '@stdlib/math/base/special/ceil2' ); // TODO: nextpow2`
`13`	`13`	`*`
`14`	`14`	`* ## Notes`
`15`	`15`	`*`
`16`		-* * If the underlying `ArrayBuffer` is too short, we need to copy the data to a new `ArrayBuffer`. To do so, we allocate a new `ArrayBuffer` in a manner similar to how `Arrays` are resized (i.e., allocate enough memory to hold `nextpow2(n)` elements).
`17`		-* * Beware that, if an ArrayBuffer view is followed by one or more other views, the created view may contain elements from those views, thus resulting in possible mutation. Accordingly, providing a typed array view having a shared underlying `ArrayBuffer` may have unintended consequences (including security vulnerabilities).
	`16`	+* - If the underlying `ArrayBuffer` is too short, we need to copy the data to a new `ArrayBuffer`. To do so, we allocate a new `ArrayBuffer` in a manner similar to how `Arrays` are resized (i.e., allocate enough memory to hold `nextpow2(n)` elements).
	`17`	+* - Beware that, if an ArrayBuffer view is followed by one or more other views, the created view may contain elements from those views, thus resulting in possible mutation. Accordingly, providing a typed array view having a shared underlying `ArrayBuffer` may have unintended consequences (including security vulnerabilities).
`18`	`18`	`*`
`19`	`19`	`* @private`
`20`	`20`	`* @param {TypedArray} arr - input array`
Original file line number	Diff line number	Diff line change
`@@ -7,7 +7,7 @@`
`7`	`7`	`*`
`8`	`8`	`* ## Notes`
`9`	`9`	`*`
`10`		-* * We need to cache the collection value to prevent the edge case where, during the invocation of the predicate function, the element at index `i` is swapped for some other value. For some, that might be a feature; here, we take the stance that one should be less clever.
	`10`	+* - We need to cache the collection value to prevent the edge case where, during the invocation of the predicate function, the element at index `i` is swapped for some other value. For some, that might be a feature; here, we take the stance that one should be less clever.
`11`	`11`	`*`
`12`	`12`	`*`
`13`	`13`	`* @private`
Original file line number	Diff line number	Diff line change
`@@ -13,7 +13,7 @@ var isFunction = require( '@stdlib/assert/is-function' );`
`13`	`13`	`*`
`14`	`14`	`* ## Notes`
`15`	`15`	`*`
`16`		-* * For dynamic array resizing, the only behavior made intentionally consistent with `every` (iterating from left to right) is when elements are pushed onto the beginning (end) of an array. In other words, for `every()`, `[].push()` behavior is consistent with `everyByRight()` `[].unshift()` behavior.
	`16`	+* - For dynamic array resizing, the only behavior made intentionally consistent with `every` (iterating from left to right) is when elements are pushed onto the beginning (end) of an array. In other words, for `every()`, `[].push()` behavior is consistent with `everyByRight()` `[].unshift()` behavior.
`17`	`17`	`*`
`18`	`18`	`* @param {Collection} collection - input collection`
`19`	`19`	`* @param {Function} predicate - test function`
Original file line number	Diff line number	Diff line change
`@@ -12,7 +12,7 @@ var hasOwnProp = require( '@stdlib/assert/has-own-property' );`
`12`	`12`	`*`
`13`	`13`	`* ## Notes`
`14`	`14`	`*`
`15`		-* * Checking for an "own" property is necessary to guard against the edge case where an indicator function returns a group identifier which matches a method or property on the `Object` prototype.
	`15`	+* - Checking for an "own" property is necessary to guard against the edge case where an indicator function returns a group identifier which matches a method or property on the `Object` prototype.
`16`	`16`	`*`
`17`	`17`	`*`
`18`	`18`	`* @private`
Original file line number	Diff line number	Diff line change
`@@ -12,8 +12,8 @@ var hasOwnProp = require( '@stdlib/assert/has-own-property' );`
`12`	`12`	`*`
`13`	`13`	`* ## Notes`
`14`	`14`	`*`
`15`		-* * We need to cache the collection value to prevent the edge case where, during the invocation of the indicator function, the element at index `i` is swapped for some other value. For some, that might be a feature; here, we take the stance that one should be less clever.
`16`		-* * Checking for an "own" property is necessary to guard against the edge case where an indicator function returns a group identifier which matches a method or property on the `Object` prototype.
	`15`	+* - We need to cache the collection value to prevent the edge case where, during the invocation of the indicator function, the element at index `i` is swapped for some other value. For some, that might be a feature; here, we take the stance that one should be less clever.
	`16`	+* - Checking for an "own" property is necessary to guard against the edge case where an indicator function returns a group identifier which matches a method or property on the `Object` prototype.
`17`	`17`	`*`
`18`	`18`	`*`
`19`	`19`	`* @private`