flpdf 0.10.0

A pure-Rust PDF toolkit modeled on qpdf — read, rewrite, linearize, and inspect PDFs.
Documentation
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
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
//! Parse PDF inspection JSON values and deliver callback events.
//!
//! qpdf correspondence: JSON.cc parser state machine and Reactor event responsibilities.
//!

use std::io::{BufRead, BufReader, Cursor, ErrorKind, Read};

use super::{Json, JsonError, JsonMessage};

/// Receives qpdf-style events while a JSON value is parsed.
pub trait Reactor {
    fn dictionary_start(&mut self);
    fn array_start(&mut self);
    fn container_end(&mut self, value: &Json);
    fn top_level_scalar(&mut self);
    /// Observe a dictionary member.
    ///
    /// Scalar members are complete when this is called. For a child dictionary
    /// or array, this is called first with an empty shared child handle, then
    /// [`Reactor::dictionary_start`] or [`Reactor::array_start`] is called.
    /// Subsequent child item events fill that same handle before
    /// [`Reactor::container_end`] reports the completed child.
    ///
    /// Return `true` to consume the member, keeping it out of the parsed
    /// dictionary, or `false` to retain it in the returned [`Json`] tree.
    fn dictionary_item(&mut self, key: &[u8], value: &Json) -> bool;
    /// Observe an array element.
    ///
    /// Scalar elements are complete when this is called. For a child dictionary
    /// or array, this is called first with an empty shared child handle, then
    /// [`Reactor::dictionary_start`] or [`Reactor::array_start`] is called.
    /// Subsequent child item events fill that same handle before
    /// [`Reactor::container_end`] reports the completed child.
    ///
    /// Return `true` to consume the element, keeping it out of the parsed
    /// array, or `false` to retain it in the returned [`Json`] tree.
    fn array_item(&mut self, value: &Json) -> bool;
}

/// Parse a JSON value from bytes.
pub fn parse(input: &[u8]) -> Result<Json, JsonError> {
    let mut cursor = Cursor::new(input);
    parse_reader(&mut cursor, None)
}

/// Parse a JSON value from a reader.
pub fn parse_reader<R: Read>(
    reader: &mut R,
    reactor: Option<&mut dyn Reactor>,
) -> Result<Json, JsonError> {
    Parser::new(reader, reactor).parse()
}

impl Json {
    pub fn parse(input: &[u8]) -> Result<Self, JsonError> {
        parse(input)
    }

    pub fn parse_reader<R: Read>(
        reader: &mut R,
        reactor: Option<&mut dyn Reactor>,
    ) -> Result<Self, JsonError> {
        parse_reader(reader, reactor)
    }
}

#[derive(Clone, Copy, Debug, Eq, PartialEq)]
enum LexState {
    Top,
    NumberMinus,
    NumberLeadingZero,
    NumberBeforePoint,
    NumberPoint,
    NumberAfterPoint,
    NumberE,
    NumberESign,
    Number,
    Alpha,
    String,
    Backslash,
    U4,
    AfterString,
    BeginDictionary,
    EndDictionary,
    BeginArray,
    EndArray,
    Colon,
    Comma,
}

#[derive(Clone, Copy, Debug, Eq, PartialEq)]
enum ParseState {
    Top,
    DictionaryBegin,
    DictionaryAfterKey,
    DictionaryAfterColon,
    DictionaryAfterItem,
    DictionaryAfterComma,
    ArrayBegin,
    ArrayAfterItem,
    ArrayAfterComma,
    Done,
}

struct StackEntry {
    state: ParseState,
    item: Json,
}

struct Parser<'reader, 'reactor, R: Read> {
    reader: BufReader<&'reader mut R>,
    reactor: Option<&'reactor mut dyn Reactor>,
    pos: usize,
    state: LexState,
    done: bool,
    token: Vec<u8>,
    token_start: i64,
    u_count: usize,
    u_value: u32,
    high_surrogate: u32,
    high_offset: Option<i64>,
    parse_state: ParseState,
    stack: Vec<StackEntry>,
    dict_key: Vec<u8>,
    dict_key_offset: i64,
}

