mirror of
https://github.com/react/react-native-devtools-frontend.git
synced 2026-10-05 03:21:16 +08:00
Tim van der Lippe
6d109a9d45
This also adds Python-2.0 to the list of accepted licenses. Lastly, it fixes a bug where the package.json files were incorrectly reordered. For the `exports` of a particular package, the order that the entrypoints are defined in is crucial. Therefore, we should not alter the order of entrypoints and instead maintain the originally defined ordering. We can use an `OrderedDict` to ensure that Python always loads the JSON files in the same order. DISABLE_THIRD_PARTY_CHECK=NPM update R=jacktfranklin@chromium.org Bug: none Change-Id: I5a309782de6015edea6ba3b502aa0db1f008d973 Reviewed-on: https://chromium-review.googlesource.com/c/devtools/devtools-frontend/+/2692909 Auto-Submit: Tim van der Lippe <tvanderlippe@chromium.org> Reviewed-by: Jack Franklin <jacktfranklin@chromium.org> Commit-Queue: Tim van der Lippe <tvanderlippe@chromium.org>
uniq
Removes all duplicates from an array in place.
Usage
First install using npm:
npm install uniq
Then use it as follows:
var arr = [1, 1, 2, 2, 3, 5]
require("uniq")(arr)
console.log(arr)
//Prints:
//
// 1,2,3,5
//
require("uniq")(array[, compare, sorted])
Removes all duplicates from a sorted array in place.
arrayis the array to remove items fromcompareis an optional comparison function that returns 0 when two items are equal, and something non-zero when they are different. If unspecified, then the default equals will be used.sortedif true, then assume array is already sorted
Returns: A reference to array
Time Complexity: O(array.length * log(arra.length)) or O(array.length) if sorted
Why use this instead of underscore.uniq[ue]?
A few reasons:
- This library updates the array in place without making an extra copy (and so it is faster for large arrays)
- It also accepts a custom comparison function so you can remove duplicates from arrays containing object
- It is more modular in the sense that it doesn't come with a bazillion other utility grab bag functions.
Credits
(c) 2013 Mikola Lysenko. MIT License