Explore projects

AMQP mocking and expectations library, inspired by nock

Minimal websocket client

The PersistentLoadingCache library is an internal implementation of a hard drive-backed loading cache in Java. This library is based on Google's Guava LoadingCache implementation, and adds flexible support for persistence strategies to carry cached data over between program invocations. We include a simple filesystem-based persistence strategy, which stores persisted and extended cached data to the local filesystem at a specified folder location. Custom persistence strategies may be implemented and used in PersistentLoadingCaches as desired. NOTE: This library is in early alpha, and is not ready for production deployment at this time.

The Probabilistic Priority Queue Java library is a collection of classes allowing the construction of a class of priority queues with a random component to next element selection, according to programmatically-defined probability distributions. These classes provide a flexible framework for building probabilistic queues and underlying cumulative density functions.

A job scheduler utility for kue, backed by redis and built for node.js

The gnowit-utilities library is a collection of simple utilities suitable to various purposes. The initial release includes limited utilities for serialization and deserialization of data (including base64 and Json encodings) and generation of secure byte sequences and strings for cryptographic use.

The gnowit-news-api-client is simple open source Java API client library for Gnowit's news monitoring web services. This library remains under development. Updated versions should be expected in the near future. Community contributions are invited.

The ConjugacyClassClusterer library provides a flexible generic implementation of the notion of mathematical conjugacy classes of objects. The conjugacy class mechanism provides an easy method to implement flexible clustering algorithms (one simply needs to define a similarity measure on the object type in question) based on a critical underlying mathematical concept. Moreover, this library's definition of similarity measures is flexible enough to allow clustering mechanisms which are more generous than would be strictly defined by any mathematical equivalence relation. Classes need not be well-defined conjuacy classes - the programmer may define similarity relations which depend on insertion order or other heuristics in determining to which class any new object is added.