ggen-cli-lib 26.5.19

CLI interface for ggen
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
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
//! Generation planner for creating task execution plans

use ggen_core::utils::error::Result;
use std::collections::{HashMap, HashSet};
use std::fs;
use std::path::{Path, PathBuf};

use super::ProjectConventions;

/// Metadata extracted from template comments
#[derive(Debug, Clone, PartialEq)]
pub struct TemplateMetadata {
    pub output: String,
    pub when: Vec<String>,
    pub query: String,
    pub foreach: Option<String>,
}

impl TemplateMetadata {
    /// Parse template metadata from file content
    pub fn parse(content: &str) -> Result<Self> {
        let mut output = None;
        let mut when = Vec::new();
        let mut query = None;
        let mut foreach = None;

        // Parse {# ... #} style comments
        for line in content.lines() {
            let line = line.trim();

            if line.starts_with("{#") && line.ends_with("#}") {
                let inner = line[2..line.len() - 2].trim();

                if let Some(value) = inner.strip_prefix("output:") {
                    output = Some(value.trim().to_string());
                } else if let Some(value) = inner.strip_prefix("when:") {
                    when.push(value.trim().to_string());
                } else if let Some(value) = inner.strip_prefix("query:") {
                    query = Some(value.trim().to_string());
                } else if let Some(value) = inner.strip_prefix("foreach:") {
                    foreach = Some(value.trim().to_string());
                }
            }
        }

        Ok(TemplateMetadata {
            output: output
                .ok_or_else(|| ggen_core::utils::error::Error::new("Missing 'output' directive"))?,
            when,
            query: query
                .ok_or_else(|| ggen_core::utils::error::Error::new("Missing 'query' directive"))?,
            foreach,
        })
    }
}

/// A single generation task
#[derive(Debug, Clone)]
pub struct GenerationTask {
    pub template: String,
    pub output_pattern: String,
    pub trigger_files: Vec<PathBuf>,
    pub query: Option<String>,
    pub foreach: Option<String>,
}

/// Complete generation plan with all tasks
#[derive(Debug)]
pub struct GenerationPlan {
    pub tasks: Vec<GenerationTask>,
}

/// Plans code generation based on conventions and templates
pub struct GenerationPlanner {
    conventions: ProjectConventions,
}

impl GenerationPlanner {
    /// Create a new generation planner
    pub fn new(conventions: ProjectConventions) -> Self {
        Self { conventions }
    }

    /// Create a generation plan by analyzing all templates
    pub fn plan(&self) -> Result<GenerationPlan> {
        let mut tasks = Vec::new();
        let mut task_graph: HashMap<String, Vec<String>> = HashMap::new();

        // Iterate through all discovered templates
        for (template_name, template_path) in &self.conventions.templates {
            let metadata = self.parse_template_metadata(template_path)?;
            let trigger_files = self.resolve_dependencies(&metadata);

            // Track dependencies for circular detection
            let deps: Vec<String> = trigger_files
                .iter()
                .filter_map(|p| {
                    p.file_stem()
                        .and_then(|s| s.to_str())
                        .map(|s| s.to_string())
                })
                .collect();

            task_graph.insert(template_name.clone(), deps);

            tasks.push(GenerationTask {
                template: template_name.clone(),
                output_pattern: metadata.output,
                trigger_files,
                query: Some(metadata.query),
                foreach: metadata.foreach,
            });
        }

        // Check for circular dependencies
        self.check_circular_dependencies(&task_graph)?;

        // Sort tasks by dependencies (topological sort)
        tasks = self.topological_sort(tasks)?;

        Ok(GenerationPlan { tasks })
    }

    /// Parse template metadata from a template file
    fn parse_template_metadata(&self, path: &Path) -> Result<TemplateMetadata> {
        let content = fs::read_to_string(path)?;
        TemplateMetadata::parse(&content)
    }

    /// Resolve file dependencies from template metadata
    fn resolve_dependencies(&self, metadata: &TemplateMetadata) -> Vec<PathBuf> {
        metadata
            .when
            .iter()
            .map(|pattern| {
                // Simple glob pattern resolution
                // In a real implementation, this would use proper glob matching
                PathBuf::from(pattern)
            })
            .collect()
    }

