lean-ctx-engine 3.12.1

//! Tokenization, code-chunk extraction and search-result formatting.
//! Split out of `bm25_index/mod.rs`; `use super::*` re-imports parent items.

#[allow(clippy::wildcard_imports)]
use super::*;
pub fn tokenize(text: &str) -> Vec<String> {
    let mut tokens = Vec::new();
    let mut current = String::new();

    for ch in text.chars() {
        if ch.is_alphanumeric() || ch == '_' {
            current.push(ch);
        } else {
            if current.len() >= 2 {
                tokens.push(current.clone());
            }
            current.clear();
        }
    }
    if current.len() >= 2 {
        tokens.push(current);
    }

    split_camel_case_tokens(&tokens)
}

pub(crate) fn tokenize_for_index(text: &str) -> Vec<String> {
    tokenize(text)
}

pub(crate) fn split_camel_case_tokens(tokens: &[String]) -> Vec<String> {
    let mut result = Vec::new();
    for token in tokens {
        result.push(token.clone());
        split_camel_word(token, &mut result);
    }
    result
}

/// The terms a chunk is indexed under: its tokens and, for a `snake_case`
/// identifier, also its words (`admit_source_typed` → admit, source, typed),
/// so a query in words finds the identifier, as camelCase parts already did.
/// Only the index side splits: a query for `settle_canary` stays that one
/// identifier and does not match `settle_ledger` by its first word.
pub(crate) fn index_terms(text: &str) -> Vec<String> {
    let mut terms = tokenize(text);
    let mut words = Vec::new();
    for term in &terms {
        let parts: Vec<&str> = term.split('_').filter(|part| !part.is_empty()).collect();
        if parts.len() > 1 {
            for part in parts {
                if part.len() >= 2 {
                    words.push(part.to_owned());
                }
                split_camel_word(part, &mut words);
            }
        }
    }
    terms.extend(words);
    terms
}

/// The camelCase parts of one word (`ContextGateway` → Context, Gateway).
fn split_camel_word(token: &str, result: &mut Vec<String>) {
    {
        let mut start = 0;
        let chars: Vec<char> = token.chars().collect();
        for i in 1..chars.len() {
            if chars[i].is_uppercase() && (i + 1 >= chars.len() || !chars[i + 1].is_uppercase()) {
                let part: String = chars[start..i].iter().collect();
                if part.len() >= 2 {
                    result.push(part);
                }
                start = i;
            }
        }
        if start > 0 {
            let part: String = chars[start..].iter().collect();
            if part.len() >= 2 {
                result.push(part);
            }
        }
    }
}

/// Whether `content` is a bundled/minified payload rather than human-authored
/// source — a whole program packed onto a handful of enormous lines.
///
/// These are the chunker's pathological input, not merely wasted index space.
/// Tree-sitter emits one chunk per nested scope and each chunk carries its full
/// subtree text, so a bundle with thousands of nested closures gets tokenized
/// once per enclosing scope. #1739 measured 15 MB of committed vendor bundles
/// producing a >10 GB in-memory index, while the surrounding 150 MB of real
/// source produced 1.4 MB.
///
/// Glob lists cannot carry this alone: the bundles in #1739 were named
/// `swagger-ui-bundle.js` and `redoc.standalone.js`, which no `*.min.js`
/// pattern matches. The shape of the content is the reliable signal, so all
/// three conditions must hold together — big enough to matter, dominated by
/// huge lines, and huge on average — which prose and generated-but-readable
/// code do not satisfy.
pub(crate) fn looks_minified(content: &str) -> bool {
    /// Below this a pathological file cannot move the index materially.
    const MIN_BYTES: usize = 64 * 1024;
    /// No hand-written line comes close; minified bundles run to megabytes.
    const MIN_LONGEST_LINE_BYTES: usize = 5_000;
    /// Real source averages well under this, unwrapped prose included.
    const MIN_AVERAGE_LINE_BYTES: usize = 500;

    if content.len() < MIN_BYTES {
        return false;
    }
    let mut lines = 0_usize;
    let mut longest = 0_usize;
    for line in content.lines() {
        lines += 1;
        longest = longest.max(line.len());
    }
    if longest < MIN_LONGEST_LINE_BYTES {
        return false;
    }
    content.len() / lines.max(1) >= MIN_AVERAGE_LINE_BYTES
}

