ltk_ritobin 0.1.2

Ritobin text format parser and writer for League Toolkit
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
//! Text writer for ritobin format.

use std::fmt::Write;

use ltk_meta::{
    value::{
        ContainerValue, EmbeddedValue, MapValue, OptionalValue, PropertyValueEnum, StructValue,
        UnorderedContainerValue,
    },
    BinProperty, BinTree, BinTreeObject,
};

use crate::{
    error::WriteError,
    hashes::{HashMapProvider, HashProvider, HexHashProvider},
    types::kind_to_type_name,
};

/// Configuration for the text writer.
#[derive(Debug, Clone)]
pub struct WriterConfig {
    /// Number of spaces per indent level.
    pub indent_size: usize,
}

impl Default for WriterConfig {
    fn default() -> Self {
        Self { indent_size: 4 }
    }
}

/// Text writer for ritobin format with hash provider support.
pub struct TextWriter<'a, H: HashProvider = HexHashProvider> {
    buffer: String,
    indent_level: usize,
    config: WriterConfig,
    hashes: &'a H,
}

impl<'a> TextWriter<'a, HexHashProvider> {
    /// Create a new text writer without hash lookup (all hashes written as hex).
    pub fn new() -> Self {
        static HEX_PROVIDER: HexHashProvider = HexHashProvider;
        Self {
            buffer: String::new(),
            indent_level: 0,
            config: WriterConfig::default(),
            hashes: &HEX_PROVIDER,
        }
    }
}

impl<'a, H: HashProvider> TextWriter<'a, H> {
    /// Create a new text writer with a hash provider for name lookup.
    pub fn with_hashes(hashes: &'a H) -> Self {
        Self {
            buffer: String::new(),
            indent_level: 0,
            config: WriterConfig::default(),
            hashes,
        }
    }

    /// Create a new text writer with custom configuration and hash provider.
    pub fn with_config_and_hashes(config: WriterConfig, hashes: &'a H) -> Self {
        Self {
            buffer: String::new(),
            indent_level: 0,
            config,
            hashes,
        }
    }

    /// Consume the writer and return the generated string.
    pub fn into_string(self) -> String {
        self.buffer
    }

    /// Get a reference to the generated string.
    pub fn as_str(&self) -> &str {
        &self.buffer
    }

    fn indent(&mut self) {
        self.indent_level += self.config.indent_size;
    }

    fn dedent(&mut self) {
        self.indent_level = self.indent_level.saturating_sub(self.config.indent_size);
    }

    fn pad(&mut self) {
        for _ in 0..self.indent_level {
            self.buffer.push(' ');
        }
    }

    fn write_raw(&mut self, s: &str) {
        self.buffer.push_str(s);
    }

    fn write_type(&mut self, value: &PropertyValueEnum) {
        let type_name = kind_to_type_name(value.kind());
        self.write_raw(type_name);

        match value {
            PropertyValueEnum::Container(ContainerValue { item_kind, .. })
            | PropertyValueEnum::UnorderedContainer(UnorderedContainerValue(ContainerValue {
                item_kind,
                ..
            })) => {
                self.write_raw("[");
                self.write_raw(kind_to_type_name(*item_kind));
                self.write_raw("]");
            }
            PropertyValueEnum::Optional(OptionalValue { kind, .. }) => {
                self.write_raw("[");
                self.write_raw(kind_to_type_name(*kind));
                self.write_raw("]");
            }
            PropertyValueEnum::Map(MapValue {
                key_kind,
                value_kind,
                ..
            }) => {
                self.write_raw("[");
                self.write_raw(kind_to_type_name(*key_kind));
                self.write_raw(",");
                self.write_raw(kind_to_type_name(*value_kind));
                self.write_raw("]");
            }
            _ => {}
        }
    }

    /// Write an entry/object path hash (looks up in entries table).
    fn write_entry_hash(&mut self, hash: u32) -> Result<(), WriteError> {
        if let Some(name) = self.hashes.lookup_entry(hash) {
            write!(self.buffer, "{:?}", name)?;
        } else {
            write!(self.buffer, "{:#x}", hash)?;
        }
        Ok(())
    }