    /// Check for circular dependencies in the task graph
    fn check_circular_dependencies(&self, graph: &HashMap<String, Vec<String>>) -> Result<()> {
        for task in graph.keys() {
            let mut visited = HashSet::new();
            let mut rec_stack = HashSet::new();

            if self.has_cycle(task, graph, &mut visited, &mut rec_stack) {
                return Err(ggen_core::utils::error::Error::new(&format!(
                    "Circular dependency detected involving task: {}",
                    task
                )));
            }
        }

        Ok(())
    }

    /// DFS-based cycle detection
    #[allow(clippy::only_used_in_recursion)] // Parameter used in recursive calls
    fn has_cycle(
        &self, task: &str, graph: &HashMap<String, Vec<String>>, visited: &mut HashSet<String>,
        rec_stack: &mut HashSet<String>,
    ) -> bool {
        if rec_stack.contains(task) {
            return true;
        }

        if visited.contains(task) {
            return false;
        }

        visited.insert(task.to_string());
        rec_stack.insert(task.to_string());

        if let Some(deps) = graph.get(task) {
            for dep in deps {
                if self.has_cycle(dep, graph, visited, rec_stack) {
                    return true;
                }
            }
        }

        rec_stack.remove(task);
        false
    }

    /// Topologically sort tasks by dependencies
    fn topological_sort(&self, mut tasks: Vec<GenerationTask>) -> Result<Vec<GenerationTask>> {
        // Build dependency map
        let mut dep_count: HashMap<String, usize> = HashMap::new();
        let mut graph: HashMap<String, Vec<String>> = HashMap::new();

        for task in &tasks {
            dep_count.entry(task.template.clone()).or_insert(0);

            for trigger in &task.trigger_files {
                if let Some(dep) = trigger.file_stem().and_then(|s| s.to_str()) {
                    graph
                        .entry(dep.to_string())
                        .or_default()
                        .push(task.template.clone());
                    *dep_count.entry(task.template.clone()).or_insert(0) += 1;
                }
            }
        }

        // Find tasks with no dependencies
        let mut ready: Vec<String> = dep_count
            .iter()
            .filter(|(_, &count)| count == 0)
            .map(|(name, _)| name.clone())
            .collect();

        let mut sorted = Vec::new();

        while let Some(task_name) = ready.pop() {
            // Find and add the task
            if let Some(pos) = tasks.iter().position(|t| t.template == task_name) {
                let task = tasks.remove(pos);
                sorted.push(task);
            }

            // Update dependent tasks
            if let Some(dependents) = graph.get(&task_name) {
                for dependent in dependents {
                    if let Some(count) = dep_count.get_mut(dependent) {
                        *count = count.saturating_sub(1);
                        if *count == 0 {
                            ready.push(dependent.clone());
                        }
                    }
                }
            }
        }

        // If there are remaining tasks, there's a cycle
        if !tasks.is_empty() {
            return Err(ggen_core::utils::error::Error::new(
                "Circular dependency detected during topological sort",
            ));
        }

        Ok(sorted)
    }
}

#[cfg(test)]
mod tests {
    use super::*;
    use std::fs;
    use tempfile::TempDir;

    fn create_test_template(dir: &Path, name: &str, content: &str) -> PathBuf {
        let path = dir.join(name);
        fs::write(&path, content).unwrap();
        path
    }

    fn create_test_conventions(
        temp_dir: &Path, templates: Vec<(&str, &str)>,
    ) -> ProjectConventions {
        let template_dir = temp_dir.join("templates");
        fs::create_dir_all(&template_dir).unwrap();

        let mut template_map = HashMap::new();
        for (name, content) in templates {
            let full_name = if name.ends_with(".tmpl") {
                name.to_string()
            } else {
                format!("{}.tmpl", name)
            };
            let path = create_test_template(&template_dir, &full_name, content);
            let key = name.strip_suffix(".tmpl").unwrap_or(name).to_string();
            template_map.insert(key, path);
        }

        ProjectConventions {
            rdf_files: vec![],
            rdf_dir: temp_dir.join("domain"),
            templates: template_map,
            templates_dir: template_dir,
            queries: HashMap::new(),
            output_dir: temp_dir.to_path_buf(),
            preset: "test".to_string(),
        }
    }

