AppSignal starts at $23/month with all features included. No overages, no hidden fees. 30-day free trial.
Tired of monitoring tools that punish you for scaling? AppSignal offers transparent, predictable pricing with every feature unlocked on every plan. Track errors, monitor performance, detect anomalies, and manage logs across Ruby, Python, Node.js, and more. Trusted by developers since 2012 with free dev-to-dev support. No credit card required to start your 30-day trial.
Try AppSignal Free
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.
High-performance JavaScript R-tree-based 2D spatial index
...It's most commonly used in maps and data visualizations. The demos contain visualization of trees generated from 50k bulk-loaded random points. Open web console to see benchmarks; click on buttons to insert or remove items; click to perform search under the cursor. An optional argument to RBush defines the maximum number of entries in a tree node. 9 (used by default) is a reasonable choice for most applications. Higher value means faster insertion and slower search, and vice versa.
COPE (Connecting Overlapped Pair-End reads) is a method to align and connect the illumina sequenced Pair-End reads of which the insert size is smaller than the sum of the two read length.The connected reads can be used in genome assembly, resequencing and transcriptome research.
The full citation:
COPE: An accurate k-mer based pair-end reads connection tool to facilitate genome assembly
Binghang Liu; Jianying Yuan; Siu-Ming Yiu; Zhenyu Li; Yinlong Xie; Yanxiang Chen; Yujian Shi; Hao Zhang; Yingrui Li; Tak-Wah Lam; Ruibang Luo
Bioinformatics (2012) 28(22): 2870-2874; doi: 10.1093/bioinformatics/bts563
JaQLib is a compact Java library that supports programmers in querying all sorts of collections, DBs and XML files in a compact and intuitive manner. Example: List<MyItem> result = Jaqlib.List.selectFrom(myCollection) .where(myCondition).asList()
Implementation of Damerau-Levenshtein fuzzy string matching in Java. Returns the distance adding one point per character insert, deletion, mismatche and swap.. This is an extension of apache/commons/lang/StringUtils.getLevenshteinDistance()
This project implements insert and remove operations on AVL trees. Comments in the source explain the implementation. Test applications perform a run-time check of insert and remove methods. A bash script builds and executes the test applications.
AVL Array is a sequence container (like std::vector or std::list) that allows fast insert/remove AND fast random access. Shiftable Files offers the usual file primitives plus fast insert/remove. Get the latest version via BZR in the Develop section.
PHPersistencia is a database persistence layer for PHP, offering Object Oriented interface to access the data, generating sql queries transparently for insert/update, selecting data as object collection and verifing data types without database access
JXmlSql is a Java database API ( MySql, Oracle, Access )that eliminates JDBC code. JXmlSql allows developers to define application and prepopulation SQL statements inside xml files. Options for query, insert, update, delete, report and prepopulation SQL.