Search Results for "b-tree implementation"

GnuCOBOL (formerly OpenCOBOL) is a free, modern COBOL compiler. GnuCOBOL implements a substantial part of the COBOL 85, X/Open COBOL and newer ISO COBOL standards (2002, 2014, 2023), as well as many extensions included in other COBOL compilers (IBM COBOL, MicroFocus COBOL, ACUCOBOL-GT and others). GnuCOBOL translates COBOL into C and internally compiles the translated code using a native C compiler. Build COBOL programs on various platforms, including GNU/Linux, Unix, Mac OS X, and...

popt4jlib is an open-source parallel optimization library for the Java programming language supporting both shared memory and distributed message passing models. Implements a number of meta-heuristic algorithms for Non-Linear Programming, including Genetic Algorithms, Differential Evolution, Evolutionary Algorithms, Simulated Annealing, Particle Swarm Optimization, Firefly Algorithm, Monte-Carlo Search, Local Search algorithms, Gradient-Descent-based algorithms, as well as some well-known...

We implement an open source conflict resolution framework that consists of a user-space C application that automatically resolves firewall rules anomalies, and b) a generic tree (called policy tree), implemented as a Linux kernel module which maintains the resolved firewall rules and enables the necessary hooks to netfilter for matching incoming (or outgoing) network packets. Tree-based data structures offer improved efficiency compared to traditional access control lists (e.g. iptables or nftable maps), especially for large systems with a huge number of rules. ...

An extension of the class javax.swing.JTree with a lot of improvements and utilities.

Arbaro is an implementation of the tree generating algorithm described in Jason Weber & Joseph Penn: Creation and Rendering of Realistic Trees

drvq is a C++ library implementation of dimensionality-recursive vector quantization, a fast vector quantization method in high-dimensional Euclidean spaces under arbitrary data distributions. It is an approximation of k-means that is practically constant in data size and applies to arbitrarily high dimensions but can only scale to a few thousands of centroids.

Provides XML Data Binding for C++ through XML Schema. Features: a) xsd2cpp - generates C++ XML Objects(X/O mapping) b) XML I/O ie. marshalling-unmarshalling(serialization-deserialization) c) roundtrip retains processing instructions and comments

Stand-alone Java library implementing parser/formatter/comparator/validator for JSON/XML-like text formats oriented on JSON-like object model (list,map,scalar + reflection). Library is designed to maximize adaptivity via set of extendable modules.

Semantic query optimization (SQO) is the process of finding equivalent rewritings of an input query given constraints that hold in a database instance. We present a Chase & Backchase (C&B) algorithm strategy that generalizes and improves on well-known methods in the field. The implementation of our approach, the pegasus system, outperforms existing C&B systems an average by two orders of magnitude. This gain in performance is due to a combination of novel methods that lower the complexity in practical situations significantly.

The ordered_tree class template is an implementation in C++ of the ordered tree data structure. It implements breadth, depth search, as well as child and leaf iterators. A single header file is needed to use the code.

CIVx is a free advanced PIV (Particle Imaging Velocimetry) code, developped in Fortran and C++. Input : pair of png images. Output : velocity field in NetCDF format. It is used by the UVMAT Matlab code develloped at LEGI.

Open source C++ implementation of the radix tree data structure, detailed here: http://en.wikipedia.org/wiki/Radix_tree

The EURP OntoLookup is a CREOLE plugin for GATE http://www.gate.ac.uk/ which uses an OWL ontology for lookup. It has a very fast implementation based on a tree of hash maps.

B-Trust eDoc is a program built on top of LibDigiDoc a free implementation of the OpenXAdES standard for signing/encrypting files using smartcard tokens. It also contains Openssl and PKCS11 wrapper classes in C++ which might be useful to developers.

Red/Black Tree implementation. Port of the sourceforge libredblack library to C#. The package also consists of mutlitree (tree with non-unique key) and tree with quick direct access to items by the index.

Implementation of various mathematical curves that define themselves over a set of control points. The API is written in Java. The curves supported are: Bezier, B-Spline, Cardinal Spline, Catmull-Rom Spline, Lagrange, Natural Cubic Spline, and NURBS.

VICS, Verification of an Implementation Conforming to its Specification, aims to check the correctness of a refinement of the B formal method (http://www-lsr.imag.fr/B/Bsite-pages.html). More info on http://vics.sourceforge.net

Python implementation of Tree Regular Expressions for XML (TREX), an XML schema language

A basic implementation of an AVL Tree in PHP 5.

This project contains the material discussed in my PhD dissertation, entitled "Hardware/Software Design of Dynamic Real-Time Schedulers for Embedded Multiprocessor Systems." The source code is available in the SVN repository: https://sourceforge.net/p/xrt/code/6/tree/trunk/ and consists in two folders: 1) /X-RT : A portable multiprocessor scheduling framework supporting scheduling periodic real-time tasks according to the G-EDF (Global Earliest Deadline First) scheduling platform. Current version supports major POSIX systems (Linux, QNX). 2) Hardware_GEDF_Scheduler: is a hardware implementation in VHDL (targeting FPGAs) of the G-EDF multiprocessor scheduling policy.