    #[test]
    fn test_parse_template_metadata_basic() {
        let content = r#"
{# output: src/{{name}}.rs #}
{# when: src/models/*.rs #}
{# query: SELECT * FROM models #}

template content here
"#;

        let metadata = TemplateMetadata::parse(content).unwrap();
        assert_eq!(metadata.output, "src/{{name}}.rs");
        assert_eq!(metadata.when, vec!["src/models/*.rs"]);
        assert_eq!(metadata.query, "SELECT * FROM models");
        assert_eq!(metadata.foreach, None);
    }

    #[test]
    fn test_parse_template_metadata_with_foreach() {
        let content = r#"
{# output: tests/{{item}}_test.rs #}
{# when: src/{{item}}.rs #}
{# query: SELECT name FROM entities #}
{# foreach: entity #}

test template
"#;

        let metadata = TemplateMetadata::parse(content).unwrap();
        assert_eq!(metadata.output, "tests/{{item}}_test.rs");
        assert_eq!(metadata.foreach, Some("entity".to_string()));
    }

    #[test]
    fn test_parse_template_metadata_multiple_when() {
        let content = r#"
{# output: generated.rs #}
{# when: file1.rs #}
{# when: file2.rs #}
{# query: SELECT * #}
"#;

        let metadata = TemplateMetadata::parse(content).unwrap();
        assert_eq!(metadata.when.len(), 2);
        assert!(metadata.when.contains(&"file1.rs".to_string()));
        assert!(metadata.when.contains(&"file2.rs".to_string()));
    }

    #[test]
    fn test_parse_template_metadata_missing_output() {
        let content = r#"
{# query: SELECT * #}
"#;

        let result = TemplateMetadata::parse(content);
        assert!(result.is_err());
        assert!(result.unwrap_err().to_string().contains("Missing 'output'"));
    }

    #[test]
    fn test_parse_template_metadata_missing_query() {
        let content = r#"
{# output: file.rs #}
"#;

        let result = TemplateMetadata::parse(content);
        assert!(result.is_err());
        assert!(result.unwrap_err().to_string().contains("Missing 'query'"));
    }

    #[test]
    fn test_generation_planner_empty() {
        let temp_dir = TempDir::new().unwrap();
        let conventions = create_test_conventions(temp_dir.path(), vec![]);

        let planner = GenerationPlanner::new(conventions);
        let plan = planner.plan().unwrap();

        assert_eq!(plan.tasks.len(), 0);
    }

    #[test]
    fn test_generation_planner_single_task() {
        let temp_dir = TempDir::new().unwrap();
        let conventions = create_test_conventions(
            temp_dir.path(),
            vec![(
                "test",
                r#"
{# output: generated.rs #}
{# query: SELECT * #}

content
"#,
            )],
        );

        let planner = GenerationPlanner::new(conventions);
        let plan = planner.plan().unwrap();

        assert_eq!(plan.tasks.len(), 1);
        assert_eq!(plan.tasks[0].template, "test");
        assert_eq!(plan.tasks[0].output_pattern, "generated.rs");
    }

    #[test]
    fn test_generation_planner_multiple_tasks() {
        let temp_dir = TempDir::new().unwrap();
        let conventions = create_test_conventions(
            temp_dir.path(),
            vec![
                (
                    "task1",
                    r#"
{# output: out1.rs #}
{# query: SELECT * FROM table1 #}
"#,
                ),
                (
                    "task2",
                    r#"
{# output: out2.rs #}
{# query: SELECT * FROM table2 #}
"#,
                ),
            ],
        );

        let planner = GenerationPlanner::new(conventions);
        let plan = planner.plan().unwrap();

        assert_eq!(plan.tasks.len(), 2);
    }

    #[test]
    fn test_generation_planner_with_dependencies() {
        let temp_dir = TempDir::new().unwrap();
        let conventions = create_test_conventions(
            temp_dir.path(),
            vec![
                (
                    "base",
                    r#"
{# output: base.rs #}
{# query: SELECT * FROM base #}
"#,
                ),
                (
                    "derived",
                    r#"
{# output: derived.rs #}
{# when: base.rs #}
{# query: SELECT * FROM derived #}
"#,
                ),
            ],
        );

        let planner = GenerationPlanner::new(conventions);
        let plan = planner.plan().unwrap();

        assert_eq!(plan.tasks.len(), 2);

        // Base task should come before derived
        let base_idx = plan
            .tasks
            .iter()
            .position(|t| t.template == "base")
            .unwrap();
        let derived_idx = plan
            .tasks
            .iter()
            .position(|t| t.template == "derived")
            .unwrap();
        assert!(base_idx < derived_idx);
    }

    #[test]
    fn test_circular_dependency_detection() {
        let temp_dir = TempDir::new().unwrap();
        let conventions = create_test_conventions(
            temp_dir.path(),
            vec![
                (
                    "task1",
                    r#"
{# output: task1.rs #}
{# when: task2.rs #}
{# query: SELECT * #}
"#,
                ),
                (
                    "task2",
                    r#"
{# output: task2.rs #}
{# when: task1.rs #}
{# query: SELECT * #}
"#,
                ),
            ],
        );

        let planner = GenerationPlanner::new(conventions);
        let result = planner.plan();

        assert!(result.is_err());
        let err_msg = result.unwrap_err().to_string();
        assert!(
            err_msg.contains("Circular dependency") || err_msg.contains("cycle"),
            "Expected circular dependency error, got: {}",
            err_msg
        );
    }

    #[test]
    fn test_foreach_pattern() {
        let temp_dir = TempDir::new().unwrap();
        let conventions = create_test_conventions(
            temp_dir.path(),
            vec![(
                "test",
                r#"
{# output: tests/{{entity}}_test.rs #}
{# query: SELECT name FROM entities #}
{# foreach: entity #}
"#,
            )],
        );

        let planner = GenerationPlanner::new(conventions);
        let plan = planner.plan().unwrap();

        assert_eq!(plan.tasks.len(), 1);
        assert_eq!(plan.tasks[0].foreach, Some("entity".to_string()));
        assert_eq!(plan.tasks[0].output_pattern, "tests/{{entity}}_test.rs");
    }

    #[test]
    fn test_once_pattern() {
        let temp_dir = TempDir::new().unwrap();
        let conventions = create_test_conventions(
            temp_dir.path(),
            vec![(
                "once",
                r#"
{# output: single_file.rs #}
{# query: SELECT COUNT(*) #}
"#,
            )],
        );

        let planner = GenerationPlanner::new(conventions);
        let plan = planner.plan().unwrap();

        assert_eq!(plan.tasks.len(), 1);
        assert_eq!(plan.tasks[0].foreach, None);
        assert_eq!(plan.tasks[0].output_pattern, "single_file.rs");
    }

    #[test]
    fn test_complex_dependency_graph() {
        let temp_dir = TempDir::new().unwrap();
        let conventions = create_test_conventions(
            temp_dir.path(),
            vec![
                (
                    "models",
                    r#"
{# output: models.rs #}
{# query: SELECT * FROM schema #}
"#,
                ),
                (
                    "services",
                    r#"
{# output: services.rs #}
{# when: models.rs #}
{# query: SELECT * FROM services #}
"#,
                ),
                (
                    "controllers",
                    r#"
{# output: controllers.rs #}
{# when: services.rs #}
{# query: SELECT * FROM controllers #}
"#,
                ),
                (
                    "routes",
                    r#"
{# output: routes.rs #}
{# when: controllers.rs #}
{# query: SELECT * FROM routes #}
"#,
                ),
            ],
        );

        let planner = GenerationPlanner::new(conventions);
        let plan = planner.plan().unwrap();

        assert_eq!(plan.tasks.len(), 4);

        // Verify ordering
        let names: Vec<_> = plan.tasks.iter().map(|t| t.template.as_str()).collect();
        let models_idx = names.iter().position(|&n| n == "models").unwrap();
        let services_idx = names.iter().position(|&n| n == "services").unwrap();
        let controllers_idx = names.iter().position(|&n| n == "controllers").unwrap();
        let routes_idx = names.iter().position(|&n| n == "routes").unwrap();

        assert!(models_idx < services_idx);
        assert!(services_idx < controllers_idx);
        assert!(controllers_idx < routes_idx);
    }
}