/// Use the same structural visitor, but charge expanded chunk bodies before
/// allocating/tokenizing them. Nested captures must not amplify a small input
/// into an unbounded retrieval view.
pub(crate) fn extract_admitted_chunks(
    file_path: &str,
    content: &str,
    remaining_bytes: &mut usize,
    remaining_chunks: &mut usize,
) -> Result<Vec<CodeChunk>, String> {
    const LIMIT: &str = "source chunk budget exceeded; reduce the indexed corpus";
    if !content.is_empty() && (*remaining_bytes == 0 || *remaining_chunks == 0) {
        return Err(LIMIT.into());
    }
    #[cfg(feature = "tree-sitter")]
    {
        let ext = std::path::Path::new(file_path)
            .extension()
            .and_then(|value| value.to_str())
            .unwrap_or("");
        let mut chunks = Vec::new();
        let exceeded = std::cell::Cell::new(false);
        let exhausted = std::cell::Cell::new(false);
        let parsed = crate::core::chunks_ts::for_each_chunk_node_while(
            content,
            ext,
            || {
                if exhausted.get() {
                    exceeded.set(true);
                    false
                } else {
                    true
                }
            },
            |node, name, kind, start_line, end_line| {
                // Query-bearing documentation often precedes the declaration.
                // Extend only within the already admitted source, and charge
                // the complete expanded range before allocating its content.
                let mut start = node.start_byte();
                let mut start_line = start_line;
                let mut preceding = node.prev_named_sibling();
                while let Some(comment) = preceding.filter(|n| n.kind().contains("comment")) {
                    if !content[comment.end_byte()..start].trim().is_empty() {
                        break;
                    }
                    start = comment.start_byte();
                    start_line = comment.start_position().row + 1;
                    preceding = comment.prev_named_sibling();
                }
                let size = node
                    .end_byte()
                    .saturating_sub(start)
                    .saturating_add(name.len())
                    .saturating_add(file_path.len());
                if size > *remaining_bytes || *remaining_chunks == 0 {
                    exceeded.set(true);
                    return false;
                }
                let Some(block) = content.get(start..node.end_byte()) else {
                    exceeded.set(true);
                    return false;
                };
                *remaining_bytes -= size;
                *remaining_chunks -= 1;
                exhausted.set(*remaining_chunks == 0 || *remaining_bytes == 0);
                chunks.push(CodeChunk {
                    file_path: file_path.into(),
                    symbol_name: name.into(),
                    kind,
                    start_line,
                    end_line,
                    content: block.into(),
                    tokens: Vec::new(),
                    token_count: 0,
                });
                true
            },
        );
        if exceeded.get() {
            return Err(LIMIT.into());
        }
        if parsed.is_some() && !chunks.is_empty() {
            return Ok(chunks);
        }
    }
    extract_chunks_fallback_budgeted(file_path, content, remaining_bytes, remaining_chunks)
}

