Find TODOs and compute debt size

A comprehensive forensic deepfake detection toolkit designed for law enforcement, military, and national security applications. Features AI/ML detection algorithms, forensic reporting, and court-admissible evidence generation with high accuracy deepfake detection for video, audio, and image files.

It mitigates the lack of support for mobile deep links on the URI module.

A Ruby wrapper for DeepStack API

Defining future deprecations

Democritus is library for building classes from reusable components.

Add simple password protection for demo Rack apps.

Tool for better visualizing and managing dependencies

This gem provides the tools to run and document the steps required to set up the development environments of your projects.

Auth0 authentication for devise

Firebase as authentication service behind the devise

This gem generates nicer default views styled with Foundation so you have a bit of a better starting point for your app.

Interacts with the ruby-jira gem to provide authentication of a login against a JIRA system.

Allows Devise to authenticate users from central-authentication services like LDAP and Shibboleth.

A Devise extension for authenticating with Rownd

DHC is an advanced HTTP client. Implementing basic http-communication enhancements like interceptors, exception handling, format handling, accessing response data, configuring endpoints and placeholders and fully compatible, RFC-compliant URL-template support.

DHS ia a Rails-Gem, providing an ActiveRecord like interface to access HTTP-JSON-Services from Rails Applications. Special features provided by this gem are: Multiple endpoint configuration per resource, active-record-like query-chains, scopes, error handling, relations, request cycle cache, batch processing, including linked resources (hypermedia), data maps (data accessing), nested-resource handling, ActiveModel like backend validation conversion, formbuilder-compatible, three types of pagination support, service configuration per resource, kaminari-support and much more.

Dibuk allow you to download purchased ebooks.

Finds solutions to the NYTimes Digits game.

Native implementation of Dijkstra algorithm for finding the shortest path between two vertices in a large, sparse graphs. Underlying algorithm is implemented in C using a priority queue. Edges are represented using linked lists rather than an adjacency matrix to reduce memory footprint when operating on very large graphs where the average number of edges between nodes is relatively small (e.g. < 1/10 the number of nodes). See https://en.wikipedia.org/wiki/Dijkstra's_algorithm for additional information.