supportsoft container
Sponsored Links
Sponsored Links
Secleted [ 0 ] software to compare
Results 1 - 15 of about 227
Peco::Container 1.0
Peco::Container is a light inversion of Control (IoC) container. more>>
Peco::Container is a light inversion of Control (IoC) container.
SYNOPSIS
my $c = Peco::Container->new;
$c->register( my_key, My::Class );
$c->register( my_key, My::Class, [ @deps ] );
$c->register( my_key, My::Class, [ @deps ], create );
$c->register( my_key, My::Class, [ @deps ], create, { %attrs } );
$c->register( my_key, My::Class, undef, create );
$c->register( my_key, My::Class, undef, create, { %attrs } );
$c->register( my_key, My::Class, [ @deps ], undef, { %attrs } );
my $instance = $c->get(my_key);
my @instances = $c->get_all();
$c->has(my_key) ? 1 : 0;
$c->is_empty ? 1 : 0;
$c->multicast( method, @args );
Peco::Container is a small, flexible Inversion of Control (IoC) container supporting both Constructor Injection and Setter Injection patterns, as well prototype services (factories) and multicasting.
<<lessSYNOPSIS
my $c = Peco::Container->new;
$c->register( my_key, My::Class );
$c->register( my_key, My::Class, [ @deps ] );
$c->register( my_key, My::Class, [ @deps ], create );
$c->register( my_key, My::Class, [ @deps ], create, { %attrs } );
$c->register( my_key, My::Class, undef, create );
$c->register( my_key, My::Class, undef, create, { %attrs } );
$c->register( my_key, My::Class, [ @deps ], undef, { %attrs } );
my $instance = $c->get(my_key);
my @instances = $c->get_all();
$c->has(my_key) ? 1 : 0;
$c->is_empty ? 1 : 0;
$c->multicast( method, @args );
Peco::Container is a small, flexible Inversion of Control (IoC) container supporting both Constructor Injection and Setter Injection patterns, as well prototype services (factories) and multicasting.
Download (0.015MB)
Added: 2007-06-22 License: Perl Artistic License Price:
855 downloads
Jiplet Container 0.1.0b
Jiplet is short for Java SIP Servlet. more>>
Jiplet is short for Java SIP Servlet. Jiplet Container project is an open-source container for server-side SIP applications. An application developer can create a SIP application written in Java using the Jiplet API and deploy the application in the container.
The container provides a number of framework services including support for SIP message parsing and formatting, scoped variables, authentication and authroization, thread-pooling, logging, custom class loading, management interface, etc. It enables application developer to create server-side SIP applications using a component-based model similar to that envisioned by the J2EE architecture.
In fact, it fits very well with the J2EE paradigm for software development and deployment. The jiplet container software can either be run as a standalone Java application or deployed as a service residing in a J2EE server. When running as a J2EE service, the jiplet container can access many of the features offered by the J2EE server.
In addition, The jiplet container is built with the service provider model in mind. In this model, a service provider can host customized SIP applications from their customers in a secure manner similar to the servlet hosting offered by many service providers.
The jiplet container is very similar to a Java HTTP servlet container in concept. A Java HTTP servlet is a Java class that handles HTTP messages from web browsers. Similarly, a jiplet is a Java class that handles SIP messages from SIP user agents (SIP phones and SIP servers).
A servlet container like Apache Tomcat can host one or more web applications (contexts), each consisting of one or more servlets. Similarly, the jiplet container can host one or more SIP applications (contexts) consisting of one or more jiplets.
Similar to the servlet API authored by Sun Microsystems, the jiplet container provides a set of Java classes that jiplet applications extend or use. The services provided by these classes are very similar to those of the servlet API including scoped variables, request forwarding from one jiplet to another, etc.
As in a servlet container, new jiplet applications, or contexts, can be deployed using a zipped file called spr (war is the Java servlet terminology). Since there are differences between the HTTP and SIP protocols, the servlet and the jiplet containers have some notable differences.
However, the jiplet is not a formal specification like the servlet specification. It is also not an implementation of the SIP servlet specification (JSR 116) authored by Sun and its community of users. There are many similarities between the jiplet and the SIP servlet in terms of features. If you are familiar with SIP servlets, you will feel right at home with the jiplet container.
We are planning to continue developing the jiplet container based on feedback provided by that the open-source community. We are hoping that open-source developers will extend this tool and the specification instead of a committee.
Main features:
- Open-source API for developing server-side SIP applications. Based on the JAIN-SIP API.
- Offers component-based development model.
- Servlet-like development and runtime environment.
- Access to powerful JAIN-API from SIP applications.
- JMX management interface for interfacing with management systems.
- Web-based user interface for managing jiplet applications.
- Support for scoped variables including application, session, request, transaction and dialog-scoped variables.
- Support for forwarding SIP messages from one jiplet to another.
- Container-managed authentication and authorization.
- Support for application timers.
- Can run as a standalone application or it can be integrated with JBOSS as a J2EE service.
- Comprehensive support for the service-provider model.
Enhancements:
- The final release (version 1.2) of the NIST SIP stack Reference Implementation has been incorporated into the Jiplet Container and reference applications.
- The new listening point architecture has been integrated into the Jiplet Container SIP connector.
- One connector can now use more than one IP address for SIP messaging.
- Convenience methods have been added to the Jiplet class for jiplet developers to handle additional listening points and SIP providers.
- The Jiplet Container message proxying has been updated to work in a multi-homed environment.
- The software has been tested with Jboss 4.0.5.GA.
<<lessThe container provides a number of framework services including support for SIP message parsing and formatting, scoped variables, authentication and authroization, thread-pooling, logging, custom class loading, management interface, etc. It enables application developer to create server-side SIP applications using a component-based model similar to that envisioned by the J2EE architecture.
In fact, it fits very well with the J2EE paradigm for software development and deployment. The jiplet container software can either be run as a standalone Java application or deployed as a service residing in a J2EE server. When running as a J2EE service, the jiplet container can access many of the features offered by the J2EE server.
In addition, The jiplet container is built with the service provider model in mind. In this model, a service provider can host customized SIP applications from their customers in a secure manner similar to the servlet hosting offered by many service providers.
The jiplet container is very similar to a Java HTTP servlet container in concept. A Java HTTP servlet is a Java class that handles HTTP messages from web browsers. Similarly, a jiplet is a Java class that handles SIP messages from SIP user agents (SIP phones and SIP servers).
A servlet container like Apache Tomcat can host one or more web applications (contexts), each consisting of one or more servlets. Similarly, the jiplet container can host one or more SIP applications (contexts) consisting of one or more jiplets.
Similar to the servlet API authored by Sun Microsystems, the jiplet container provides a set of Java classes that jiplet applications extend or use. The services provided by these classes are very similar to those of the servlet API including scoped variables, request forwarding from one jiplet to another, etc.
As in a servlet container, new jiplet applications, or contexts, can be deployed using a zipped file called spr (war is the Java servlet terminology). Since there are differences between the HTTP and SIP protocols, the servlet and the jiplet containers have some notable differences.
However, the jiplet is not a formal specification like the servlet specification. It is also not an implementation of the SIP servlet specification (JSR 116) authored by Sun and its community of users. There are many similarities between the jiplet and the SIP servlet in terms of features. If you are familiar with SIP servlets, you will feel right at home with the jiplet container.
We are planning to continue developing the jiplet container based on feedback provided by that the open-source community. We are hoping that open-source developers will extend this tool and the specification instead of a committee.
Main features:
- Open-source API for developing server-side SIP applications. Based on the JAIN-SIP API.
- Offers component-based development model.
- Servlet-like development and runtime environment.
- Access to powerful JAIN-API from SIP applications.
- JMX management interface for interfacing with management systems.
- Web-based user interface for managing jiplet applications.
- Support for scoped variables including application, session, request, transaction and dialog-scoped variables.
- Support for forwarding SIP messages from one jiplet to another.
- Container-managed authentication and authorization.
- Support for application timers.
- Can run as a standalone application or it can be integrated with JBOSS as a J2EE service.
- Comprehensive support for the service-provider model.
Enhancements:
- The final release (version 1.2) of the NIST SIP stack Reference Implementation has been incorporated into the Jiplet Container and reference applications.
- The new listening point architecture has been integrated into the Jiplet Container SIP connector.
- One connector can now use more than one IP address for SIP messaging.
- Convenience methods have been added to the Jiplet class for jiplet developers to handle additional listening points and SIP providers.
- The Jiplet Container message proxying has been updated to work in a multi-homed environment.
- The software has been tested with Jboss 4.0.5.GA.
Download (15.2MB)
Added: 2006-09-04 License: GPL (GNU General Public License) Price:
1150 downloads
vtkContainers 0.3
vtkContainers is a container library for VTK. more>>
vtkContainers is a container library for VTK providing list, deque, and vector sequence types; set, map, and hash map associative types; as well as stack, queue, and priority queue adaptor types.
All container implementions, except hash map, are wrappers around an internal C++ STL type. Similar to a vtkCollection, all containers register objects on insertion, unregister them on removal, are wrappable into other languages, and are covered by a unit testing suite. vtkContainers also provides many unique capabilities, higher performance, and support for object level locking.
Though the standard vtkCollection is an excellent general purpose container type that serves the internal needs of VTK very well, specialized containers are often needed for application-level support.
vtkContainers originated as the implementation of a simple stack class for use with parsers or transaction systems and a simple map class for accessing C++ objects by name. The current library grew from the desire to complete the concept by providing all applicable STL container types and their iterators.
<<lessAll container implementions, except hash map, are wrappers around an internal C++ STL type. Similar to a vtkCollection, all containers register objects on insertion, unregister them on removal, are wrappable into other languages, and are covered by a unit testing suite. vtkContainers also provides many unique capabilities, higher performance, and support for object level locking.
Though the standard vtkCollection is an excellent general purpose container type that serves the internal needs of VTK very well, specialized containers are often needed for application-level support.
vtkContainers originated as the implementation of a simple stack class for use with parsers or transaction systems and a simple map class for accessing C++ objects by name. The current library grew from the desire to complete the concept by providing all applicable STL container types and their iterators.
Download (0.25MB)
Added: 2005-07-15 License: GPL (GNU General Public License) Price:
1562 downloads
Class::Container 0.12
Class::Container is a Perl module with Glues object frameworks together transparently. more>>
Class::Container is a Perl module with Glues object frameworks together transparently.
SYNOPSIS
package Car;
use Class::Container;
@ISA = qw(Class::Container);
__PACKAGE__->valid_params
(
paint => {default => burgundy},
style => {default => coupe},
windshield => {isa => Glass},
radio => {isa => Audio::Device},
);
__PACKAGE__->contained_objects
(
windshield => Glass::Shatterproof,
wheel => { class => Vehicle::Wheel,
delayed => 1 },
radio => Audio::MP3,
);
sub new {
my $package = shift;
# windshield and radio objects are created automatically by
# SUPER::new()
my $self = $package->SUPER::new(@_);
$self->{right_wheel} = $self->create_delayed_object(wheel);
... do any more initialization here ...
return $self;
}
This class facilitates building frameworks of several classes that inter-operate. It was first designed and built for HTML::Mason, in which the Compiler, Lexer, Interpreter, Resolver, Component, Buffer, and several other objects must create each other transparently, passing the appropriate parameters to the right class, possibly substituting other subclasses for any of these objects.
The main features of Class::Container are:
Explicit declaration of containment relationships (aggregation, factory creation, etc.)
Declaration of constructor parameters accepted by each member in a class framework
Transparent passing of constructor parameters to the class that needs them
Ability to create one (automatic) or many (manual) contained objects automatically and transparently
<<lessSYNOPSIS
package Car;
use Class::Container;
@ISA = qw(Class::Container);
__PACKAGE__->valid_params
(
paint => {default => burgundy},
style => {default => coupe},
windshield => {isa => Glass},
radio => {isa => Audio::Device},
);
__PACKAGE__->contained_objects
(
windshield => Glass::Shatterproof,
wheel => { class => Vehicle::Wheel,
delayed => 1 },
radio => Audio::MP3,
);
sub new {
my $package = shift;
# windshield and radio objects are created automatically by
# SUPER::new()
my $self = $package->SUPER::new(@_);
$self->{right_wheel} = $self->create_delayed_object(wheel);
... do any more initialization here ...
return $self;
}
This class facilitates building frameworks of several classes that inter-operate. It was first designed and built for HTML::Mason, in which the Compiler, Lexer, Interpreter, Resolver, Component, Buffer, and several other objects must create each other transparently, passing the appropriate parameters to the right class, possibly substituting other subclasses for any of these objects.
The main features of Class::Container are:
Explicit declaration of containment relationships (aggregation, factory creation, etc.)
Declaration of constructor parameters accepted by each member in a class framework
Transparent passing of constructor parameters to the class that needs them
Ability to create one (automatic) or many (manual) contained objects automatically and transparently
Download (0.019MB)
Added: 2006-10-06 License: Perl Artistic License Price:
1113 downloads
Basset::Container::Hash 1.04
Basset::Container::Hash Perl module implements a layered hash. more>>
Basset::Container::Hash Perl module implements a layered hash. The easiest way to explain is with an example:
my %x = (a => b);
tie my %y, Basset::Container::Hash, %x; #<<less
my %x = (a => b);
tie my %y, Basset::Container::Hash, %x; #<<less
Download (0.14MB)
Added: 2007-07-24 License: Perl Artistic License Price:
822 downloads
libcontain 0.2 Alpha1
libcontain library provides a large and growing number of fast and thread-safe containter objects written in C and C++. more>>
libcontain library provides a large and growing number of fast and thread-safe containter objects written in C and C++.
The libcontain library now provides the following container types:
- a series of hash tables libcontain includes the hash table implementation from GNU glib and a hash implementation in C++ it inherited from the libhash library it originates from. This latter has been rendered thread-safe in the 0.2 release and implements a linear hashing algorithm. A single hash table implementation that will replace them both is on the drawing boards and is intended to be thread-safe and non-blocking.
- an array (vector) implementation
libcontain currently includes a non-blocking array implementation. However, this implementation presents a race-condition in concurrent calls to any of its writing functions if the array is in the process of being resized. There is currently no known non-blocking way to solve this race condition. Help is welcome in this area.
- a binomial tree
The binomial tree provided by libcontain does not provide any algorithmic logic in its implementation: it is a generic container that can be used as the basis for other container implementations, such as a heap or a map (as a matter of fact, the heap and the map are both based on this binomial tree)
- a heap
libcontain provides an automatically sorting heap implementation that (obviously) uses a heap sort to sort the elements it contains. Unfortunately, the heap implementation is not non-blocking (although bases on a non-blocking binomial tree implementation). It contains four levels of locks: a reader count and a write lock at the level of the nodes, and a reader count and a write lock at the level of the container. The locks are posed on the container for as short a time as possible so at to prevent the progress of the algorithm to block too long. If anyone knows of a non-blocking heap algorithm, input is more than welcome.
- a list
libcontain provides a non-blocking list implementation based on an algorithm by M.M. Micheal (also the inventor of Safe Memory Reclamation on which libmemory is based).
a map
The map implementation included in libcontain is based on the binomial tree implementation. Unlike some implementations based on binary trees, this implementation stores values in each node of the tree (not just the leaf nodes) and therefore allows a more memory-efficient way to store information than hashes and other map implementations. Also, the map implementation does not use a "less" function but uses a three-way comparison to compare keys (much like the helper function used by qsort). The implementation is almost (but not quite) non-blocking: for most intents and purposes, there are no real locks: read and write operations may be re-directed along a branch of the binomial tree if a node that they traverse is being deleted, but will not block for that. However, a remove operation will wait for another remove operation to finish if it traverses a node being removed.
- a queue
a non-blocking queue implementation is provided
- a stack
a non-blocking stack implementation is also provided
In future versions, the hash implementation will be replaced by a non-blocking one and the remaining problems with the existing containers will (hopefully) be solved. Help is also needed to write the architecture-dependant code for non-IA32 platforms such as Sparc.
Enhancements:
- The 0.2 release introduces number of important new features including a heap and a map, both based on a lock-free binomial tree. It also includes the required memory management to make the containters impervious to the ABA problem and thus truly thread-safe.
<<lessThe libcontain library now provides the following container types:
- a series of hash tables libcontain includes the hash table implementation from GNU glib and a hash implementation in C++ it inherited from the libhash library it originates from. This latter has been rendered thread-safe in the 0.2 release and implements a linear hashing algorithm. A single hash table implementation that will replace them both is on the drawing boards and is intended to be thread-safe and non-blocking.
- an array (vector) implementation
libcontain currently includes a non-blocking array implementation. However, this implementation presents a race-condition in concurrent calls to any of its writing functions if the array is in the process of being resized. There is currently no known non-blocking way to solve this race condition. Help is welcome in this area.
- a binomial tree
The binomial tree provided by libcontain does not provide any algorithmic logic in its implementation: it is a generic container that can be used as the basis for other container implementations, such as a heap or a map (as a matter of fact, the heap and the map are both based on this binomial tree)
- a heap
libcontain provides an automatically sorting heap implementation that (obviously) uses a heap sort to sort the elements it contains. Unfortunately, the heap implementation is not non-blocking (although bases on a non-blocking binomial tree implementation). It contains four levels of locks: a reader count and a write lock at the level of the nodes, and a reader count and a write lock at the level of the container. The locks are posed on the container for as short a time as possible so at to prevent the progress of the algorithm to block too long. If anyone knows of a non-blocking heap algorithm, input is more than welcome.
- a list
libcontain provides a non-blocking list implementation based on an algorithm by M.M. Micheal (also the inventor of Safe Memory Reclamation on which libmemory is based).
a map
The map implementation included in libcontain is based on the binomial tree implementation. Unlike some implementations based on binary trees, this implementation stores values in each node of the tree (not just the leaf nodes) and therefore allows a more memory-efficient way to store information than hashes and other map implementations. Also, the map implementation does not use a "less" function but uses a three-way comparison to compare keys (much like the helper function used by qsort). The implementation is almost (but not quite) non-blocking: for most intents and purposes, there are no real locks: read and write operations may be re-directed along a branch of the binomial tree if a node that they traverse is being deleted, but will not block for that. However, a remove operation will wait for another remove operation to finish if it traverses a node being removed.
- a queue
a non-blocking queue implementation is provided
- a stack
a non-blocking stack implementation is also provided
In future versions, the hash implementation will be replaced by a non-blocking one and the remaining problems with the existing containers will (hopefully) be solved. Help is also needed to write the architecture-dependant code for non-IA32 platforms such as Sparc.
Enhancements:
- The 0.2 release introduces number of important new features including a heap and a map, both based on a lock-free binomial tree. It also includes the required memory management to make the containters impervious to the ABA problem and thus truly thread-safe.
Download (0.37MB)
Added: 2006-01-19 License: GPL (GNU General Public License) Price:
1373 downloads
SmartVariables 0.91 Beta
SmartVariables is a C++ library that simplifies network database programming by implementing seamless sharing and storage. more>>
SmartVariables is a C++ library that simplifies network database programming by implementing seamless sharing and storage of generic content. This C++ based network development platform is rather novel in that it "attaches" an email-like address to container and list objects. This makes the working program data "network aware" and distributed. SmartVariables simplifies application development and maintenance by removing complexity. The product provides an automated, intelligent data delivery capability for generic objects and lists.
Most systems manage data by moving the data in and out of databases - using a "buffer" to transfer data between the database and application working variables. SmartVariables removes this "buffer" by attaching the working variables directly to network information storage. When the storage changes, so do the variables... on all of the machines with copies of that information! Internally, distributed databases "push" altered content to machines accessing that - and deliver the data to each processs working variables automatically.
The library has two logical entities (container and list) that translate into six physical object-classes. Containers can hold almost any piece of data - from numbers to arbitrary-length strings to complex binary objects including multimedia and files. Containers can perform infinite-precision math. List objects hold containers - or other list objects as elements. Because SmartVariables behave similar to ordinary C++ intrinsic types, there is very little time required before a developer becomes productive with the library. Junior programmers can learn this environment with about 1 day of study.
The developers assert this platform is useful for a wide variety of common distributed processing tasks, including GRID programming, web-services and integration of legacy software. It is easy to use SmartVariables as "glue" to make systems communicate.. The company is internally using SmartVariables as a component in a massively-parallel distributed neural network: In that, distributed neurons process sequences of auto-associative invariant pattern representations and yield a percentage match for input pattern fragments. These neuron objects use SmartVariables objects as "generic axons" to widely exchange information.
Enhancements:
- This release compiles and runs using GCC 4.X.
- Order-of-processing for object updates has been fixed.
- New object XML conversion code has been added.
- There is a fix for the object name@localhost truncation bug.
- There are VC++ and build system "make install" changes.
<<lessMost systems manage data by moving the data in and out of databases - using a "buffer" to transfer data between the database and application working variables. SmartVariables removes this "buffer" by attaching the working variables directly to network information storage. When the storage changes, so do the variables... on all of the machines with copies of that information! Internally, distributed databases "push" altered content to machines accessing that - and deliver the data to each processs working variables automatically.
The library has two logical entities (container and list) that translate into six physical object-classes. Containers can hold almost any piece of data - from numbers to arbitrary-length strings to complex binary objects including multimedia and files. Containers can perform infinite-precision math. List objects hold containers - or other list objects as elements. Because SmartVariables behave similar to ordinary C++ intrinsic types, there is very little time required before a developer becomes productive with the library. Junior programmers can learn this environment with about 1 day of study.
The developers assert this platform is useful for a wide variety of common distributed processing tasks, including GRID programming, web-services and integration of legacy software. It is easy to use SmartVariables as "glue" to make systems communicate.. The company is internally using SmartVariables as a component in a massively-parallel distributed neural network: In that, distributed neurons process sequences of auto-associative invariant pattern representations and yield a percentage match for input pattern fragments. These neuron objects use SmartVariables objects as "generic axons" to widely exchange information.
Enhancements:
- This release compiles and runs using GCC 4.X.
- Order-of-processing for object updates has been fixed.
- New object XML conversion code has been added.
- There is a fix for the object name@localhost truncation bug.
- There are VC++ and build system "make install" changes.
Download (32.7MB)
Added: 2006-09-08 License: Other/Proprietary License Price:
1142 downloads
App::SVNBinarySearch 0.1.0
App::SVNBinarySearch is a container for functions in the svn_binary_search program. more>>
App::SVNBinarySearch is a container for functions in the svn_binary_search program.
SYNOPSIS
No user-serviceable parts inside. svn_binary_search is all that should use this.
CONFIGURATION AND ENVIRONMENT
App::SVNBinarySearch requires no configuration files or environment variables.
<<lessSYNOPSIS
No user-serviceable parts inside. svn_binary_search is all that should use this.
CONFIGURATION AND ENVIRONMENT
App::SVNBinarySearch requires no configuration files or environment variables.
Download (0.005MB)
Added: 2007-01-24 License: Perl Artistic License Price:
1003 downloads
STX B+ Tree 0.8
STX B+ Tree project is a set of C++ template classes implementing a B+ tree key/data container in main memory. more>>
STX B+ Tree project is a set of C++ template classes implementing a B+ tree key/data container in main memory. The classes are designed as drop-in replacements of the STL containers set, map, multiset and multimap and follow their interfaces very closely. By packing multiple value pairs into each node of the tree the B+ tree reduces heap fragmentation and utilizes cache-line effects better than the standard red-black binary tree.
The tree algorithms are based on the implementation in Cormen, Leiserson and Rivests Introduction into Algorithms, Jan Janninks paper and other algorithm resources. The classes contain extensive assertion and verification mechanisms to ensure the implementations correctness by testing the tree invariants.
The main B+ tree implementation can be found in doxygen stx/btree.h or with plain text comments btree.h.
Special interest was put into performing a speed comparison test between the standard red-black tree and the new B+ tree implementation. The speed test results are interesting and show the B+ tree to be significantly faster.
Enhancements:
- This release introduces the demonstration program wxBTreeDemo.
- This program draws illustrations of the B+ trees constructed by the STX B+ Tree template classes.
- It allows the user to select different types of B+ tree instantiations: integer or string keys and different slot numbers.
- The user may insert and erase key/data pairs from the tree and run different search operations.
- The demo program uses the cross-platform wxWidgets toolkit and can be compiled on Linux, Windows, and Mac OS X.
<<lessThe tree algorithms are based on the implementation in Cormen, Leiserson and Rivests Introduction into Algorithms, Jan Janninks paper and other algorithm resources. The classes contain extensive assertion and verification mechanisms to ensure the implementations correctness by testing the tree invariants.
The main B+ tree implementation can be found in doxygen stx/btree.h or with plain text comments btree.h.
Special interest was put into performing a speed comparison test between the standard red-black tree and the new B+ tree implementation. The speed test results are interesting and show the B+ tree to be significantly faster.
Enhancements:
- This release introduces the demonstration program wxBTreeDemo.
- This program draws illustrations of the B+ trees constructed by the STX B+ Tree template classes.
- It allows the user to select different types of B+ tree instantiations: integer or string keys and different slot numbers.
- The user may insert and erase key/data pairs from the tree and run different search operations.
- The demo program uses the cross-platform wxWidgets toolkit and can be compiled on Linux, Windows, and Mac OS X.
Download (0.36MB)
Added: 2007-05-15 License: LGPL (GNU Lesser General Public License) Price:
548 downloads
idioskopos 0.4.1
idioskopos is a C++ library that simplifies the addition of object reflection and introspection. more>>
idioskopos (Greek: idio- inward, within, private; -skopos look, aim, target) is a C++ library that simplifies (hopefully) the addition of object reflection and introspection.
There are numerous libraries that provide object introspection, but are generally part of some framework such as:
Glibs gobject
Gtkmms Glib::Object
VCFs object class
QTs introspective objects
PUMA
OpenC++
et. al.
Enhancements:
- This release features improved documentation, a few new features, and a little code cleanup.
- The constructors of introspectable objects and properties now have an optional slot that, if provided, will automatically connect to the changed signal.
- Because of this change, the ordering of the construction parameters has changed from a container-name-value sequence to name-value-container.
<<lessThere are numerous libraries that provide object introspection, but are generally part of some framework such as:
Glibs gobject
Gtkmms Glib::Object
VCFs object class
QTs introspective objects
PUMA
OpenC++
et. al.
Enhancements:
- This release features improved documentation, a few new features, and a little code cleanup.
- The constructors of introspectable objects and properties now have an optional slot that, if provided, will automatically connect to the changed signal.
- Because of this change, the ordering of the construction parameters has changed from a container-name-value sequence to name-value-container.
Download (0.59MB)
Added: 2007-01-11 License: LGPL (GNU Lesser General Public License) Price:
1017 downloads
Davenport 0.9.11
Davenport is a servlet providing WebDAV-based access to a Windows/Samba network. more>>
Davenport project is a servlet which provides a WebDAV gateway to SMB shared resources. Typical usage would be to provide web-based read and write access to Windows shared drives.
WebDAV clients, such as Windows "Web Folders" can copy files to and from the shares over HTTP. Non-WebDAV-capable web browsers can also access the network, downloading files from shared folders in a seamless fashion.
Users access shared resources using their Windows domain username and password, so no account configuration is typically needed. When run over HTTPS, Davenport provides a secure means of accessing internal shared drives over the internet without requiring a VPN.
Installation
The binary distribution of Davenport is provided preinstalled in a standalone Jetty Servlet container. This is distributed in zip and gzipped tar archives for deployment on a variety of platforms; it is also available as a Linux RPM install (tested on Fedora Core 2, but should be portable to most other distributions).
Zip/Tar Installation
Installation is fairly straightforward:
1. Expand the .zip or .tgz archive (preserving directory structure).
2. Configure the deployment descriptor.
RPM Installation (Linux)
1. Install the RPM:
rpm -Uhvf davenport-x.x.x-1.rpm
2. Configure the deployment descriptor.
By default, Davenport will be installed to "/opt/davenport".
Getting started
Before starting, make sure you have tailored the deployment descriptor to your environment. After configuration is complete, the Davenport container is ready be started. The simplest way to do this is to run "java -jar start.jar" in the Davenport root directory. Likewise, executing "java -jar stop.jar" will stop the container. On the Windows platform, double-clicking the .jar files should launch them as well.
After the container has been started, it should be possible to browse SMB resources using Davenport. To list the shares on an SMB server "smbserver" you would enter into your web browser:
http://davserver:8080/smbserver/
"davserver" is the server on which Davenport is running (by default, the container will run on port 8080).
This will list all shares on the "smbserver" server; by clicking one of the shares, files will be listed, and so forth.
You can drag and drop files to and from the Web Folder, create and delete directories, and perform other file operations. You can open a URL as a Web Folder directly by using the "File -> Open" menu in Internet Explorer, and selecting "Open as Web Folder".
Enhancements:
- Updated bundled jCIFS to version 1.2.13.
- Updated bundled Jetty to version 4.2.27.
- Added support for GZIP and Deflate compression.
<<lessWebDAV clients, such as Windows "Web Folders" can copy files to and from the shares over HTTP. Non-WebDAV-capable web browsers can also access the network, downloading files from shared folders in a seamless fashion.
Users access shared resources using their Windows domain username and password, so no account configuration is typically needed. When run over HTTPS, Davenport provides a secure means of accessing internal shared drives over the internet without requiring a VPN.
Installation
The binary distribution of Davenport is provided preinstalled in a standalone Jetty Servlet container. This is distributed in zip and gzipped tar archives for deployment on a variety of platforms; it is also available as a Linux RPM install (tested on Fedora Core 2, but should be portable to most other distributions).
Zip/Tar Installation
Installation is fairly straightforward:
1. Expand the .zip or .tgz archive (preserving directory structure).
2. Configure the deployment descriptor.
RPM Installation (Linux)
1. Install the RPM:
rpm -Uhvf davenport-x.x.x-1.rpm
2. Configure the deployment descriptor.
By default, Davenport will be installed to "/opt/davenport".
Getting started
Before starting, make sure you have tailored the deployment descriptor to your environment. After configuration is complete, the Davenport container is ready be started. The simplest way to do this is to run "java -jar start.jar" in the Davenport root directory. Likewise, executing "java -jar stop.jar" will stop the container. On the Windows platform, double-clicking the .jar files should launch them as well.
After the container has been started, it should be possible to browse SMB resources using Davenport. To list the shares on an SMB server "smbserver" you would enter into your web browser:
http://davserver:8080/smbserver/
"davserver" is the server on which Davenport is running (by default, the container will run on port 8080).
This will list all shares on the "smbserver" server; by clicking one of the shares, files will be listed, and so forth.
You can drag and drop files to and from the Web Folder, create and delete directories, and perform other file operations. You can open a URL as a Web Folder directly by using the "File -> Open" menu in Internet Explorer, and selecting "Open as Web Folder".
Enhancements:
- Updated bundled jCIFS to version 1.2.13.
- Updated bundled Jetty to version 4.2.27.
- Added support for GZIP and Deflate compression.
Download (4.83MB)
Added: 2007-03-09 License: LGPL (GNU Lesser General Public License) Price:
964 downloads
EasyBeans 1.0 Milestone 6
EasyBeans is an implementation of an EJB3 container. more>>
EasyBeans is an implementation of an EJB3 container. EasyBeans library aims to provide an implementation for the full EJBCore API.
For the persistence matter, it relies on Hibernate EJB 3 or, in upcoming versions, on Speedo, the ObjectWebs JDO implementation.
it is divided in three parts :
- Core part
- Persistence part (Which is the persistence provider)
- Simplified specification : it contains new features.
Enhancements:
- EAR deployment (and undeployment) is now supported in JOnAS, Tomcat, and Jetty.
- For JOnAS, if the EAR contains EJB 2.1 components, they will be deployed in the EJB 2.1 container.
- The WAR files of the EAR will be deployed in the Tomcat or Jetty Web container.
- An ear example is provided in this version.
- The timer service which is based on the Quartz component is supported.
- A timer example is provided.
- OpenJPA is supported as a persistence provider.
<<lessFor the persistence matter, it relies on Hibernate EJB 3 or, in upcoming versions, on Speedo, the ObjectWebs JDO implementation.
it is divided in three parts :
- Core part
- Persistence part (Which is the persistence provider)
- Simplified specification : it contains new features.
Enhancements:
- EAR deployment (and undeployment) is now supported in JOnAS, Tomcat, and Jetty.
- For JOnAS, if the EAR contains EJB 2.1 components, they will be deployed in the EJB 2.1 container.
- The WAR files of the EAR will be deployed in the Tomcat or Jetty Web container.
- An ear example is provided in this version.
- The timer service which is based on the Quartz component is supported.
- A timer example is provided.
- OpenJPA is supported as a persistence provider.
Download (9.4MB)
Added: 2007-05-17 License: LGPL (GNU Lesser General Public License) Price:
892 downloads
chemicalInventory 20070120
chemicalInventory is an intelligent tool for managing chemical inventories. more>>
Chemicalinventory is a web application that manage the chemical stock in a laboratory-, production- or other facilities, where chemicals must be safely stored, easily found and tracked. chemicalInventory solution is currently productive at The Danish University of Pharmaceutical Sciences
Main features:
- Search facility, with textual, structure and substructure search.
- Check in and out of containers.
- Multi-level location management.
- Label print with container information.
- Administration module for all data.
- History tracking of essential data.
- Report generation - on screen and paper.
- Sample Module - track analytical data.
- Share data cross organisation.
- Batch module. Link samples in batches/projects.
- Link to external ressources, msds
- ... and lots more..
Chemicalinventory is an open source project. The application is free*. Specific components of this application is licenced by third parties, and may require separate licence.
<<lessMain features:
- Search facility, with textual, structure and substructure search.
- Check in and out of containers.
- Multi-level location management.
- Label print with container information.
- Administration module for all data.
- History tracking of essential data.
- Report generation - on screen and paper.
- Sample Module - track analytical data.
- Share data cross organisation.
- Batch module. Link samples in batches/projects.
- Link to external ressources, msds
- ... and lots more..
Chemicalinventory is an open source project. The application is free*. Specific components of this application is licenced by third parties, and may require separate licence.
Download (30.7MB)
Added: 2007-02-17 License: GPL (GNU General Public License) Price:
979 downloads
JOPE Application Server 1.2.2/1.3.6
JOPE is an implementation of the SOPE server and concepts in Java 1.5. more>>
JOPE is an implementation of the SOPE server and concepts in Java 1.5. JOPE Application Server provides (yet another) templating engine modelled after the WebObjects one, as well as database access libraries and other features.
JOPE applications can be deployed into a Servlet container or run standalone using the Jetty HTTP server.
Enhancements:
- This release has various improvements in the database layer plus several convenience enhancements in the template parser.
<<lessJOPE applications can be deployed into a Servlet container or run standalone using the Jetty HTTP server.
Enhancements:
- This release has various improvements in the database layer plus several convenience enhancements in the template parser.
Download (0.53MB)
Added: 2007-06-10 License: GPL (GNU General Public License) Price:
866 downloads
Bastard 34c
Bastard is virtual server oriented patchset, containing essential elements for building virtual server container machines. more>>
Bastard is virtual server oriented patchset, containing essential elements for building virtual server container machines.
It includes a CTX-VS patch, squashfs for creating a small template server, lufs and bme for easily creating overlayed filesystems on top of the template, and honeynet- inspired extensions to enhance monitoring of hosted servers.
Bastard project also includes VPN extensions like OpenSWAN, MPPE, and CIPE to enable direct access to hosted virtual servers in situations where IPs are scarce.
Enhancements:
- The softirq changes were backed off.
- The openwall patch was updated.
<<lessIt includes a CTX-VS patch, squashfs for creating a small template server, lufs and bme for easily creating overlayed filesystems on top of the template, and honeynet- inspired extensions to enhance monitoring of hosted servers.
Bastard project also includes VPN extensions like OpenSWAN, MPPE, and CIPE to enable direct access to hosted virtual servers in situations where IPs are scarce.
Enhancements:
- The softirq changes were backed off.
- The openwall patch was updated.
Download (MB)
Added: 2007-01-03 License: GPL (GNU General Public License) Price:
1025 downloads
Secleted [ 0 ] software to compare
Copyright Notice:
Software piracy is theft, Using crack, password, serial numbers, registration codes, key generators is illegal and prevent future software development. The above supportsoft container search only lists software in full, demo and trial versions for free download. Download links are directly from our mirror sites or publisher sites, torrent files or links from rapidshare.com, yousendit.com or megaupload.com are not allowed
