Search Results for "sorted list"

List all available Node.js versions. Sorted from the most to the least recent. Includes major release and LTS information. This package is an ES module and must be loaded using an import or import() statement, not require(). The return value resolves to an object with the following properties. List of available Node.js versions and related information. Sorted from the most to the least recent Node.js version. List of Node.js major releases sorted from the most to the least recent.

It aims at increasing the discoverability of useful forks of open-source projects. Simply type a repository's URL in the Text Field. The criteria is simple: if a fork was created, but never received any other activity on its master branch, it is filtered out. Adding a sorted list of starred forks to the GitHub forks page. Results are filtered out if there were never any commits pushed on the main branch since the fork was created. This is meant to help increase the discoverability of useful...

Marionette simplifies your Backbone application code with robust views and architecture solutions. Organize your app in terms of small Views. Marionette makes it easy to compose rich layouts out of small components. Show a sorted filtered list without breaking a sweat. Have a massive collection? Want to add or remove an item? No worries! Learn to love the details. We've added tons of features from templateHelpers, to a declarative UI hash, that will keep you from ever wanting to go back. Share...

... license is required. Most commonly, MixItUp is applied to a "container" of "target" elements, which could be a portfolio of projects, a list of blog posts, a selection of products, or any kind of UI where filtering and/or sorting would be advantageous. Targets can be filtered using any valid selector e.g. '.category-a', and are sorted via optional custom data attributes e.g. 'data-order'.

A complete fully tested and documented data structure library written in pure JavaScript. Buckets also includes several functions for manipulating arrays. A bag is a special kind of set in which members are allowed to appear more than once. Binary search trees keep their elements in sorted order, so that lookup and other operations can use the principle of binary search. Dictionaries map keys to values, each key can map to at most one value. A heap is a binary tree that maintains the heap...