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.
Our generous forever free tier includes the full platform, including the AI Assistant, for 3 users with 10k metrics, 50GB logs, and 50GB traces.
Built on open standards like Prometheus and OpenTelemetry, Grafana Cloud includes Kubernetes Monitoring, Application Observability, Incident Response, plus the AI-powered Grafana Assistant. Get started with our generous free tier today.
Tpl makes it easy to serialize your C data using just a handful of API functions. The data is stored in its native binary form for maximum efficiency. C, Perl and XML supported. Data is portable across CPU types and OS's from Unix to Mac to Windows.
A log player for "The Fourth Coming" ("T4C", http://www.the4thcoming.com).
Given a log-file, this tool will replay a T4C game you've played before.
It will have built-in functionnalities like : merging log files
together, searching and cleaning
Alef++, is a new programming language like Perl and Lisp syntax, with a many changing in classical languages designs, her specification designed to be implemented for any VM, by default can access to any private/protected/default Java fields or methods.
Generate interest, access liquidity without selling, and execute trades seamlessly. All in one platform.
Geographic restrictions, eligibility, and terms apply.
CILib is a framework for developing Computational Intelligence software in swarm intelligence, evolutionary computing, neural networks, artificial immune systems, fuzzy logic and robotics.
GEECoP (Graphical Editor and Engine for Constrained Processes) is a tool to graphically design control-flow graphs and their associated constraints. It supports creation of Concurrent Transaction Logic formulas and validation of constrained processes.
This chess program changes its strength to give the best match against you. Eventually it learns to beat you specifically through learning alogirthms. Features included transposition tables and a elementary 3-piece endgame tablebase.
A collection of Concurrent and Highly Scalable Utilities. These are intended as direct replacements for the java.util.* or java.util.concurrent.* collections but with better performance when many CPUs are using the collection concurrently.
Java library offering theory of sets/set theory functionality (complement, intersection, symetric difference, union, cartesian product and powerset). There's also an ant task/ant tasks included that provides the library's functionality
a first work algorithm trials to implement a compromise between distributed and centralized version control system.part of research project,it's only a simulation. no real networking is implemented ,only virtual random signal are imaginary produced.
Now part of Apache's Mahout machine learning project at http://mahout.apache.org/-- please see there for latest info and code and releases and support!
A Java package for pretty-printing a text by deciding where to introduce line-breaks and indentation. A Java implementation of Derek Oppen\'s pretty printing algorithm. It is _not_ a pretty printer for Java code, though it could be used to write one.
This is an implementation of Donald Knuth's Algorithm X ("dancing links"). This is primarily a sudoku generator and solver, though it can be used to solve other exact cover problems.
Are Plain Old Java Objects (POJOs) to complex? The aim of this framework is, to convert JavaBeans (complex Java-Object graphs) in a simplified representation (JSON, XML, CSV or other object structures) or handle and control access to JavaBean properties.
Framework: Project for Evolutionary Predator Prey Algorithms, used to implement an evolutionary scheme based on the developement by van Laumanns. Implement testproblems, special behaviours, environments, and other yet not known features.
The goal: to provide implementations of as many algorithms (sorting, searching, ...) and data structures (lists, trees, ...) as possible, accompanied by discussion of big O run time and memory limits and references to sources of further study.
Project that will provide implementations in Java's Micro Edition (J2ME) platform of algorithms on strings, for exact/inexact matching, similarity distances, among others.
A complete library of high-speed java collection classes to complement existing classes with new and advanced algorithms. Complements standard J2SE classes and Jakarta commons classes
FunctionalJ is a library which makes it easy to use functional programming patterns in Java, such as representing functions as objects, partial function application, higher-order functions, mapping, folding, and more.