Search Results for "perfect binary tree" - Page 2

Lilac is a tool suite, which contains an assembler and a disassembler for the JVM (Java Virtual Machine) bytecode. The assembler takes textual representations of Java classes, written in an assembler-like syntax, and converts them to binary Java class files, which can be loaded into JVM. The disassembler takes binary Java class files and creates out of them assembler files suitable for the assembler. In general (except for some very rare cases) Lilac tools allow a perfect round-trip, that is, if you disassemble a class file and then assemble it again, without making any changes, you'll get the original file.

cdsaext is a library of implementations of data structures and algorithms, such as lists, maps, trees, binary search functions, and similar dsa's. See also my javadsaext project, which implements similar functions in Java.

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

Monolithor creates monolithic installers for Windows from a dependency tree of intermediate binary packages. Currently NSIS is used for creating the installer and the supported packages are the RPMs built by openSUSE.

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.

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

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.

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.

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.

A Generic Data Structures Library. A collection of data structures you're most likely to need. Written in ANSI C. Interface is basic, but powerful, and intuitive. Has AVL tree, binary heap, queue/linked list, and more. All platforms.