pub(crate) fn extract_chunks(file_path: &str, content: &str) -> Vec<CodeChunk> {
    #[cfg(feature = "tree-sitter")]
    {
        let ext = std::path::Path::new(file_path)
            .extension()
            .and_then(|e| e.to_str())
            .unwrap_or("");
        if let Some(chunks) = crate::core::chunks_ts::extract_chunks_ts(file_path, content, ext) {
            return chunks;
        }
    }

    extract_chunks_fallback(file_path, content)
}

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

    #[test]
    fn bounded_chunks_preserve_existing_structural_content() {
        for (path, content) in [
            (
                "auth.rs",
                "pub fn login() { let answer = 73; }\nfn logout() {}\n",
            ),
            (
                "notes.txt",
                "A useful authentication explanation.\nSecond paragraph.\n",
            ),
        ] {
            let expected = extract_chunks(path, content);
            let actual = extract_admitted_chunks(path, content, &mut 4096, &mut 32).unwrap();
            let identity = |chunk: &CodeChunk| {
                (
                    chunk.symbol_name.clone(),
                    chunk.start_line,
                    chunk.end_line,
                    chunk.content.clone(),
                )
            };
            assert_eq!(
                actual.iter().map(identity).collect::<Vec<_>>(),
                expected.iter().map(identity).collect::<Vec<_>>()
            );
        }
    }

    #[cfg(feature = "tree-sitter")]
    #[test]
    fn admitted_preview_keeps_query_and_body_after_long_comment_header() {
        let source = format!(
            "{}fn alpha() {{\n    // authentication retry\n    let answer = \"REFRESH_SESSION_FIRST\";\n}}\n",
            "// explanatory header\n".repeat(20)
        );
        let chunks = extract_admitted_chunks("auth.rs", &source, &mut 4096, &mut 32).unwrap();
        let mut index = BM25Index::new();
        for chunk in chunks {
            index.add_chunk_with_content_limit(chunk, None);
        }
        index.finalize();
        let results = index.search("authentication retry", 3);
        assert_eq!(results.len(), 1);
        assert!(results[0].snippet.contains("fn alpha()"));
        assert!(results[0].snippet.contains("authentication retry"));
        assert!(results[0].snippet.contains("REFRESH_SESSION_FIRST"));
        assert!(results[0].snippet.lines().count() <= 5);
        assert_eq!(
            query_snippet(
                "é\nλ authentication\nβ\nγ\nδ\nε",
                &tokenize("authentication")
            ),
            "é\nλ authentication\nβ\nγ\nδ"
        );
        assert_eq!(
            query_snippet("first\nsecond", &tokenize("missing")),
            "first\nsecond"
        );
    }

    #[cfg(feature = "tree-sitter")]
    #[test]
    fn admitted_ranking_keeps_leading_comments_and_charges_their_bytes() {
        for (path, content, body) in [
            (
                "login.py",
                "# authentication retry\ndef alpha():\n    return 'REFRESH_SESSION_FIRST'\n",
                "def alpha():\n    return 'REFRESH_SESSION_FIRST'",
            ),
            (
                "login.rs",
                "// authentication retry\nfn alpha() { let answer = 73; }\n",
                "fn alpha() { let answer = 73; }",
            ),
        ] {
            let mut bytes = 4096;
            let chunks = extract_admitted_chunks(path, content, &mut bytes, &mut 32).unwrap();
            assert_eq!(chunks.len(), 1);
            assert_eq!(chunks[0].start_line, 1);
            assert!(
                chunks[0]
                    .content
                    .starts_with(content.lines().next().unwrap())
            );
            assert!(chunks[0].content.contains(body));
            assert_eq!(
                4096 - bytes,
                chunks[0].content.len() + chunks[0].symbol_name.len() + path.len()
            );
            assert!(
                !BM25Index::from_chunks_for_test(chunks)
                    .search("authentication retry", 5)
                    .is_empty()
            );
            let mut body_only = body.len() + "alpha".len() + path.len();
            assert!(extract_admitted_chunks(path, content, &mut body_only, &mut 32).is_err());
        }
    }

    #[test]
    fn chunk_expansion_limits_refuse_instead_of_returning_a_partial_corpus() {
        let content = "pub fn login() { let answer = 73; }\nfn logout() {}\n";
        assert!(extract_admitted_chunks("auth.rs", content, &mut 1, &mut 100).is_err());
        assert!(extract_admitted_chunks("auth.rs", content, &mut 4096, &mut 0).is_err());
        assert!(
            extract_admitted_chunks("notes.txt", "Authentication notes", &mut 1, &mut 100).is_err()
        );
        let mut count = 1;
        assert!(extract_admitted_chunks("auth.unknown", content, &mut 4096, &mut count).is_err());
        assert_eq!(count, 0);
    }

    #[cfg(feature = "tree-sitter")]
    #[test]
    fn structural_visitor_stops_at_the_first_refused_capture() {
        let content = "fn first() {}\nfn second() {}\nfn third() {}\n";
        let mut visited = 0;
        crate::core::chunks_ts::for_each_chunk_node_while(
            content,
            "rs",
            || true,
            |_, _, _, _, _| {
                visited += 1;
                false
            },
        )
        .unwrap();
        assert_eq!(visited, 1);
    }

    #[cfg(feature = "tree-sitter")]
    #[test]
    fn exhausted_allowance_is_checked_before_nested_capture_deduplication() {
        let content = "impl Example {\nfn first() {}\nfn second() {}\n}\n";
        let exhausted = std::cell::Cell::new(false);
        let probes = std::cell::Cell::new(0);
        let mut visited = 0;
        crate::core::chunks_ts::for_each_chunk_node_while(
            content,
            "rs",
            || {
                probes.set(probes.get() + 1);
                !exhausted.get()
            },
            |_, _, _, _, _| {
                visited += 1;
                exhausted.set(true);
                true
            },
        )
        .unwrap();
        assert_eq!(visited, 1);
        assert_eq!(probes.get(), 2);
        assert!(
            extract_admitted_chunks("one.rs", "fn exactly_one() {}", &mut 4096, &mut 1).is_ok()
        );
    }
}

