flpdf 0.1.10

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
//! Page-range syntax parser, matching qpdf's page-range mini-language.
//!
//! # Syntax
//!
//! ```text
//! range        ::= "" | entry ("," entry)*
//! entry        ::= endpoint ("-" endpoint)? (":odd" | ":even")?
//! endpoint     ::= "z" | "r" digit+ | digit+
//! ```
//!
//! - `z` — the last page (equivalent to `r1`).
//! - `rN` — N-th page from the end; `r1` is the last page, `r2` is the second-to-last, …
//! - Ranges may be ascending (`1-5`) or descending (`5-1`); both are inclusive.
//! - `:odd` / `:even` filter the *positions* within the expanded entry sequence:
//!   `:odd` keeps positions 1, 3, 5, … (1-based); `:even` keeps positions 2, 4, 6, …
//!   They operate on the entry's own expansion, not the whole expression.
//!   Example: `2-8:even` → pages at positions 2, 4, 6 of `[2,3,4,5,6,7,8]` → `[3,5,7]`.
//!   This is intentionally position-based, matching qpdf: its `--help=page-ranges`
//!   states `:odd`/`:even` select "odd and even pages from the resulting set, not
//!   based on the original page numbers" (verified against qpdf 11.9.0: `2-8:even`
//!   yields 3 pages, not the 4 a page-number reading would give). Do not "fix"
//!   this to filter by `p % 2` — that would diverge from qpdf.
//! - An empty string means "all pages" and is resolved to `1..=page_count`.
//! - Multiple entries are concatenated; the final resolved list is deduplicated
//!   (first-occurrence wins) while preserving order.
//!
//! # Divergence from qpdf
//!
//! qpdf does **not** deduplicate — `1,1,2` in qpdf produces page 1 twice. This
//! implementation **does** deduplicate. The syntax parser and resolve error
//! conditions are otherwise qpdf-compatible.

use crate::{Error, Result};

// ---------------------------------------------------------------------------
// Public types
// ---------------------------------------------------------------------------

/// An unresolved endpoint of a page-range entry.
///
/// Concrete page numbers are not computed until [`PageRange::resolve`] is
/// called with a known `page_count`, so that the parser does not need to know
/// the document's page count.
#[derive(Debug, Clone, PartialEq, Eq)]
pub enum Endpoint {
    /// Absolute 1-based page number. Must be ≥ 1.
    Num(u32),
    /// The last page (`z`).
    Z,
    /// N-th page from the end (`rN`); `r1` = last, `r2` = second-to-last.
    /// Must be ≥ 1.
    FromEnd(u32),
}

/// Which positions to keep within a single entry's expanded page sequence.
#[derive(Debug, Clone, Copy, PartialEq, Eq)]
pub enum Parity {
    /// Keep positions 1, 3, 5, … (`:odd`).
    Odd,
    /// Keep positions 2, 4, 6, … (`:even`).
    Even,
}

/// A single parsed entry in a page-range expression.
#[derive(Debug, Clone, PartialEq, Eq)]
pub struct PageRangeEntry {
    /// Start of the range (or the single page).
    pub start: Endpoint,
    /// End of the range, if this is a range rather than a single page.
    pub end: Option<Endpoint>,
    /// Optional parity filter for this entry.
    pub parity: Option<Parity>,
}

/// A parsed page-range expression, ready to be resolved against a page count.
///
/// Constructed via [`PageRange::parse`].
#[derive(Debug, Clone, PartialEq, Eq)]
pub struct PageRange {
    /// `None` means "all pages" (empty string input).
    pub(crate) entries: Option<Vec<PageRangeEntry>>,
}

impl PageRange {
    /// Parse a page-range expression.
    ///
    /// An empty string returns the "all pages" sentinel. Any syntax error
    /// produces an [`Error::Parse`] with an actionable message; the byte
    /// offset is relative to the start of the input string.
    ///
    /// # Errors
    ///
    /// - [`Error::Parse`] when the input is a non-empty string that is not a
    ///   valid page-range expression (invalid endpoint, `0`/`r0`, a dangling
    ///   `-`, an empty or trailing entry, an unknown `:` parity suffix, or any
    ///   unexpected character).
    pub fn parse(input: &str) -> Result<Self> {
        if input.is_empty() {
            return Ok(Self { entries: None });
        }
        let entries = parse_entries(input)?;
        Ok(Self {
            entries: Some(entries),
        })
    }

