977 projects tagged "Apache 2.0"
google-rfc-2445 is a Java implementation of RFC 2445 recurrence rules. RFC 2445 describes a scheme for calendar interoperability. This project implements core parts of RFC 2445, including a parser for recurrence rules and date lists and a mechanism for evaluating recurrence rules.
The peaberry project is an extension library for Google-Guice that supports dependency injection of dynamic services. It provides OSGi integration out of the box, and has plug-in support for other registry-based service frameworks. It ships as an OSGi bundle that can be dropped into any R4 framework, such as Apache Felix or Eclipse/Equinox. You can also use peaberry outside of OSGi.
The TIGL Geometry Library can be used for easy processing of geometric data stored inside CPACS data sets. TIGL offers query functions for the geometry structure. These functions can be used, for example, to detect how many segments are attached to a certain segment, which indices these segments have, or how many wings and fuselages the current airplane configuration contains. This functionality is necessary because TIGL targets not only the modeling of simple wings or fuselages but also the description of quite complicated structures with branches or flaps. The library uses the OpenCASCADE software to represent the airplane geometry by B-spline surfaces in order to compute surface points and also to export the geometry in the IGES/VTK format. The library provides external interfaces for C, C++, Python, Java, and FORTRAN.
LdapTemplate is a framework to simplify LDAP programming in Java, built on the same principles as Spring Jdbc. The LdapTemplate class encapsulates all the plumbing work involved in traditional LDAP programming, such as creating Contexts, looping through NamingEnumerations, handling Exceptions, and cleaning up resources. This leaves the programmer free to handle the important stuff: where to find data (DNs and Filters) and what do do with it (map to and from domain objects, bind, modify, unbind, etc.).
Amiba is a Gene Expression Programming (GEP) framework for Java. GEP is, like genetic algorithms, a branch of evolutionary computing. The framework separates the process of evolution from the process of interpretation of the chromosome, allowing the use of various schemes. For example, graphs may be used as terminals and graph operations as operators in the chromosome instead of the usual double precision numbers. It implements mutation, transposition, and recombination. Options and rates are easily configured through an XML file. A mechanism to load fitness cases in bulk is also provided.