Showing 7 open source projects for "b tree"

View related business solutions
  • Our Free Plans just got better! | Auth0 Icon
    Our Free Plans just got better! | Auth0

    With up to 25k MAUs and unlimited Okta connections, our Free Plan lets you focus on what you do best—building great apps.

    You 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.
    Try free now
  • Ship Agents Faster Icon
    Ship Agents Faster

    Transform your applications and workflows into powerful agentic systems at global scale.

    Gemini Enterprise Agent Platform lets you rapidly build, scale, govern and optimize production-ready agents grounded in your organization's data. The platform enables developers to build custom or pre-built agents for virtually any use case. New customers get $300 in free credits.
    Get Started Free
  • 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/
    Downloads: 0 This Week
    Last Update:
    See Project
  • 2
    VR Paged List for C# and more

    VR Paged List for C# and more

    VR Paged List for C# and more

    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
    Downloads: 0 This Week
    Last Update:
    See Project
  • 3
    VR Paged List GXS for C++ and more ...

    VR Paged List GXS for C++ and more ...

    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++...
    Downloads: 0 This Week
    Last Update:
    See Project
  • 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.
    Downloads: 0 This Week
    Last Update:
    See Project
  • Custom VMs From 1 to 96 vCPUs With 99.95% Uptime Icon
    Custom VMs From 1 to 96 vCPUs With 99.95% Uptime

    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
  • 5
    Creates an index to DBF files using a B+ Tree; Cria um indice para um arquivo DBF usando uma arvore B+; Implementação em C; Baseada em Arquivo;
    Downloads: 0 This Week
    Last Update:
    See Project
  • 6

    bs

    A B-tree based sequence library.

    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).
    Downloads: 0 This Week
    Last Update:
    See Project
  • 7
    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.
    Downloads: 0 This Week
    Last Update:
    See Project
  • Previous
  • You're on page 1
  • Next
Auth0 Logo