    /// Construct a range that selects **no** pages.
    ///
    /// This is distinct from [`PageRange::parse`] of the empty string, which
    /// returns the "all pages" sentinel. It corresponds to qpdf's
    /// overlay/underlay semantics where an explicitly empty `--from=` selects an
    /// empty source set, so [`resolve`](PageRange::resolve) returns an empty
    /// vector for any page count.
    pub fn empty() -> Self {
        Self {
            entries: Some(Vec::new()),
        }
    }

    /// Resolve the parsed expression against `page_count` (the number of pages
    /// in the document, ≥ 1).
    ///
    /// Returns an ordered, deduplicated (first-occurrence-wins) `Vec<u32>` of
    /// 1-based page numbers.
    ///
    /// # Errors
    ///
    /// - `page_count` is 0.
    /// - An absolute page number exceeds `page_count`.
    /// - A `rN` endpoint has N > `page_count`.
    /// - A `z` endpoint when `page_count` is 0 (covered by the first check).
    pub fn resolve(&self, page_count: u32) -> Result<Vec<u32>> {
        if page_count == 0 {
            return Err(Error::parse(0, "page_count must be at least 1"));
        }
        let entries = match &self.entries {
            None => return Ok((1..=page_count).collect()),
            Some(e) => e,
        };

        let mut result: Vec<u32> = Vec::new();
        let mut seen: std::collections::HashSet<u32> = std::collections::HashSet::new();

        for entry in entries {
            let expanded = resolve_entry(entry, page_count)?;
            for p in expanded {
                if seen.insert(p) {
                    result.push(p);
                }
            }
        }
        Ok(result)
    }
}

// ---------------------------------------------------------------------------
// Internal helpers
// ---------------------------------------------------------------------------

fn resolve_endpoint(ep: &Endpoint, page_count: u32) -> Result<u32> {
    match ep {
        Endpoint::Num(n) => {
            if *n > page_count {
                return Err(Error::parse(
                    0,
                    format!("page number {n} is out of range (document has {page_count} page(s))"),
                ));
            }
            Ok(*n)
        }
        Endpoint::Z => Ok(page_count),
        Endpoint::FromEnd(n) => {
            if *n > page_count {
                return Err(Error::parse(
                    0,
                    format!("r{n} is out of range (document has {page_count} page(s))"),
                ));
            }
            Ok(page_count + 1 - n)
        }
    }
}

fn resolve_entry(entry: &PageRangeEntry, page_count: u32) -> Result<Vec<u32>> {
    let start = resolve_endpoint(&entry.start, page_count)?;
    let end = match &entry.end {
        None => start,
        Some(ep) => resolve_endpoint(ep, page_count)?,
    };

    // Build the sequence (ascending or descending).
    let seq: Vec<u32> = if start <= end {
        (start..=end).collect()
    } else {
        (end..=start).rev().collect()
    };

    // Apply parity filter (position is 1-based within this entry's sequence).
    let filtered = match entry.parity {
        None => seq,
        Some(Parity::Odd) => seq
            .into_iter()
            .enumerate()
            .filter(|(i, _)| i % 2 == 0)
            .map(|(_, p)| p)
            .collect(),
        Some(Parity::Even) => seq
            .into_iter()
            .enumerate()
            .filter(|(i, _)| i % 2 == 1)
            .map(|(_, p)| p)
            .collect(),
    };
    Ok(filtered)
}

// ---------------------------------------------------------------------------
// Parser
// ---------------------------------------------------------------------------

struct RangeParser<'a> {
    input: &'a str,
    pos: usize,
}

impl<'a> RangeParser<'a> {
    fn new(input: &'a str) -> Self {
        Self { input, pos: 0 }
    }

    fn remaining(&self) -> &str {
        &self.input[self.pos..]
    }

    fn peek(&self) -> Option<char> {
        self.remaining().chars().next()
    }

    fn advance(&mut self, n: usize) {
        self.pos += n;
    }

    fn err(&self, msg: impl Into<String>) -> Error {
        Error::parse(self.pos, msg.into())
    }

    /// Parse a non-negative integer. Returns Err if no digits are found.
    fn parse_u32(&mut self) -> Result<u32> {
        let start = self.pos;
        let digits: String = self
            .remaining()
            .chars()
            .take_while(|c| c.is_ascii_digit())
            .collect();
        if digits.is_empty() {
            return Err(self.err(format!("expected a page number at position {}", self.pos)));
        }
        self.advance(digits.len());
        digits
            .parse::<u32>()
            .map_err(|_| Error::parse(start, format!("page number too large at position {start}")))
    }

