Displaying 1 to 20 from 56 results

Pyrsistent is a number of persistent collections (by some referred to as functional data structures). Persistent in the sense that they are immutable. All methods on a data structure that would normally mutate it instead return a new copy of the structure containing the requested updates. The original structure is left untouched.

immutable datastructures functional:crown: LeetCode of algorithms with java solution(updating).

leetcode leetcode-solutions leetcode-java facebook datastructure datastructures algorithm algorithmsCosmos is your personal offline collection of every algorithm and data structure one will ever encounter and use in a lifetime. This provides solutions in various languages spanning C, C++, Java, JavaScript, Swift, Python, Go and others. This work is maintained by a community of hundreds of people and is a massive collaborative effort to bring the readily available coding knowledge offline.

opengenus algorithm datastructures library offline-app interview-questions sorting-algorithms search-algorithmsThere are several data structures and algorithms implemented in this project. The list will be replenished with time. The library is not intended for direct use by importing. We strongly recommend copying the necessary implementations and adjusting to your case.

datastructures algorithms algorithms-datastructures algorithms-and-data-structures algorithm data-structuresNote: Some of the code here is old and was written when I was learning C++. It might be possible that code is not safe or making wrong assumptions. Please use with caution. Pull requests are always welcome. Include contains single header implementation of data structures and some algorithms.

algorithm cpp interview-questions interview-practice data-structures datastructures c-plus-plus bit-manipulation tree leetcode-solutions leetcode string-manipulationPython Data Structures for Humans™. Schematics is a Python library to combine types into structures, validate them, and transform the shapes of your data based on simple descriptions.

validation datastructures types schema serialization deserializationSimple, quick cheat sheets on computer science concepts.

algorithms datastructuresThe missing set collection for the Go language. Until Go has sets built-in...use this.I have to give some credit for helping seed the idea with this post on stackoverflow.

set threadsafe datastructures data-structure collections go-collectionThis is a collection of different data structures and utilities, implemented in JavaScript. Its written and tested using Node.js which is also the target platform.CircularBuffer - A data structure that uses a single, fixed-size buffer as if it were connected end-to-end. When the buffer is filled, new data is written starting at the beginning of the buffer and overwriting the old.

algorithms datastructures ds sort-map data-structures avl avltree trie ternarysearchtrie multiwaytrie skiplist btree binarysearch binarysearchtree sortedmap lru cache eviction maximize least-recently-used loading guava async delay-queue delayqueue priorityqueue heap binaryheap bitset bitarray bitvector circularbuffer ringbuffer graph directed undirected shortest cycle path topological bloomfilter bloom filterPython 中文数据结构和算法教程

python3 algorithm datastructuresTree implementation in python: simple to use for you. Brett Alistair Kromkamp (brettkromkamp@gmail.com): Post basic idea online.

treelib tree datastructures algorithmMy solutions to some of the algorithm and data structure questions in Java

algorithm interview datastructures data-structures hackerrank hackerrank-solutions geeksforgeeks coding-interviews interview-practice interview-preparation java-8 cracking-the-coding-interview cracking-the-technical-interview cracking-code-interview coding-interview"A Bloom filter is a space-efficient probabilistic data structure that is used to test whether an element is a member of a set. False positive matches are possible, but false negatives are not. In other words, a query returns either "possibly in set" or "definitely not in set". Elements can be added to the set, but not removed," says Wikipedia. Warning: These are synthetic benchmarks in isolated environment. Usually the difference in throughput and latency is bigger in production system because it will stress the GC, lead to slow allocation paths and higher latencies, trigger the GC, etc.

bloom-filter probabilistic high-performance datastructuresSorting Algorithms Visualizer

react sorting styled-components algorithms datastructures reactjs sorting-algorithms zustandJust like regular Struct, but uses keyword arguments. Any non-existent arguments will raise an ArgumentError.

stdlib datastructuresA utility for working with nested data structures. Take a look at Nested data structures with functional lenses for a gentler introduction. In 0.6.0 the function Lens.get got removed. The reason was that it was very easy to create a bug where a list was treated as a single element or vice-versa. Wherever you used Lens.get you now should either use Lens.one! if the invocation should always return exactly one element (this will crash if there is any other number of elements) or Lens.to_list and match on the result if you want to behave differently for different numbers of elements.

elixir functional datastructuresEfficient, Pythonic bidirectional map implementation and related functionality. For more usage documentation, head to the intro [1] and proceed from there.

bidirectional dictionary two-way mapping bimap bijection bijective-maps datastructures python3 python2 cpython pypyThis is repository of data structures and algorithms written in JavaScript and Ruby. Some of the algorithms are from Cracking the Coding Interview by Gayle Laakmann McDowell . Contributions are welcome! Please read the Contributing guidelines and the Code of Conduct on how to contribute. This project is Licensed under the MIT License.

datastructures data-structures algorithms algorithm-challenges cracking-the-coding-interview tree algorithm stack sum palindrome anagrams queue trees stacks trie tries heapA roaring bitmap is an efficient compressed datastructure to store a set of integers. A Roaring bitmap stores a set of 32-bit integers in a series of arrays and bitmaps, whichever takes the least space (which is always 2 ** 16 bits or less). This datastructure is useful for storing a large number of integers, e.g., for an inverted index used by search engines and databases. In particular, it is possible to quickly compute the intersection of a series of sets, which can be used to implement a query as the conjunction of subqueries.

roaring-bitmaps bitset cython datastructuresleafy is a library of different tree implementations. leafy can be used in both the browser and node. Why would I need a tree in javascript? I have arrays and objects.

datastructures tree avl avl-tree red-black-tree andersson-tree
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.**