    /// Write a field/property name hash (looks up in fields table).
    fn write_field_hash(&mut self, hash: u32) -> Result<(), WriteError> {
        if let Some(name) = self.hashes.lookup_field(hash) {
            self.write_raw(name);
        } else {
            write!(self.buffer, "{:#x}", hash)?;
        }
        Ok(())
    }

    /// Write a hash property value (looks up in hashes table).
    fn write_hash_value(&mut self, hash: u32) -> Result<(), WriteError> {
        if let Some(name) = self.hashes.lookup_hash(hash) {
            write!(self.buffer, "{:?}", name)?;
        } else {
            write!(self.buffer, "{:#x}", hash)?;
        }
        Ok(())
    }

    /// Write a type/class hash (looks up in types table).
    fn write_type_hash(&mut self, hash: u32) -> Result<(), WriteError> {
        if let Some(name) = self.hashes.lookup_type(hash) {
            self.write_raw(name);
        } else {
            write!(self.buffer, "{:#x}", hash)?;
        }
        Ok(())
    }

    /// Write a link hash (looks up in entries table, same as entry paths).
    fn write_link_hash(&mut self, hash: u32) -> Result<(), WriteError> {
        if let Some(name) = self.hashes.lookup_entry(hash) {
            write!(self.buffer, "{:?}", name)?;
        } else {
            write!(self.buffer, "{:#x}", hash)?;
        }
        Ok(())
    }

    fn write_value(&mut self, value: &PropertyValueEnum) -> Result<(), WriteError> {
        match value {
            PropertyValueEnum::None(_) => self.write_raw("null"),
            PropertyValueEnum::Bool(v) => self.write_raw(if v.0 { "true" } else { "false" }),
            PropertyValueEnum::I8(v) => write!(self.buffer, "{}", v.0)?,
            PropertyValueEnum::U8(v) => write!(self.buffer, "{}", v.0)?,
            PropertyValueEnum::I16(v) => write!(self.buffer, "{}", v.0)?,
            PropertyValueEnum::U16(v) => write!(self.buffer, "{}", v.0)?,
            PropertyValueEnum::I32(v) => write!(self.buffer, "{}", v.0)?,
            PropertyValueEnum::U32(v) => write!(self.buffer, "{}", v.0)?,
            PropertyValueEnum::I64(v) => write!(self.buffer, "{}", v.0)?,
            PropertyValueEnum::U64(v) => write!(self.buffer, "{}", v.0)?,
            PropertyValueEnum::F32(v) => write!(self.buffer, "{}", v.0)?,
            PropertyValueEnum::Vector2(v) => {
                write!(self.buffer, "{{ {}, {} }}", v.0.x, v.0.y)?;
            }
            PropertyValueEnum::Vector3(v) => {
                write!(self.buffer, "{{ {}, {}, {} }}", v.0.x, v.0.y, v.0.z)?;
            }
            PropertyValueEnum::Vector4(v) => {
                write!(
                    self.buffer,
                    "{{ {}, {}, {}, {} }}",
                    v.0.x, v.0.y, v.0.z, v.0.w
                )?;
            }
            PropertyValueEnum::Matrix44(v) => {
                self.write_raw("{\n");
                self.indent();
                let arr = v.0.to_cols_array();
                for (i, val) in arr.iter().enumerate() {
                    if i % 4 == 0 {
                        self.pad();
                    }
                    write!(self.buffer, "{}", val)?;
                    if i % 4 == 3 {
                        self.write_raw("\n");
                        if i == 15 {
                            self.dedent();
                        }
                    } else {
                        self.write_raw(", ");
                    }
                }
                self.pad();
                self.write_raw("}");
            }
            PropertyValueEnum::Color(v) => {
                write!(
                    self.buffer,
                    "{{ {}, {}, {}, {} }}",
                    v.0.r, v.0.g, v.0.b, v.0.a
                )?;
            }
            PropertyValueEnum::String(v) => {
                write!(self.buffer, "{:?}", v.0)?;
            }
            PropertyValueEnum::Hash(v) => {
                self.write_hash_value(v.0)?;
            }
            PropertyValueEnum::WadChunkLink(v) => {
                // WAD chunk links are u64 xxhash, we don't have lookup for these yet
                write!(self.buffer, "{:#x}", v.0)?;
            }
            PropertyValueEnum::ObjectLink(v) => {
                self.write_link_hash(v.0)?;
            }
            PropertyValueEnum::BitBool(v) => self.write_raw(if v.0 { "true" } else { "false" }),

            PropertyValueEnum::Container(ContainerValue { items, .. })
            | PropertyValueEnum::UnorderedContainer(UnorderedContainerValue(ContainerValue {
                items,
                ..
            })) => {
                if items.is_empty() {
                    self.write_raw("{}");
                } else {
                    self.write_raw("{\n");
                    self.indent();
                    for item in items {
                        self.pad();
                        self.write_value(item)?;
                        self.write_raw("\n");
                    }
                    self.dedent();
                    self.pad();
                    self.write_raw("}");
                }
            }
            PropertyValueEnum::Optional(OptionalValue { value, .. }) => {
                if let Some(inner) = value {
                    self.write_raw("{\n");
                    self.indent();
                    self.pad();
                    self.write_value(inner)?;
                    self.write_raw("\n");
                    self.dedent();
                    self.pad();
                    self.write_raw("}");
                } else {
                    self.write_raw("{}");
                }
            }
            PropertyValueEnum::Map(MapValue { entries, .. }) => {
                if entries.is_empty() {
                    self.write_raw("{}");
                } else {
                    self.write_raw("{\n");
                    self.indent();
                    for (key, value) in entries {
                        self.pad();
                        self.write_value(&key.0)?;
                        self.write_raw(" = ");
                        self.write_value(value)?;
                        self.write_raw("\n");
                    }
                    self.dedent();
                    self.pad();
                    self.write_raw("}");
                }
            }
            PropertyValueEnum::Struct(v) => {
                self.write_struct_value(v)?;
            }
            PropertyValueEnum::Embedded(EmbeddedValue(v)) => {
                self.write_struct_value(v)?;
            }
        }
        Ok(())
    }

