Free object oriented design software for linux

The Object Oriented Database Kit is a set of tools to help database applications developers to handle database communication, reporting, and printing. It has a solid, stable, and easy to use API. The project is also GUI toolkit agnostic and portable.

Business Oriented Framework (BOF) is a Perl application server. It uses SOAP, optionally secured with SSL, to communicate with the client.
The client can use SOAP::Lite or the client module included in BOF, making it easy to connect to the server. User, grou
Enhancements:
- Added support for Schedules and tasks

Object Relational Membrane is a Python package that provides the functionality of an object relational layer like EJB or other persistence storage systems.
Object Relational Membrane is a thin compatibility layer between SQL table layouts and Object Oriented Python. While providing a good deal of functionality, it tries to be as small and simple as possible. It currently works with PostgreSQL and Gadfly.
Adapters for Firebird and MySQL are planed.
Enhancements:
- A number of small changes and enhancements.
- The last release previous to a "beta" release.

Turtle3D project is a scheme implementation of the Turtle, in 3D.

It is object oriented, so you can have many turtles in the drawing window.

A test program is included.

JDOInstruments is an embedded object oriented database programmed in java, it is also an implementation of Suns Java Data Objects (JDO) specification for the transparent persistence of Java objects.
Because of this, it doesnt need a JDBC driver or a relational database. JDOInstruments uses its own object store thus it allows storage and retrieval of persistent data with little work from you.
It is integrated with Netbeans IDE (via Plugin module) allowing developers to build pure object-oriented systems.
It is free and Our license is GNU LGPL providing the code and executables (JARs) free of charge. You are free to use JDOInstruments in your projects.
Main features:
- Byte-Code Enhancement of classes
- Byte-Code Compatibility
- Datastore identity
- Optimistic Transaction
- Nontransactional Read
- Retain values
- Restore values
- Second Class PersistenceCapable objects
- J2EE Integration
- Query (JDOQL)
- Index
- Schema Evolution

Yet Another Dynamic Engine (YADE) is an extensible framework that is designed with dynamic libraries in a way that it is easy to add new numerical models and objects.
There are four different models: Discrete Element Method based on spheres, a second method based on tetrahedra, modelling with lattice elements, and Finite Element Method.
Various different methods and algorithms for numerical simulation currently exist. Yade tries to extract their underlying abstractions using following examples:
- Finite Element Method (FEM, [2]),
- Discrete Element Method (DEM),
- Coupling FEM with DEM,
- Mass Spring System,
- Lattice Beam Model,
- Tetrahedron Discrete Model.
Those abstractions are implemented in C++ conforming to Object Oriented design principles. They provide interface to plug-in different modelling methods.
Yade framework is intended to work with other numerical methods than those mentioned above.
Advantages:
- allows numerous simulation methods in the single framework, so coupling them becomes possible,
- plugins can import data from other software,
- thoughtful code design promotes code reuse and improvement,
- open source development model allows community feedback.
Disadvantages:
- implementing models requires adhering to framework design,
- Yade framework is a new emerging software, still in beta phase.
- if you know more disadvantages, let us know!
Enhancements:
- This release has major improvements in the code, and directory cleanup was done.
- The build system was changed from qmake to scons.
- A complete Lattice Geometrical Model was added as a result of PhD defense by one of yades authors.
- Several improvements in Discrete Element Method, capillary law, and triaxial test.
- Among smaller improvements, it is possible to select bodies by clicking them and moving around with the mouse.
- Interaction forces are drawn between bodies, and can be seen as bars with strength related to bar thinckness.

Tree::Binary is a Object Oriented Binary Tree for Perl.

SYNOPSIS

use Tree::Binary;

# a tree representaion of the expression:
# ((2 + 2) * (4 + 5))
my $btree = Tree::Binary->new("*")
->setLeft(
Tree::Binary->new("+")
->setLeft(Tree::Binary->new("2"))
->setRight(Tree::Binary->new("2"))
)
->setRight(
Tree::Binary->new("+")
->setLeft(Tree::Binary->new("4"))
->setRight(Tree::Binary->new("5"))
);
# Or shown visually:
# +---(*)---+
# | |
# +-(+)-+ +-(+)-+
# | | | |
# (2) (2) (4) (5)