fn extract_chunks_fallback(file_path: &str, content: &str) -> Vec<CodeChunk> {
    let mut bytes = usize::MAX;
    let mut chunks = usize::MAX;
    extract_chunks_fallback_budgeted(file_path, content, &mut bytes, &mut chunks)
        .unwrap_or_default()
}

fn charge_chunk(
    file_path: &str,
    name: &str,
    body_bytes: usize,
    remaining_bytes: &mut usize,
    remaining_chunks: &mut usize,
) -> Result<(), String> {
    let bytes = body_bytes
        .saturating_add(file_path.len())
        .saturating_add(name.len());
    if bytes > *remaining_bytes || *remaining_chunks == 0 {
        return Err("source chunk budget exceeded; reduce the indexed corpus".into());
    }
    *remaining_bytes -= bytes;
    *remaining_chunks -= 1;
    Ok(())
}

fn extract_chunks_fallback_budgeted(
    file_path: &str,
    content: &str,
    remaining_bytes: &mut usize,
    remaining_chunks: &mut usize,
) -> Result<Vec<CodeChunk>, String> {
    let lines: Vec<&str> = content.lines().collect();
    if lines.is_empty() {
        return Ok(Vec::new());
    }

    let mut chunks = Vec::new();
    let mut i = 0;

    while i < lines.len() {
        let trimmed = lines[i].trim();

        if let Some((name, kind)) = detect_symbol(trimmed) {
            let start = i;
            let end = find_block_end(&lines, i);
            let block_lines = &lines[start..=end.min(lines.len() - 1)];
            let bytes = block_lines
                .iter()
                .map(|line| line.len())
                .sum::<usize>()
                .saturating_add(block_lines.len().saturating_sub(1));
            charge_chunk(file_path, &name, bytes, remaining_bytes, remaining_chunks)?;
            let block: String = block_lines.join("\n");
            let token_count = tokenize(&block).len();

            chunks.push(CodeChunk {
                file_path: file_path.to_string(),
                symbol_name: name,
                kind,
                start_line: start + 1,
                end_line: end + 1,
                content: block,
                tokens: Vec::new(),
                token_count,
            });

            i = end + 1;
        } else {
            i += 1;
        }
    }

    if chunks.is_empty() && !content.is_empty() {
        // Fallback: when no symbols are detected, chunk the file into stable, content-defined
        // segments (rolling-hash) to enable meaningful semantic search over non-code assets.
        //
        // Safety note: rabin_karp uses byte offsets; we must slice bytes and decode safely.
        let bytes = content.as_bytes();
        let rk_chunks = crate::core::rabin_karp::chunk(content);
        if !rk_chunks.is_empty() && rk_chunks.len() <= 200 {
            for (idx, c) in rk_chunks.into_iter().take(50).enumerate() {
                let end = (c.offset + c.length).min(bytes.len());
                let slice = &bytes[c.offset..end];
                let chunk_text = String::from_utf8_lossy(slice);
                let name = format!("{file_path}#chunk-{idx}");
                charge_chunk(
                    file_path,
                    &name,
                    chunk_text.len(),
                    remaining_bytes,
                    remaining_chunks,
                )?;
                let chunk_text = chunk_text.into_owned();
                let token_count = tokenize(&chunk_text).len();
                let start_line = 1 + bytecount::count(&bytes[..c.offset], b'\n');
                let end_line = start_line + bytecount::count(slice, b'\n');
                chunks.push(CodeChunk {
                    file_path: file_path.to_string(),
                    symbol_name: name,
                    kind: ChunkKind::Module,
                    start_line,
                    end_line: end_line.max(start_line),
                    content: chunk_text,
                    tokens: Vec::new(),
                    token_count,
                });
            }
        } else {
            charge_chunk(
                file_path,
                file_path,
                content.len(),
                remaining_bytes,
                remaining_chunks,
            )?;
            let token_count = tokenize(content).len();
            let snippet = lines
                .iter()
                .take(50)
                .copied()
                .collect::<Vec<_>>()
                .join("\n");
            chunks.push(CodeChunk {
                file_path: file_path.to_string(),
                symbol_name: file_path.to_string(),
                kind: ChunkKind::Module,
                start_line: 1,
                end_line: lines.len(),
                content: snippet,
                tokens: Vec::new(),
                token_count,
            });
        }
    }

    Ok(chunks)
}

