|
| 1 | +// Copyright 2026 Carlos Munoz and the Folio Authors |
| 2 | +// SPDX-License-Identifier: Apache-2.0 |
| 3 | + |
| 4 | +package document_test |
| 5 | + |
| 6 | +import ( |
| 7 | + "bytes" |
| 8 | + "testing" |
| 9 | + |
| 10 | + "github.com/carlos7ags/folio/core" |
| 11 | + "github.com/carlos7ags/folio/document" |
| 12 | + "github.com/carlos7ags/folio/font" |
| 13 | + "github.com/carlos7ags/folio/layout" |
| 14 | + "github.com/carlos7ags/folio/reader" |
| 15 | +) |
| 16 | + |
| 17 | +// TestNamedDestPageIndexOffsetByManualPages verifies that an anchor produced by |
| 18 | +// flow content is registered on its ABSOLUTE page index — offset past any |
| 19 | +// manually-added pages (manualPageCount + i) — so an internal link lands on the |
| 20 | +// right page in a document that mixes manual pages with laid-out flow content. |
| 21 | +func TestNamedDestPageIndexOffsetByManualPages(t *testing.T) { |
| 22 | + d := document.NewDocument(document.PageSizeLetter) |
| 23 | + d.AddPage() // manual page 0 |
| 24 | + d.AddPage() // manual page 1 |
| 25 | + |
| 26 | + // Flow content: the anchored element becomes flow page 0 → absolute page 2. |
| 27 | + d.Add(layout.NewAnchor(layout.NewParagraph("Target section", font.Helvetica, 12), "target")) |
| 28 | + |
| 29 | + var buf bytes.Buffer |
| 30 | + if _, err := d.WriteTo(&buf); err != nil { |
| 31 | + t.Fatalf("WriteTo: %v", err) |
| 32 | + } |
| 33 | + r, err := reader.Parse(buf.Bytes()) |
| 34 | + if err != nil { |
| 35 | + t.Fatalf("reader.Parse: %v", err) |
| 36 | + } |
| 37 | + if got := r.PageCount(); got != 3 { |
| 38 | + t.Fatalf("page count = %d, want 3 (2 manual + 1 flow)", got) |
| 39 | + } |
| 40 | + |
| 41 | + // /Dests → target → [pageRef /XYZ ...]. |
| 42 | + cat := r.Catalog() |
| 43 | + destsObj, err := r.ResolveObject(cat.Get("Dests")) |
| 44 | + if err != nil { |
| 45 | + t.Fatalf("resolve /Dests: %v", err) |
| 46 | + } |
| 47 | + dests, ok := destsObj.(*core.PdfDictionary) |
| 48 | + if !ok { |
| 49 | + t.Fatalf("/Dests is %T, want *core.PdfDictionary", destsObj) |
| 50 | + } |
| 51 | + arrObj, err := r.ResolveObject(dests.Get("target")) |
| 52 | + if err != nil { |
| 53 | + t.Fatalf("resolve dest target: %v", err) |
| 54 | + } |
| 55 | + arr, ok := arrObj.(*core.PdfArray) |
| 56 | + if !ok || arr.Len() < 1 { |
| 57 | + t.Fatalf("dest target is %T/len<1, want a destination array", arrObj) |
| 58 | + } |
| 59 | + pageRef, ok := arr.At(0).(*core.PdfIndirectReference) |
| 60 | + if !ok { |
| 61 | + t.Fatalf("dest page target is %T, want *core.PdfIndirectReference", arr.At(0)) |
| 62 | + } |
| 63 | + |
| 64 | + if idx := pageIndexInKids(t, r, pageRef.ObjectNumber); idx != 2 { |
| 65 | + t.Errorf("anchor destination page index = %d, want 2 (offset past the 2 manual pages)", idx) |
| 66 | + } |
| 67 | +} |
| 68 | + |
| 69 | +// TestNamedDestDuplicateNameFirstWins verifies that when a destination name is |
| 70 | +// registered more than once (duplicate ids, or an id colliding with a caller's |
| 71 | +// AddNamedDest), the /Dests dictionary keeps the FIRST registration — matching |
| 72 | +// the link-annotation resolver, which stops at the first match, so both point |
| 73 | +// at the same target. |
| 74 | +func TestNamedDestDuplicateNameFirstWins(t *testing.T) { |
| 75 | + d := document.NewDocument(document.PageSizeLetter) |
| 76 | + d.AddPage() // page 0 |
| 77 | + d.AddPage() // page 1 |
| 78 | + |
| 79 | + d.AddNamedDest(document.NamedDest{Name: "dup", PageIndex: 0, FitType: "XYZ", Top: 700}) |
| 80 | + d.AddNamedDest(document.NamedDest{Name: "dup", PageIndex: 1, FitType: "XYZ", Top: 700}) |
| 81 | + |
| 82 | + var buf bytes.Buffer |
| 83 | + if _, err := d.WriteTo(&buf); err != nil { |
| 84 | + t.Fatalf("WriteTo: %v", err) |
| 85 | + } |
| 86 | + r, err := reader.Parse(buf.Bytes()) |
| 87 | + if err != nil { |
| 88 | + t.Fatalf("reader.Parse: %v", err) |
| 89 | + } |
| 90 | + |
| 91 | + destsObj, err := r.ResolveObject(r.Catalog().Get("Dests")) |
| 92 | + if err != nil { |
| 93 | + t.Fatalf("resolve /Dests: %v", err) |
| 94 | + } |
| 95 | + dests, ok := destsObj.(*core.PdfDictionary) |
| 96 | + if !ok { |
| 97 | + t.Fatalf("/Dests is %T, want *core.PdfDictionary", destsObj) |
| 98 | + } |
| 99 | + arrObj, err := r.ResolveObject(dests.Get("dup")) |
| 100 | + if err != nil { |
| 101 | + t.Fatalf("resolve dest dup: %v", err) |
| 102 | + } |
| 103 | + arr, ok := arrObj.(*core.PdfArray) |
| 104 | + if !ok || arr.Len() < 1 { |
| 105 | + t.Fatalf("dest dup is %T/len<1, want a destination array", arrObj) |
| 106 | + } |
| 107 | + pageRef, ok := arr.At(0).(*core.PdfIndirectReference) |
| 108 | + if !ok { |
| 109 | + t.Fatalf("dest page target is %T, want *core.PdfIndirectReference", arr.At(0)) |
| 110 | + } |
| 111 | + if idx := pageIndexInKids(t, r, pageRef.ObjectNumber); idx != 0 { |
| 112 | + t.Errorf("duplicate name resolved to page %d, want 0 (first registration must win)", idx) |
| 113 | + } |
| 114 | +} |
| 115 | + |
| 116 | +// pageIndexInKids returns the position of the page object objNum within the |
| 117 | +// page tree's /Kids array. |
| 118 | +func pageIndexInKids(t *testing.T, r *reader.PdfReader, objNum int) int { |
| 119 | + t.Helper() |
| 120 | + pagesObj, err := r.ResolveObject(r.Catalog().Get("Pages")) |
| 121 | + if err != nil { |
| 122 | + t.Fatalf("resolve /Pages: %v", err) |
| 123 | + } |
| 124 | + pages, ok := pagesObj.(*core.PdfDictionary) |
| 125 | + if !ok { |
| 126 | + t.Fatalf("/Pages is %T, want *core.PdfDictionary", pagesObj) |
| 127 | + } |
| 128 | + kids, ok := pages.Get("Kids").(*core.PdfArray) |
| 129 | + if !ok { |
| 130 | + t.Fatal("/Pages has no /Kids array") |
| 131 | + } |
| 132 | + for i := 0; i < kids.Len(); i++ { |
| 133 | + if ref, ok := kids.At(i).(*core.PdfIndirectReference); ok && ref.ObjectNumber == objNum { |
| 134 | + return i |
| 135 | + } |
| 136 | + } |
| 137 | + t.Fatalf("page object %d not found in /Kids", objNum) |
| 138 | + return -1 |
| 139 | +} |
0 commit comments