Displaying 1 to 20 from 20 results

Buckets 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 hashmapSource code of Learning JavaScript Data Structures and Algorithms book.

javascript-algorithms algorithm data-structures typescript typescript-algorithms stack queue deque priority-queue linked-list set tree sorting-algorithms dictionary binary-tree avl-tree quicksort graph graph-algorithms dijkstra-algorithmMnemonist is a curated collection of data structures for the JavaScript language. It gathers classic data structures (think heap, trie etc.) as well as more exotic ones such as Buckhard-Keller trees etc.

data-structure bag bimap bit-array bit-set bit-vector bitset bk-tree burkhard-keller-tree circular-buffer counter data-structures disjoint-set fibonacci-heap fuzzy-map hashed-array-tree heap interval-tree inverted-index linked-list multimap multiset queue sparse-set stack structures suffix-tree symspell trie union-find vantage-point-tree vector vp-treeA library providing a handful of useful data structures omitted from the .NET framework.

binarytree btree data-structures graph heap linked-listThis ASP.NET UserControl displays two ListBoxes and allows the user to select items by moving them from the source ListBox to the destination ListBox.

webcontrols linked-list moss-2007 sharepointThis is a program that demonstrates how to access in a linked list the nth node from the last node - a simple piece of code that demonstrates how to access nth (from the last) element in a lili in one pass. My initial release was not efficient - This version is better than t...

linked-list test-caseCopyright 2013, Licensed under the GPL version 2. Please reach out to me directly if you require another licensing option. I am willing to work with you. To collect many important data structures for usage in go programs. Golang's standard library lacks many useful and important structures. This library attempts to fill the gap. I have implemented data-structure's as I have needed them. If there is a missing structure or even just a missing (or incorrect) method open an issue, send a pull request, or send an email patch.

data-structures avl-tree avl immutable btree hashtable hash-tables linear-hash-table trie ternary-search-trie arraylist linked-list priority-queue exceptions error-handling treeTurn any collection of objects into its own efficient tree or linked list using Symbol. This library has been designed to provide an efficient backing data structure for DOM trees. You can also use this library as an efficient linked list. Any meta data is stored on your objects directly, which ensures any kind of insertion or deletion is performed in constant time. Because an ES6 Symbol is used, the meta data does not interfere with your object in any way.

tree metadata symbol-tree js dom linked-list list queue es6 symbol data-structure efficiency nodejs browser algorithms stackThis is a javascript implementation of a doubly linked list data structure. In simple terms, a doubly linked list consists of one or more 'nodes'. Each node has a data field (which can contain any data--a primitive value or complex object) and a pointer to the next 'node' and the previous 'node'. This additional pointer to the previous node is what distinguishes a doubly linked list from a singly linked list--a singly linked list only contains a pointer, or reference, to the next node. The major advantage to having pointers to both the next and previous node is that the list can be traversed in both directions, as well as making operations that operate on the 'middle' of the list a bit more efficient since each node has a reference the one before it and the one after it. The idea of having a links to the previous and next nodes is where this data structure got its descriptive name.

doubly-linked-list linked-list data-structureDequeue is implemented as a doubly linked circular list with a titular head node. By "titular head node", I mean an empty node to designate the beginning and end of the circularly linked list. I first saw this construction in the linux kernel source and it seem simple and elegant. I added the .length property to use it like I was using an Array. I was using a javascript Array as a FIFO. Somewhere between 100,000 and 200,000 entries the program performance went to hell (dev host is a MBP w/8GB RAM). 15 minutes later, I implemented a simple dequeue and my FIFO scales up to millions of entries.

datastructure queue double-ended-queue fifo linked-listLightweight linked list implementation with a small memory footprint. There are few implementation of the linked-list structure in the JavaScript ecosystem, but most of them create a bunch of extra objects to store metadata about the list. We didn't like that, so we created LiLL.

linked-list linked list es6 symbol lightweightJust some experiments with linked lists and unlimited polymorphic derived types.

linked-listNeedle is a standalone extensive data structure library in JavaScript. Install as an npm package or download the minified file of the latest version.

needle data-structures library node hashmap heap bitarray binary-trees stack k-ary-tree rolling-hash-functions rabin-karp queue linked-list data-structure data structure structuresÉter is a conglomerate of lightweight collections for JavaScript running on node and browser. A Stack is a Last-In-First-Out (LIFO) data structure.

typescript data-structures collections stack queue linked-list trieData Structures with Go Language

data-stuctures golang-examples arrays binary-trees linked-list graph-algorithms interview-questions collections stack queue binary-search-tree binary-search tree sorting-algorithms dictionary algorithms educational searching-algorithmsFast, light and hassle-free JavaScript data structures, written in CoffeeScript. Alternatively, you can directly use the compiled JavaScript version in the "distribution" folder. It's always in sync with the CoffeeScript one.

data-structure linked-list list bst binary-search-tree red-black-tree tree graph edge queue map hash heap triedata structure and algorithm - examples and implementations

dsa data-structures algorithm sorting-algorithms list base-conversion quicksort binary-search linked-listSolutions for Cracking the Coding Interview - 6th Edition

array arrays string strings string-manipulation linked-list linkedlist stack queue tree trees graph graph-algorithms bitset bits sum matrix permutation palindrome ctciData structures basics

data structure structures array list linked-list tree graph binary-tree n-ary-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.**