Trie

A package for interacting with Qdrant for memory retrieval and upsert operations

"Automate your ArXiv paper search, retrieval, and summarization process."

Local retriever search for your use

A Python retry package based on strategies

Logentries Command Line Interface

Natural Language Weather Retriever

Weather forecast retrieval gathers relevant gridded weather forecasts to ingest into physically based models for water supply forecasts

llama-index packs infer retrieve rerank integration

ITA - Registri IVA

llama-index packs fusion_retriever integration

CLI to host Trie Server

Provides models for a "complete" list of countries

Python API Wrapper for restcountries.com

High performance Trie and Ahocorasick automata (AC automata) for python

Generalized trie implementation

Retrieve pre-trained models and cache it locally

[private preview] Parallel feature retrieval for Tecton

A synchronous wrapper for AIOHTTP

llama-index retrievers mongodb-atlas-bm25-retriever integration

Send metrics to the Riemann monitoring system

llama-index packs timescale_vector_autoretrieval integration

llama-index packs chroma_autoretrieval integration

Client to access server Trie

Python library for tries with different grades of fastness.

A library for fast keyword extraction and replacement in strings.

A simple trie data structure implementation

CLI for communicating with a Trie hosted online

Trie implementation for approximate string matching.

Pure Python 3 Merkle Patricia Trie implementation

A pure Python implementation of a PATRICIA trie.

Python bindings for NodeTrie, a trie data structure library

Super-fast, efficiently stored Trie for Python.

Typed mutable SSZ views over cached and immutable binary merkle trees

A simlpe Merkle Patricia Trie implementation

A fast and efficient trie-based collection for storing and searching millions of strings.

51Degrees Mobile Detector (C Trie Wrapper).

HAT-Trie for Python

General Purpose Trie Data Structure in Python

Single-hash-table Trie

Prefix Tree (trie) for manipulating CIDR sets

Implementation of the trie data structure

WordTrie: a simple trie (prefix tree) for word and phrase matching

A Trie data structure for efficient pattern matching using regular expressions - up to 1000 times faster

Storage string trie.

An efficient C++ incremental parser for multi-choices grammars (generalization of the trie structure) with Python bindings.

Pure Python implementation of DARTS (Double ARray Trie System)

A self-compressing, dependency-free radix trie

A trie filled with words from several languages (English - en, German - de , French - fr, Spanish - es, Portuguese - pt)

A Trie implementation that manages not the single characters but treats its values as typical namespaces.

A thread safe implementation of a Trie.