Koloboke aims to replace the standard Java collections and streams with more efficient implementations. The current version of Koloboke focuses on replacing java.util.HashSet and java.util.HashMap. It provides a complete set of primitive type implementations for each collection. Its able to avoid the expensive boxing/unboxing of primitives and saves memory for boxed primitive objects. It is the fastest and the most memory efficient library implementing hash maps and sets.
collections java-collection collections-library hashmap set list mapImplementation of various data structures and algorithms in Go.Containers are either ordered or unordered. All ordered containers provide stateful iterators and some of them allow enumerable functions.
data-structure map tree set list stack iterator enumerable sort avl-tree red-black-tree b-tree binary-heap collections go-collectionGo-datastructures is a collection of useful, performant, and threadsafe Go datastructures.Interval tree for collision in n-dimensional ranges. Implemented via a red-black augmented tree. Extra dimensions are handled in simultaneous inserts/queries to save space although this may result in suboptimal time complexity. Intersection determined using bit arrays. In a single dimension, inserts, deletes, and queries should be in O(log n) time.
data-structure collections go-collectionBuckets is a complete, fully tested and documented data structure library written in pure JavaScript.
data-structures collections collection linked-list dictionary map multimap stack queue set bag binary-heap priority-queue binary-search binary-search-tree tree tree-structure buckets data structure linked list heap priority binary data-structure hashmapPersistent Data Structures for JavaScript
data structure persistent clojurescript map filter reduce data-structure collections hashmapGuava is a set of core libraries that includes new collection types (such as multimap and multiset), immutable collections, a graph library, functional types, an in-memory cache, and APIs/utilities for concurrency, I/O, hashing, primitives, reflection, string processing, and much more.
java-collection concurrency hash murmur-hash collections reflection cache libraryBoom Filters are probabilistic data structures for processing continuous, unbounded streams. This includes Stable Bloom Filters, Scalable Bloom Filters, Counting Bloom Filters, Inverse Bloom Filters, Cuckoo Filters, several variants of traditional Bloom filters, HyperLogLog, Count-Min Sketch, and MinHash.Classic Bloom filters generally require a priori knowledge of the data set in order to allocate an appropriately sized bit array. This works well for offline processing, but online processing typically involves unbounded data streams. With enough data, a traditional Bloom filter "fills up", after which it has a false-positive probability of 1.
bloom-filter stable-bloom-filters cuckoo-filter probabilistic-programming counting-bloom-filters scalable-bloom-filters count-min-sketch data-stream filter data-structure collections go-collectionA curated list of awesome Python frameworks, libraries, software and resources.Inspired by awesome-php.
awesome collections python-library python-frameworkA high performance Transducers implementation for JavaScript.Transducers are composable algorithmic transformations. They are independent from the context of their input and output sources and specify only the essence of the transformation in terms of an individual element. Because transducers are decoupled from input or output sources, they can be used in many different processes - collections, streams, channels, observables, etc. Transducers compose directly, without awareness of input or creation of intermediate aggregates.
functional underscore lodash collectionsA family of projects around collections in Java (so far). A carefully designed extension of the Java Collections Framework with primitive specializations and more. Java 6+. Apache 2.0 license.
java-collections koloboke annotation-processor primitive-specializations high-performance hashmap collectionsThis package contains JavaScript implementations of common data structures with idiomatic iterfaces, including extensions for Array and Object. You can use these Node Packaged Modules with Node.js, Browserify, Mr, or any compatible CommonJS module loader. Using a module loader or bundler when using Collections in web browsers has the advantage of only incorporating the modules you need. However, you can just embed <script src="collections/collections.min.js"> and all of the collections will be introduced as globals. ⚠️ require("collections") is not supported.
collections data-structures observable list set map splayUsing Laravel as your backend? Collect.js offers an (almost) identical api to Laravel Collections 5.5. See differences. All comparisons in collect.js are done using strict equality. Using loose equality comparisons are generally frowned upon in JavaScript. Laravel only performs "loose" comparisons by default and offer several "strict" comparison methods. These methods have not been implemented in collect.js because all methods are strict by default.
collection nested-arrays laravel-collections comparison collectable collections collect map filter group-by reduce transform pluck pie mapwithkeys laravel wherein values uniqueIt is a complete, fully tested data structure library written in TypeScript. This project uses TypeScript Generics so you need TS 0.9 and above.
typescript generics data structures collections linked list dictionary default multi binary search tree key value stack queue set bag heap priority arrayBackbone.React.Component is a mixin and API that glues Backbone models and collections into React components. When used as a mixin the component is mounted, a wrapper starts listening to models and collections changes to automatically set your component state and achieve UI binding through reactive updates.
backbone react data-binding models collections server client react-componentwindows-kernel-exploits Windows平台提权漏洞集合
kernel exploit tool collections pentestПостоянно обновляемая подборка ресурсов по машинному обучению. Обсуждение машинного обучения в мессенджерах (группы, каналы, чаты, сообщества).
machine-learning data-science collections university mooc data-mining nlp neural-networks deep-learning russian🏆 A ranked list of awesome Python open-source libraries & tools. Updated weekly. 🧙♂️ Discover other best-of lists or create your own. 📫 Subscribe to our newsletter for updates and trending projects.
cli library awesome utilities python-library pypi data-structures collections awesome-list utility-library python-utilities python-framework python-libraries best-of best-of-listImmutable data cannot be changed once created, leading to much simpler application development, no defensive copying, and enabling advanced memoization and change detection techniques with simple logic. Persistent data presents a mutative API which does not update the data in-place, but instead always yields new updated data. Immutable.js provides many Persistent Immutable data structures including: List, Stack, Map, OrderedMap, Set, OrderedSet and Record.
immutable persistent lazy data data-structure functional collection stateless sequence iteration collectionsRedisson - Distributed and Scalable Java data structures (Set, SortedSet, Map, ConcurrentMap, List, Queue, Deque, Lock, AtomicLong, CountDownLatch, Publish / Subscribe, HyperLogLog) on top of Redis server. Advanced redis java client. It supports over 28+ data structures and services, Synchronous / asynchronous / reactive interfaces and lot more.
distributed collections locks distributed-locks cacheEnhancing Java 8 Streams
java8 collections streams-api functional-programming functional streams
We have large collection of open source products. Follow the tags from
Tag Cloud >>
Open source products are scattered around the web. Please provide information
about the open source projects you own / you use.
Add Projects.