fef1af5e3f
Bumps [h2](https://github.com/hyperium/h2) from 0.3.24 to 0.3.26. - [Release notes](https://github.com/hyperium/h2/releases) - [Changelog](https://github.com/hyperium/h2/blob/v0.3.26/CHANGELOG.md) - [Commits](https://github.com/hyperium/h2/compare/v0.3.24...v0.3.26) --- updated-dependencies: - dependency-name: h2 dependency-type: indirect ... Signed-off-by: dependabot[bot] <support@github.com>
RustySearch
This project is a simple implementation of a search engine in Rust. It uses the BM25 algorithm for ranking documents. This project is a learning exercise and is not intended for production use.
Todo
- [] Store index to Disk
- [] Save multiple indecies
Features
- Indexing documents: The search engine maintains an index of documents, where each document is associated with a unique identifier.
- Searching: Given a query, the search engine returns the most relevant documents.
Usage
Creating a new instance of SearchEngine
You can create a new instance of the SearchEngine with the new function. It takes two parameters:
k1: The k1 parameter of the BM25 algorithm.b: The b parameter of the BM25 algorithm.
Project Structure
The main components of the project are:
SearchEngine: This is the main class that provides the functionality of the search engine.index: A HashMap that stores the index of the documents.documents: A HashMap that stores the documents with their unique identifiers.
Contributing
Contributions are welcome. Please submit a pull request.
License
This project is licensed under the MIT License.