Search Results for "binary tree" - Page 3

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.

Java Behaviour Trees is a Java framework for easily building and running generic behaviour trees. Here, "behaviour tree" refers to the technique used to control the behaviour of characters in video games. IMPORTANT NOTE: our source code has been moved to GitHub. You will find it at: https://github.com/gaia-ucm/jbt Note however that all the binary files will still be distributed here at SourceForge.

...Their state machines are precompiled and serialized, so run time initialization is fast no matter how large the rule set. JPlex is not a parser generator; it only generates an interface for its parsers, and it does not build a parse tree. When the lexer identifies a token that has a named event associated with it, it passes the token to the parser method associated with that event. A lexer can dispatch token events to any number of parsers. JPlex is steadily being improved, and the Subversion repo will almost always be newer and better than the binary download.

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

...The TASOM has been originally introduced for adaptive and changing environments. Several versions of TASOM networks have been introduced. Some of them are capable of changing the number of neurons based on the problems at hand. Moreover, a binary tree version of the TASOM has been introduced for faster performance.

C++ binary tree with some cool functions

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

MobileC, J2ME Application. Run C on your mobile phone. MobileASM, Run ASM; MobileBASIC, Run BASIC. Mobile(A,B,C). Now stepping upon B....

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

A fully functional red-black tree implemented in C++/CLI with an OO approach of naming and structuring which makes the code highly readable as well as easily portable to C# or Java. The package also includes a binary search tree and two traversal algorithms.

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.

This application is a tree algorithms visualizator. The user can create his own tree of a certain type (among binary, binary search, and red black), his algorithm and then can observe the execution in real time of his algorithm on his tree.

::OMLM:: is a modular multi-level (MLM) network marketing engine designed to handle core MLM business functionality. It's a binary 2xN structured application. It can automatically generate invoices, commissions, weekly reports, binary structure, se

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.

A binary self-balancing tree which implements the features of an AVL tree where each operations (add, remove, search) cost O(log(n)) It uses Java Generics in order to manage any kind of java objects associated to a comparable unique key.

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.

produce full software package using the binary decision diagram (BDD) representation to manipulate logic maps for design optimization objectives multiplyer{like(A+B)(C)(D)}In C++ Core.C++ GUI.VB6 Verilog Modules Quin McCluskey Multi Functions Operations

BinML is a specification and a Java library. It takes XML specifications of (binary) file formats as input and while parsing a binary file it builds an Abstract File Tree containing all the information in a more processing friendly format.

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