Search Results for "c memory allocator"
Sort By:
Showing 43 open source projects for "c memory allocator"
View related business solutions-
Ship Agents FasterGemini Enterprise Agent Platform lets you rapidly build, scale, govern and optimize production-ready agents grounded in your organization's data. The platform enables developers to build custom or pre-built agents for virtually any use case. New customers get $300 in free credits.
-
MongoDB Atlas runs apps anywhereMongoDB Atlas gives you the freedom to build and run modern applications anywhere—across AWS, Azure, and Google Cloud. With global availability in over 115 regions, Atlas lets you deploy close to your users, meet compliance needs, and scale with confidence across any geography.
-
1
LZ4
Extremely fast compression algorithm
LZ4 is lossless compression algorithm, providing compression speed > 500 MB/s per core (>0.15 Bytes/cycle). It features an extremely fast decoder, with speed in multiple GB/s per core (~1 Byte/cycle). A high compression derivative, called LZ4_HC, is available, trading customizable CPU time for compression ratio. LZ4 library is provided as open-source software using a BSD license. This benchmark simulates simple "static content transfer" scenario such as OS Kernel compression or video game's... -
2
TBOX
A glib-like multi-platform c library
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... -
3
Dynamic Arrays and Hashes (Delphi, C++)
Incredibly fast Dynamic Arrays classes written in Delphi and C++
(New version 1.05 is released) Dynamic Arrays is a set of useful incredibly fast classes for data manipulating in memory. Flexible memory control, functionality that standard containers do not have, fast operations (assembler implementation for x86 and x64 platforms). Available for Delphi all latest versions and for C++. Powerful Hash and Double Hash classes to work with pairs of values (key and value) and with values that have two keys (key1, key2, value). ... -
4
L2
A BST, B-tree and trie data structures library.
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/ -
$300 Free Credits for Your Google Cloud ProjectsLaunch your next project with $300 in free Google Cloud credits—no strings attached. Test, build, and deploy without risk. Use your credits across the entire Google Cloud platform to find what works best for your needs. After your credits are used, continue with always-free tier services. Only pay when you're ready to scale. Sign up in minutes and start exploring.
-
5
Elite Planet Browser
Browse through the planets of the Elite game on various Z80 machines
...But those of you who know and love the classic computer game "Elite" will maybe like it. The "Elite Planet Browser" is a little program for various classic Z80-based computers, written in C using the z88dk compiler (www.z88dk.org). It allows you to browse through the planet data of the Elite game on many old Z80-based computers. When the original game came out in 1984, many people wondered how it is possible to have detailed data of so many planets in the 16K RAM memory of the BBC Micro. The trick behind this is a clever algorithm based on a pseudo-random number sequence, and this algorithm is reproduced here in this program. ... -
6
PetoronHash2
PH2 Permutation-based cryptographic post-quantum hash library with duplex construction (C++20)
PetoronHash2 (PH2) is a standalone ARX-based sponge construction that combines: A 4096-bit internal permutation core A sponge/duplex architecture with explicit capacity separation An extendable-output function (XOF) Memory-hard (HARD) and burn (BURN) modes A structured tagged absorb scheme A parameterized architecture suitable for hashing, KDF, and stress-oriented derivation PH2 is designed as a wide-state cryptographic primitive with explicit domain separation and configurable output... -
7
ccgsl
Use Gnu Scientific Library as if it were writtem in C++.
The ccgsl provides simple C++ wrappers for the GNU Scientific Library. It uses Java-like shared-pointer classes in place of structs to avoid direct memory allocation/freeing and to work better with the STL. It lets you construct functions for optimisation, root-finding and the like from C++ member functions, making it easier to integrate with existing C++ code. -
8
libtdata
Libtdata is a C library implements trees, index allocation and bit ops
Libtdata is a small and portable C library implements a set of various search data structures, bit operations and index allocation. -
9
STXXL is an implementation of the C++ standard template library STL for external memory (out-of-core) computations, containers, and algorithms that can process huge volumes of data that only fit on disks.
-
Our Free Plans just got better! | Auth0You asked, we delivered! Auth0 is excited to expand our Free and Paid plans to include more options so you can focus on building, deploying, and scaling applications without having to worry about your security. Auth0 now, thank yourself later.
-
10
bps
A B-tree based associative array library.
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. -
11
LBSP
Real-Time Processing Library for OSHW Biomedical Sensors
Applications involving data acquisition from sensors need samples at a preset frequency rate, the filtering out of noise and/or analysis of certain frequency components. We propose a novel software architecture based on open-software hardware platforms which allows programmers to create data streams from input channels and easily implement filters and frequency analysis objects. The performances of the different classes given in the size of memory allocated and execution time (number of... -
12
cds
Concurrent Data Structure library
CDS (Concurrent Data Structures) is a C++ template library of lock-free and fine-grained lock-based algorithms. It contains a collection of concurrent data structures: queues, stacks, sets, maps, etc, and safe memory reclamation schema for concurrent containers - Hazard Pointer and user-space RCU. See doxygen doc http://libcds.sourceforge.net/doc/cds-api/index.html. The source code repo for libcds 2.x has been moved to https://github.com/khizmax/libcds -
13
The Edge Machine Learning library
Machine learning algorithms for edge devices
Machine learning models for edge devices need to have a small footprint in terms of storage, prediction latency, and energy. One instance of where such models are desirable is resource-scarce devices and sensors in the Internet of Things (IoT) setting. Making real-time predictions locally on IoT devices without connecting to the cloud requires models that fit in a few kilobytes.These algorithms can train models for classical supervised learning problems with memory requirements that are... -
14
CryptoLibraryRefImpl
encapsulates secure crypto algorithms for easy use
This library exposes security functionality to the programmer, such as random number generation, hashing, salted hashing, message authentication code, symmetric encryption, asymmetric encryption, hybrid encryption, digital signature and in-memory protection. The library is accompanied by a sophisticated reference implementation, that demonstrates how to make use of the CryptoLibrary. -
15
OptimC
OptimC - Optimization / Unconstrained Minimization Library in ANSI C
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. -
16
libcutils
Some Useful C-Utilities
Libcutils provides a self-contained set of fundamental routines which are essential to basically any Unix utility or daemon application written in C. 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 -
17
BudgetedSVM
BudgetedSVM: A C++ Toolbox for Large-scale, Non-linear Classification
We present BudgetedSVM, a C++ toolbox containing highly optimized implementations of three recently proposed algorithms for scalable training of Support Vector Machine (SVM) approximators: Adaptive Multi-hyperplane Machines (AMM), Budgeted Stochastic Gradient Descent (BSGD), and Low-rank Linearization SVM (LLSVM). BudgetedSVM trains models with accuracy comparable to LibSVM in time comparable to LibLinear, as it allows solving highly non-linear classi fication problems with millions of... -
18
DDMTestbed
An independent Data Distribution Management testbed
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. -
19
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".
-
20
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...
-
21
libgostl
variant of STL extension
small C++ Library providing some classes to extend STL: singletons, cross-platform threads & synchronization, thread pool, memory pool, custom allocators, small unicode support, logging & diagnostic, and so on. -
22
The SNOMP Library
SNOMP (SNOMP is Not OpenMP) is a library for semi-shared memory parall
SNOMP (SNOMP is Not OpenMP) is a library for semi-shared memory parallelization. -
23
-
24
-
25
A generic implementation of STL containers and some STL algorithms. The main intent is no make this STL implementation to work with any kind of pointers defined by allocator classes, e.g. memory_mgr::offset_ptr.
