loftspec 2.0.2

The Loft Specification Format: document model, identity, canonical bytes, hashing and conversion
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

//! The rules on nodes a typed document can break: a tag listed twice (RQ-79), and a Component
//! that declares `private` beneath an `external` one (ADR-15).

use std::collections::BTreeSet;

use super::ValidationError;
use crate::boundary::Boundaries;
use crate::document::Document;
use crate::node::Node;

pub(super) fn check(document: &Document, errors: &mut Vec<ValidationError>) {
    document.walk(&mut |node| repeated_tags(node, errors));
    errors.extend(Boundaries::of(document).conflicts().iter().map(|conflict| {
        ValidationError::PrivateUnderExternal {
            component: conflict.component,
            ancestor: conflict.ancestor,
        }
    }));
}

/// One error per tag a node lists more than once.
fn repeated_tags(node: Node<'_>, errors: &mut Vec<ValidationError>) {
    let (Some(id), Some(details)) = (node.id(), node.details()) else {
        return;
    };
    let mut seen = BTreeSet::new();
    let mut reported = BTreeSet::new();
    for tag in &details.tags {
        if !seen.insert(tag) && reported.insert(tag) {
            errors.push(ValidationError::RepeatedTag {
                node: id,
                tag: tag.clone(),
            });
        }
    }
}