    fn write_struct_value(&mut self, v: &StructValue) -> Result<(), WriteError> {
        if v.class_hash == 0 && v.properties.is_empty() {
            self.write_raw("null");
        } else {
            self.write_type_hash(v.class_hash)?;
            self.write_raw(" ");
            if v.properties.is_empty() {
                self.write_raw("{}");
            } else {
                self.write_raw("{\n");
                self.indent();
                for prop in v.properties.values() {
                    self.write_property(prop)?;
                }
                self.dedent();
                self.pad();
                self.write_raw("}");
            }
        }
        Ok(())
    }

    fn write_property(&mut self, prop: &BinProperty) -> Result<(), WriteError> {
        self.pad();
        self.write_field_hash(prop.name_hash)?;
        self.write_raw(": ");
        self.write_type(&prop.value);
        self.write_raw(" = ");
        self.write_value(&prop.value)?;
        self.write_raw("\n");
        Ok(())
    }

    /// Write a BinTree to the buffer.
    pub fn write_tree(&mut self, tree: &BinTree) -> Result<(), WriteError> {
        // Header
        self.write_raw("#PROP_text\n");

        // Type
        self.write_raw("type: string = \"PROP\"\n");

        // Version
        writeln!(self.buffer, "version: u32 = {}", tree.version)?;

        // Dependencies (linked)
        if !tree.dependencies.is_empty() {
            self.write_raw("linked: list[string] = {\n");
            self.indent();
            for dep in &tree.dependencies {
                self.pad();
                writeln!(self.buffer, "{:?}", dep)?;
            }
            self.dedent();
            self.write_raw("}\n");
        }

        // Entries (objects)
        if !tree.objects.is_empty() {
            self.write_raw("entries: map[hash,embed] = {\n");
            self.indent();
            for obj in tree.objects.values() {
                self.write_object(obj)?;
            }
            self.dedent();
            self.write_raw("}\n");
        }

        Ok(())
    }

