dx-driven 0.1.0

Professional AI-assisted development orchestrator with binary-first architecture
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

//! Conflict detection

use super::Conflict;
use crate::{Result, parser::UnifiedRule};

/// Detects conflicts between rules
#[derive(Debug, Default)]
pub struct ConflictDetector;

impl ConflictDetector {
    /// Create a new conflict detector
    pub fn new() -> Self {
        Self
    }

    /// Detect conflicts in a set of rules
    pub fn detect(&self, rules: &[UnifiedRule]) -> Result<Vec<Conflict>> {
        let mut conflicts = Vec::new();

        // Check for conflicting naming conventions
        conflicts.extend(self.check_naming_conflicts(rules));

        // Check for contradictory standards
        conflicts.extend(self.check_contradictions(rules));

        Ok(conflicts)
    }

    fn check_naming_conflicts(&self, rules: &[UnifiedRule]) -> Vec<Conflict> {
        let mut conflicts = Vec::new();
        let mut naming_rules: Vec<&str> = Vec::new();

        for rule in rules {
            if let UnifiedRule::Standard { description, .. } = rule {
                let lower = description.to_lowercase();
                if lower.contains("snake_case")
                    || lower.contains("camelcase")
                    || lower.contains("pascalcase")
                {
                    naming_rules.push(description);
                }
            }
        }

        // Check for conflicting naming rules
        if naming_rules.len() > 1 {
            let has_snake = naming_rules
                .iter()
                .any(|r| r.to_lowercase().contains("snake_case"));
            let has_camel = naming_rules
                .iter()
                .any(|r| r.to_lowercase().contains("camelcase"));

            if has_snake && has_camel {
                // Only conflict if they're for the same context
                let func_snake = naming_rules.iter().any(|r| {
                    r.to_lowercase().contains("function") && r.to_lowercase().contains("snake_case")
                });
                let func_camel = naming_rules.iter().any(|r| {
                    r.to_lowercase().contains("function") && r.to_lowercase().contains("camelcase")
                });

                if func_snake && func_camel {
                    conflicts.push(Conflict {
                        description: "Conflicting function naming conventions".to_string(),
                        rules: naming_rules.iter().map(|s| s.to_string()).collect(),
                        suggestion: Some("Choose one naming convention for functions".to_string()),
                    });
                }
            }
        }

        conflicts
    }

    fn check_contradictions(&self, rules: &[UnifiedRule]) -> Vec<Conflict> {
        let mut conflicts = Vec::new();

        // Look for obvious contradictions
        let contradiction_pairs = [
            ("always", "never"),
            ("must", "must not"),
            ("require", "avoid"),
        ];

        let standards: Vec<_> = rules
            .iter()
            .filter_map(|r| {
                if let UnifiedRule::Standard { description, .. } = r {
                    Some(description.as_str())
                } else {
                    None
                }
            })
            .collect();

        for (positive, negative) in contradiction_pairs {
            for &rule1 in &standards {
                for &rule2 in &standards {
                    if rule1 == rule2 {
                        continue;
                    }

                    let r1_lower = rule1.to_lowercase();
                    let r2_lower = rule2.to_lowercase();

                    // Check if same topic with contradicting verbs
                    if (r1_lower.contains(positive) && r2_lower.contains(negative))
                        || (r1_lower.contains(negative) && r2_lower.contains(positive))
                    {
                        // Check for similar topics (simple word overlap)
                        let r1_words: std::collections::HashSet<_> = r1_lower
                            .split_whitespace()
                            .filter(|w| w.len() > 4)
                            .collect();
                        let r2_words: std::collections::HashSet<_> = r2_lower
                            .split_whitespace()
                            .filter(|w| w.len() > 4)
                            .collect();

                        let overlap: Vec<_> = r1_words.intersection(&r2_words).collect();
                        if overlap.len() >= 2 {
                            conflicts.push(Conflict {
                                description: "Potentially contradicting rules".to_string(),
                                rules: vec![rule1.to_string(), rule2.to_string()],
                                suggestion: Some("Review these rules for consistency".to_string()),
                            });
                        }
                    }
                }
            }
        }

        conflicts
    }
}

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

    #[test]
    fn test_detector_new() {
        let detector = ConflictDetector::new();
        let conflicts = detector.detect(&[]).unwrap();
        assert!(conflicts.is_empty());
    }
}