config-disassembler 0.5.1

Disassemble config files into smaller files and reassemble on demand.
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
//! Parse unique ID from XML element for file naming.
//!
//! ## Configuration syntax
//!
//! `unique_id_elements` is a comma-separated list of *candidates*; the first
//! candidate that fully resolves against an element wins. Each candidate is
//! either:
//!
//! * a single field name (e.g. `fullName`) - matches when that field is
//!   present anywhere in the element's subtree, or
//! * a `+`-joined **compound** of two or more field names (e.g.
//!   `actionName+pageOrSobjectType+formFactor`) - matches only when *every*
//!   sub-field resolves at the same level, in which case the resolved
//!   values are joined with [`COMPOUND_VALUE_SEPARATOR`] (`__`).
//!
//! Compounds let metadata types like `<profileActionOverrides>` - whose
//! natural unique key is `actionName + pageOrSobjectType + formFactor +
//! profile [+ recordType]` - produce stable, readable filenames instead of
//! collapsing every sibling into a SHA-256 fallback. Listing both the wide
//! and narrow forms (`A+B+C+D, A+B+C, A`) gives a graceful fallback chain
//! when an item only carries some of the keys.
//!
//! Backwards compatibility: any spec that contains no `+` is parsed as a
//! list of single-field candidates and behaves identically to releases
//! prior to compound-key support.

use serde_json::Value;
use sha2::{Digest, Sha256};
use std::borrow::Cow;

use crate::xml::types::XmlElement;

/// Separator inserted between resolved values when a compound candidate
/// matches. Picked because filenames are filesystem-safe everywhere and
/// because individual Salesforce identifier names rarely contain the
/// double-underscore (single `_` is common - e.g. `Account_Name__c` - so
/// a single underscore would round-trip ambiguously when values themselves
/// already contain `_`).
const COMPOUND_VALUE_SEPARATOR: &str = "__";

/// Replacement character substituted in for any byte that's illegal or
/// portability-unsafe in a path segment. Underscore matches the convention
/// used by `sanitize_filename` in the grouped-by-tag write path so behavior
/// is consistent across strategies.
const SANITIZED_REPLACEMENT: char = '_';

/// True for characters that are illegal or portability-unsafe inside a
/// single path segment on at least one supported OS:
///
/// - `/` `\`            path separators on Unix / Windows
/// - `:` `*` `?` `"` `<` `>` `|`   reserved on Windows
/// - ASCII control bytes (0x00-0x1F)  break terminals and zip readers
///
/// Salesforce identifier fields can legitimately contain any of these.
/// `EntitlementProcess.milestones[*].milestoneName`, for example, accepts
/// free-form text and we have seen `TrustFile Transaction Sync/Import
/// Complete` in the wild - the embedded `/` was being interpreted as a
/// path separator and silently dropped data on round-trip (see #25).
fn is_illegal_path_char(c: char) -> bool {
    matches!(c, '/' | '\\' | ':' | '*' | '?' | '"' | '<' | '>' | '|') || c.is_ascii_control()
}

/// True for trailing characters that Windows silently strips when creating
/// a file. Leaving these in would let two distinct inputs (`Foo.` vs `Foo`,
/// `Foo ` vs `Foo`) collide on disk on Windows but not on Unix, breaking
/// cross-platform stability of disassembled output. Tab is *not* in this
/// set: Windows accepts trailing tab in filenames and we'd rather replace
/// the (rare) tab with `_` via the control-char path than silently lose
/// the byte.
fn is_trailing_strip_char(c: char) -> bool {
    matches!(c, '.' | ' ')
}

