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
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
// RLX — versatile ML compiler + runtime.
// Copyright (C) 2026 Eugene Hauptmann, Nataliya Kosmyna.
//
// 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, version 3.
//
// 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/>.
//! Boxed-trait dispatch for LM runners (PLAN.md M3 + M8).
//!
//! `LmRunner` is the minimal abstraction `rlx_models::run::auto_runner`
//! returns from a path. M3 shipped the single-shot `predict_logits`
//! method; M8 adds streaming `generate(prompt_ids, n_new, on_token)`
//! with a sampler-agnostic greedy default that delegates to
//! `predict_logits` on each step.
//!
//! Per-family runners with a cached decode path
//! (`Qwen3Runner::generate`, `Qwen35Runner::generate_with_opts`,
//! `GemmaRunner::generate`, `Llama32Runner::generate`) should
//! override this default with their fast path — the default exists
//! so `auto_runner(path)?.generate(...)` always works, not as a
//! recommended hot path.
//!
//! Each per-family crate provides `impl LmRunner for FooRunner` so
//! that `rlx-models` can hand back a `Box<dyn LmRunner>` from a
//! single GGUF path without the caller knowing the family upfront.
use Result;
/// Minimal per-family runner interface.
///
/// Implementations must be `Send` so the boxed trait can move across
/// threads (e.g. when `skill` runs inference on a worker pool).
/// `Sync` is intentionally not required — most runners hold mutable
/// per-call compile / cache state.