Search Results for "binary tree"

Create zip files, extract zip files, replace text in files, search in files using expressions, stream text editor, instant command line ftp and http server, send folder via network, copy folder excluding sub folders and files, find duplicate files, run a command on all files of a folder, split and join large files, make md5 checksum lists of files, remove tab characters, convert CR/LF, list newest or biggest files of a folder, compare folders, treesize, show first or last lines of a file,...

Efficiently find items by matching weight. If your data is static, you can build the lookup structure (a complete binary tree) at compile time, by making it `const`. You can use any inferred numeric type for the weights. You can have any range for the lookup, by default `0.0 .. 1.0` for floats, and their respective whole spectrum for unsigned integers.

Java API to realize quick ISAM (Index Sequential Access Method) functionality for application in the file system. Includes scalable database files w/ space recovery and variable record length, scalable B+Tree index files. Supports file backup and restore. Two package types: one with and one without strong file encryption using Twofish algorithm and state-of-the-art encryption technology.

An note taking program with WebDAV sync capabilities. It works on a local (and WebDAV) directory and shows the items (text/image/binary) in a tree view. Any changes are reflected in the file system directly. Features: - group notes and images in a tree structure (using folders) - can work on any directory on your machine - technically works like a file browser with inline text editing - synchronizes with any WebDAV server (optionally using SSL/TLS) - allows one-way and two-way synchronization - allows to encrypt your files locally and remote using AES256 - multi language support You can obtain the full source code at: https://crispy-cow.de/git/CrispySyncNote.git Latest changes: 2.1.0: Updated for Java 9 and up 2.0.2: Added more UI translation, updated greek language (thanks to geogeo) 2.0.1: Bugfix: Sync state is now copied when duplicating workspace due to change in encryption settings

DSA extensions contains classes similar in purpose to the classes provided in java.util. Currently, it contains sortable Lists and Maps, as well as a balanced binary search tree and a binary array search algorithm.

DecisionTree is a Ruby library that implements decision tree learning with the ID3 information-gain algorithm. It can train models from discrete, continuous, or mixed attribute data. Continuous features are evaluated across possible split points to build threshold-based binary branches. Discrete models classify unique labels and can be rendered for visual inspection. The library supports inconsistent datasets, multiple or symbolic outputs, and fallback values when no branch matches an input. ...

The Ian Watters Named Binary Tag Java Library (IWNBTJL for short) is a Java library that allows work with the Named Binary Tag format created by Notch with any project of your's (please note, no one owns NBT). Written off of the JNBT library (http://jnbt.sourceforge.net/), this contains usage improvements, however is not too different from the original library.

CLAW is a C++ Library providing various tools in different domains, like a Tweener framework, Bézier curves manipulation, a map with multiple value types, a binary search tree container implemented as an AVL and an implementation of the sockets as std::stream. The library also includes a set of classes to easily load and write png, jpeg, gif files and other image formats. Finally, a part of the library is devoted to artificial intelligence in games and includes a generic alpha-beta algorithm. ...

Patchamama is a binary patch maker/applier that works on directory tree. It can be used in application deployment, large scale project patching (including source and binary data). It use bsdiff for the binary diff job and 7zip for compression.

...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.

Reblok build an Abstract Syntax Tree (AST) from a python bytecode (typically found in .pyc files).

An interactive binary search tree. The user may interact with the tree by performing rotations, balancing, insertions, and deletions. For educational purposes

process logic expression with binary tree, it can be used on the expert system's facts logic expression especailly infere with database.it needs java6 environment.any question plz contact with me nicky.jcoder@gmail.com

An extremely flexible and customizable hex editor accompanied by a .Net hex viewer control. The file or resource is represented as a file system structure (folder/file hierarchy) and viewed in tree view. Selected file is displayed on the hex viewer.

A small binary tree library that is concentrates around binary tree algorithms. Currently it focuses on an binary tree with key-value(s) pairs and non-redundant keys. Current features: MaxHeap (Add, remove keys), Algorithms: Bubble-up, Bubble-down.

QTreeViewer is a small application for working with binary search tree (BST). The main purpose was to take a closer look at Qt and to make smth interesting (but maybe not very useful) at the same time.

binreplace is a command line tool to search and replace binary sequences in a file. It can be very powerful when used together with grep and sed. It uses prefix tree internally to search. It's efficient even with millions of search terms.

This project draws the binary tree representation of an arithmetic expression. It can be compiled on Windows or Linux.

spdict is a library of dictionary algorithms written in C++. It has support for sorted array, binary search tree, red-black tree, skip list, and balanced tree algorithms. Also include a cache class.

.Net Generic Data Structures Provides parametric polymorphic data structores (the first is an AVL Binary tree, always balanced), for the .Net framework.

Numerically estimate an efficiency of code construction algorithms. Randomly generate n binary words of length m with minimum Hamming distance d and create a prefix code (= retrieval tree) from them. Based on PhD work.