    /// Parse a single endpoint: `z`, `rN`, or a positive integer.
    fn parse_endpoint(&mut self) -> Result<Endpoint> {
        match self.peek() {
            Some('z') => {
                self.advance(1);
                Ok(Endpoint::Z)
            }
            Some('r') => {
                self.advance(1);
                let n = self.parse_u32()?;
                if n == 0 {
                    return Err(self.err("r0 is invalid; r1 means the last page"));
                }
                Ok(Endpoint::FromEnd(n))
            }
            Some(c) if c.is_ascii_digit() => {
                let start_pos = self.pos;
                let n = self.parse_u32()?;
                if n == 0 {
                    return Err(Error::parse(
                        start_pos,
                        "page number 0 is invalid; pages are 1-based",
                    ));
                }
                Ok(Endpoint::Num(n))
            }
            Some(c) => Err(self.err(format!(
                "unexpected character '{c}' at position {}; expected a page number, 'z', or 'rN'",
                self.pos
            ))),
            None => Err(self.err(format!(
                "unexpected end of input at position {}; expected a page number, 'z', or 'rN'",
                self.pos
            ))),
        }
    }

    /// Parse one entry: `endpoint ("-" endpoint)? (":odd"|":even")?`
    fn parse_entry(&mut self) -> Result<PageRangeEntry> {
        let start = self.parse_endpoint()?;

        let end = if self.remaining().starts_with('-') {
            self.advance(1);
            Some(self.parse_endpoint()?)
        } else {
            None
        };

        let parity = if self.remaining().starts_with(':') {
            self.advance(1); // consume ':'
            if self.remaining().starts_with("odd") {
                self.advance(3);
                Some(Parity::Odd)
            } else if self.remaining().starts_with("even") {
                self.advance(4);
                Some(Parity::Even)
            } else {
                let token: String = self
                    .remaining()
                    .chars()
                    .take_while(|c| c.is_alphanumeric())
                    .collect();
                return Err(self.err(format!(
                    "unknown parity suffix ':{token}' at position {}; expected ':odd' or ':even'",
                    self.pos
                )));
            }
        } else {
            None
        };

        Ok(PageRangeEntry { start, end, parity })
    }
}

fn parse_entries(input: &str) -> Result<Vec<PageRangeEntry>> {
    let mut p = RangeParser::new(input);
    let mut entries = Vec::new();

    loop {
        // Empty segment (e.g. "1,,2" would have an empty segment between commas).
        match p.peek() {
            None => break,
            Some(',') => {
                return Err(p.err(format!(
                    "empty entry at position {}; consecutive commas are not allowed",
                    p.pos
                )));
            }
            _ => {}
        }

        entries.push(p.parse_entry()?);

        match p.peek() {
            None => break,
            Some(',') => {
                p.advance(1);
                // Check for trailing comma.
                if p.peek().is_none() {
                    return Err(p.err(format!("trailing comma at position {}", p.pos)));
                }
            }
            Some(c) => {
                return Err(p.err(format!(
                    "unexpected character '{c}' at position {}; expected ',' or end of input",
                    p.pos
                )));
            }
        }
    }

    if entries.is_empty() {
        // Should not reach here since we check `input.is_empty()` above,
        // but guard defensively.
        return Err(Error::parse(0, "page range is empty"));
    }

    Ok(entries)
}

// ---------------------------------------------------------------------------
// Tests
// ---------------------------------------------------------------------------

#[cfg(test)]
mod tests {
    use super::*;

    // -----------------------------------------------------------------------
    // Parse-level tests (no page count needed)
    // -----------------------------------------------------------------------

    fn parse_ok(input: &str) -> PageRange {
        PageRange::parse(input).unwrap_or_else(|e| panic!("expected Ok for {input:?}, got: {e}"))
    }

    fn parse_err(input: &str) -> String {
        PageRange::parse(input)
            .err()
            .unwrap_or_else(|| panic!("expected Err for {input:?}"))
            .to_string()
    }

    #[test]
    fn empty_string_is_all_pages() {
        let pr = parse_ok("");
        assert_eq!(pr.entries, None);
    }

    #[test]
    fn single_page() {
        let pr = parse_ok("3");
        let entries = pr.entries.as_ref().unwrap();
        assert_eq!(entries.len(), 1);
        assert_eq!(entries[0].start, Endpoint::Num(3));
        assert_eq!(entries[0].end, None);
        assert_eq!(entries[0].parity, None);
    }