pub(crate) fn detect_symbol(line: &str) -> Option<(String, ChunkKind)> {
    let trimmed = line.trim();

    let patterns: &[(&str, ChunkKind)] = &[
        ("pub async fn ", ChunkKind::Function),
        ("async fn ", ChunkKind::Function),
        ("pub fn ", ChunkKind::Function),
        ("fn ", ChunkKind::Function),
        ("pub struct ", ChunkKind::Struct),
        ("struct ", ChunkKind::Struct),
        ("pub enum ", ChunkKind::Struct),
        ("enum ", ChunkKind::Struct),
        ("impl ", ChunkKind::Impl),
        ("pub trait ", ChunkKind::Struct),
        ("trait ", ChunkKind::Struct),
        ("export function ", ChunkKind::Function),
        ("export async function ", ChunkKind::Function),
        ("export default function ", ChunkKind::Function),
        ("function ", ChunkKind::Function),
        ("async function ", ChunkKind::Function),
        ("export class ", ChunkKind::Class),
        ("class ", ChunkKind::Class),
        ("export interface ", ChunkKind::Struct),
        ("interface ", ChunkKind::Struct),
        ("def ", ChunkKind::Function),
        ("async def ", ChunkKind::Function),
        ("func ", ChunkKind::Function),
    ];

    for (prefix, kind) in patterns {
        if let Some(rest) = trimmed.strip_prefix(prefix) {
            let name: String = rest
                .chars()
                .take_while(|c| c.is_alphanumeric() || *c == '_' || *c == '<')
                .take_while(|c| *c != '<')
                .collect();
            if !name.is_empty() {
                return Some((name, kind.clone()));
            }
        }
    }

    None
}

pub(crate) fn find_block_end(lines: &[&str], start: usize) -> usize {
    let mut depth = 0i32;
    let mut found_open = false;

    for (i, line) in lines.iter().enumerate().skip(start) {
        for ch in line.chars() {
            match ch {
                '{' | '(' if !found_open || depth > 0 => {
                    depth += 1;
                    found_open = true;
                }
                '}' | ')' if depth > 0 => {
                    depth -= 1;
                    if depth == 0 && found_open {
                        return i;
                    }
                }
                _ => {}
            }
        }

        if found_open && depth <= 0 && i > start {
            return i;
        }

        if !found_open && i > start + 2 {
            let trimmed = lines[i].trim();
            if trimmed.is_empty()
                || (!trimmed.starts_with(' ') && !trimmed.starts_with('\t') && i > start)
            {
                return i.saturating_sub(1);
            }
        }
    }

    (start + 50).min(lines.len().saturating_sub(1))
}

/// Keep the preview near the first query-bearing line, with one preceding line
/// and up to three following lines. Only the supplied admitted/resident text is
/// inspected; rendering never reopens a source file.
pub(crate) fn query_snippet(content: &str, query_tokens: &[String]) -> String {
    let query: Vec<String> = query_tokens
        .iter()
        .map(|token| token.to_lowercase())
        .collect();
    let matching_line = content.lines().position(|line| {
        tokenize(line)
            .iter()
            .any(|token| query.contains(&token.to_lowercase()))
    });
    content
        .lines()
        .skip(matching_line.unwrap_or(0).saturating_sub(1))
        .take(5)
        .collect::<Vec<_>>()
        .join("\n")
}

