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
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
/*******************************************************************************
*
* Copyright (c) 2026 Haixing Hu.
*
* SPDX-License-Identifier: Apache-2.0
*
* Licensed under the Apache License, Version 2.0.
*
******************************************************************************/
use TranscodeProgress;
/// Converts one logical stream of input units into one logical stream of output units.
///
/// `transcode` is the main streaming API. It transforms a provided input segment and
/// writes as much output as available buffer space allows, without automatically
/// finalizing internal pending state.
///
/// A transcoder instance has a simple lifecycle:
///
/// 1. A newly created or reset instance is ready for a new logical stream.
/// 2. Call [`Transcoder::transcode`] zero or more times while input is available.
/// 3. Call [`Transcoder::finish`] after the caller knows no more input remains.
/// 4. Continue calling [`Transcoder::finish`] while it reports
/// [`crate::TranscodeStatus::NeedOutput`].
/// 5. After [`Transcoder::finish`] reports [`crate::TranscodeStatus::Complete`],
/// call [`Transcoder::reset`] before starting another logical stream with the
/// same instance.
///
/// The method is suitable for:
/// - pull-style consumers that call conversion repeatedly as buffers arrive;
/// - bounded output sinks that need `NeedOutput` progress when capacity is hit;
/// - stateless and stateful codecs that all return progress-oriented stopping
/// reasons.
///
/// `Transcoder` is intentionally independent from any charset semantics:
///
/// - Use `Transcoder` directly for custom, policy-free unit transforms.
/// - Use `Transcoder` when you want to own malformed/unmappable decisions at the call site.
///
/// # Example: streaming byte-to-word decoder
///
/// ```rust
/// use qubit_codec::{Transcoder, TranscodeProgress, TranscodeStatus};
///
/// #[derive(Default)]
/// struct U16BeBytesDecoder;
///
/// impl Transcoder<u8, u16> for U16BeBytesDecoder {
/// type Error = core::convert::Infallible;
///
/// fn max_output_len(&self, input_len: usize) -> Option<usize> {
/// Some(input_len / 2)
/// }
///
/// fn transcode(
/// &mut self,
/// input: &[u8],
/// input_index: usize,
/// output: &mut [u16],
/// output_index: usize,
/// ) -> Result<TranscodeProgress, Self::Error> {
/// let mut read = 0;
/// let mut written = 0;
/// while input_index + read + 1 < input.len() {
/// if output_index + written == output.len() {
/// let status = TranscodeStatus::NeedOutput {
/// output_index: output_index + written,
/// required: 1,
/// available: 0,
/// };
/// return Ok(TranscodeProgress::new(status, read, written));
/// }
/// let high = input[input_index + read] as u16;
/// let low = input[input_index + read + 1] as u16;
/// output[output_index + written] = (high << 8) | low;
/// read += 2;
/// written += 1;
/// }
/// if input_index + read == input.len() {
/// Ok(TranscodeProgress::complete(read, written))
/// } else {
/// let status = TranscodeStatus::NeedInput {
/// input_index: input_index + read,
/// required: 2,
/// available: input.len() - (input_index + read),
/// };
/// Ok(TranscodeProgress::new(status, read, written))
/// }
/// }
/// }
///
/// let mut transcoder = U16BeBytesDecoder;
/// let mut output = [0_u16; 1];
/// let progress = transcoder
/// .transcode(&[0x12, 0x34, 0xab, 0xcd], 0, &mut output, 0)
/// .expect("decoding cannot fail");
/// assert_eq!(TranscodeStatus::NeedOutput {
/// output_index: 1,
/// required: 1,
/// available: 0,
/// }, progress.status());
/// assert_eq!(2, progress.read());
/// assert_eq!(1, progress.written());
/// assert_eq!([0x1234], output);
///
/// let mut output = [0_u16; 2];
/// let progress = transcoder
/// .transcode(&[0x12, 0x34, 0xab], 0, &mut output, 0)
/// .expect("decoding cannot fail");
/// assert_eq!(TranscodeStatus::NeedInput {
/// input_index: 2,
/// required: 2,
/// available: 1,
/// }, progress.status());
/// assert_eq!(2, progress.read());
/// assert_eq!(1, progress.written());
/// assert_eq!([0x1234, 0], output);
/// ```
///
/// The trait is intentionally independent from charset concepts. Implementors
/// use `input_index` and `output_index` as absolute positions in the supplied
/// slices. Returned progress counters are relative counts from those positions.
/// For raw codecs this gives a compact API; higher-level workflows can wrap this
/// trait with their own semantic policies.
///
/// # Type Parameters
///
/// - `Input`: Input unit type accepted by this transcoder.
/// - `Output`: Output unit type produced by this transcoder.