    #[test]
    fn z_endpoint() {
        let pr = parse_ok("z");
        let entries = pr.entries.as_ref().unwrap();
        assert_eq!(entries[0].start, Endpoint::Z);
    }

    #[test]
    fn from_end_endpoint() {
        let pr = parse_ok("r3");
        let entries = pr.entries.as_ref().unwrap();
        assert_eq!(entries[0].start, Endpoint::FromEnd(3));
    }

    #[test]
    fn ascending_range() {
        let pr = parse_ok("1-5");
        let entries = pr.entries.as_ref().unwrap();
        assert_eq!(entries[0].start, Endpoint::Num(1));
        assert_eq!(entries[0].end, Some(Endpoint::Num(5)));
    }

    #[test]
    fn descending_range() {
        let pr = parse_ok("5-1");
        let entries = pr.entries.as_ref().unwrap();
        assert_eq!(entries[0].start, Endpoint::Num(5));
        assert_eq!(entries[0].end, Some(Endpoint::Num(1)));
    }

    #[test]
    fn range_with_z() {
        let pr = parse_ok("r3-z");
        let entries = pr.entries.as_ref().unwrap();
        assert_eq!(entries[0].start, Endpoint::FromEnd(3));
        assert_eq!(entries[0].end, Some(Endpoint::Z));
    }

    #[test]
    fn odd_parity() {
        let pr = parse_ok("1-9:odd");
        let entries = pr.entries.as_ref().unwrap();
        assert_eq!(entries[0].parity, Some(Parity::Odd));
    }

    #[test]
    fn even_parity() {
        let pr = parse_ok("1-9:even");
        let entries = pr.entries.as_ref().unwrap();
        assert_eq!(entries[0].parity, Some(Parity::Even));
    }

    #[test]
    fn multiple_entries() {
        let pr = parse_ok("1,3,5-9,15-12");
        let entries = pr.entries.as_ref().unwrap();
        assert_eq!(entries.len(), 4);
    }

    #[test]
    fn parity_on_single_page() {
        // ':odd' on a single page is syntactically valid.
        let pr = parse_ok("5:odd");
        let entries = pr.entries.as_ref().unwrap();
        assert_eq!(entries[0].start, Endpoint::Num(5));
        assert_eq!(entries[0].parity, Some(Parity::Odd));
    }

    // -----------------------------------------------------------------------
    // Invalid inputs
    // -----------------------------------------------------------------------

    #[test]
    fn page_zero_is_invalid() {
        let msg = parse_err("0");
        assert!(msg.contains("0 is invalid"), "got: {msg}");
    }

    #[test]
    fn r0_is_invalid() {
        let msg = parse_err("r0");
        assert!(msg.contains("r0 is invalid"), "got: {msg}");
    }

    #[test]
    fn trailing_dash_is_invalid() {
        let msg = parse_err("1-");
        assert!(msg.contains("expected a page number"), "got: {msg}");
    }

    #[test]
    fn leading_dash_is_invalid() {
        let msg = parse_err("-1");
        assert!(msg.contains("unexpected character"), "got: {msg}");
    }

    #[test]
    fn double_comma_is_invalid() {
        let msg = parse_err("1,,2");
        assert!(
            msg.contains("empty entry") || msg.contains("consecutive commas"),
            "got: {msg}"
        );
    }

    #[test]
    fn trailing_comma_is_invalid() {
        let msg = parse_err("1,2,");
        assert!(msg.contains("trailing comma"), "got: {msg}");
    }

    #[test]
    fn unknown_suffix_is_invalid() {
        let msg = parse_err("1-9:foo");
        assert!(msg.contains("unknown parity suffix"), "got: {msg}");
    }

    #[test]
    fn bare_colon_is_invalid() {
        let msg = parse_err(":odd");
        assert!(!msg.is_empty());
    }

    #[test]
    fn alpha_input_is_invalid() {
        let msg = parse_err("abc");
        assert!(!msg.is_empty());
    }

    #[test]
    fn lone_r_without_number_is_invalid() {
        let msg = parse_err("r");
        assert!(msg.contains("expected a page number"), "got: {msg}");
    }

    // -----------------------------------------------------------------------
    // Resolve-level tests
    // -----------------------------------------------------------------------

    fn resolve(input: &str, page_count: u32) -> Vec<u32> {
        PageRange::parse(input)
            .and_then(|pr| pr.resolve(page_count))
            .unwrap_or_else(|e| {
                panic!("expected Ok for {input:?} with {page_count} pages, got: {e}")
            })
    }

