General-purpose, compute-optimized, or GPU/TPU-accelerated. Built to your exact specs.
Live migration and automatic failover keep workloads online through maintenance. One free e2-micro VM every month.
Try Free
$300 Free Credits for Your Google Cloud Projects
Start building on Google Cloud with $300 in free credits. No commitment, no credit card required until you're ready to scale.
Launch your next project with $300 in free Google Cloud credits—no strings attached. Test, build, and deploy without risk. Use your credits across the entire Google Cloud platform to find what works best for your needs. After your credits are used, continue with always-free tier services. Only pay when you're ready to scale. Sign up in minutes and start exploring.
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/
a collection of Vincent Radio {Adrix.NT} C# sources & build projects
includes
- Paged Lists & Iterators Library for C#
- Multi Dimensional Array Library for C#
- MDArray List Manager Library for C#
- Adjacency (List | Matrix) Direct Graph Libs for C#
- Range Check functions
- VRMosaic (WinForms) - with Auto Resolver
also includes
- Source Files
- Visual Studio Build Projects
- Test Applics
have fun
adrixnt@hotmail.it
Paged Lists & Iterators GXS for C++ Sources by Vincent Radio {Adrix.NT
Vincent Radio {Adrix.NT}
presents
Paged Lists & Iterators GXS for C++ Sources
by Vincent Radio {Adrix.NT}
also contains
- Little Docs about Paged Lists (docx, pdf)
- VR Basic Common Utils Sources (Array List ...)
- VR Generic Multi Dim Array Class
- VR Generic MDArray List Mgr Class
- VR Generic Adjacency (List | Matrix) Direct Graph Classes
- VR List Interface with STL Support with some nice implementations (ArrayList, Paged-LIst)
- Env Var Notes for sources
for C++...
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.
Give your IT, operations, and business teams the ability to deliver exceptional services—without the complexity.
Freshservice is an intuitive, AI-powered platform that helps IT, operations, and business teams deliver exceptional service without the usual complexity. Automate repetitive tasks, resolve issues faster, and provide seamless support across the organization. From managing incidents and assets to driving smarter decisions, Freshservice makes it easy to stay efficient and scale with confidence.
BS is a data structures library. It features fixed data size, random access sequences. The sequences are constructed over B-trees. Complexity for most single item operations is about O(logN).
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.