Search Results for "high"

truffleHog searches through git repositories for high entropy strings and secrets, digging deep into commit history. TruffleHog runs behind the scenes to scan your environment for secrets like private keys and credentials, so you can protect your data before a breach occurs. Secrets can be found anywhere, so TruffleHog scans more than just code repositories, including SaaS and internally hosted software.

...The Apache Software Foundation provides support for the Apache community of open-source software projects. The Apache projects are defined by collaborative consensus-based processes, an open, pragmatic software license and a desire to create high-quality software that leads the way in its field. Apache Lucene, Apache Solr, Apache PyLucene, Apache Open Relevance Project and their respective logos are trademarks of The Apache Software Foundation.

Elasticsearch is a distributed, RESTful search and analytics engine that lets you store, search and analyze with ease at scale. It lets you perform and combine many types of searches; it scales seamlessly, and offers answers incredibly fast with search results you can rank based on a variety of factors. Elasticsearch can be used for a wide variety of use cases, from maps and metrics to site search and workplace search, and with all data types.

TNTSearch is a full-text search engine written in PHP, designed to be integrated into Laravel and other PHP applications. It offers real-time, efficient indexing and searching of textual data using SQLite as its storage backend. TNTSearch is highly configurable and supports features like fuzzy searching, customizable ranking algorithms, and boolean search, making it a powerful tool for adding search functionality to websites and applications.

zoekt is a fast, scalable code search engine written in Go that builds compressed indexes (shards) for source repositories and serves low-latency regex and substring queries. It optimizes for developer workflows: refresh indexes from Git, search across many repos instantly, and jump into hits with surrounding context and file navigation. The indexer uses efficient n-gram dictionaries and posting lists to keep query latency low, while storing metadata (branch, language, repo) for precise...

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. ...

ENAS in PyTorch is a PyTorch implementation of Efficient Neural Architecture Search (ENAS), a method that automates the design of neural network architectures through reinforcement learning and parameter sharing. The repository demonstrates how a controller network can explore a large search space and discover high-performing architectures while dramatically reducing the computational cost traditionally associated with neural architecture search. It is primarily intended as a research and educational codebase, helping practitioners understand how ENAS works in practice and how to reproduce results on benchmark datasets. The project includes training scripts, model definitions, and search procedures that show the full workflow from architecture sampling to evaluation. ...

CLucene is a C++ port of Lucene: the high-performance, full-featured text search engine written in Java. CLucene is faster than lucene as it is written in C++.

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

This library implements several locality sensitive hashing(LSH) based algorithms, including indexing data structure for high dimensional spaces and metric spaces, sketch constructions and set embedding algorithms.