# get a InOrder visitor
my $visitor = Tree::Binary::Visitor::InOrderTraversal->new();
$btree->accept($visitor);

# print the expression in infix order
print $visitor->getAccumulation(); # prints "2 + 2 * 4 + 5"

# get a PreOrder visitor
my $visitor = Tree::Binary::Visitor::PreOrderTraversal->new();
$btree->accept($visitor);

# print the expression in prefix order
print $visitor->getAccumulation(); # prints "* + 2 2 + 4 5"

# get a PostOrder visitor
my $visitor = Tree::Binary::Visitor::PostOrderTraversal->new();
$btree->accept($visitor);

# print the expression in postfix order
print $visitor->getAccumulation(); # prints "2 2 + 4 5 + *"

# get a Breadth First visitor
my $visitor = Tree::Binary::Visitor::BreadthFirstTraversal->new();
$btree->accept($visitor);

# print the expression in breadth first order
print $visitor->getAccumulation(); # prints "* + + 2 2 4 5"

# be sure to clean up all circular references
$btree->DESTROY();

This module is a fully object oriented implementation of a binary tree. Binary trees are a specialized type of tree which has only two possible branches, a left branch and a right branch. While it is possible to use an n-ary tree, like Tree::Simple, to fill most of your binary tree needs, a true binary tree object is just easier to mantain and use.

Binary Tree objects are especially useful (to me anyway) when building parse trees of things like mathematical or boolean expressions. They can also be used in games for such things as descisions trees. Binary trees are a well studied data structure and there is a wealth of information on the web about them.

This module uses exceptions and a minimal Design By Contract style. All method arguments are required unless specified in the documentation, if a required argument is not defined an exception will usually be thrown. Many arguments are also required to be of a specific type, for instance the $tree argument to both the setLeft and setRight methods, must be a Tree::Binary object or an object derived from Tree::Binary, otherwise an exception is thrown. This may seems harsh to some, but this allows me to have the confidence that my code works as I intend, and for you to enjoy the same level of confidence when using this module. Note however that this module does not use any Exception or Error module, the exceptions are just strings thrown with die.

This object uses a number of methods copied from another module of mine, Tree::Simple. Users of that module will find many similar methods and behaviors. However, it did not make sense for Tree::Binary to be derived from Tree::Simple, as there are a number of methods in Tree::Simple that just wouldnt make sense in Tree::Binary. So, while I normally do not approve of cut-and-paste code reuse, it was what made the most sense in this case.

Bonddb is a object oriented wrapper for postgresql SQL. bonddb project is a fast data abstraction layer written in C for C/C++ applications to allow easy access to class objects.
Bonddb is not a stand alone object orientated database, but works on top of SQL so you still get a solid proven backend with the benefits of things like prescient objects.
At the moment only postgresql is supported, though we are working with gnome-db to support a more complete range of databases.
One of the real advantages of bonddb is how easy it is to modify rows in database fields without you having to construct sql statements or worry about refreshing existing datasets. It also lets you easy map your tables together in object to object relationships.
Method calls arent supported yet but they are on the way. Direct binding into individual langauges is still been worked on.
Installation and Requierments:
In order to install bonddb you need the postgresql client development libraries installed, specifically libpq-fe.
Postgresql 7.0 or higher is required, as bonddb uses functions specific to this version. Also glib development libaries 1.2 or higher is needed.
For bonddb 0.3.0 and higher you will need bison, Ive come across some problems under older versions of bison and I recommend you have version 1.3 or higher installed.
Enhancements:
- Bugs concerning saving records and jumpto searches were fixed.
- Problems with using PostgreSQL 8.2 and OIDs were fixed.
- Improvements were made for the build process for Windows.