Error to trace to log to deploy. One click. No SSH.
Catch the cause before the pager goes off.
AppSignal links every error to the trace, the trace to the log, the log to the deploy that shipped it.
Free 30 days.
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.
clibutils is collection of common datastructures , This library supports any type, Following are the datastructures currently implemented.
1. Dynamic Array
2. Single Linked List
3. Heap
4. Map
4. Set.
Don't hard-code data-structures for Artificial Intelligence (AI). Evolve them (and control flow) as cycles of arrays in arrays with size constraints based on other array sizes (at specific index) in terms of range, multiply, exponent, or permutation. No working code yet. Whats there now is an extension of GigaLineCompile which would become part of Human AI Net, but there are other projects to finish before I can come back to this one.
This project aims to be a repository of most popular datastructures written in C# language, like stacks, queues, lists, linked lists, heaps, graphs, trees, etc.
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.
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.
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.
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.
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.
An implementation of "k-Way Merging" as described in "Fundamentals of DataStructures" by Horowitz/Sahni. NOTE: This project has been moved to http://code.google.com/p/kway/
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 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.
Alternative approach to minimum redundancy coding (fixed-length) without using tree datastructures. The main advantages are simplicity and flexibility.
An academic project where computer-science students can practice datastructures principles. Based on the famous problem of the labyrinth rat, this application has an engine where you can run your own algorithms to help the robot to get out of the laby.
General Toolkit Library is a general purpose toolkit written in C++ designed to make it easier for developers to produce applications. It provides classes and templates that implement several datastructures like Arrays, Lists, Heaps, Sets, Files, etc.
Automated computer program grading solutions designed for trainings on computer languages, datastructures and algorithms. See http://openjudge.net for details.
An adaptive mini database learns algorithmic operations for data intensive algebraic computational methods within a pervasive computing graph. It also provides generic structures and algorithms as a data fabric.
Some datastructures developed in c++ for the 'Algorithms & DataStructures' exam at the Computer Science Department of the University of Bari by Tafuni Vito & Nicola Perrini.
A library of datastructures with a unified API, written in portable C. Lists (uni- and bidirectional), a vector, a hash, a balanced tree (RB or AVL), a heap and tuples. Memory management, clone support, error handling.
This project aims to provide developers a convenient library about graph theory algorithm and some basic datastructures. It will be developed in Java via Eclipse IDE, supporting both win32 and linux systems, and published as jar files.
Data Structure Tester is an OCaml application for multiple testing of various datastructures (also written in other lanages, like C or C++).It proviedes many examples to test, easily configurable tester and signatures for all data structers to be tested.
GraphSmart is a collection of graph datastructures and algorithms utilizing generics and the Microsoft .NET 2.0 Framework. Included items are commonly used in software engineering but not included in the .NET 2.0 Framework class library.