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
Full-stack observability with actually useful AI | Grafana Cloud
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.
High-performance JavaScript R-tree-based 2D spatial index
RBush is a high-performance JavaScript library for 2D spatial indexing of points and rectangles. It's based on an optimized R-tree data structure with bulk insertion support. Spatial index is a special data structure for points and rectangles that allows you to perform queries like "all items within this bounding box" very efficiently (e.g. hundreds of times faster than looping over all items). It's most commonly used in maps and data visualizations. The demos contain visualization of trees...
Contributions to this project are always welcome. To add a new feature fork the dev branch and give a pull request when your new feature is tested and complete. If its a new module, it should be put inside the modules directory. The branch name should be your new feature name in the format <Feature_featurename_version(optional)>. On Linux platforms, you can make an executable for TorBot by using the install.sh script. You will need to give the script the correct permissions using chmod +x...
A very fast geospatial point clustering library for browsers and Node
A very fast JavaScript library for geospatial point clustering for browsers and Node. supercluster supports property aggregation with the following two options. Map, a function that returns cluster properties corresponding to a single point. Reduce, a reduce function that merges properties of two clusters into one.
Software for calculating geometric properties of cross sections
Software for calculating geometric properties of cross sections and polygons. Calculates: area, moments of inertia, product of inertia, radius of gyration, section modulus, among others. It also supports import and export of CSV, JSON and DXF files. Able to do geometric transformations and 2D and 3D visualization of the cross sections.
Libcutils provides a self-contained set of fundamental routines which are
essential to basically any Unix utility or daemon application written in C. The
library provides fundamental data structures such as lists, hash-maps, strings
and parsing functions for JSON or the typical dot-file based configuration data.
The following list summarizes the currently supported functionality:
* length delimited instead of NULL terminated strings
* memory management based on reference counting
* several list processing functions like iterators and map-reduce
* support of [Ideal Hash Tries](http://infoscience.epfl.ch/record/64398/files/idealhashtrees.pdf)
for highly efficient hash map data structures
* parsers for [JSON](http://json.org) data and the text configuration files found
in Unix system
* doubly linked circular lists for reliable event queues
* support for test and debugging of memory management problems such as memory leaks
HOOPLE is a portable collection of C++ source code, featuring thread-safe objects for collections and event processing, RPC-style plugin-based encrypted networking (CROMP / octopus), bookmark collection management utilities, and a lot of other cool stuff.
This is the project page for HOOPLE version 1, which was retired on September 25 2010. The code supposedly still builds on both Linux (with gnu gcc) and on Windows (with ms visual studio).
Most of the code from hoople1 has moved into...
...Currently the code can read BioNLP shared task format (http://2011.bionlp-st.org/) and i2b2 Natural Language Processing for Clinical Data shared task format (https://www.i2b2.org/NLP/DataSets/Main.php). Event extraction includes finding events and the parameters for an event in a text.
The method is based on SVM but other ML algorithms can be adopted. The method details are explained in the following paper:
Ehsan Emadzadeh, Azadeh Nikfarjam, and Graciela Gonzalez. 2011. Double Layered Learning for Biological Event Extraction from Text. ...
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.
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.
The classes in stdfuncs.inc.php provide general functions you can use while developping a PHP Application / Website or whatever. - Debugging - Time measurment - Sorting and Grouping - JSON Encoding - XML-Reading - FileSystem - Date handling
JSONER is a JavaScript library intented to simplify most used operations with JSON based on event API on JSON tree. It includes: data lookup and binding solution, HTML form by JSON dynamically creation and population, transformation and comparison JSONs.