Skip to main content

Crate jmdict_fast

Crate jmdict_fast 

Source
Expand description

Blazing-fast Japanese dictionary engine with FST-based indexing.

Structs§

BatchQueryBuilder
A builder for configuring and executing batch dictionary lookups.
DataVersion
Dictionary data version information.
DeinflectionInfo
Information about how a term was deinflected to find its base form.
Dict
Entry
EntryIter
Iterator over every Entry in a Dict, in sequential-ID order.
GlossEntry
KanaEntry
KanjiEntry
LanguageSource
LookupResult
A structured lookup result with metadata about how it matched.
LookupResultIter
An iterator that lazily deserializes dictionary entries from pre-sorted match candidates.
QueryBuilder
A builder for configuring and executing dictionary lookups.
SenseEntry
Xref

Enums§

DictStorage
Backing storage for Dict data. Holds either a memory-mapped file, a 'static byte slice (used by the embedded feature), or an owned allocation. All three implement [AsRef<[u8]>] so fst::Map can wrap them uniformly.
JmdictError
Typed error enum for jmdict-fast, suitable for FFI consumers.
MatchMode
The search mode for a query.
MatchType
How a lookup result matched the query term.

Constants§

FORMAT_VERSION
Binary format version for entries.bin. Bump whenever the on-disk layout, the serialized Entry struct, or the set of expected sibling files changes — Dict::load rejects mismatched versions instead of attempting a deserialize that may silently succeed.
JMDICT_VERSION
JMdict source version this build was generated against. Surfaces to the install feature so Dict::install() can resolve the right release tarball without the caller hardcoding a version. Kept in lock-step with xtask::JMDICT_VERSION; bump together when upgrading the upstream JMdict release.
MAGIC
Magic bytes that prefix every entries.bin. The library uses these to distinguish a valid jmdict-fast data file from arbitrary input before touching the format version.
MAX_FUZZY_DISTANCE
Upper bound on the Levenshtein edit distance accepted by the fuzzy search builders. The fst Levenshtein automaton’s DFA grows rapidly with distance; values above 4 are rarely useful and risk large allocations.