    /// Write a single BinTreeObject.
    fn write_object(&mut self, obj: &BinTreeObject) -> Result<(), WriteError> {
        self.pad();
        self.write_entry_hash(obj.path_hash)?;
        self.write_raw(" = ");
        self.write_type_hash(obj.class_hash)?;
        self.write_raw(" ");

        if obj.properties.is_empty() {
            self.write_raw("{}\n");
        } else {
            self.write_raw("{\n");
            self.indent();
            for prop in obj.properties.values() {
                self.write_property(prop)?;
            }
            self.dedent();
            self.pad();
            self.write_raw("}\n");
        }

        Ok(())
    }
}

impl Default for TextWriter<'_, HexHashProvider> {
    fn default() -> Self {
        Self::new()
    }
}

// ============================================================================
// Public API Functions
// ============================================================================

/// Write a BinTree to ritobin text format (hashes as hex).
pub fn write(tree: &BinTree) -> Result<String, WriteError> {
    let mut writer = TextWriter::new();
    writer.write_tree(tree)?;
    Ok(writer.into_string())
}

/// Write a BinTree to ritobin text format with custom configuration.
pub fn write_with_config(tree: &BinTree, config: WriterConfig) -> Result<String, WriteError> {
    static HEX_PROVIDER: HexHashProvider = HexHashProvider;
    let mut writer = TextWriter::with_config_and_hashes(config, &HEX_PROVIDER);
    writer.write_tree(tree)?;
    Ok(writer.into_string())
}

/// Write a BinTree to ritobin text format with hash name lookup.
pub fn write_with_hashes<H: HashProvider>(
    tree: &BinTree,
    hashes: &H,
) -> Result<String, WriteError> {
    let mut writer = TextWriter::with_hashes(hashes);
    writer.write_tree(tree)?;
    Ok(writer.into_string())
}

/// Write a BinTree to ritobin text format with configuration and hash name lookup.
pub fn write_with_config_and_hashes<H: HashProvider>(
    tree: &BinTree,
    config: WriterConfig,
    hashes: &H,
) -> Result<String, WriteError> {
    let mut writer = TextWriter::with_config_and_hashes(config, hashes);
    writer.write_tree(tree)?;
    Ok(writer.into_string())
}

// ============================================================================
// Builder
// ============================================================================

/// A builder for creating ritobin files programmatically and converting to text.
///
/// This is a convenience wrapper around [`ltk_meta::bin_tree::BinTreeBuilder`]
/// that adds methods for direct text output.
///
/// # Examples
///
/// ```
/// use ltk_ritobin::writer::RitobinBuilder;
/// use ltk_meta::BinTreeObject;
///
/// let text = RitobinBuilder::new()
///     .dependency("base.bin")
///     .object(BinTreeObject::new(0x1234, 0x5678))
///     .to_text()
///     .unwrap();
/// ```
#[derive(Debug, Default, Clone)]
pub struct RitobinBuilder {
    is_override: bool,
    dependencies: Vec<String>,
    objects: Vec<BinTreeObject>,
}

impl RitobinBuilder {
    /// Creates a new `RitobinBuilder` with default values.
    pub fn new() -> Self {
        Self::default()
    }

    /// Sets whether this is an override bin file.
    ///
    /// Default is `false`.
    pub fn is_override(mut self, is_override: bool) -> Self {
        self.is_override = is_override;
        self
    }

    /// Adds a single dependency.
    pub fn dependency(mut self, dep: impl Into<String>) -> Self {
        self.dependencies.push(dep.into());
        self
    }

    /// Adds multiple dependencies.
    pub fn dependencies(mut self, deps: impl IntoIterator<Item = impl Into<String>>) -> Self {
        self.dependencies.extend(deps.into_iter().map(Into::into));
        self
    }

