Search Results for "binary tree"

A really fast static spatial index for 2D points and rectangles in JavaScript. An efficient implementation of the packed Hilbert R-tree algorithm. Enables fast spatial queries on a very large number of objects (e.g. millions), which is very useful in maps, data visualizations and computational geometry algorithms.

Trilium is provided as either desktop application (Linux and Windows) or web application hosted on your server (Linux). Mac OS desktop build is available, but it is unsupported. Synchronization with self-hosted sync server, strong note encryption with per-note granularity, relation maps and link maps for visualizing notes and their relations, and scripting, see Advanced showcases. Scales well in both usability and performance upwards of 100 000 notes, touch optimized mobile frontend for...

I've been trying to develop an idea of a project, but the wide range of possibilities with all their outcomes, cons and pros and whatnot got my mind overloaded. There was no way I could keep or process that much information with my bare mind. So, I've checked the mind mapping tools available in the market, both free and commercial ones, yet they were either clunky or overkilling for my needs. Thus, I've made my own thing, and decided to share it with everyone who might find it useful for...

A complete fully tested and documented data structure library written in pure JavaScript. Buckets also includes several functions for manipulating arrays. A bag is a special kind of set in which members are allowed to appear more than once. Binary search trees keep their elements in sorted order, so that lookup and other operations can use the principle of binary search. Dictionaries map keys to values, each key can map to at most one value. A heap is a binary tree that maintains the heap property. Every node is less than or equal to each of its children. A linked list is a sequence of items arranged one after another. ...

...The read-write head itself is a state engine, which is affected by the input from the track, and which decides what to write on the track, and where to read the next input, by "moving" the head back or forth. In 5050, the part of the track left of the head is represented not by a line or stack of information, but by a binary tree. The part right of the head is represented by a binary tree, too. The head itself sort of sits between the two trees, but will often change its state according to information from the right side of the left side. In 5050, the state of the head itself is again represented as a tree of commands, although for simple programs, a linear representation can be sufficient.

Our goal is to create the world's fastest extendable, non-transactional time series database for big data (you know, for kids)! Log file indexing is our initial focus. For example append only ASCII files produced by libraries like Log4J, or containing FIX messages or JSON objects. Occursions was built by a small team sick of creating hacks to remotely copy and/or grep through tons of large log files. We use it to index around a terabyte of new log data per day. You can use it too. Who...