pub fn format_search_results(results: &[SearchResult], compact: bool) -> String {
    if results.is_empty() {
        return "No results found.".to_string();
    }

    let mut out = String::new();
    for (i, r) in results.iter().enumerate() {
        let is_external = r.file_path.contains("://");
        // Forward-slash normalize local paths so Windows backslashes are never
        // dropped/escape-mangled by client render layers (issue #324). External
        // URIs (provider results, e.g. `github://`) are left untouched.
        let normalized;
        let file_path: &str = if is_external {
            &r.file_path
        } else {
            normalized = crate::core::protocol::display_path(&r.file_path);
            &normalized
        };
        if compact {
            if is_external {
                out.push_str(&format!(
                    "{}. {:.2} [{:?}] {} — {}\n",
                    i + 1,
                    r.score,
                    r.kind,
                    file_path,
                    r.symbol_name,
                ));
            } else {
                out.push_str(&format!(
                    "{}. {:.2} {}:{}-{} {:?} {}\n",
                    i + 1,
                    r.score,
                    file_path,
                    r.start_line,
                    r.end_line,
                    r.kind,
                    r.symbol_name,
                ));
            }
        } else if is_external {
            out.push_str(&format!(
                "\n--- Result {} (score: {:.2}) [{:?}] ---\n{} — {}\n{}\n",
                i + 1,
                r.score,
                r.kind,
                file_path,
                r.symbol_name,
                r.snippet,
            ));
        } else {
            out.push_str(&format!(
                "\n--- Result {} (score: {:.2}) ---\n{} :: {} [{:?}] (L{}-{})\n{}\n",
                i + 1,
                r.score,
                file_path,
                r.symbol_name,
                r.kind,
                r.start_line,
                r.end_line,
                r.snippet,
            ));
        }
    }
    // Snippets come from persisted indexes (dense/hybrid/workspace/artifact
    // modes) as well as fresh admitted views; mask secrets the same way
    // `ctx_read`/`ctx_search` do before they reach the model (GHSA-rxv5-4c3x-g4q6 A).
    crate::core::redaction::redact_text_if_enabled(&out)
}

/// Enrich chunk content with file-path components for BM25 path-matching.
///
/// SACL (EMNLP 2025) shows that augmenting code with structural information
/// improves retrieval by 7-12.8%. We append the file stem twice (for boost)
/// and the immediate parent directory once, enabling queries like "auth handler"
/// to match `src/auth/handler.rs`.
pub(crate) fn enrich_for_bm25(chunk: &CodeChunk) -> String {
    let path = Path::new(&chunk.file_path);
    let stem = path.file_stem().and_then(|s| s.to_str()).unwrap_or("");
    let dir = path
        .parent()
        .and_then(|p| p.file_name())
        .and_then(|d| d.to_str())
        .unwrap_or("");

    if stem.is_empty() {
        return chunk.content.clone();
    }

    format!("{} {} {} {}", chunk.content, stem, stem, dir)
}

#[cfg(test)]
mod chunking_shape_tests {
    use super::looks_minified;

    /// A query in words finds a snake_case identifier: the index holds its
    /// words as terms of their own, as the parts of a camelCase name already
    /// were; a query for the identifier itself is not split.
    #[test]
    fn snake_case_identifiers_are_split_into_their_words() {
        let terms = super::index_terms("fn admit_source_typed(ctx: ContextGateway)");
        for word in [
            "admit_source_typed",
            "admit",
            "source",
            "typed",
            "Context",
            "Gateway",
        ] {
            assert!(terms.iter().any(|term| term == word), "{word}: {terms:?}");
        }
        // A query stays the identifier it names.
        let query = super::tokenize("settle_canary");
        assert!(
            !query
                .iter()
                .any(|token| token == "settle" || token == "canary")
        );
    }

    #[test]
    fn minified_bundles_are_recognised_without_a_glob() {
        // #1739: the offending files were `swagger-ui-bundle.js` and
        // `redoc.standalone.js` — no `*.min.js` pattern matches either.
        let bundle = format!("!function(){{{}}}();", "var aB=1;".repeat(20_000));
        assert!(bundle.len() > 64 * 1024);
        assert!(looks_minified(&bundle));
    }

    #[test]
    fn ordinary_source_and_prose_are_not_minified() {
        // Real source: big file, ordinary lines.
        let source = "pub fn compute(value: i32) -> i32 {\n    value * 2\n}\n".repeat(3_000);
        assert!(source.len() > 64 * 1024);
        assert!(!looks_minified(&source));

        // Unwrapped prose: long lines, but nowhere near a minified bundle.
        let prose = format!("{}\n", "lorem ipsum dolor sit amet ".repeat(60)).repeat(60);
        assert!(prose.len() > 64 * 1024);
        assert!(!looks_minified(&prose));

        // A small file is never worth skipping, however it is shaped.
        let tiny = format!("var a={};", "0".repeat(6_000));
        assert!(!looks_minified(&tiny));

        // One long line inside an otherwise normal large file (an embedded
        // data URI, say) must not disqualify the file.
        let mostly_normal = format!(
            "{}\nconst DATA = \"{}\";\n",
            "let x = 1;\n".repeat(20_000),
            "A".repeat(9_000)
        );
        assert!(!looks_minified(&mostly_normal));
    }
}