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
Enterprise-grade ITSM, for every business
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.
clibutils is collection of common data structures , This library supports any type, Following are the datastructures currently implemented.
1. Dynamic Array
2. Single Linked List
3. Heap
4. Map
4. Set.
Project contains engine to construct Fuzzy Reasoning System. Package might be used when Fuzzy Reasoning is appropriate e.g. in trading, control, modelling, human behavior simulation.
The ordered_tree class template is an implementation in C++ of the ordered tree data structure. It implements breadth, depth search, as well as child and leaf iterators. A single header file is needed to use the code.
Lay a foundation for success with Tested Reference Architectures developed by Fortinet’s experts. Learn more in this white paper.
Moving to the cloud brings new challenges. How can you manage a larger attack surface while ensuring great network performance? Turn to Fortinet’s Tested Reference Architectures, blueprints for designing and securing cloud environments built by cybersecurity experts. Learn more and explore use cases in this white paper.
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 projects hosts the worlds fastest algorithms for the labeling of point-features. It especially looks for algorithms thar are free of constraints, applicable to many scenarios (e.g., visualization, maps...) and do not need any preprocessing.
A light-weight cross platform C++ library for console and file I/O, fast data structures and algorithms, CPU identification (CPUID), and sockets (TCP and UDP).
Unfixed bugs delaying your launch? Test with real users globally – check it out for free, results in days.
Testeum connects your software, app, or website to a worldwide network of testers, delivering detailed feedback in under 48 hours. Ensure functionality and refine UX on real devices, all at a fraction of traditional costs. Trusted by startups and enterprises alike, our platform streamlines quality assurance with actionable insights. Click to perfect your product now.
C ADT(Abstract Data Types) is a simple template library written in C which implements commonly used abstract data structures, such as linked lists, trees, queues, stacks, hashes, graphs and associated algorithms.
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 data structures loaded from shapefiles.
Game Toolbox is a C# assembly designed to facilitate the creation of games and game prototypes. It contains no graphics code, does not depend on XNA, and is Mono-compatible. It provides implementations of A*, GOAP, a genetic algorithm, and more.
This project aims to be a repository of most popular data structures written in C# language, like stacks, queues, lists, linked lists, heaps, graphs, trees, etc.
XPN is relies on a non relational native XML database, where XML documents are stored in a compressed form and indices enables fast access to structure and content, thus enabling a fast evaluation of XQuery queries.
Tsunami is an open-source high performance computing language. With it you can write streaming data-parallel algorithms that utilize GPGPUs for orders-of-magnitude speed-up with the ease of writing sequential algorithms.
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.
A compilation of source code consisting of various Data Structures and Algorithms in C++ alongside with related documentation material. A useful basis for university students, new programmers and people interested in the subject.
Isolate Project is a straightforward data retrieval software that connects to popular relational database management systems and performs search operations based on the criteria specified. This project aims to speedup data retrieval operations.
An implementation of Bruhn et al.'s fast variational optical flow algorithm using the OpenCV image processing library. The code calculates dense flow fields with a user-specified level of precision.