Stub Chef Search!

ActiveRecord plugin

An engine for search-engine-optimized blog management.

Quick and dirty multi column LIKE searches.

A PubMed searching library with more features than BioRuby

A Rubyesque interface to Gmail, with all the tools you will need. Search, read and send multipart emails; archive, mark as read/unread, delete emails; and manage labels.

LintSearch is a an application which searchs for a keyword and then lints the first results

Quick and dirty multi column LIKE searches.

A small wrapper of elasticsearch search api

Searches movies using the OMDapi. It's also a CLI that organizes movies based on when they're published

If the user clicked through from a search engine, this middleware will detect the engine used and the terms searched.

Object based ActiveRecord searching, ordering, pagination, and more!

scope_filter is a filter- and search-library for ActiveRecord models using scopes

WordSearcher generates a new word search puzzle with your input word, then tries to solve the puzzle. It is not programmed to win every game. It simply compares each letter of the word with all those available on the board, then randomly selects one. Then, it looks to see if the next letter of...

Because Solr sometimes fails, it happens. It might be a maintenance work you have to do or just Out-Of-Memory problems. If you are running search-sensitive Rails app, you have to deal with it.This gem was developed to postpone your index tasks automatically into a sidekiq queue if Solr engine bec...

Calculates algorithms and data structures for sorting and searching. Selects best one to use for particular data set. Currently supports: Bubble Sort, Insertion Sort, Selection Sort, Merge Sort, Quick Sort, Heap Sort, Stack, Queue, Linked List, Binary Search Tree

Ruby wrapper for the SearchSpring Live Indexing API

Search Youtube from the command line and download videos using `youtube-dl`.

Simple full-text searching for Rails

A crit bit tree, also known as a Binary Patricia Trie is a trie (https://en.wikipedia.org/wiki/Trie), also called digital tree and sometimes radix tree or prefix tree (as they can be searched by prefixes), is an ordered tree data structure that is used to store a dynamic set or associative array...