/// Sanitize a resolved unique-ID value into a portable path segment.
///
/// Borrows the input on the happy path - the vast majority of Salesforce
/// identifiers (`fullName`, `name`, `developerName`, ...) only contain
/// ASCII alphanumerics, underscores, hyphens, and dots, all of which are
/// passed through verbatim. We only allocate when the input contains an
/// illegal character or has a trailing `.`/space that Windows would
/// silently strip on write.
///
/// Order of operations matters:
///   1. Trim trailing `.`/space from the *input*. Windows would strip them
///      on write anyway, so doing it deterministically here keeps Linux
///      and Windows producing byte-identical filenames.
///   2. Replace illegal chars in the trimmed input with `_`. Each illegal
///      char becomes exactly one `_` so the resulting length, and the
///      mapping between original and replacement positions, is stable.
///
/// The substitution is deterministic so the produced filename is stable
/// across runs and across machines, which keeps source-control diffs
/// meaningful. When two distinct un-sanitized values collapse to the same
/// sanitized form (for example `Foo/Bar` and `Foo_Bar` both produce
/// `Foo_Bar`), the upstream caller's collision detector catches it and
/// falls back to per-element SHA-256 hashes for the colliding siblings.
fn sanitize_path_segment(s: &str) -> Cow<'_, str> {
    let trimmed = s.trim_end_matches(is_trailing_strip_char);
    let needs_replacement = trimmed.chars().any(is_illegal_path_char);
    let was_trimmed = trimmed.len() != s.len();
    if !needs_replacement && !was_trimmed {
        return Cow::Borrowed(s);
    }
    let mut out = String::with_capacity(trimmed.len());
    for c in trimmed.chars() {
        if is_illegal_path_char(c) {
            out.push(SANITIZED_REPLACEMENT);
        } else {
            out.push(c);
        }
    }
    if out.is_empty() {
        // Edge case: input was entirely trimmed away (e.g. `". "`). Returning
        // an empty string would produce a path like `.<tag>-meta.xml` which
        // is also invalid. Use a single underscore so the file still writes;
        // the upstream collision detector will hash any siblings that pile
        // up here.
        out.push(SANITIZED_REPLACEMENT);
    }
    Cow::Owned(out)
}

/// Hash the full canonicalized JSON form of an element to derive an 8-char
/// filename. SHA-256 over distinct content yields distinct prefixes with
/// vanishingly small collision probability for normal sibling counts.
fn create_short_hash(element: &XmlElement) -> String {
    let stringified = serde_json::to_string(element).unwrap_or_default();
    let mut hasher = Sha256::new();
    hasher.update(stringified.as_bytes());
    let result = hasher.finalize();
    const HEX: &[u8; 16] = b"0123456789abcdef";
    let mut s = String::with_capacity(8);
    for b in result.iter().take(4) {
        s.push(HEX[(b >> 4) as usize] as char);
        s.push(HEX[(b & 0xf) as usize] as char);
    }
    s
}

/// True only for objects that have at least one element-name child. quick-xml
/// represents leaf scalars (and attribute-only nodes) as `{ "#text": "..." }` /
/// `{ "@attr": "...", "#text": "..." }`; those are *not* recursable - if we
/// recurse into them we end up hashing the same single text-leaf child for
/// every sibling that happens to start with the same scalar element, which
/// silently collapses distinct siblings into one filename.
fn is_recursable_object(value: &Value) -> bool {
    let Some(obj) = value.as_object() else {
        return false;
    };
    obj.iter()
        .any(|(k, _)| !k.starts_with('#') && !k.starts_with('@'))
}

/// Extract string from a value - handles both direct strings and objects with #text (XML leaf elements).
fn value_as_string(value: &Value) -> Option<String> {
    if let Some(s) = value.as_str() {
        return Some(s.to_string());
    }
    value
        .as_object()
        .and_then(|obj| obj.get("#text"))
        .and_then(|v| v.as_str())
        .map(|s| s.to_string())
}

/// Parse the user-supplied spec into a list of candidates, where each
/// candidate is itself a list of field names. A candidate of length 1 is a
/// plain single-field match (legacy behaviour); length >= 2 is a compound.
///
/// Empty entries (from leading/trailing commas, double commas, or stray `+`
/// separators) are filtered so a copy-pasted spec like `, name ,, +foo+ ,`
/// degrades to `[["name"], ["foo"]]` rather than panicking on empty lookups.
fn parse_candidates(spec: &str) -> Vec<Vec<&str>> {
    spec.split(',')
        .map(|candidate| {
            candidate
                .split('+')
                .map(str::trim)
                .filter(|f| !f.is_empty())
                .collect::<Vec<&str>>()
        })
        .filter(|fields| !fields.is_empty())
        .collect()
}

