From 16a035b82b70765a0bac3f685ab2b2add2c7dd6a Mon Sep 17 00:00:00 2001 From: 30secondsofcode <30secondsofcode@gmail.com> Date: Mon, 26 Feb 2018 12:04:41 +0000 Subject: [PATCH] Travis build: 1744 --- README.md | 6 +----- docs/index.html | 7 ++----- snippets/sortedLastIndex.md | 4 +--- 3 files changed, 4 insertions(+), 13 deletions(-) diff --git a/README.md b/README.md index 23e142d1f..80ff561a8 100644 --- a/README.md +++ b/README.md @@ -2312,16 +2312,12 @@ sortedIndexBy([{ x: 4 }, { x: 5 }], { x: 4 }, o => o.x); // 0 Returns the highest index at which value should be inserted into array in order to maintain its sort order. Check if the array is sorted in descending order (loosely). -Use `Array.map()` to map each element to an array with its index and value. Use `Array.reverse()` and `Array.findIndex()` to find the appropriate last index where the element should be inserted. ```js const sortedLastIndex = (arr, n) => { const isDescending = arr[0] > arr[arr.length - 1]; - const index = arr - .map((val, i) => [i, val]) - .reverse() - .findIndex(el => (isDescending ? n <= el[1] : n >= el[1])); + const index = arr.reverse().findIndex(el => (isDescending ? n <= el : n >= el)); return index === -1 ? 0 : arr.length - index - 1; }; ``` diff --git a/docs/index.html b/docs/index.html index 5de07cb15..6da1d2431 100644 --- a/docs/index.html +++ b/docs/index.html @@ -464,12 +464,9 @@ Object.assig return index === -1 ? arr.length : index; }; 
sortedIndexBy([{ x: 4 }, { x: 5 }], { x: 4 }, o => o.x); // 0
-

sortedLastIndex

Returns the highest index at which value should be inserted into array in order to maintain its sort order.

Check if the array is sorted in descending order (loosely). Use Array.map() to map each element to an array with its index and value. Use Array.reverse() and Array.findIndex() to find the appropriate last index where the element should be inserted.

const sortedLastIndex = (arr, n) => {
+

sortedLastIndex

Returns the highest index at which value should be inserted into array in order to maintain its sort order.

Check if the array is sorted in descending order (loosely). Use Array.reverse() and Array.findIndex() to find the appropriate last index where the element should be inserted.

const sortedLastIndex = (arr, n) => {
   const isDescending = arr[0] > arr[arr.length - 1];
-  const index = arr
-    .map((val, i) => [i, val])
-    .reverse()
-    .findIndex(el => (isDescending ? n <= el[1] : n >= el[1]));
+  const index = arr.reverse().findIndex(el => (isDescending ? n <= el : n >= el));
   return index === -1 ? 0 : arr.length - index - 1;
 };
 
sortedLastIndex([10, 20, 30, 30, 40], 30); // 3
diff --git a/snippets/sortedLastIndex.md b/snippets/sortedLastIndex.md
index 281f6c3d4..43ecefab5 100644
--- a/snippets/sortedLastIndex.md
+++ b/snippets/sortedLastIndex.md
@@ -8,9 +8,7 @@ Use `Array.reverse()` and `Array.findIndex()` to find the appropriate last index
 ```js
 const sortedLastIndex = (arr, n) => {
   const isDescending = arr[0] > arr[arr.length - 1];
-  const index = arr
-    .reverse()
-    .findIndex(el => (isDescending ? n <= el : n >= el));
+  const index = arr.reverse().findIndex(el => (isDescending ? n <= el : n >= el));
   return index === -1 ? 0 : arr.length - index - 1;
 };
 ```