bemoje Goto Github PK
Name: bemoje
Type: User
Blog: bemoje
Name: bemoje
Type: User
Blog: bemoje
Packaged version of Ace code editor
Blazing fast and lightweight autocomplete widget without dependencies. Only 1KB gzipped. Demo:
Takes an arguments-object and returns its values in an array.
Returns array of node-js commandline arguments
Check whether a condition is true for any element of an array. The condition check is in the form of a callback.
Sort array by bubbling up bigger values to the right side. Runtime: O(n^2)
Shallow clone of provided array, 'arr'.
Remove an element from an array if present.
Immnutably remove an element from an array if it is present.
Returns true if the predicate callback returns true for every element of the passed array; otherwise false.
Return the first element of an array where the callback returns true.
Flattens the passed array recursively.
Iterate an array in reverse.
Retrieve all elements in provided indexes array.
Returns true if the element exists in the array
Return the index of the first element of an array where the callback returns true. Returns -1 if none do.
Returns all indexes at which an element is found.
Sorting by insertion - Look for bigger numbers on the left side. Runtime: O(n^2). It starts from the 2nd element, and it tries to find any element (to the left) that could be bigger than the current index. It will move all the elements that are bigger and insert the current element where it belongs.
Determine whether an array is empty
Return the last element of an array where the callback returns true.
Linear-time Partitioning. Runtime: O(n). Chooses a pivot and re-arrages the array so that everything on the left is <= pivot and everything on the right is > pivot
Efficient in-place recursive sorting algorithm of numeric values. Avg. Runtime: O(n log n) | Worst: O(n^2)
Selection sort array
Shuffle items in an array in-place. Runtime: O(n)
Sort an array considerably faster than the native Array.prototype.sort as a drop-in replacement. Fork of of the famous timsort module, but this module allows for passing comparator-builder options instead of a comparator function. In short, advanced comparators made easy. Timsort: https://www.npmjs.com/package/timsort
Create array comparator function.
For a sorted array, add an element. Whichever comparator function was used to sort the array, can be passed. Also supports comparator-builder options. For reference, see: https://github.com/bemoje/bemoje-arr-sort-comparator
Binary search -based indexOf for sorted arrays.
Binary search -based indexOf for sorted arrays.
Find all indexes at which an array element exists, by binary search.
A declarative, efficient, and flexible JavaScript library for building user interfaces.
🖖 Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.
TypeScript is a superset of JavaScript that compiles to clean JavaScript output.
An Open Source Machine Learning Framework for Everyone
The Web framework for perfectionists with deadlines.
A PHP framework for web artisans
Bring data to life with SVG, Canvas and HTML. 📊📈🎉
JavaScript (JS) is a lightweight interpreted programming language with first-class functions.
Some thing interesting about web. New door for the world.
A server is a program made to process requests and deliver data to clients.
Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.
Some thing interesting about visualization, use data art
Some thing interesting about game, make everyone happy.
We are working to build community through open source technology. NB: members must have two-factor auth.
Open source projects and samples from Microsoft.
Google ❤️ Open Source for everyone.
Alibaba Open Source for everyone
Data-Driven Documents codes.
China tencent open source team.