impl<'reader, 'reactor, R: Read> Parser<'reader, 'reactor, R> {
    fn new(reader: &'reader mut R, reactor: Option<&'reactor mut dyn Reactor>) -> Self {
        Self {
            reader: BufReader::with_capacity(16 * 1024, reader),
            reactor,
            pos: 0,
            state: LexState::Top,
            done: false,
            token: Vec::new(),
            token_start: 0,
            u_count: 0,
            u_value: 0,
            high_surrogate: 0,
            high_offset: None,
            parse_state: ParseState::Top,
            stack: Vec::new(),
            dict_key: Vec::new(),
            dict_key_offset: 0,
        }
    }

    fn parse(mut self) -> Result<Json, JsonError> {
        while !self.done {
            self.get_token()?;
            self.handle_token()?;
        }
        if self.parse_state != ParseState::Done {
            return Err(self.error("JSON: premature end of input"));
        }
        let item = self
            .stack
            .last()
            .expect("completed JSON parser has a top-level value")
            .item
            .clone();
        if !(item.is_array() || item.is_dictionary()) {
            if let Some(reactor) = self.reactor.as_deref_mut() {
                reactor.top_level_scalar();
            }
        }
        Ok(item)
    }

    fn offset(&self) -> i64 {
        self.pos as i64
    }

    fn current(&mut self) -> Result<Option<u8>, JsonError> {
        loop {
            match self.reader.fill_buf() {
                Ok(input) => return Ok(input.first().copied()),
                Err(error) if error.kind() == ErrorKind::Interrupted => {}
                Err(error) => return Err(JsonError::Parse(error.to_string().into())),
            }
        }
    }

    fn append(&mut self, byte: u8) {
        self.token.push(byte);
        self.reader.consume(1);
        self.pos += 1;
    }

    fn append_state(&mut self, state: LexState, byte: u8) {
        self.state = state;
        self.append(byte);
    }

    fn ignore(&mut self) {
        self.reader.consume(1);
        self.pos += 1;
    }

    fn ignore_state(&mut self, state: LexState) {
        self.state = state;
        self.ignore();
    }

    fn error(&self, message: impl Into<JsonMessage>) -> JsonError {
        JsonError::Parse(message.into())
    }

    fn error_with_byte(&self, prefix: String, byte: u8) -> JsonError {
        let mut message = prefix.into_bytes();
        message.push(byte);
        self.error(message)
    }

    fn error_with_bytes(&self, prefix: String, bytes: &[u8]) -> JsonError {
        let mut message = prefix.into_bytes();
        message.extend_from_slice(bytes);
        self.error(message)
    }

    fn token_error(&mut self) -> Result<(), JsonError> {
        if self.done {
            return Err(self.error("JSON: premature end of input"));
        }

        let byte = self.current()?.expect("not done has input");
        let offset = self.offset();
        match self.state {
            LexState::U4 => Err(self.error(format!(
                "JSON: offset {}: \\u must be followed by four hex digits",
                offset - self.u_count as i64 - 1
            ))),
            LexState::Alpha => Err(self.error_with_byte(
                format!("JSON: offset {offset}: keyword: unexpected character "),
                byte,
            )),
            LexState::String => Err(self.error(format!(
                "JSON: offset {offset}: control character in string (missing \"?)"
            ))),
            LexState::Backslash => Err(self.error_with_byte(
                format!("JSON: offset {offset}: invalid character after backslash: "),
                byte,
            )),
            _ => match byte {
                b'.' => {
                    if matches!(
                        self.state,
                        LexState::Number | LexState::NumberE | LexState::NumberESign
                    ) {
                        Err(self.error(format!(
                            "JSON: offset {offset}: numeric literal: decimal point after e"
                        )))
                    } else {
                        Err(self.error(format!(
                            "JSON: offset {offset}: numeric literal: decimal point already seen"
                        )))
                    }
                }
                b'e' | b'E' => Err(self.error(format!(
                    "JSON: offset {offset}: numeric literal: e already seen"
                ))),
                b'+' | b'-' => Err(self.error(format!(
                    "JSON: offset {offset}: numeric literal: unexpected sign"
                ))),
                b' ' | b'\t' | b'\n' | b'\r' | b'{' | b'}' | b'[' | b']' | b':' | b',' => Err(self
                    .error(format!(
                        "JSON: offset {offset}: numeric literal: incomplete number"
                    ))),
                _ => Err(self.error_with_byte(
                    format!("JSON: offset {offset}: numeric literal: unexpected character "),
                    byte,
                )),
            },
        }
    }

