Search Results for "perfect binary tree" - Page 2

A multiplataform development kit 2D for Linux G++ and Windows MinGW. features: 2D render with OpenGL. Clock and FPS control. Multithread WIndows and Linux. Templated Binary Tree. Network TCP/UDP SERVER/CLIENT. SQL using SQLite. Áudio 2D and 3D using SFML. View Based Render. 2D Shape Render. Animation with interpolation Line/Curve. 2D Bones with IK and BVH loader. Physics 2D using Box2D. Tile Set and Tile Map. Cenario layer based. XML parser using pugiXML. https://github.com/Edimartin/edk-source

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.

The QCacheGrind branch of KCacheGrind compiled with the QT5 toolkit for use in Windows. This tool allows visualisation of profiling data in the callgrind-format. For Xdebug (PHP), version 2.2+ of the extension is recommended. Currently built and tested in Windows 7 for x86 and x64. Please go to https://sourceforge.net/projects/kcachegrind for the source. Description from the main project: KCachegrind visualizes traces generated by profiling, including a tree map and a call...

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

Delphi class incapsulating functionality of Red-black binary search tree

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.

ZenWINX is a framework for Windows native applications development. These applications are intended for use inside of the Windows boot process in a manner similar to Microsoft CheckDisk or UltraDefrag. Actually ZenWINX is part of UltraDefrag, so check it out if you'd like to develop your own native application.

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.