    fn resolve_err(input: &str, page_count: u32) -> String {
        let pr = PageRange::parse(input).expect("parse should succeed");
        pr.resolve(page_count)
            .err()
            .unwrap_or_else(|| panic!("expected Err for {input:?} with {page_count} pages"))
            .to_string()
    }

    #[test]
    fn empty_resolves_to_all() {
        assert_eq!(resolve("", 5), vec![1, 2, 3, 4, 5]);
    }

    #[test]
    fn empty_constructor_selects_no_pages() {
        // `PageRange::empty()` is the empty source set (qpdf `--from=`), distinct
        // from `parse("")` which is the "all pages" sentinel.
        let none = PageRange::empty();
        assert_eq!(none.entries, Some(Vec::new()));
        assert_eq!(none.resolve(5).unwrap(), Vec::<u32>::new());
        assert_ne!(none, PageRange::parse("").unwrap());
    }

    #[test]
    fn single_page_resolve() {
        assert_eq!(resolve("3", 10), vec![3]);
    }

    #[test]
    fn z_resolves_to_last() {
        assert_eq!(resolve("z", 7), vec![7]);
    }

    #[test]
    fn r1_resolves_to_last() {
        assert_eq!(resolve("r1", 7), vec![7]);
    }

    #[test]
    fn r2_resolves_to_second_to_last() {
        assert_eq!(resolve("r2", 7), vec![6]);
    }

    #[test]
    fn ascending_range_resolve() {
        assert_eq!(resolve("1-5", 10), vec![1, 2, 3, 4, 5]);
    }

    #[test]
    fn descending_range_resolve() {
        assert_eq!(resolve("5-1", 10), vec![5, 4, 3, 2, 1]);
    }

    #[test]
    fn r3_to_z_resolve() {
        // r3 on a 5-page doc = page 3; z = page 5.
        assert_eq!(resolve("r3-z", 5), vec![3, 4, 5]);
    }

    #[test]
    fn odd_parity_resolve() {
        // '1-9:odd' → positions 1,3,5,7,9 of [1..9] = [1,3,5,7,9]
        assert_eq!(resolve("1-9:odd", 9), vec![1, 3, 5, 7, 9]);
    }

    #[test]
    fn even_parity_resolve() {
        // '1-9:even' → positions 2,4,6,8 of [1..9] = [2,4,6,8]
        assert_eq!(resolve("1-9:even", 9), vec![2, 4, 6, 8]);
    }

    #[test]
    fn even_parity_offset_range() {
        // '2-8:even' → positions 2,4,6 of [2,3,4,5,6,7,8] = [3,5,7]
        assert_eq!(resolve("2-8:even", 10), vec![3, 5, 7]);
    }

    #[test]
    fn one_to_twenty_even() {
        // '1-20:even' → positions 2,4,...,20 of [1..20] = [2,4,...,20]
        let expected: Vec<u32> = (1..=10).map(|i| i * 2).collect();
        assert_eq!(resolve("1-20:even", 20), expected);
    }

    #[test]
    fn deduplication_preserves_order() {
        // '1,3,5,3' → [1,3,5] (first occurrence wins; second '3' dropped)
        assert_eq!(resolve("1,3,5,3", 10), vec![1, 3, 5]);
    }

    #[test]
    fn mixed_selection() {
        // '1,3,5-9,15-12' on a 20-page doc
        let result = resolve("1,3,5-9,15-12", 20);
        let expected = vec![1, 3, 5, 6, 7, 8, 9, 15, 14, 13, 12];
        assert_eq!(result, expected);
    }

    #[test]
    fn out_of_range_page_number_is_error() {
        let msg = resolve_err("10", 5);
        assert!(msg.contains("out of range"), "got: {msg}");
    }

    #[test]
    fn out_of_range_from_end_is_error() {
        let msg = resolve_err("r10", 5);
        assert!(msg.contains("out of range"), "got: {msg}");
    }

    #[test]
    fn page_count_zero_is_error() {
        let pr = PageRange::parse("1").unwrap();
        let err = pr.resolve(0).unwrap_err().to_string();
        assert!(err.contains("page_count must be at least 1"), "got: {err}");
    }

    #[test]
    fn z_with_single_page_doc() {
        assert_eq!(resolve("z", 1), vec![1]);
    }

    #[test]
    fn full_doc_range_z_1() {
        // 'z-1' on a 5-page doc = [5,4,3,2,1]
        assert_eq!(resolve("z-1", 5), vec![5, 4, 3, 2, 1]);
    }
}