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

//! Higher level support for writing hff files.

mod chunk_array;
pub use chunk_array::ChunkArray;

mod data_source;
pub use data_source::DataSource;

mod table_array;
pub use table_array::TableArray;

mod data_array;
pub use data_array::DataArray;

mod chunk_desc;
pub use chunk_desc::ChunkDesc;

mod table_builder;
pub use table_builder::TableBuilder;

mod table_desc;
pub use table_desc::TableDesc;

mod hff_desc;
pub use hff_desc::HffDesc;

use crate::{Error, Identifier, Result};

/// Start building a new table.
pub fn table<'a>(identifier: impl Into<Identifier>) -> TableBuilder<'a> {
    TableBuilder::new(identifier.into())
}

/// Build a new chunk.
pub fn chunk<'a, T>(identifier: impl Into<Identifier>, content: T) -> Result<ChunkDesc<'a>>
where
    T: TryInto<DataSource<'a>, Error = Error>,
{
    Ok(ChunkDesc::new(identifier.into(), content.try_into()?))
}

/// Build the structure of the Hff content.
pub fn hff<'a>(tables: impl IntoIterator<Item = TableBuilder<'a>>) -> HffDesc<'a> {
    // Split the tables into their components.
    let mut table_array = TableArray::new();
    let mut chunk_array = ChunkArray::new();
    let mut data_array = DataArray::new();

    // Collect the tables into a vector so we know the length.
    let tables = tables
        .into_iter()
        .map(|desc| desc.finish())
        .collect::<Vec<_>>();

    let table_count = tables.len();
    for (index, table) in tables.into_iter().enumerate() {
        // Determine if this table has a sibling.
        let has_sibling = index < table_count - 1;
        // And flatten the table.
        table.flatten(
            has_sibling,
            &mut table_array,
            &mut chunk_array,
            &mut data_array,
        );
    }
    HffDesc::new(table_array, chunk_array, data_array)
}