Expand description
Blazing-fast Japanese dictionary engine with FST-based indexing.
Structs§
- Batch
Query Builder - A builder for configuring and executing batch dictionary lookups.
- Data
Version - Dictionary data version information.
- Deinflection
Info - Information about how a term was deinflected to find its base form.
- Dict
- Entry
- Entry
Iter - Iterator over every
Entryin aDict, in sequential-ID order. - Gloss
Entry - Kana
Entry - Kanji
Entry - Language
Source - Lookup
Result - A structured lookup result with metadata about how it matched.
- Lookup
Result Iter - An iterator that lazily deserializes dictionary entries from pre-sorted match candidates.
- Query
Builder - A builder for configuring and executing dictionary lookups.
- Sense
Entry - Xref
Enums§
- Dict
Storage - Backing storage for
Dictdata. Holds either a memory-mapped file, a'staticbyte slice (used by the embedded feature), or an owned allocation. All three implement [AsRef<[u8]>] sofst::Mapcan wrap them uniformly. - Jmdict
Error - Typed error enum for jmdict-fast, suitable for FFI consumers.
- Match
Mode - The search mode for a query.
- Match
Type - 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
Entrystruct, or the set of expected sibling files changes —Dict::loadrejects mismatched versions instead of attempting a deserialize that may silently succeed. - JMDICT_
VERSION - JMdict source version this build was generated against. Surfaces to the
installfeature soDict::install()can resolve the right release tarball without the caller hardcoding a version. Kept in lock-step withxtask::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
fstLevenshtein automaton’s DFA grows rapidly with distance; values above 4 are rarely useful and risk large allocations.