go datastructures online with Winfy

We have hosted the application go datastructures in order to run this application in our online workstations with Wine or directly.

Quick description about go datastructures:

Go-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. Bitarray used to detect existence without having to resort to hashing with hashmaps. Requires entities have a uint64 unique identifier. Two implementations exist, regular and sparse. Sparse saves a great deal of space but insertions are O(log n). There are some useful functions on the BitArray interface to detect intersection between two bitarrays. This package also includes bitmaps of length 32 and 64 that provide increased speed and O(1) for all operations by storing the bitmaps in unsigned integers rather than arrays.

Features:

• Only tested with Go 1.3+
• Augmented Tree, Bitarray, Futures, and Queue
• Fibonacci Heap, Range Tree, and Threadsafe
• AVL Tree, X-Fast Trie, and Y-Fast Trie
• Fast integer hashmap, and Skiplist
• Immutable B Tree, Ctrie, Dtrie, and more

Programming Language: Go.
Categories: