Search Results for "pointer"
Sort By:
6 projects for "pointer" with 2 filters applied:
-
Cut Data Warehouse Costs up to 54% with BigQueryBigQuery delivers up to 54% lower TCO than cloud alternatives. Migrate from legacy or competing warehouses using free BigQuery Migration Service with automated SQL translation. Get serverless scale with no infrastructure to manage, compressed storage, and flexible pricing—pay per query or commit for deeper discounts. New customers get $300 in free credit.
-
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
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. It also provides C++ exceptions. -
3
AhoCorasickDoubleArrayTrie
An extremely fast implementation of Aho Corasick algorithm
...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. -
4
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. -
Build AI Apps with Gemini 3 on Vertex AIVertex AI gives developers access to Gemini 3—Google’s most advanced reasoning and coding model—plus 200+ foundation models including Claude, Llama, and Gemma. Build generative AI apps with Vertex AI Studio, customize with fine-tuning, and deploy to production with enterprise-grade MLOps. New customers get $300 in free credits.
-
5
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 -
6
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.
- Previous
- You're on page 1
- Next