    fn handle_u_code(&mut self, codepoint: u32, offset: i64) -> Result<(), JsonError> {
        if (codepoint & 0xfc00) == 0xd800 {
            if let Some(high_offset) = self.high_offset {
                return Err(self.error(format!(
                    "JSON: offset {offset}: UTF-16 high surrogate found after previous high surrogate at offset {high_offset}"
                )));
            }
            self.high_offset = Some(offset);
            self.high_surrogate = codepoint;
        } else if (codepoint & 0xfc00) == 0xdc00 {
            // qpdf uses zero as its high-surrogate-offset sentinel. This
            // intentionally accepts a low surrogate beginning at offset 6
            // even when no high surrogate has been seen.
            let high_offset = self.high_offset.unwrap_or(0);
            if offset != high_offset + 6 {
                return Err(self.error(format!(
                    "JSON: offset {offset}: UTF-16 low surrogate found not immediately after high surrogate"
                )));
            }
            self.high_offset = None;
            let codepoint = 0x10000 + ((self.high_surrogate & 0x3ff) << 10) + (codepoint & 0x3ff);
            append_utf8(&mut self.token, codepoint);
        } else {
            append_utf8(&mut self.token, codepoint);
        }
        Ok(())
    }

    fn get_token(&mut self) -> Result<(), JsonError> {
        self.token.clear();
        self.high_surrogate = 0;
        self.high_offset = None;

        loop {
            let Some(byte) = self.current()? else {
                self.done = true;
                break;
            };

            if byte < 32 {
                if matches!(byte, b'\t' | b'\n' | b'\r') {
                    if self.state == LexState::Top {
                        self.ignore();
                    } else {
                        break;
                    }
                } else {
                    return Err(self.error(format!(
                        "JSON: control or null character at offset {}",
                        self.offset()
                    )));
                }
                continue;
            }

            match byte {
                b',' => {
                    if self.state == LexState::Top {
                        self.ignore_state(LexState::Comma);
                        return Ok(());
                    }
                    if self.state == LexState::String {
                        self.append(byte);
                    } else {
                        break;
                    }
                }
                b':' => {
                    if self.state == LexState::Top {
                        self.ignore_state(LexState::Colon);
                        return Ok(());
                    }
                    if self.state == LexState::String {
                        self.append(byte);
                    } else {
                        break;
                    }
                }
                b' ' => {
                    if self.state == LexState::Top {
                        self.ignore();
                    } else if self.state == LexState::String {
                        self.append(byte);
                    } else {
                        break;
                    }
                }
                b'{' => {
                    if self.state == LexState::Top {
                        self.token_start = self.offset();
                        self.ignore_state(LexState::BeginDictionary);
                        return Ok(());
                    }
                    if self.state == LexState::String {
                        self.append(byte);
                    } else {
                        break;
                    }
                }
                b'}' => {
                    if self.state == LexState::Top {
                        self.ignore_state(LexState::EndDictionary);
                        return Ok(());
                    }
                    if self.state == LexState::String {
                        self.append(byte);
                    } else {
                        break;
                    }
                }
                b'[' => {
                    if self.state == LexState::Top {
                        self.token_start = self.offset();
                        self.ignore_state(LexState::BeginArray);
                        return Ok(());
                    }
                    if self.state == LexState::String {
                        self.append(byte);
                    } else {
                        break;
                    }
                }
                b']' => {
                    if self.state == LexState::Top {
                        self.ignore_state(LexState::EndArray);
                        return Ok(());
                    }
                    if self.state == LexState::String {
                        self.append(byte);
                    } else {
                        break;
                    }
                }
                _ => match self.state {
                    LexState::Top => {
                        self.token_start = self.offset();
                        match byte {
                            b'"' => self.ignore_state(LexState::String),
                            b'a'..=b'z' => self.append_state(LexState::Alpha, byte),
                            b'-' => self.append_state(LexState::NumberMinus, byte),
                            b'1'..=b'9' => self.append_state(LexState::NumberBeforePoint, byte),
                            b'0' => self.append_state(LexState::NumberLeadingZero, byte),
                            _ => {
                                return Err(self.error_with_byte(
                                    format!(
                                        "JSON: offset {}: unexpected character ",
                                        self.offset()
                                    ),
                                    byte,
                                ));
                            }
                        }
                    }
                    LexState::NumberMinus => match byte {
                        b'1'..=b'9' => self.append_state(LexState::NumberBeforePoint, byte),
                        b'0' => self.append_state(LexState::NumberLeadingZero, byte),
                        _ => {
                            return Err(self.error(format!(
                                "JSON: offset {}: numeric literal: no digit after minus sign",
                                self.offset()
                            )));
                        }
                    },
                    LexState::NumberLeadingZero => match byte {
                        b'.' => self.append_state(LexState::NumberPoint, byte),
                        b'e' | b'E' => self.append_state(LexState::NumberE, byte),
                        _ => {
                            return Err(self.error(format!(
                                "JSON: offset {}: number with leading zero",
                                self.offset()
                            )));
                        }
                    },
                    LexState::NumberBeforePoint => match byte {
                        b'0'..=b'9' => self.append(byte),
                        b'.' => self.append_state(LexState::NumberPoint, byte),
                        b'e' | b'E' => self.append_state(LexState::NumberE, byte),
                        _ => return self.token_error(),
                    },
                    LexState::NumberPoint => {
                        if byte.is_ascii_digit() {
                            self.append_state(LexState::NumberAfterPoint, byte);
                        } else {
                            return self.token_error();
                        }
                    }
                    LexState::NumberAfterPoint => match byte {
                        b'0'..=b'9' => self.append(byte),
                        b'e' | b'E' => self.append_state(LexState::NumberE, byte),
                        _ => return self.token_error(),
                    },
                    LexState::NumberE => match byte {
                        b'0'..=b'9' => self.append_state(LexState::Number, byte),
                        b'+' | b'-' => self.append_state(LexState::NumberESign, byte),
                        _ => return self.token_error(),
                    },
                    LexState::NumberESign => {
                        if byte.is_ascii_digit() {
                            self.append_state(LexState::Number, byte);
                        } else {
                            return self.token_error();
                        }
                    }
                    LexState::Number => {
                        if byte.is_ascii_digit() {
                            self.append(byte);
                        } else {
                            return self.token_error();
                        }
                    }
                    LexState::Alpha => {
                        if byte.is_ascii_lowercase() {
                            self.append(byte);
                        } else {
                            return self.token_error();
                        }
                    }
                    LexState::String => match byte {
                        b'"' => {
                            if let Some(high_offset) = self.high_offset {
                                return Err(self.error(format!(
                                    "JSON: offset {high_offset}: UTF-16 high surrogate not followed by low surrogate"
                                )));
                            }
                            self.ignore_state(LexState::AfterString);
                            return Ok(());
                        }
                        b'\\' => self.ignore_state(LexState::Backslash),
                        _ => self.append(byte),
                    },
                    LexState::Backslash => {
                        self.state = LexState::String;
                        match byte {
                            b'\\' | b'"' | b'/' => self.token.push(byte),
                            b'b' => self.token.push(b'\x08'),
                            b'f' => self.token.push(b'\x0c'),
                            b'n' => self.token.push(b'\n'),
                            b'r' => self.token.push(b'\r'),
                            b't' => self.token.push(b'\t'),
                            b'u' => {
                                self.state = LexState::U4;
                                self.u_count = 0;
                                self.u_value = 0;
                            }
                            _ => {
                                self.state = LexState::Backslash;
                                return self.token_error();
                            }
                        }
                        self.ignore();
                    }
                    LexState::U4 => {
                        let Some(value) = hex_value(byte) else {
                            return self.token_error();
                        };
                        self.u_value = 16 * self.u_value + value;
                        self.u_count += 1;
                        if self.u_count == 4 {
                            self.handle_u_code(self.u_value, self.offset() - 5)?;
                            self.state = LexState::String;
                        }
                        self.ignore();
                    }
                    LexState::AfterString
                    | LexState::BeginDictionary
                    | LexState::EndDictionary
                    | LexState::BeginArray
                    | LexState::EndArray
                    | LexState::Colon
                    | LexState::Comma => unreachable!("delimiter states are handled immediately"), // cov:ignore: delimiter states return from get_token before dispatch
                },
            }
        }

        if !self.token.is_empty() {
            match self.state {
                LexState::NumberLeadingZero
                | LexState::NumberBeforePoint
                | LexState::NumberAfterPoint => self.state = LexState::Number,
                LexState::Number | LexState::Alpha => {}
                _ => self.token_error()?,
            }
        }
        Ok(())
    }