/// Match a single candidate against the element's *direct* fields. A
/// single-field candidate succeeds when the field is present and resolves
/// to a non-empty string; a compound candidate succeeds only when every
/// sub-field is present and non-empty, in which case the resolved values
/// are joined with [`COMPOUND_VALUE_SEPARATOR`].
///
/// Restricting compounds to the same level keeps the semantics intuitive:
/// `actionName+profile+recordType` describes a single record's shape, not
/// a search for those tokens scattered across the subtree.
fn match_candidate_at_direct(element: &XmlElement, fields: &[&str]) -> Option<String> {
    let obj = element.as_object()?;
    let mut parts: Vec<String> = Vec::with_capacity(fields.len());
    for field in fields {
        let value = obj.get(*field).and_then(value_as_string)?;
        if value.is_empty() {
            return None;
        }
        parts.push(value);
    }
    if parts.is_empty() {
        return None;
    }
    Some(parts.join(COMPOUND_VALUE_SEPARATOR))
}

/// Search for a configured unique-id candidate anywhere in the subtree
/// rooted at `element`. Returns `Some(id)` only when a candidate fully
/// resolves; returns `None` so the caller can fall back to hashing the
/// *outer* element rather than a single inner child.
///
/// Order of evaluation:
/// 1. Try every candidate against the direct fields of `element` (so a
///    direct match always beats a deeper one - preserves the priority that
///    callers configuring `fullName,name` historically relied on).
/// 2. If nothing matched, recurse into recursable children and repeat.
fn find_id_in_subtree(element: &XmlElement, unique_id_elements: &str) -> Option<String> {
    let candidates = parse_candidates(unique_id_elements);
    if candidates.is_empty() {
        return None;
    }
    for candidate in &candidates {
        if let Some(id) = match_candidate_at_direct(element, candidate) {
            return Some(id);
        }
    }
    let obj = element.as_object()?;
    for (_, child) in obj {
        if !is_recursable_object(child) {
            continue;
        }
        if let Some(found) = find_id_in_subtree(child, unique_id_elements) {
            return Some(found);
        }
    }
    None
}

/// Get a unique ID for an element, using configured fields or a hash of the
/// *outer* element when no configured field exists in the subtree.
///
/// Hashing must be performed on the outer element (not on whatever inner
/// child the search happened to visit first) so siblings whose first nested
/// child shares a value - e.g. a list of `<actionOverrides>` that all start
/// with `<actionName>View</actionName>` - still produce distinct filenames
/// reflecting their distinct content.
///
/// Resolved configured-field values are passed through [`sanitize_path_segment`]
/// before being returned so any path-illegal characters in the source value
/// (e.g. `/` in an `EntitlementProcess` `milestoneName`) are mapped to a
/// safe placeholder. Hash-fallback values are pure hex and pass through the
/// sanitizer as a no-op.
pub fn parse_unique_id_element(element: &XmlElement, unique_id_elements: Option<&str>) -> String {
    let raw = if let Some(ids) = unique_id_elements {
        find_id_in_subtree(element, ids).unwrap_or_else(|| create_short_hash(element))
    } else {
        create_short_hash(element)
    };
    match sanitize_path_segment(&raw) {
        Cow::Borrowed(_) => raw,
        Cow::Owned(s) => s,
    }
}

