Provides tree collection template
Angular Schematics - Library
Utility data structure used in discord.js
TypeScript definitions for d3-collection
Which kind of Collection (Map, Set, WeakMap, WeakSet) is this JavaScript value? Works cross-realm, without `instanceof`, and despite Symbol.toStringTag.
This is an internal utility, not intended for public usage.
Turn any collection of objects into its own efficient tree or linked list using Symbol
Microsoft Application Insights JavaScript SDK Channel
TypeScript definitions for postman-collection
Syncs an entire TREE collection, but only emits the objects, does not store them.
TypeScript definitions for google.analytics
Microsoft Application Insights properties (Part A) plugin
Microsoft Application Insights JavaScript SDK - Web Analytics
Curated addons to bring out the best of Storybook
Visit a method over the items in an object, or map visit over the objects in an array.
Microsoft Application Insights JavaScript SDK - Web Basic
TypeScript definitions for pluralize
Highmaps Map Collection
Enables developers to use a unified Postman Collection format Object across projects
Common functions used across Polkadot, derived from RPC calls and storage queries.
Angular Schematics - CLI
Opinionated collection of common JavaScript / TypeScript utils by @antfu
The primary functions of the world state package are to maintain the collection of Merkle Trees comprising the global state of the system and to offer an interface with which the trees can be queried.
Expressive query building for MongoDB
Name reservation – Project will feature a collection of dependency-free pure rust implementations of tree varaints, such as AVL Tree, TTree and B+ Tree.
Immutable collections, schema hooks, and federated search for hashtree
A collection for tree data structures. It provides APIs that allows users to create memory efficient binary search trees, red-black trees and avl trees.
A RBTree is a sorted associative collection that is implemented with a Red-Black Tree. It maps keys to values like a Hash, but maintains its elements in ascending key order. The interface is the almost identical to that of Hash. This is a fork of the original gem that fixes various bugs on Ruby 2.3+.
A simple collection class to aggregate tree objects. It takes [Adjacency List](http://sqlsummit.com/AdjacencyList.htm) as input, shows some stats and the top x biggest trees.
Collect metadata on a directory tree of music files
Mirror your ebooks directory tree into kindle collections
A RBTree is a sorted associative collection that is implemented with a Red-Black Tree. It maps keys to values like a Hash, but maintains its elements in ascending key order. The interface is the almost identical to that of Hash.
A collection of containers: heap, sorted array, AVL tree
A Guilded (http://github.com/midas/guilded/tree/master) Rails component that generates a rich grid control from an ActiveRecord collection.
RubyTree is a Ruby implementation of the generic tree data structure. It provides simple APIs to store named nodes, and to access, modify, and traverse the tree. The data model is node-centric, where nodes in the tree are the primary structural elements. It supports all common tree-traversal methods (pre-order, post-order, and breadth first). RubyTree mixes in the Enumerable and Comparable modules and behaves like a standard Ruby collection (iteration, comparison, etc.). RubyTree also includes a binary tree implementation, which provides in-order node traversal besides the other methods. RubyTree can import from and export to JSON, and supports Ruby’s object marshaling.
This is a collection of extensions to Rails internals that I've found to be absolutely indispensible since I implimented them. The real action is happening in the following two files at the moment: http://github.com/brendan/entrails/tree/master/lib/entrails/active_record/better_conditions.rb http://github.com/brendan/entrails/tree/master/lib/entrails/active_record/find_by_association.rb
A self-balancing binary tree optimised for fast access to frequently used nodes. Useful for implementing caches and garbage collection algorithms.
RBTree is a sorted associative collection that is implemented with Red-Black Tree. The elements of RBTree are ordered and its interface is the almost same as Hash, so simply you can consider RBTree sorted Hash.
CollectionUtils provide with basic collection templates like stack(push, pop, peek), queues(enqueue, dequeue), heaps/tree(MinHeap, MaxHeap, BST) and HashDeserializedObject(Converts a hash into object for easy access. All the keys will become attributes of the object). Check out the wiki at https://github.com/deeshugupta/collection_utils/wiki
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.