    fn handle_token(&mut self) -> Result<(), JsonError> {
        if self.state == LexState::Top {
            return Ok(());
        }

        if self.parse_state == ParseState::Done {
            return Err(self.error_with_bytes(
                format!(
                    "JSON: offset {}: material follows end of object: ",
                    self.offset()
                ),
                &self.token,
            ));
        }

        let state = std::mem::replace(&mut self.state, LexState::Top);
        let value = match state {
            LexState::BeginDictionary => Json::make_dictionary(),
            LexState::BeginArray => Json::make_array(),
            LexState::Colon => {
                if self.parse_state != ParseState::DictionaryAfterKey {
                    return Err(
                        self.error(format!("JSON: offset {}: unexpected colon", self.offset()))
                    );
                }
                self.parse_state = ParseState::DictionaryAfterColon;
                return Ok(());
            }
            LexState::Comma => {
                self.parse_state = match self.parse_state {
                    ParseState::DictionaryAfterItem => ParseState::DictionaryAfterComma,
                    ParseState::ArrayAfterItem => ParseState::ArrayAfterComma,
                    _ => {
                        return Err(
                            self.error(format!("JSON: offset {}: unexpected comma", self.offset()))
                        );
                    }
                };
                return Ok(());
            }
            LexState::EndArray => {
                if !matches!(
                    self.parse_state,
                    ParseState::ArrayBegin | ParseState::ArrayAfterItem
                ) {
                    return Err(self.error(format!(
                        "JSON: offset {}: unexpected array end delimiter",
                        self.offset()
                    )));
                }
                let (parent_state, item) = {
                    let entry = self
                        .stack
                        .last()
                        .expect("array end has a matching stack entry");
                    (entry.state, entry.item.clone())
                };
                self.parse_state = parent_state;
                item.set_end(self.offset());
                if let Some(reactor) = self.reactor.as_deref_mut() {
                    reactor.container_end(&item);
                }
                if self.parse_state != ParseState::Done {
                    self.stack.pop();
                }
                return Ok(());
            }
            LexState::EndDictionary => {
                if !matches!(
                    self.parse_state,
                    ParseState::DictionaryBegin | ParseState::DictionaryAfterItem
                ) {
                    return Err(self.error(format!(
                        "JSON: offset {}: unexpected dictionary end delimiter",
                        self.offset()
                    )));
                }
                let (parent_state, item) = {
                    let entry = self
                        .stack
                        .last()
                        .expect("dictionary end has a matching stack entry");
                    (entry.state, entry.item.clone())
                };
                self.parse_state = parent_state;
                item.set_end(self.offset());
                if let Some(reactor) = self.reactor.as_deref_mut() {
                    reactor.container_end(&item);
                }
                if self.parse_state != ParseState::Done {
                    self.stack.pop();
                }
                return Ok(());
            }
            LexState::Number => Json::make_number(&self.token),
            LexState::Alpha => match self.token.as_slice() {
                b"true" => Json::make_bool(true),
                b"false" => Json::make_bool(false),
                b"null" => Json::make_null(),
                _ => {
                    return Err(self.error_with_bytes(
                        format!("JSON: offset {}: invalid keyword ", self.offset()),
                        &self.token,
                    ));
                }
            },
            LexState::AfterString => {
                if matches!(
                    self.parse_state,
                    ParseState::DictionaryBegin | ParseState::DictionaryAfterComma
                ) {
                    self.dict_key.clone_from(&self.token);
                    self.dict_key_offset = self.token_start;
                    self.parse_state = ParseState::DictionaryAfterKey;
                    return Ok(());
                }
                Json::make_string(&self.token)
            }
            _ => {
                return Err(self.error(format!(
                    "JSON: offset {}: premature end of input",
                    self.offset()
                )))
            }
        };

        value.set_start(self.token_start);
        value.set_end(self.offset());

        match self.parse_state {
            ParseState::DictionaryBegin | ParseState::DictionaryAfterComma => {
                return Err(self.error(format!(
                    "JSON: offset {}: expect string as dictionary key",
                    self.offset()
                )));
            }
            ParseState::DictionaryAfterColon => {
                let parent = self
                    .stack
                    .last()
                    .expect("dictionary value has a matching stack entry")
                    .item
                    .clone();
                if parent.check_dictionary_key_seen(&self.dict_key)? {
                    return Err(self.error(format!(
                        "JSON: offset {}: duplicated dictionary key",
                        self.dict_key_offset
                    )));
                }
                let consumed = if let Some(reactor) = self.reactor.as_deref_mut() {
                    reactor.dictionary_item(&self.dict_key, &value)
                } else {
                    false
                };
                if !consumed {
                    parent.add_dictionary_member(&self.dict_key, value.clone())?;
                }
                self.parse_state = ParseState::DictionaryAfterItem;
            }
            ParseState::ArrayBegin | ParseState::ArrayAfterComma => {
                let parent = self
                    .stack
                    .last()
                    .expect("array value has a matching stack entry")
                    .item
                    .clone();
                let consumed = if let Some(reactor) = self.reactor.as_deref_mut() {
                    reactor.array_item(&value)
                } else {
                    false
                };
                if !consumed {
                    parent.add_array_element(value.clone())?;
                }
                self.parse_state = ParseState::ArrayAfterItem;
            }
            ParseState::Top => {
                self.parse_state = ParseState::Done;
            }
            ParseState::DictionaryAfterKey => {
                return Err(self.error(format!("JSON: offset {}: expected ':'", self.offset())));
            }
            ParseState::DictionaryAfterItem => {
                return Err(self.error(format!(
                    "JSON: offset {}: expected ',' or '}}'",
                    self.offset()
                )));
            }
            ParseState::ArrayAfterItem => {
                return Err(self.error(format!(
                    "JSON: offset {}: expected ',' or ']'",
                    self.offset()
                )));
            }
            ParseState::Done => unreachable!("done state is checked before token dispatch"), // cov:ignore: ParseState::Done returns before token dispatch
        }

        if value.is_dictionary() || value.is_array() {
            let is_dictionary = value.is_dictionary();
            self.stack.push(StackEntry {
                state: self.parse_state,
                item: value,
            });
            self.parse_state = if is_dictionary {
                if let Some(reactor) = self.reactor.as_deref_mut() {
                    reactor.dictionary_start();
                }
                ParseState::DictionaryBegin
            } else {
                if let Some(reactor) = self.reactor.as_deref_mut() {
                    reactor.array_start();
                }
                ParseState::ArrayBegin
            };

            if self.stack.len() > 500 {
                return Err(self.error(format!(
                    "JSON: offset {}: maximum object depth exceeded",
                    self.offset()
                )));
            }
        } else if self.parse_state == ParseState::Done {
            self.stack.push(StackEntry {
                state: ParseState::Done,
                item: value,
            });
        }
        Ok(())
    }
}

fn hex_value(byte: u8) -> Option<u32> {
    match byte {
        b'0'..=b'9' => Some((byte - b'0') as u32),
        b'a'..=b'f' => Some((byte - b'a' + 10) as u32),
        b'A'..=b'F' => Some((byte - b'A' + 10) as u32),
        _ => None,
    }
}

fn append_utf8(out: &mut Vec<u8>, codepoint: u32) {
    let character = char::from_u32(codepoint).expect("JSON UTF-16 code point is valid Unicode");
    let mut buf = [0; 4];
    out.extend_from_slice(character.encode_utf8(&mut buf).as_bytes());
}