/// Hash an arbitrary [`XmlElement`] to its 8-character short hash. Exposed so
/// the upstream collision detector can request a deterministic fallback for
/// individual siblings without re-deriving the hash logic.
pub fn short_hash_for_element(element: &XmlElement) -> String {
    create_short_hash(element)
}

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

    #[test]
    fn finds_direct_field() {
        let el = json!({ "name": "Get_Info", "label": "Get Info" });
        assert_eq!(parse_unique_id_element(&el, Some("name")), "Get_Info");
    }

    #[test]
    fn finds_deeply_nested_field() {
        // value before connector so we find elementReference (matches TS iteration order)
        let el = json!({
            "value": { "elementReference": "accts.accounts" },
            "connector": { "targetReference": "X" }
        });
        assert_eq!(
            parse_unique_id_element(&el, Some("elementReference")),
            "accts.accounts"
        );
    }

    #[test]
    fn finds_id_in_grandchild() {
        let el = json!({
            "wrapper": {
                "inner": { "name": "NestedName" }
            }
        });
        assert_eq!(parse_unique_id_element(&el, Some("name")), "NestedName");
    }

    #[test]
    fn value_as_string_returns_none_for_non_string_non_text_objects() {
        // Directly named field exists but value is neither a string nor an object with #text.
        // Exercises the None-return path inside value_as_string plus the "no match, move on"
        // path inside find_direct_field_match.
        let el = json!({ "name": { "other": "xxx" } });
        let id = parse_unique_id_element(&el, Some("name"));
        // Falls through to the 8-char short-hash fallback.
        assert_eq!(id.len(), 8);
    }

    #[test]
    fn falls_back_to_hash_when_no_match_and_no_nested_object() {
        // No direct match and no nested object match → hash fallback.
        let el = json!({ "a": "string", "b": "another" });
        let id = parse_unique_id_element(&el, Some("name"));
        assert_eq!(id.len(), 8);
    }

    #[test]
    fn hash_fallback_when_unique_id_elements_is_none() {
        let el = json!({ "a": "b" });
        let id = parse_unique_id_element(&el, None);
        assert_eq!(id.len(), 8);
    }

    #[test]
    fn non_object_element_returns_hash() {
        let el = json!("just-a-string");
        let id = parse_unique_id_element(&el, Some("name"));
        assert_eq!(id.len(), 8);
    }

    #[test]
    fn finds_name_from_text_object() {
        // XML parser stores leaf elements as { "#text": "value" }
        let el = json!({
            "name": { "#text": "Get_Info" },
            "label": { "#text": "Get Info" },
            "actionName": { "#text": "GetFirstFromCollection" }
        });
        assert_eq!(parse_unique_id_element(&el, Some("name")), "Get_Info");
        assert_eq!(
            parse_unique_id_element(&el, Some("actionName")),
            "GetFirstFromCollection"
        );
    }

    // ---- regression: text-leaf siblings must NOT collapse to one hash ------

    /// Models a `<CustomApplication>`'s `<actionOverrides>`: every block has
    /// the same `<actionName>View</actionName>` first child but distinct
    /// `<content>` and `<pageOrSobjectType>` payloads. With the old
    /// implementation the recursion landed on `{"#text":"View"}` for every
    /// sibling and they all hashed to the same 8-char prefix, silently
    /// collapsing 100s of overrides into a single shard that contained only
    /// the last one written.
    #[test]
    fn distinct_siblings_with_shared_first_text_leaf_get_distinct_hashes() {
        let make_action_override = |i: u32| -> XmlElement {
            json!({
                "actionName": { "#text": "View" },
                "comment": { "#text": format!("Action override {i}") },
                "content": { "#text": format!("Sample_Page_{i:05}") },
                "formFactor": { "#text": "Large" },
                "skipRecordTypeSelect": { "#text": "false" },
                "type": { "#text": "Flexipage" },
                "pageOrSobjectType": { "#text": format!("Sample_Object_{i:03}__c") }
            })
        };

        // Default unique-id elements ("fullName,name") - none of these are
        // present on actionOverride children.
        let ids = Some("fullName,name");

        let mut seen = std::collections::HashSet::new();
        for i in 1..=128 {
            let id = parse_unique_id_element(&make_action_override(i), ids);
            assert_eq!(id.len(), 8, "expected an 8-char short hash, got {id}");
            assert!(
                seen.insert(id.clone()),
                "duplicate hash {id} for actionOverride {i} - distinct siblings collapsed"
            );
        }
    }

    /// Same shape but with no unique-id config at all: must also produce
    /// distinct hashes per sibling.
    #[test]
    fn distinct_siblings_get_distinct_hashes_with_no_unique_id_config() {
        let mut seen = std::collections::HashSet::new();
        for i in 1..=64 {
            let el = json!({
                "actionName": { "#text": "View" },
                "content": { "#text": format!("Page_{i}") }
            });
            let id = parse_unique_id_element(&el, None);
            assert!(
                seen.insert(id.clone()),
                "duplicate hash {id} at index {i} with no unique-id config"
            );
        }
    }

    /// `find_id_in_subtree` must skip text-leaf wrappers like
    /// `{"#text": "..."}` rather than treat them as recursable objects.
    /// Otherwise the search returns a hash of the inner wrapper rather than
    /// hashing the outer element.
    #[test]
    fn text_leaf_wrappers_are_not_recursable() {
        let leaf = json!({ "#text": "View" });
        assert!(!is_recursable_object(&leaf));

        let attrs_only = json!({ "@attr": "x", "#text": "y" });
        assert!(!is_recursable_object(&attrs_only));

        let real = json!({ "name": "x" });
        assert!(is_recursable_object(&real));

        let mixed = json!({ "@attr": "x", "name": "y" });
        assert!(is_recursable_object(&mixed));
    }

    // ---- compound-key support ----------------------------------------------

    /// A `<profileActionOverrides>` element with the full key set. The
    /// compound `actionName+pageOrSobjectType+formFactor+profile` must
    /// resolve to all four values joined with `__`.
    #[test]
    fn compound_resolves_when_all_fields_present() {
        let el = json!({
            "actionName": { "#text": "Tab" },
            "content": { "#text": "Home_Page_Default" },
            "formFactor": { "#text": "Large" },
            "pageOrSobjectType": { "#text": "standard-home" },
            "type": { "#text": "Flexipage" },
            "profile": { "#text": "Implementation_Lightning" }
        });
        let id =
            parse_unique_id_element(&el, Some("actionName+pageOrSobjectType+formFactor+profile"));
        assert_eq!(id, "Tab__standard-home__Large__Implementation_Lightning");
    }

    /// A compound that names a field the element doesn't have must NOT
    /// match - the next candidate (a narrower compound, then a single
    /// field) takes over.
    #[test]
    fn compound_falls_through_when_one_field_missing() {
        // `<actionOverrides>` (no profile, no recordType) - the wide compound
        // must fail, the narrow compound must succeed.
        let el = json!({
            "actionName": { "#text": "View" },
            "content": { "#text": "LUX_Case_Release_Candidate_Copy" },
            "formFactor": { "#text": "Large" },
            "pageOrSobjectType": { "#text": "Case" },
            "type": { "#text": "Flexipage" }
        });
        let spec = "actionName+pageOrSobjectType+formFactor+profile,actionName+pageOrSobjectType+formFactor,actionName";
        assert_eq!(
            parse_unique_id_element(&el, Some(spec)),
            "View__Case__Large"
        );
    }

    /// All compound candidates miss → the loop must fall back to the
    /// single-field candidate at the tail of the spec, and ultimately to
    /// the outer-element hash if even that misses.
    #[test]
    fn compound_then_single_then_hash_fallback() {
        let el = json!({
            "actionName": { "#text": "View" }
        });
        let spec_all_compound =
            "actionName+pageOrSobjectType+formFactor+profile,actionName+pageOrSobjectType";
        let id = parse_unique_id_element(&el, Some(spec_all_compound));
        assert_eq!(
            id.len(),
            8,
            "no candidate should match → hash fallback, got {id}"
        );

        let spec_with_single_tail = "actionName+pageOrSobjectType+formFactor,actionName";
        assert_eq!(
            parse_unique_id_element(&el, Some(spec_with_single_tail)),
            "View"
        );
    }

    /// Empty values (`<recordType></recordType>`) must be treated as
    /// missing for the purpose of compound matching - otherwise we would
    /// emit filenames like `View__Account__Large__` with a trailing
    /// separator and silently collide with siblings that genuinely lack
    /// the field.
    #[test]
    fn compound_treats_empty_values_as_missing() {
        let el = json!({
            "actionName": { "#text": "View" },
            "pageOrSobjectType": { "#text": "Account" },
            "recordType": { "#text": "" }  // explicitly empty
        });
        let spec = "actionName+pageOrSobjectType+recordType,actionName+pageOrSobjectType";
        assert_eq!(
            parse_unique_id_element(&el, Some(spec)),
            "View__Account",
            "empty <recordType> must be treated as missing"
        );
    }

    /// Distinct profileActionOverrides siblings sharing actionName +
    /// pageOrSobjectType + formFactor but differing in `profile` must
    /// produce distinct compound IDs (not collide).
    #[test]
    fn compound_disambiguates_siblings_that_share_outer_fields() {
        let make = |profile: &str| {
            json!({
                "actionName": { "#text": "Tab" },
                "content": { "#text": "Home_Page_Default" },
                "formFactor": { "#text": "Large" },
                "pageOrSobjectType": { "#text": "standard-home" },
                "type": { "#text": "Flexipage" },
                "profile": { "#text": profile }
            })
        };
        let spec = "actionName+pageOrSobjectType+formFactor+profile";
        let a = parse_unique_id_element(&make("Implementation_Lightning"), Some(spec));
        let b = parse_unique_id_element(&make("Sales_Lightning"), Some(spec));
        assert_ne!(a, b);
        assert!(a.ends_with("Implementation_Lightning"));
        assert!(b.ends_with("Sales_Lightning"));
    }

    /// A single-field spec must behave identically to releases prior to
    /// compound-key support: same priority (direct first, then nested),
    /// same hash fallback, no spurious `__` separators.
    #[test]
    fn single_field_behaviour_is_unchanged() {
        let el = json!({ "name": "Get_Info", "label": "Get Info" });
        assert_eq!(parse_unique_id_element(&el, Some("name")), "Get_Info");

        // Direct vs nested priority preserved.
        let nested = json!({
            "wrapper": { "name": "NestedName" }
        });
        assert_eq!(parse_unique_id_element(&nested, Some("name")), "NestedName");
    }

    /// Pathological/malformed specs - leading commas, stray `+`, all
    /// whitespace - must not panic and must degrade to hash fallback.
    #[test]
    fn malformed_spec_degrades_to_hash() {
        let el = json!({ "foo": "bar" });
        let id = parse_unique_id_element(&el, Some(",,+,, "));
        assert_eq!(id.len(), 8, "all-empty candidates → hash fallback");
    }

    // ---- path-segment sanitization (issue #25) ------------------------------

    /// Salesforce identifiers can legitimately contain characters that are
    /// illegal in a path segment. The most common offender is `/` (seen in
    /// the wild on `EntitlementProcess.milestones[*].milestoneName`). Without
    /// sanitization the resolved id `Foo/Bar` is interpreted by the OS as
    /// the path `Foo/Bar.tag-meta.xml`, silently writing into a non-existent
    /// `Foo/` directory and dropping data. Each forbidden char must collapse
    /// to a single `_`.
    #[test]
    fn sanitize_replaces_path_separators() {
        assert_eq!(sanitize_path_segment("Foo/Bar"), "Foo_Bar");
        assert_eq!(sanitize_path_segment("Foo\\Bar"), "Foo_Bar");
        assert_eq!(
            sanitize_path_segment("TrustFile Transaction Sync/Import Complete"),
            "TrustFile Transaction Sync_Import Complete"
        );
    }

    #[test]
    fn sanitize_replaces_windows_reserved_chars() {
        for c in [':', '*', '?', '"', '<', '>', '|'] {
            let input = format!("a{c}b");
            assert_eq!(sanitize_path_segment(&input), "a_b", "char={c}");
        }
    }

    #[test]
    fn sanitize_replaces_control_characters() {
        // 0x00 (NUL), 0x09 (TAB), 0x1F (US) all map to `_`.
        assert_eq!(sanitize_path_segment("a\u{0}b"), "a_b");
        assert_eq!(sanitize_path_segment("a\u{1f}b"), "a_b");
    }

    #[test]
    fn sanitize_strips_trailing_dot_and_space() {
        // Windows write semantics drop trailing `.` and space silently;
        // leaving them in would let two distinct inputs collide on disk.
        // Tab and other control characters are NOT in this set - they're
        // replaced with `_` via the control-char path so the byte isn't
        // lost (`Foo\t` -> `Foo_` rather than `Foo`).
        assert_eq!(sanitize_path_segment("Foo."), "Foo");
        assert_eq!(sanitize_path_segment("Foo "), "Foo");
        assert_eq!(sanitize_path_segment("Foo. ."), "Foo");
        assert_eq!(sanitize_path_segment("Foo\t"), "Foo_");
    }

    #[test]
    fn sanitize_passes_safe_inputs_through_unchanged() {
        // Borrows on the happy path - exercise via the Cow variant.
        let cases = [
            "Account",
            "Account_Name__c",
            "Sample_Object_005__c",
            "Implementation - TrustFile Amazon",
            "View",
            "TrustFile Account Setup Complete",
            "View__Account__Large__SalesProfile",
            // Inner dots are fine; only TRAILING dots are stripped.
            "Account.LogACall",
            "Sample_Object_017__c.Sample_Record_Type_0123",
        ];
        for case in cases {
            match sanitize_path_segment(case) {
                Cow::Borrowed(s) => assert_eq!(s, case, "unexpected mutation for {case:?}"),
                Cow::Owned(s) => panic!("unexpected allocation for {case:?}: got {s:?}"),
            }
        }
    }

    #[test]
    fn sanitize_replaces_illegal_chars_one_for_one() {
        // Each illegal char becomes exactly one `_` so the result length
        // and structure mirror the input - critical for collision-detection
        // signal: two distinct inputs differing only in their illegal chars
        // produce distinct sanitized outputs and the collision detector
        // does not need to fire.
        assert_eq!(sanitize_path_segment("///"), "___");
        assert_eq!(sanitize_path_segment("/"), "_");
        assert_eq!(sanitize_path_segment("a/b/c"), "a_b_c");
        assert_eq!(sanitize_path_segment("a*b?c"), "a_b_c");
    }

    #[test]
    fn sanitize_replacement_yields_underscore_when_input_collapses_to_empty() {
        // Edge case: input is entirely trailing-trim-able (e.g. `". ."` or `". "`).
        // After trim the string is empty, which would produce a degenerate
        // filename like `.<tag>-meta.xml`. Substitute a single `_` so the
        // file still writes; the upstream collision detector will hash any
        // siblings that pile up here.
        assert_eq!(sanitize_path_segment(". ."), "_");
        assert_eq!(sanitize_path_segment(". "), "_");
        assert_eq!(sanitize_path_segment("."), "_");
        assert_eq!(sanitize_path_segment(" "), "_");
    }

    #[test]
    fn sanitize_handles_empty_input() {
        // Empty in -> empty out. Caller is responsible for upgrading to a
        // hash if they need a non-empty filename; sanitize itself has no
        // useful work to do here.
        let out = sanitize_path_segment("");
        assert!(matches!(out, Cow::Borrowed(s) if s.is_empty()));
    }

    /// `parse_unique_id_element` MUST apply sanitization at the boundary so
    /// every caller (single-field, compound, multi-level) gets it for free.
    /// This is the regression test that pairs with issue #25.
    #[test]
    fn parse_unique_id_element_sanitizes_resolved_value() {
        let el = json!({
            "milestoneName": { "#text": "TrustFile Transaction Sync/Import Complete" }
        });
        let id = parse_unique_id_element(&el, Some("milestoneName"));
        assert!(!id.contains('/'), "resolved id must not contain `/`: {id}");
        assert_eq!(id, "TrustFile Transaction Sync_Import Complete");
    }

    #[test]
    fn parse_unique_id_element_sanitizes_compound_values() {
        // Compound values are joined with `__`; if any component contains
        // an illegal char it must be sanitized BEFORE the join (otherwise
        // the illegal char survives into the produced filename).
        let el = json!({
            "actionName": { "#text": "View" },
            "pageOrSobjectType": { "#text": "Sample/Object__c" },
            "formFactor": { "#text": "Large" }
        });
        let id = parse_unique_id_element(&el, Some("actionName+pageOrSobjectType+formFactor"));
        assert!(!id.contains('/'), "compound id must not contain `/`: {id}");
        assert_eq!(id, "View__Sample_Object__c__Large");
    }

    #[test]
    fn parse_unique_id_element_hash_fallback_is_unaffected_by_sanitizer() {
        // Hash fallback returns 8 hex chars, all of which are safe; the
        // sanitizer must be a no-op here.
        let el = json!({ "a": "b" });
        let id = parse_unique_id_element(&el, Some("name"));
        assert_eq!(id.len(), 8);
        assert!(id.chars().all(|c| c.is_ascii_hexdigit()));
    }

    /// Recursion must only return when a configured unique-id field is
    /// *actually* found, not when a recursive call falls back to its own
    /// hash. The hash is computed exactly once, at the top level, on the
    /// outer element.
    #[test]
    fn nested_search_does_not_return_inner_hash() {
        // Two distinct outer elements whose first recursable child has the
        // same shape. With the old behavior the recursion would compute a
        // hash of that inner child for both - same hash for distinct outers.
        // With the fix, each outer is hashed in full and they differ.
        let a = json!({
            "wrapper": { "leafA": "shared", "extraA": "different-A" },
            "outerA": "A"
        });
        let b = json!({
            "wrapper": { "leafA": "shared", "extraA": "different-A" },
            "outerB": "B"
        });
        let id_a = parse_unique_id_element(&a, Some("name"));
        let id_b = parse_unique_id_element(&b, Some("name"));
        assert_ne!(id_a, id_b);
    }
}