Search Results for "memory"

...This benchmark simulates simple "static content transfer" scenario such as OS Kernel compression or video game's static assets (text/images/tables/scripts/etc) which loading from Flash Memory / HDD / SSD. In this case, compression time is completely ignored. Because only content developers compress the data at once and usually they don't care about its computational cost. But they always care end user's experience a.k.a. "loading time" and bandwidth. Please pay attention to "LZ4HC -9" which is quite faster than other methods.

TBOX is a glib-like cross-platform C library that is simple to use yet powerful in nature. The project focuses on making C development easier and provides many modules (.e.g stream, coroutine, regex, container, algorithm ...), so that any developer can quickly pick it up and enjoy the productivity boost when developing in C language. It supports the following platforms: Windows, Macosx, Linux, Android, iOS, BSD and etc. Supports file, data, http and socket source. Supports the stream filter...

L2 is a data structures library. Featured are self balancing BSTs and self balancing BST backed sequences, in memory B-trees and B-tree backed sequences, pointer sets, radix and critical bit trees. A few articles about L2 data structures and more here: https://dsxxi.home.blog/

B-tree with a twist pointer set. The ordered set approaches the speed of the fastest unordered, hash table based sets, while using several times less memory.

OptimC is a C software package to minimize any unconstrained multivariable function. The algorithms implemented are Nelder-Mead,Newton Methods (Line Search and Trust Region methods), Conjugate Gradient and BFGS (regular and Limited Memory). Brent method is also available for single variable functions if the bounds are known. Update 06/09/2014 - Nonlinear Squares Implementation [Levenberg-Marquardt Method] Added. Documentation - http://code.google.com/p/optimc/

...The library provides fundamental data structures such as lists, hash-maps, strings and parsing functions for JSON or the typical dot-file based configuration data. The following list summarizes the currently supported functionality: * length delimited instead of NULL terminated strings * memory management based on reference counting * several list processing functions like iterators and map-reduce * support of [Ideal Hash Tries](http://infoscience.epfl.ch/record/64398/files/idealhashtrees.pdf) for highly efficient hash map data structures * parsers for [JSON](http://json.org) data and the text configuration files found in Unix system * doubly linked circular lists for reliable event queues * support for test and debugging of memory management problems such as memory leaks

DDMTestbed is a testbed that allows you to generate random instances and evaluate your proposed resolutive method measuring execution time, memory occupied and distance from the optimal solution. It has been written in C language.

A capsule tree is a general purpose, self-balancing tree data structure for large, ordered, data-sets. It is designed to provide the same characteristics as B-trees and B+trees, but built from the ground up for in-memory usage. In other words, there are no provisions for “slow” I/O cases. The original motivation for this tree was a better backend for memory managers. However, the end result was a new sub-category of trees. The implementation giving here is just one implementation of the new tree sub-category, there can be others. In any case, read the PDF: “Capsule Trees - A Primer”, before delving into the code.

The Safe C Library provides bound checking memory and string functions per ISO/IEC TR24731. These functions are alternative functions to the existing standard C library that promote safer, more secure programming. The ISO/IEC Programming languages — C spec, C11, now includes the bounded APIs in Appendix K, "Bounds-checking interfaces". This latest upload supports building static library, a shared library and a linux kernel module.

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

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

The Boehm-Demers-Weiser conservative garbage collector. The CVS source of the version 7+ collector resided here for a while, but is now on github. Other information and release snapshots are currently at http://hboehm.info/gc

Application level crossed-platform slab allocator implementation: fixed-allocating-time, automanual give memory back to os, address coloring to reduce bus-unbalance.

ARMR provides a foundation for creating an efficient in-memory database. Its unique list processing structures simplify programming logic and allow the developer to rapidly sort, group, and select data. Give your app a hypercard like capability.

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.

Easy To Use Collection Classes For C And C++ The Memory Structures Library (MemSL) has implementations of structures (i.e. AVL trees, threaded trees, dynamic hashing, ...) that are extremely hard to find and far harder to implement.

Origin is a evolver for the programming game Corewars. Part of this project is a modified MARS (Memory Array Redcode Simulator) written in C especialy for evolvers. With SWIG its going to be very easy to use in different languages.

CGL(C Generic Library) is a stl-like library written in pure C.It implements iterators, memory management,generic containers such as list,map, generic algorithms such as sort() and search(),and it can manipulate any types of data.

This is an avl tree implementation. It is implemented in very optimized way and easy to use. It does not force you to use any specific way of memory allocation. It does not use recursive call. It is implemented with emphasis on speed and simplicity.

x86mph is an optimized library with vector, matrix, and vertex helpers (including an own TnL) It also contains memory helpers, and other stuff such as image processing (color inverting, changing bpp) taking advantage of x86's 3DNow!, MMX, and SSE

A library of data structures with a unified API, written in portable C. Lists (uni- and bidirectional), a vector, a hash, a balanced tree (RB or AVL), a heap and tuples. Memory management, clone support, error handling.