qualia_core_db/query/
visual_model_bridge.rs1use crate::{q_hash, NQuin};
4use serde::{Deserialize, Serialize};
5
6#[derive(Serialize, Deserialize, Debug, Clone)]
7pub struct UiLogicNode {
8 pub id: usize,
9 pub title: String,
10 pub kind: String,
11}
12
13#[derive(Serialize, Deserialize, Debug, Clone)]
14pub struct UiLogicEdge {
15 pub from: usize,
16 pub to: usize,
17 pub label: String,
18 pub status: String,
19}
20
21#[derive(Serialize, Deserialize, Debug, Clone)]
22pub struct UiLogicGraph {
23 pub nodes: Vec<UiLogicNode>,
24 pub edges: Vec<UiLogicEdge>,
25}
26
27#[derive(Serialize, Deserialize, Debug, Clone)]
28pub struct EvaluationReport {
29 pub contradictions: Vec<usize>, pub validations: Vec<usize>,
31}
32
33pub fn translate_graph_to_quins(graph: &UiLogicGraph, out: &mut [NQuin]) -> usize {
36 let mut count = 0;
37
38 for edge in &graph.edges {
40 if count >= out.len() {
41 break; }
43
44 let from_node = graph.nodes.iter().find(|n| n.id == edge.from);
45 let to_node = graph.nodes.iter().find(|n| n.id == edge.to);
46
47 if let (Some(f), Some(t)) = (from_node, to_node) {
48 let mut q = NQuin::default();
49 q.subject = q_hash(&f.title);
50 q.predicate = q_hash(&edge.label);
51 q.object = q_hash(&t.title);
52
53 q.parity = q.subject ^ q.predicate ^ q.object ^ q.context;
55
56 out[count] = q;
57 count += 1;
58 }
59 }
60
61 count
62}
63
64pub fn evaluate_ui_graph(graph: &UiLogicGraph) -> EvaluationReport {
66 let mut out_quins = [NQuin::default(); 128];
67 let quin_count = translate_graph_to_quins(graph, &mut out_quins);
68
69 let mut contradictions = Vec::new();
70 let mut validations = Vec::new();
71
72 let mut consistent = [NQuin::default(); 128];
73 let mut isolated = [NQuin::default(); 128];
74
75 let (_, isolated_count) = crate::modalities::paraconsistent::route_paraconsistent(
76 &out_quins[..quin_count],
77 &mut consistent,
78 &mut isolated,
79 )
80 .unwrap_or((0, 0));
81
82 let isolated_subjects: Vec<u64> = isolated[..isolated_count]
83 .iter()
84 .map(|q| q.subject)
85 .collect();
86
87 for edge in &graph.edges {
88 let is_status_contradiction = edge.status.eq_ignore_ascii_case("contradiction")
89 || edge.label.eq_ignore_ascii_case("contradicts")
90 || edge.label.eq_ignore_ascii_case("conflicts_with")
91 || edge.label.eq_ignore_ascii_case("not");
92
93 let from_title_hash = graph
94 .nodes
95 .iter()
96 .find(|n| n.id == edge.from)
97 .map(|n| q_hash(&n.title))
98 .unwrap_or(0);
99
100 let is_paraconsistent_isolated = isolated_subjects.contains(&from_title_hash);
101
102 if is_status_contradiction || is_paraconsistent_isolated {
103 contradictions.push(edge.from);
104 } else {
105 validations.push(edge.from);
106 }
107 }
108
109 EvaluationReport {
110 contradictions,
111 validations,
112 }
113}