Showing 3 open source projects for "hash data"

View related business solutions
  • $300 Free Credits to Build on Google Cloud Icon
    $300 Free Credits to Build on Google Cloud

    New customers can spin up VMs, build with AI, and query data at no cost.

    Put your $300 in credit toward real workloads, then keep building with free monthly usage for 20+ products. No commitment and no charge until you upgrade.
    Start Free
  • 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.
    Start Free
  • 1
    ALEPH-w

    ALEPH-w

    Data structures and Algorithms library

    Aleph-w is a library of data structures and algorithms implemented in and for C++. It contains the main data structures: single and double lists, special arrays (dynamic and of bits), many types of trees: multitrees, binary search trees, avl, red-black, randomized, treaps, splay and other interesting types. Several types of hash tables are implemented: separated chaining, open adressing with linear probing and double function hash; this last one has a garbage colector mechanism that allows to free deleted entries. ...
    Downloads: 2 This Week
    Last Update:
    See Project
  • 2
    aztree library is an implementation of most types of tree data-structure in C language. The library will implement these different type of trees. Binary, Self-balancing binary search, B-trees, Tries, BSP, Non-binary and few used in Computer Graphics
    Downloads: 0 This Week
    Last Update:
    See Project
  • 3
    Converter from Advanced Revelation and Revelation G Linear Hash tables to different formats.
    Downloads: 0 This Week
    Last Update:
    See Project
  • Previous
  • You're on page 1
  • Next