onnx-ir 0.21.0

ONNX-IR is a pure Rust library for parsing ONNX models into an intermediate representation that can be used to generate code for various ML/DL frameworks
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

/// Basic tests for ONNX-IR parsing
///
/// These tests verify that the ONNX-IR parser can successfully parse
/// simple ONNX models without errors. They are the most basic sanity checks
/// to ensure the pipeline works at all.
mod test_utils;

use test_utils::*;

#[test]
fn test_parse_basic_model() {
    // Load and parse the most basic model
    let graph = load_onnx("basic_model.onnx");

    // Basic sanity checks
    assert!(!graph.nodes.is_empty(), "Graph should have nodes");
    assert!(!graph.inputs.is_empty(), "Graph should have inputs");
    assert!(!graph.outputs.is_empty(), "Graph should have outputs");

    // Verify we have the expected operation nodes
    assert!(has_node_type(&graph, |n| matches!(
        n,
        onnx_ir::ir::Node::Relu { .. }
    )));
    assert!(has_node_type(&graph, |n| matches!(
        n,
        onnx_ir::ir::Node::PRelu { .. }
    )));
    assert!(has_node_type(&graph, |n| matches!(
        n,
        onnx_ir::ir::Node::Add { .. }
    )));

    // Verify basic I/O counts
    assert_eq!(graph.inputs.len(), 1, "Expected 1 input");
    assert_eq!(graph.outputs.len(), 1, "Expected 1 output");
}

#[test]
fn test_parse_multi_io() {
    // Test that we can handle multiple inputs and outputs
    let graph = load_onnx("multi_io.onnx");

    assert_eq!(graph.inputs.len(), 3, "Expected 3 inputs");
    assert_eq!(graph.outputs.len(), 2, "Expected 2 outputs");
    assert!(
        count_operation_nodes(&graph) >= 3,
        "Expected operation nodes"
    );
}

#[test]
fn test_parse_edge_cases() {
    // Test that edge cases don't crash the parser
    let graph = load_onnx("edge_cases.onnx");

    // Just verify we can parse it successfully
    assert_eq!(graph.inputs.len(), 1);
    assert_eq!(graph.outputs.len(), 3);
    assert_eq!(count_operation_nodes(&graph), 3);
}