1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
// Bistun Linguistic Metadata Service (LMS)
// Copyright (C) 2026 Francis Xavier Wazeter IV
//
// This program is free software: you can redistribute it and/or modify
// it under the terms of the GNU General Public License as published by
// the Free Software Foundation, either version 3 of the License, or
// (at your option) any later version.
//
// This program is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// GNU General Public License for more details.
//
// You should have received a copy of the GNU General Public License
// along with this program. If not, see <https://www.gnu.org/licenses/>.
//! # Resolver Core Engine
//! Ref: [012-LMS-ENG]
//! Location: `src/core/resolver/mod.rs`
//!
//! **Why**: This module defines the Chain of Responsibility interface for Taxonomic Resolution. It serves as the abstract foundation for Phase 1 of the capability pipeline.
//! **Impact**: Compromising this interface breaks the ability to dynamically route BCP 47 tags to their linguistic definitions, causing the system to fail open to defaults and potentially misidentifying critical script traits.
//!
//! ### Glossary
//! * **Resolver**: A discrete operational unit in the fallback chain (e.g., ExactMatch, Truncation).
//! * **Chain of Responsibility**: A behavioral design pattern where a request is passed along a chain of handlers until one processes it.
// Expose the test utilities ONLY during cargo test
use crateLocaleEntry;
use crateIRegistryState;
/// The standard contract for all Taxonomic Resolvers in the pipeline.
///
/// Time: O(1) definition | Space: O(1)
///
/// # Logic Trace (Internal)
/// 1. Accept a BCP 47 tag and a reference to the active registry state.
/// 2. If the current resolver can satisfy the request, return a `LocaleEntry`.
/// 3. If not, delegate the request to the `next` resolver in the chain.