d703a14745
Children were forced to StrategyRecursive on the assumption that re-profiling each parent would be too expensive. In practice profiling each parent is bounded by O(sum(parent_size)) ≈ O(N) total, the same order as the original parent profiling pass — and the gain is real: when a parent (e.g. an H1 chapter) contains its own sub-headings, the heading splitter on child input now picks them up and generates a finer-grained breadcrumb instead of every child sharing the parent's top-level breadcrumb. Add mergeBreadcrumbs to combine the parent ContextHeader with the child's freshly-derived one, dropping the duplicated seam line that appears when the child's first heading equals the parent's last. Tests cover (a) sub-headings now appearing in child breadcrumbs and (b) the merge dedup against duplicated seam lines.
250 lines
8.2 KiB
Go
250 lines
8.2 KiB
Go
package chunker
|
|
|
|
import (
|
|
"strings"
|
|
"testing"
|
|
)
|
|
|
|
func TestSplit_EmptyText(t *testing.T) {
|
|
if got := Split("", DefaultConfig()); got != nil {
|
|
t.Errorf("empty text should return nil, got %v", got)
|
|
}
|
|
}
|
|
|
|
func TestSplit_LegacyStrategy_MatchesSplitText(t *testing.T) {
|
|
text := strings.Repeat("Hello world.\n\n", 30)
|
|
cfg := SplitterConfig{ChunkSize: 100, ChunkOverlap: 20, Separators: []string{"\n\n"}, Strategy: StrategyLegacy}
|
|
a := Split(text, cfg)
|
|
b := SplitText(text, cfg)
|
|
if len(a) != len(b) {
|
|
t.Errorf("legacy strategy should match SplitText: got %d vs %d chunks", len(a), len(b))
|
|
}
|
|
for i := range a {
|
|
if a[i].Content != b[i].Content {
|
|
t.Errorf("chunk %d differs", i)
|
|
}
|
|
}
|
|
}
|
|
|
|
func TestSplit_EmptyStrategyEqualsLegacy(t *testing.T) {
|
|
text := strings.Repeat("Sentence one. Sentence two.\n", 20)
|
|
cfg := SplitterConfig{ChunkSize: 80, ChunkOverlap: 10}
|
|
a := Split(text, cfg)
|
|
cfg.Strategy = StrategyLegacy
|
|
b := Split(text, cfg)
|
|
if len(a) != len(b) {
|
|
t.Errorf("empty Strategy should equal legacy: %d vs %d", len(a), len(b))
|
|
}
|
|
}
|
|
|
|
func TestSplit_AutoStrategy_PicksHeadingForMarkdownDoc(t *testing.T) {
|
|
doc := strings.Repeat("# A\nbody\n## B\nbody\n## C\nbody\n## D\nbody\n", 1)
|
|
cfg := SplitterConfig{ChunkSize: 200, ChunkOverlap: 20, Strategy: StrategyAuto}
|
|
// Until heading_splitter is wired, this falls through to SplitText —
|
|
// just assert we get a valid result.
|
|
chunks := Split(doc, cfg)
|
|
if len(chunks) == 0 {
|
|
t.Error("auto strategy should produce chunks")
|
|
}
|
|
}
|
|
|
|
// TestSplit_PreservesPositionInvariantAcrossTiers ensures every chunk's
|
|
// (Start, End, Content) triple stays consistent — End-Start must equal the
|
|
// rune length of Content, and runes[Start:End] must equal Content. This is
|
|
// the contract that knowledge.go:2278+ relies on for document reconstruction
|
|
// during summary generation.
|
|
func TestSplit_PreservesPositionInvariantAcrossTiers(t *testing.T) {
|
|
cases := map[string]string{
|
|
"heading-tier": "# Top\nintro paragraph here.\n\n## Section A\nbody A here.\n\n## Section B\nbody B here.\n\n## Section C\nbody C.",
|
|
"heuristic-tier": strings.Repeat("Kapitel 1: Einleitung\n", 1) + strings.Repeat("Beispieltext. ", 50) +
|
|
"\n\n" + strings.Repeat("Kapitel 2: Hauptteil\n", 1) + strings.Repeat("Mehr Text. ", 50),
|
|
"recursive-tier": strings.Repeat("plain prose without structure. ", 100),
|
|
}
|
|
cfg := SplitterConfig{ChunkSize: 300, ChunkOverlap: 30, Separators: []string{"\n\n", "\n", "。", ". "}, Strategy: StrategyAuto}
|
|
|
|
for name, doc := range cases {
|
|
t.Run(name, func(t *testing.T) {
|
|
runes := []rune(doc)
|
|
chunks := Split(doc, cfg)
|
|
if len(chunks) == 0 {
|
|
t.Fatal("expected chunks")
|
|
}
|
|
for i, c := range chunks {
|
|
contentRuneLen := len([]rune(c.Content))
|
|
spanLen := c.End - c.Start
|
|
if spanLen != contentRuneLen {
|
|
t.Errorf("chunk %d: End(%d)-Start(%d)=%d but Content has %d runes:\n%q",
|
|
i, c.End, c.Start, spanLen, contentRuneLen, c.Content)
|
|
}
|
|
if c.Start < 0 || c.End > len(runes) {
|
|
t.Errorf("chunk %d: position out of range Start=%d End=%d totalRunes=%d",
|
|
i, c.Start, c.End, len(runes))
|
|
}
|
|
if c.Start >= 0 && c.End <= len(runes) {
|
|
sliced := string(runes[c.Start:c.End])
|
|
if sliced != c.Content {
|
|
t.Errorf("chunk %d: runes[Start:End] differs from Content", i)
|
|
}
|
|
}
|
|
}
|
|
})
|
|
}
|
|
}
|
|
|
|
// Children should pick up sub-heading context when childCfg uses auto
|
|
// strategy on a heading-rich document. Previously child splitting was
|
|
// pinned to the recursive tier, so sub-chunks all shared the parent's
|
|
// top-level breadcrumb regardless of inner H2/H3 structure.
|
|
func TestSplitParentChild_AutoStrategyEnrichesChildBreadcrumbs(t *testing.T) {
|
|
body := strings.Repeat("Lorem ipsum dolor sit amet. ", 40)
|
|
doc := "# Chapter\n" + body +
|
|
"\n\n## Section A\n" + body +
|
|
"\n\n## Section B\n" + body +
|
|
"\n\n## Section C\n" + body
|
|
seps := []string{"\n\n", "\n", ". "}
|
|
parentCfg := SplitterConfig{ChunkSize: 800, ChunkOverlap: 80, Strategy: StrategyAuto, Separators: seps}
|
|
childCfg := SplitterConfig{ChunkSize: 200, ChunkOverlap: 20, Strategy: StrategyAuto, Separators: seps}
|
|
res := SplitParentChild(doc, parentCfg, childCfg)
|
|
if len(res.Children) == 0 {
|
|
t.Fatal("expected children")
|
|
}
|
|
|
|
// At least one child should carry a breadcrumb that includes a
|
|
// sub-heading (## Section …) — that's only possible if the child
|
|
// splitter re-detected headings inside the parent.
|
|
saw := false
|
|
for _, c := range res.Children {
|
|
if strings.Contains(c.ContextHeader, "## Section") {
|
|
saw = true
|
|
break
|
|
}
|
|
}
|
|
if !saw {
|
|
t.Errorf("no child carries a sub-heading breadcrumb. samples:\n %q\n %q",
|
|
firstHeader(res.Children), lastHeader(res.Children))
|
|
}
|
|
|
|
// And no breadcrumb should contain the same line twice in a row
|
|
// (mergeBreadcrumbs deduplicates the parent/child seam).
|
|
for i, c := range res.Children {
|
|
lines := strings.Split(c.ContextHeader, "\n")
|
|
for j := 1; j < len(lines); j++ {
|
|
if strings.TrimSpace(lines[j]) != "" && lines[j] == lines[j-1] {
|
|
t.Errorf("child[%d] has duplicate breadcrumb lines: %q", i, c.ContextHeader)
|
|
break
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
func firstHeader(cs []ChildChunk) string {
|
|
if len(cs) == 0 {
|
|
return ""
|
|
}
|
|
return cs[0].ContextHeader
|
|
}
|
|
|
|
func lastHeader(cs []ChildChunk) string {
|
|
if len(cs) == 0 {
|
|
return ""
|
|
}
|
|
return cs[len(cs)-1].ContextHeader
|
|
}
|
|
|
|
func TestMergeBreadcrumbs(t *testing.T) {
|
|
cases := []struct {
|
|
name string
|
|
parent, child string
|
|
want string
|
|
}{
|
|
{"empty parent", "", "## Sub", "## Sub"},
|
|
{"empty child", "# Top", "", "# Top"},
|
|
{"both empty", "", "", ""},
|
|
{"disjoint", "# Top", "## Other", "# Top\n## Other"},
|
|
{"duplicate seam", "# Top\n## A", "## A\n### A1", "# Top\n## A\n### A1"},
|
|
{"deep duplicate", "# Top", "# Top", "# Top"},
|
|
{"only whitespace differs", "# Top\n## A", " ## A \n### A1", "# Top\n## A\n### A1"},
|
|
}
|
|
for _, tc := range cases {
|
|
t.Run(tc.name, func(t *testing.T) {
|
|
got := mergeBreadcrumbs(tc.parent, tc.child)
|
|
if got != tc.want {
|
|
t.Errorf("mergeBreadcrumbs(%q, %q) = %q, want %q", tc.parent, tc.child, got, tc.want)
|
|
}
|
|
})
|
|
}
|
|
}
|
|
|
|
func TestSplitParentChild_LegacyStrategy(t *testing.T) {
|
|
text := strings.Repeat("This is a sentence. Another one.\n\n", 50)
|
|
parentCfg := SplitterConfig{ChunkSize: 400, ChunkOverlap: 40, Strategy: StrategyLegacy}
|
|
childCfg := SplitterConfig{ChunkSize: 100, ChunkOverlap: 20, Strategy: StrategyLegacy}
|
|
res := SplitParentChild(text, parentCfg, childCfg)
|
|
if len(res.Children) == 0 {
|
|
t.Fatal("expected children chunks")
|
|
}
|
|
for i, c := range res.Children {
|
|
if c.ParentIndex >= 0 && c.ParentIndex >= len(res.Parents) {
|
|
t.Errorf("child[%d] has invalid ParentIndex %d (parents=%d)", i, c.ParentIndex, len(res.Parents))
|
|
}
|
|
}
|
|
}
|
|
|
|
func TestEnsureDefaults(t *testing.T) {
|
|
cfg := ensureDefaults(SplitterConfig{})
|
|
if cfg.ChunkSize != DefaultChunkSize {
|
|
t.Errorf("expected default ChunkSize %d, got %d", DefaultChunkSize, cfg.ChunkSize)
|
|
}
|
|
if cfg.ChunkOverlap != DefaultChunkOverlap {
|
|
t.Errorf("expected default ChunkOverlap %d, got %d", DefaultChunkOverlap, cfg.ChunkOverlap)
|
|
}
|
|
if len(cfg.Separators) == 0 {
|
|
t.Error("expected default separators")
|
|
}
|
|
}
|
|
|
|
func TestValidateChunks_Empty(t *testing.T) {
|
|
if v := ValidateChunks(nil, 1000, 500); v.OK {
|
|
t.Error("nil chunks should be invalid")
|
|
}
|
|
}
|
|
|
|
func TestValidateChunks_SingleChunkLargeDoc(t *testing.T) {
|
|
c := []Chunk{{Content: strings.Repeat("a", 5000)}}
|
|
if v := ValidateChunks(c, 5000, 500); v.OK {
|
|
t.Error("single 10x-too-large chunk should be invalid")
|
|
}
|
|
}
|
|
|
|
func TestValidateChunks_AcceptsReasonableOutput(t *testing.T) {
|
|
chunks := []Chunk{
|
|
{Content: strings.Repeat("a", 480)},
|
|
{Content: strings.Repeat("b", 510)},
|
|
{Content: strings.Repeat("c", 460)},
|
|
}
|
|
if v := ValidateChunks(chunks, 1500, 512); !v.OK {
|
|
t.Errorf("reasonable chunks should validate, got: %s", v.Reason)
|
|
}
|
|
}
|
|
|
|
func TestValidateChunks_RejectsOversized(t *testing.T) {
|
|
chunks := []Chunk{
|
|
{Content: strings.Repeat("a", 100)},
|
|
{Content: strings.Repeat("b", 5000)}, // > 2x chunkSize
|
|
}
|
|
if v := ValidateChunks(chunks, 5100, 1000); v.OK {
|
|
t.Error("chunk >2x size should be invalid")
|
|
}
|
|
}
|
|
|
|
func TestValidateChunks_TolerantTinyTail(t *testing.T) {
|
|
chunks := []Chunk{
|
|
{Content: strings.Repeat("a", 480)},
|
|
{Content: strings.Repeat("b", 510)},
|
|
{Content: "tail"},
|
|
}
|
|
if v := ValidateChunks(chunks, 994, 512); !v.OK {
|
|
t.Errorf("tiny last chunk should be tolerated, got: %s", v.Reason)
|
|
}
|
|
}
|