Search Results for "c-sharp" - Page 6

Tiny-DSP library contains c sources of a fast, tiny, portable and generic FFT (Fast Fourier transform) and inverse FFT. Supported are all power of two sizes (like 2,4,8,16,32,...) for one and two dimensional floating point arrays.

Small console application written in C to simplify boolean functions with the Quine-McCluskey algorithm

See the new project page: https://nojhan.github.io/paradiseo/ (Archived project page: http://eodev.sourceforge.net/)

..., for the Astra Group which does research about Constraint Programming and related technologies: Water Retention on Magic Squares with Constraint-Based Local Search http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-176018 I 'm posting two solvers in this project. One written in C++ which is the fastest, at least for the heavier objective functions, and a Dynadec Comet solver which lets you easily post new constraints along with the Magic-constraints. Author: Johan Öfverstedt

A portable in-place bitwise binary Fredkin trie algorithm which allows for near constant time insertions, deletions, finds, closest fit finds and iteration. Is approx. 50-100% faster than red-black trees and up to 20% faster than O(1) hash tables.

The Wittgen programming language consists of just two instructions and one special variable name. Wittgen allows you to assign any text string to a variable of any name. It also allows you to retrieve the text assigned to that variable. Lastly, it has a special variable called “Doing Now”. Every execution step consists of retrieving the contents of Doing Now, removing the first assign found in that content and performing that assign. In the course of performing that assign any retrieve...

The EXT Library is set of various useful classes, templates and macros that extend functionality provided by ISO C++ (ext sub-library), standard C and C++ library (lib), to abstract parts of Windows API (win) and access PE file resources (res).

Yet another container library written in C. Originally born as auxiliary library for another project it aims to be simple, dependency-free and lightweight.

The C++-programs simulate : Nondeterministic/Deterministic Multitape Turing & Post Machines, Universal Turing Machine, Turing Machine with faults, failures and recovery.

the c prototyping tools library provides thread-safe linked list, priority queue, hash table, hash list, AVL tree and trie implementations, as well as a thread pool and thread management framework, a tcp and http socket api, and a dbms abstraction layer.

The 'cbear' framework is a set of libraries and common utilities for different programming languages and platforms.

SNOMP (SNOMP is Not OpenMP) is a library for semi-shared memory parallelization.

Tina's Random Number Generator Library (TRNG) is a state of the art C++ pseudo-random number generator library for sequential and parallel Monte Carlo simulations.

Dieser Parser, soll arithmetische Ausdrücke, die als String vorliegen, ausrechnen, bzw. diverse Funktionen darauf anwenden können. Bis jetzt kann er nur Audrücke wie "4^(5+2)-23*4/cos(3)" ausrechnen. er unterstützt auch vergleichsoperatoren

Open Metaheuristic (oMetah) is a library aimed at the conception and the rigourous testing of metaheuristics (i.e. genetic algorithms, simulated annealing, ...). The code design is separated in components : algorithms, problems and a test report generator

A library of standard data structures in C, similar to STL in C++. Includes variable-length arrays, deques, hashtables, avl trees, binary heaps, and many other useful structures, with a simple and intuitive interface.

Provides bitwise, context-based 2nd generation data compression for large FASTQ-based files

SMART (Shape Matching Algorithm Research Tool) enables you to implement 2D and 3D shape matching algorithms as plugins. Plugins can either be implemented in Java or as native plugins, i.e. in C/C++.

General purpose library (and some tools) that allows the construction of recursive deterministic/non-deterministic automaton from non-deterministic settings.

20 SkipList containers for C++ that work with STL. Combines set/map functionality with random access in logn time. One container is a multilist where you can order the same elements in a variety of different ways simultaneously.

Some tools for discussion about algorithms. 1) an evaluating tool for complexity

BlueDS is a library that contains the implementation of frequently used data structures and algorithms in Computer Science. BlueDS is designed to be fast and efficient.

An O(1) memory allocator, which may be used to replace malloc. It's very small and very fast.

This is a general purpose expression evaluator which has abilities to evaluate mathematical expressions having operators: +, -, *, /, < , <=, >, >=, ==, !=, &&, ||. The enhancement to support all the other arithmetic operators is under development.

A C++ API to work with manifold triangle meshes.