    /// Adds a single object.
    pub fn object(mut self, obj: BinTreeObject) -> Self {
        self.objects.push(obj);
        self
    }

    /// Adds multiple objects.
    pub fn objects(mut self, objs: impl IntoIterator<Item = BinTreeObject>) -> Self {
        self.objects.extend(objs);
        self
    }

    /// Builds the [`BinTree`].
    ///
    /// The resulting tree will have version 3, which is always used when writing.
    pub fn build(self) -> BinTree {
        BinTree::builder()
            .is_override(self.is_override)
            .dependencies(self.dependencies)
            .objects(self.objects)
            .build()
    }

    /// Build and write to ritobin text format (hashes as hex).
    pub fn to_text(self) -> Result<String, WriteError> {
        write(&self.build())
    }

    /// Build and write to ritobin text format with hash name lookup.
    pub fn to_text_with_hashes<H: HashProvider>(self, hashes: &H) -> Result<String, WriteError> {
        write_with_hashes(&self.build(), hashes)
    }
}

// ============================================================================
// Convenience type aliases
// ============================================================================

/// A pre-configured writer that outputs all hashes as hex values.
pub type HexWriter<'a> = TextWriter<'a, HexHashProvider>;

/// A pre-configured writer that looks up hashes from HashMaps.
pub type NamedWriter<'a> = TextWriter<'a, HashMapProvider>;

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

    #[test]
    fn test_write_simple() {
        let tree = BinTree::new([], std::iter::empty::<&str>());
        let text = write(&tree).unwrap();
        assert!(text.contains("#PROP_text"));
        assert!(text.contains("type: string = \"PROP\""));
        assert!(text.contains("version: u32 = 3"));
    }

    #[test]
    fn test_write_with_dependencies() {
        let tree = BinTree::new(
            std::iter::empty(),
            vec![
                "path/to/dep1.bin".to_string(),
                "path/to/dep2.bin".to_string(),
            ],
        );
        let text = write(&tree).unwrap();
        assert!(text.contains("linked: list[string] = {"));
        assert!(text.contains("\"path/to/dep1.bin\""));
        assert!(text.contains("\"path/to/dep2.bin\""));
    }

    #[test]
    fn test_builder() {
        let tree = RitobinBuilder::new().dependency("path/to/dep.bin").build();

        assert_eq!(tree.dependencies.len(), 1);
        assert_eq!(tree.version, 3); // Version is always 3
    }

    #[test]
    fn test_write_with_hash_lookup() {
        use ltk_meta::value::StringValue;
        use std::collections::HashMap as StdHashMap;

        // Create a simple tree with a hash value
        let mut properties = StdHashMap::new();
        let name_hash = ltk_hash::fnv1a::hash_lower("testField");
        properties.insert(
            name_hash,
            BinProperty {
                name_hash,
                value: PropertyValueEnum::String(StringValue("hello".to_string())),
            },
        );

        let path_hash = ltk_hash::fnv1a::hash_lower("Test/Path");
        let class_hash = ltk_hash::fnv1a::hash_lower("TestClass");

        let obj = BinTreeObject {
            path_hash,
            class_hash,
            properties,
        };

        let tree = BinTree::new(std::iter::once(obj), std::iter::empty::<&str>());

        // Without hash lookup - should have hex values
        let text_hex = write(&tree).unwrap();
        assert!(text_hex.contains(&format!("{:#x}", path_hash)));

        // With hash lookup - should have named values
        let mut hashes = HashMapProvider::new();
        hashes.insert_entry(path_hash, "Test/Path");
        hashes.insert_field(name_hash, "testField");
        hashes.insert_type(class_hash, "TestClass");

        let text_named = write_with_hashes(&tree, &hashes).unwrap();
        assert!(text_named.contains("\"Test/Path\""));
        assert!(text_named.contains("testField:"));
        assert!(text_named.contains("TestClass {"));
    }
}