Search Results for "b-tree"

...It lets you create, manipulate and navigate classes, class relations, class members and class methods at a high level of abstraction. ObjectBuilder dramatically simplify work with C++ project architecture. I use it and think that tree OO interface targeted to C++ more fast and power than UML class diagrams. ObjectBuilder perfectly organize C++ header files with any level of complexity. Even if you use loop-references if OO hierarchy, you need include only one project-level header file. You can easy modify and refactore existing project with cut/copy/paste ANY object (from Method Argument to entire Project) within project and between ObjectBuilder projects. ...

Application simplifies the development and management of VHDL projects. The project is displayed in a well-arranged tree structure depending on the hierarchy of entities. It also helps to maintain projects in a consistent state. Other features include automatic generation of VHDL testbenches and structures based on user-defined templates. The NetBeans platform is used as a basis for the implementation.

A design specification language based upon Z Notation and CSP.

Simple TreeEditor for making hierarchical json files. Writen on Java-SWT. Tree orderable by dragging, editable by context menu. Have a simple edit panel, with name, and configurable type, and description textarea.

STDProject (Simple Tree Driven Project) is a modeling tool for software development projects. It will let you build your project, watch its consistency, generate documentation and reuse work from one project to another.

TreeDL (Tree Description Language) is a notation for tree structures used by programs (like syntax trees) and tool for translation of tree descriptions to target programming language, docs generation, etc. Tool's functionality can be extended by plugins.

Analyse and convert sources to trees of blocks. Project on FreePascal and Lazarus.

A minimalistic CASE tool that will allow end-users to analyze their graphs (plain-old graphs, UML diagrams, ERDs, etc.) by applying various graph theory functions to them (such as a shortest path algorithm or a spanning tree algorithm.)