Open Source C Search Software

FSearch is a blazing-fast file search utility for Linux inspired by Windows’ Everything Search Engine, built to allow users to locate files and directories instantly by name rather than content. It achieves its high performance by indexing the filesystem and updating that index in real time, so as you create, rename, or delete files the results stay up to date without noticeable lag. The intuitive user interface supports incremental search — where results filter as you type — plus features like regular expressions, case-sensitivity options, and customizable indexing scopes, making it both powerful and accessible. Designed with GTK and written in C, it integrates nicely with desktop environments like GNOME, XFCE, and Cinnamon while still being lightweight and resource-efficient. Developers and power users appreciate FSearch for dramatically reducing the time it takes to find files compared to traditional search tools, especially on large partitions.

Are you looking for a command that you used recently? Do you want to avoid the need to write long commands over and over again despite you used them recently? Are you looking for a tool that is able to manage your favorite commands? HSTR is a command line utility that brings improved Bash command completion from the history. It aims to make completion easier and more efficient than Ctrl-r. Apart to the completion, history can be managed (you can remove commands that e.g. contain sensitive information like passwords) and bookmark your favorite commands.

This tool enables users to search their NTFS formatted harddrives within seconds. It uses the MFT( master file table) of NTFS to search for files very fast. Ermöglicht eine extrem schnelle Dateisuche auf NTFS formatierten Festplatten.

mairix is a tool for indexing and searching email messages stored in Maildir, MH, or mbox folders.

A universal suite of utilities for large corpora processing.

FTimes is a forensic system baselining, searching, and evidence collection tool. Its primary purpose is to gather and/or develop topographical information and attributes about specified directories and files in a manner conducive to intrusion and forensic analysis.

Write programs as graphical dataflow charts instead of text. Compile them to any programming language you want. Besides this project includes the most efficient tree-based sorting algorithm that is possible. Originally developed on a CTOS Color NGEN, at first in Pascal, later ported to C, finally - 20 years later - ported to Linux. Currently it's still not really system independent. But it's intended that further releases will cure this.

cgrep provides many of the features of grep, egrep, and fgrep with greatly enhanced performance along with many additional features, one of which is the ability to output the context (surrounding lines) of the matching lines.

The findstr is searching the words in the text and binary files in several codepages. The famouse 'grep' is very slow and get a lot memory for large binary files without ends of lines - findstr is fast and light, but it doesn't use regular expressions.

A high-performance implementation of bloom filters, a lightweight duplicate detection algorithm.

This project aims to create an OS X and Windows XP desktop application that will extract relevant information from your computer as you perform everyday tasks such as reading emails or chatting on instant messenger clients.

DFA library is a regular expression library capable of the classic RE syntax (i.e. - without any perl extension). Unlike many other libraries with similar functionality, a deterministic finite automata (DFA) is used. DFA was formerly called npcre, wh

Look for changed/added/deleted files existing in your removable media.

This is a network based text search tool. The Network part consists of Client and Server side .class files. The text search algorithm has been implemented in C. On client side type SearchClient ip(server) string

Bible Concordance generator and viewer for UNIX/Linux/Cygwin, written in C. Supports multiple word searches using boolean operators and Reverse Polish notation. Unlike printed concordances, shows complete verse, and in context.

Exostar LDAP Proxy is a specialized LDAP proxy used to look up X.509 encryption certificates for prospective recipients in secure e-mail applications. It can be used to fetch other types of end user certificates, CA certificates and CRLs

A simple full text search tool that finds files matching a search expression in a directory tree.

Kriterion is a document retrieval and categorization engine capable of full text searching. There is no need for keyword or context-based information.

a group of network tools aimed to promote, search and rate shared resources. Basicly, it consists of console indexing utilities and web front-end to the database.

Lucino is a C-library with some support for reading and writing Apache Lucene-indices. It currently comes with PHP- and Python bindings.

Lux is a simple, fast and extendible full-text search engine. It works as a library for now.

This is media desktop search written in C/C++ using CLucene. It allows the user to index multimedia files and search in your disk.

Monad is intend to be a complete Desktop search engine for GNU/Linux systems. it will be a pluginable system to support many text file formats like html, pdf and so on...

MyLib is a smart desktop assistant to manage PDF/PPT/PS documents. These types of documents are frequently used by academic & engineering communities.

This project considers the problem of calculating primes as a sorting problem. It includes the most efficient tree-based sorting algorithm that is possible and shows that finding a new prime can be done by sorting the differences between the previous primes in the right way. Unfortunately it has turned out that going this way is even more slowly than trying to find primes by brute force. So it can only be used as a test with heavy load for the sorting algorithm, which can be used for sorting any kind of data. And as already mentioned, it's just the most efficient tree-based sorting algorithm that you can get. But furthermore this way of finding primes interestingly leaves a hard nut to crack for mathematicians: In very rare cases it finds numbers that are not primes. For all primes below one million this phenomenon arises in exactly two cases: 31213 which is 7 * 7 * 7 * 7 * 13 336141 which is 3 * 3 * 13 * 13 * 13 * 17 Who can explain, why?