Search Results for "b-tree"

EJE is a simple Java editor, perfect to learn Java, without learning a complex development tool. EJE is multi-platform (written in Java), light- weight, user-friendly and have several useful basic features. A good help to start with Java! Supports the study of the Java for Aliens book (www.javaforaliens.com), or other my books (Italian Language) like www.nuovojava.it. You don't need to install the JDK anymore (the runtime is embedded). See the video "How to create the "Hello World App in...

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

For Homepage, Blog, Family Tree, Database, C#|hjt|js|chm Editor. Convert hjt2xml, (c#)cs2xml, chm2xml, js2xml, xml2cs, xml2js, xml2hjt, cs2hjt, hjt2cs, cs2chm, hjt2chm. IE/Opera/Firefox/PocketPC supported.

ABTools provides an open environment based on ANTLR and Java and provides some facilities for design and test the B language and somes extensions. ABTools est un environnement de développement base sur ANTLR et Java. Il permet de manipuler le langag

Requirement Heap is a web based requirement management /business analysis application. It allows to enter requirement in rich text, supports versioning and the management of requirements. It also handles use cases, interviews and test cases. It allows multiple projects. Stakeholders and glossaries can be handled per project or globally.

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