Search Results for "allocator"
Sort By:
Showing 11 open source projects for "allocator"
View related business solutions-
Build Agents and Models on One PlatformGemini Enterprise Agent Platform is Google Cloud's comprehensive platform for developers to build, scale, govern, and optimize agents and models. Choose from Google's most advanced models and third-party models like Anthropic's Claude Model Family.
-
$300 Free Credits to Build on Google CloudPut your $300 in credit toward real workloads, then keep building with free monthly usage for 20+ products. No commitment and no charge until you upgrade.
-
1
async-std
Async version of the Rust standard library
async-std makes async programming foundations easy and approachable. Built-in Rust for speed and safety. -
2
VulkanSceneGraph
Vulkan & C++17 based Scene Graph Project
VulkanSceneGraph (VSG), is a modern, cross-platform, high-performance scene graph library built upon Vulkan graphics/compute API. The software is written in C++17 and follows the CppCoreGuidelines and FOSS Best Practices. The source code is published under the MIT License, with the exception of vulkan.h, used for Vulkan extensions, which is under Apache License 2.0. This repository contains C++ headers and source and CMake build scripts to build the libvsg library. Additional support... -
3
UAP Common Extensions (UCX)
Utilities Library for C
With this library we provide useful data structures and algorithms for common programming tasks in the C language. -
4
minicoro
Single header stackful cross-platform coroutine library in pure C
Minicoro is a single-file library for using asymmetric coroutines in C. The API is inspired by Lua coroutines but with C's use in mind. The project is being developed mainly to be a coroutine backend for the Nelua programming language. The library assembly implementation is inspired by Lua Coco by Mike Pall. -
Train ML Models With SQL You Already KnowBuild and deploy ML models using familiar SQL. Automate data prep with built-in Gemini. Query 1 TB and store 10 GB free monthly.
-
5
Unused
A command line tool to identify unused code
Unused identifies unused code in Rails, Phoenix, and other types of applications, improving developer productivity. By default, unused leverages a different memory allocator called mimalloc. For my local benchmarks, it speeds up execution by a significant amount (which is documented in the commit introducing mimalloc), but currently runs into sporadic issues on Apple M1 devices. If you run into issues with segmentation faults, consider reinstalling unused with the stock Rust allocator. It is strongly recommended you install Universal Ctags to generate tags files. ... -
6
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. -
7
Napa.js
Napa.js, a multi-threaded JavaScript runtime
...Node.js compatible module architecture with NPM support. API for object transportation, object sharing and synchronization across JavaScript threads. API for pluggable logging, metric and memory allocator. Distributed as a Node.js module, as well as supporting embed scenarios. Most of the time, there is no need to build Napa.js. When consuming Napa.js via npm install napajs, npm will first try to download the pre-build binaries for the current platform. -
8
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.
-
9
-
Custom VMs From 1 to 96 vCPUs With 99.95% UptimeLive migration and automatic failover keep workloads online through maintenance. One free e2-micro VM every month.
-
10
STLshm provides an C++ STL Allocator implementation for creating and using STL containers (and any other allocator aware types) in shared memory regions. It supports multiple shared region implementations.
-
11
OS portable common dynamic / static memory allocator for embedded system. Auto-converge, keep track of free chunks list, first-fit allocating principle. All of these are done by only 4-Byte boundary tag in each chunk - Fast & Minimal Memory Fragmentation
- Previous
- You're on page 1
- Next
