Search Results for "pointer"

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.

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.

...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.

...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. ...

.... - 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.

...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.

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...