Search Results for "pointer"
Sort By:
Showing 15 open source projects for "pointer"
View related business solutions-
Easily Host LLMs and Web Apps on Cloud RunRun frontend and backend services, batch jobs, host LLMs, and queue processing workloads without the need to manage infrastructure. Cloud Run gives you on-demand GPU access for hosting LLMs and running real-time AI—with 5-second cold starts and automatic scale-to-zero so you only pay for actual usage. New customers get $300 in free credit to start.
-
AI-generated apps that pass security reviewRetool lets you generate dashboards, admin panels, and workflows directly on your data. Type something like “Build me a revenue dashboard on my Stripe data” and get a working app with security, permissions, and compliance built in from day one. Whether on our cloud or self-hosted, create the internal software your team needs without compromising enterprise standards or control.
-
1
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/ -
2
ringBufU
Ring-Buffer library in C, includes support of multithreading
A Ring-Buffer instance could be used with element types - char - long - long long - void* . Focus is on a hardened SW structure with buffer-instance-pointer check (not very fast but more secure). Some features are globally choosable on compile-time (e.g. switch multithread support off completely to have faster access). Note: User Interface is for Test and Tutor Code only. -
3
JPointerLock
Pointer Lock for Java AWT/Swing
...Call PointerLock.setPointerLock(Window, boolean) on the AWT EDT when you want to lock or unlock the pointer. This library and the included native library loader are released under the Unlicense and come with absolutely no warranty. See https://unlicense.org/ for more information. -
4
gatelib
A multiplatform library to program in C++ like in an hi-level language
-
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.
-
5
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. -
6
test-tlb
Stupid memory latency and TLB tester
...By timing tight loops and varying parameters, the program reveals step-changes in latency that map to cache lines, page sizes, and TLB coverage. It is intentionally minimal so you can modify page sizes, strides, or pointer-chasing strategies to run experiments on different machines and kernels. The code is useful for teaching, hardware bring-up, or validating assumptions about huge pages and NUMA placement. Rather than providing a plotting framework, it prints timings that you can collect and graph with external tools to visualize cache/TLB boundaries. -
7
Clue is an experimental C compiler that generates code for high-level dynamic languages such as Lua, Javascript, Perl5 and Common Lisp, as well as non-dynamic languages like C and Java. It supports the complete ANSI standard, including pointer arithmetic
-
8
Cello
Higher level programming in C
...I made Cello as a fun experiment to see what C looks like hacked to its limits. As well as being a powerful library and toolkit, it should be interesting to those who want to explore what is possible in C. I recommend reading A Fat Pointer Library to get an overview of how Cello works.You can also peek at the source code, which I'm told is fairly readable, or ask me any questions you like via e-mail. -
9
Simple Dynamic Strings
Simple Dynamic Strings library for C
...The library was originally used internally in Redis, but pulled out as a standalone project to allow any C project to benefit from its features. SDS strings maintain metadata (length, allocation size) just before the pointer returned to the user, while still being compatible with standard C string APIs (null-terminated). They enable common operations like concatenation, formatted append, efficient growth and trimming, and safe binary data handling. The design emphasises simplicity, compatibility, performance and minimal overhead: you still get a C-style char * string pointer, but you also get length tracking, safe memory management, and higher-level string operations. ... -
Run Any Workload on Compute Engine VMsCompute Engine delivers high-performance virtual machines for web apps, databases, containers, and AI workloads. Choose from general-purpose, compute-optimized, or GPU/TPU-accelerated machine types—or build custom VMs to match your exact specs. With live migration and automatic failover, your workloads stay online. New customers get $300 in free credits.
-
10
YSignalSlot
Header only c++ signal slot mechanism implemantation
.... - It uses meta programming methods for “static for loop” and “static if”. - Signals can be used nested. - Receivers can be “this” pointer. - It is free and LGPL licensed. - It uses C++11 features. -
11
libcontc
Container library in C.
...Performance These are designed to be general purpose, and reasonably efficient in most circumstances. Notes The biggest problem with these is type safety due to the use of pointer to void for type abstraction. This code is intentionally spartan. With the exception of a handful of assertions placed as an aid to debugging for the most common or fatal errors (underflow in pop operations, allocation failures), this library makes no attempt to protect itself. Please read 'algo' function documentation. Some of the functions have different behavior than the standard library equivalents. -
12
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...
-
13
Portable PRECISE tracing collector for C++ (as oposed to popular Hans Boehm CONSERVATIVE collector). It should not mess other data with collected pointers ! And thats a feat! Smieciuch defines smart pointer classes which behave like normal C/C++ pointers
-
14
CSpe is a library allowing partial function application in C (kindof like closures in ML languages) : From a function to be specialized and some of its arguments, it dynamically generates a new function pointer, which can then be called transparently
-
15
This program makes it possible to read a file produced by the option "-fdump-tree-original" which replaces the old "-fdump-ast-<I>switch</i>". The goal is to automatically annotate C code for SPLint (actually we focus on possibly null pointer)
- Previous
- You're on page 1
- Next
