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
$300 Free Credits to Build on Google Cloud
New to Google Cloud? Get $300 in credits to explore Compute Engine, BigQuery, Cloud Run, Gemini Enterprise Agent Platform, and more.
Start your next project with $300 in free Google Cloud credit. Spin up VMs, run containers, query petabytes in BigQuery, or build agents with Gemini Enterprise Agent Platform. Once your credits are used, keep building with 20+ always-free tier products including Compute Engine, Cloud Storage, GKE, and Cloud Run functions. No commitment required—just sign up and start building.
Service Invocation Tool generates Java code to implement a declared service facade by calling operations of another service and mapping datastructures between them.
CPPML adds support to C++ for some of the type constructions and pattern matching that are found in ML-based languages like OCaml. CPPML transforms sourcecode back to regular c++ and should work with most compilers.
Ertha is an open source GIS whose main focus is to guarantee easy extensibility and straightforward integration of custom modules. It provides basic geographic rendering and topologic analysis and exposes the main datastructures loaded from shapefiles.
Plexus is a Java library with specifications and implementations for generic graph datastructures. Like the Java Collections Framework, vertices and edges are containers for arbitrary user-defined objects.
C ADT(Abstract Data Types) is a simple template library written in C which implements commonly used abstract datastructures, such as linked lists, trees, queues, stacks, hashes, graphs and associated algorithms.
This is intended to ease the development of web applications using CherryPy (web server) and Elixir (DB access) with python. It will contain structures to easily setup the database structure and populate with data, and to configure the server
Release 1 of BroadBit Test Tool (BTT) offers the power and efficiency of TTCN testing; all software testing engineers can add this platform independent tool it into their toolbox.
Training support is available through training@broadbit.com.
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.
ARMR provides a foundation for creating an efficient in-memory database. Its unique list processing structures simplify programming logic and allow the developer to rapidly sort, group, and select data. Give your app a hypercard like capability.
PET is a C++ library that implements generic regular path expressions. It provides a set of classes and overloaded operators that allow the programmer to define regular path expressions over user-defined datastructures using solely the GCC compiler
MicroWSS is a lightweight web services server/toolkit written in Java. Its purpose it to allow for simple development and deployment of services that use SOAP 1.2 and WSDL. It handles everything relating to XML, so that you only need to deal with Java.
ADTL is an Advanced Datastructures Template Library written in C++. it includs sixteen kinds of stl-like contains, such as fibonacci heap,pariring heap,skew heap,avl tree,red-black tree,splay tree,skip list, unrolled linked list and so on.
A compilation of source code consisting of various DataStructures and Algorithms in C++ alongside with related documentation material. A useful basis for university students, new programmers and people interested in the subject.
RExASTor is a code generator for tree like structures. The user gives it a set of expressions that look a lot like regular expression but for trees and the tool generates Java data-structures for the described trees.
The MemSL for C and C++ includes a complete datastructures/collection classes library, memory tracing, memory debugging, logging, entry/exit tracing, exception handling, definable memory handlers, built-in threads support and much more.
It aims to use flash animations to create an interactive open source website that can be used by students to understand the finer details of datastructures. Please provide your comments and help us improve our project.
The gsuffix library implements serveral algorithms used for enumerative string searches. It incorporates the suffix tree and suffix array datastructures as well as some other methods.
The goal: to provide implementations of as many algorithms (sorting, searching, ...) and datastructures (lists, trees, ...) as possible, accompanied by discussion of big O run time and memory limits and references to sources of further study.
This is an C library implementing the Fast Object and Array (FOA) encoding/decoding method. FOA is designed to be an efficient alternative to XML for exchange of datastructures between applications and/or networked hosts.
Performance oriented datastructures and other programming utilities for Java that are meant to replace those provided by Java. They are designed to provide a solid backbone for any software project.
Developed in Java programming language, this software lets its users view and manipulate hierarchical datastructures represented as a hyperbolic trees.
This library is meant to offer an array of general purpose datastructures and algorithms for a multitude of uses. Each structure must be examined for its specific usefulness to be determined. Please see the API documentation for more details.