Search Results for "pointer"

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. It also provides C++ exceptions.

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.

...The core idea is to build an automaton from a dictionary of patterns, then stream through input text to emit matches with minimal overhead. By using a double-array trie representation, the project emphasizes performance and memory efficiency compared to simpler pointer-heavy trie structures, which can matter a lot for large dictionaries or latency-sensitive services. This makes it a strong fit for tasks like content filtering, entity/term spotting, dictionary-based annotation, or high-throughput log/text processing. In short, it’s a specialized, speed-focused library for industrial-strength multi-keyword matching in Java.

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

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

A C++ RAII ( Resource Allocation Is Initialization ) implementation of an automatic pointer/reference. Pointable/Referenced objects are handled in a manner similar to Python. Strives to have the simplest syntax possible.