Search Results for "data structures" - Page 5

About Collection of data structures and operations that have been (and will continue to be) implemented in response to need. Container interface, naming and behavior is similar to the STL containers. Algorithm interface is in the spirit of the C standard library search and sort functions. Compatibility ISO C99, ISO C++98, ISO C++11. Performance These are designed to be general purpose, and reasonably efficient in most circumstances.

Calculates Natural Product(NP)-likeness of a molecule, i.e. the similarity of the molecule to the structure space covered by known natural products. NP-likeness is a useful criterion to screen compound libraries and to design new lead compounds. Maven dependancy: <dependency> <groupId>uk.ac.ebi.cheminformatics</groupId> <artifactId>NP-Likeness</artifactId> <version>2.1</version> </dependency> Required repository: <repositories> ...

...Because these maps are an individual implementation depending on the graph datastructure used, they are more memory efficient than using a Java HashMap. Currently spargel is in its early stages, but will soon support more tasks. As now, implemented are: * Adjecency graph data structures * Algorithms: SSSP, APSP, Traversal, Min-Cut, Max-Flow, Many types of finding Components * Creating sub graphs, vertice and edge maps that use a function to implement their mapping. Spargel is released under GPLv3

XTarget is an Groovy Library for automated editing of small XML Databases with Groovy scripts. It focuses on simultaneous editing of data, including structures like lists and maps, and linking between various XML files.

Java library for operations with Iterables and other data structures in functional way.

A template serialization engine for C++. Provides an easy to use method of describing data structures to be serialized/unserialized. You don't need to remember which members are to be serialized/unserialized. The engine will do this for you.

Cognity is an object-oriented neural network library for Java. It's goal is to provide easy-to-use, high level architecture for neural network computations along with reasonable performance.

This project provides a set of libraries written in Java to easily manipulate Multi-Criteria Decision Aid (MCDA) concepts, especially related to outranking methods, and XMCDA files.

Development in Python (be it website or an App development or implementation of an automation framework) always involves certain operations like handling db queries, operations on web, development of data structures, windows operations (handing services, registries), logging and many more... What, if you have these libraries handy with you all the time? Just import and start using them.. In comes PyLibrary.. PyLibrary is a collection of infrastructure libraries that aid faster development in Python. These libraries are well documented, provide robust error handling and are frequently updated/tested for improvements. ...

A python library for parsing and building of data structures (binary or textual). It is based on the concept of defining data structures in a declarative manner, where complex structures are composed of a hierarchy of simpler ones.

Tentacles is a Object-Relational Mapping (ORM) written in Python. It's main concept is to manipulate stored datas as you do for python data structures.

Geom4J is a computational geometry library for Java. It contains implementation of the most important computational geometry data structures and algorithms coded in pure Java, designed for ease of use and optimized for performance.

SPLITNEURON is a completely new approach to large-scale, biologically plausible, neural-network simulation library based on data structures and methods directly coded into database and conceived to explicitly share load on multiple machines.

A librairie devoted to backtrackable data structures

C ADT(Abstract Data Types) is a simple template library written in C which implements commonly used abstract data structures, such as linked lists, trees, queues, stacks, hashes, graphs and associated algorithms.

An implementation of data structures in C, for now there is a a dynamic list and stack, the rest are to come.

PET is a C++ library that implements generic regular path expressions. It provides a set of classes and overloaded operators that allow the programmer to define regular path expressions over user-defined data structures using solely the GCC compiler

MicroWSS is a lightweight web services server/toolkit written in Java. Its purpose it to allow for simple development and deployment of services that use SOAP 1.2 and WSDL. It handles everything relating to XML, so that you only need to deal with Java.

Python API for accessing 4chan image boards. Provides posting, reading, and tripcoding capabilities.

The MemSL for C and C++ includes a complete data structures/collection classes library, memory tracing, memory debugging, logging, entry/exit tracing, exception handling, definable memory handlers, built-in threads support and much more.

The goal: to provide implementations of as many algorithms (sorting, searching, ...) and data structures (lists, trees, ...) as possible, accompanied by discussion of big O run time and memory limits and references to sources of further study.