lerna 2.0.3

Lerna is a framework for elegantly configuring complex applications
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

// Copyright (c) Facebook, Inc. and its affiliates. All Rights Reserved
//! Sweep expansion for multirun configurations

use crate::core::{Override, OverrideValue, ParsedElement};

/// Expand sweep overrides into individual override sets.
///
/// Given a list of overrides like:
/// - db=mysql,postgresql
/// - server=dev,prod
///
/// Returns a list of override sets (cartesian product):
/// - [db=mysql, server=dev]
/// - [db=mysql, server=prod]
/// - [db=postgresql, server=dev]
/// - [db=postgresql, server=prod]
pub fn expand_sweeps(overrides: &[Override]) -> Vec<Vec<String>> {
    // Collect sweep dimensions
    let mut dimensions: Vec<Vec<String>> = Vec::new();

    for ovr in overrides {
        let key = &ovr.key.key_or_group;

        match &ovr.value {
            Some(OverrideValue::ChoiceSweep(cs)) => {
                // Expand choice sweep
                let choices: Vec<String> = cs
                    .list
                    .iter()
                    .map(|elem| format!("{}={}", key, element_to_string(elem)))
                    .collect();
                dimensions.push(choices);
            }
            Some(OverrideValue::RangeSweep(rs)) => {
                // Expand range sweep
                let start = rs.start.unwrap_or(0.0);
                let stop = rs.stop.unwrap_or(10.0);
                let step = rs.step;

                let mut choices = Vec::new();
                let mut current = start;
                while current < stop {
                    if step == step.floor() && current == current.floor() {
                        // Integer range
                        choices.push(format!("{}={}", key, current as i64));
                    } else {
                        choices.push(format!("{}={}", key, current));
                    }
                    current += step;
                }
                dimensions.push(choices);
            }
            Some(OverrideValue::Element(elem)) => {
                // Non-sweep override - single value
                dimensions.push(vec![format!("{}={}", key, element_to_string(elem))]);
            }
            None => {
                // Delete override
                dimensions.push(vec![format!("~{}", key)]);
            }
            _ => {
                // Other sweep types not yet supported
                dimensions.push(vec![format!("{}=<unsupported>", key)]);
            }
        }
    }

    // Cartesian product of all dimensions
    cartesian_product(&dimensions)
}

/// Compute cartesian product of all dimensions
fn cartesian_product(dimensions: &[Vec<String>]) -> Vec<Vec<String>> {
    if dimensions.is_empty() {
        return vec![vec![]];
    }

    if dimensions.len() == 1 {
        return dimensions[0].iter().map(|s| vec![s.clone()]).collect();
    }

    let first = &dimensions[0];
    let rest = &dimensions[1..];

    let rest_product = cartesian_product(rest);

    let mut result = Vec::new();
    for item in first {
        for rest_combo in &rest_product {
            let mut combo = vec![item.clone()];
            combo.extend(rest_combo.iter().cloned());
            result.push(combo);
        }
    }

    result
}

/// Convert a ParsedElement to its string representation
fn element_to_string(elem: &ParsedElement) -> String {
    match elem {
        ParsedElement::Null => "null".to_string(),
        ParsedElement::Bool(b) => b.to_string(),
        ParsedElement::Int(i) => i.to_string(),
        ParsedElement::Float(f) => f.to_string(),
        ParsedElement::String(s) => s.clone(),
        ParsedElement::QuotedString(qs) => {
            let quote = match qs.quote {
                crate::core::Quote::Single => '\'',
                crate::core::Quote::Double => '"',
            };
            format!("{}{}{}", quote, qs.text, quote)
        }
        ParsedElement::List(items) => {
            let inner: Vec<String> = items.iter().map(element_to_string).collect();
            format!("[{}]", inner.join(","))
        }
        ParsedElement::Dict(pairs) => {
            let inner: Vec<String> = pairs
                .iter()
                .map(|(k, v)| format!("{}:{}", k, element_to_string(v)))
                .collect();
            format!("{{{}}}", inner.join(","))
        }
    }
}

/// Expand sweep strings without full parsing.
///
/// For simple sweeps like "db=mysql,postgresql", expands directly from strings.
/// This is faster for simple cases.
pub fn expand_simple_sweeps(overrides: &[&str]) -> Vec<Vec<String>> {
    let mut dimensions: Vec<Vec<String>> = Vec::new();

    for ovr in overrides {
        if let Some(eq_pos) = ovr.find('=') {
            let key = &ovr[..eq_pos];
            let value = &ovr[eq_pos + 1..];

            // Check for range sweep FIRST (since it contains commas)
            if value.starts_with("range(") && value.ends_with(')') {
                // Range sweep: a=range(1,10)
                let inner = &value[6..value.len() - 1];
                let parts: Vec<&str> = inner.split(',').map(|s| s.trim()).collect();

                let start: i64 = parts.first().and_then(|s| s.parse().ok()).unwrap_or(0);
                let stop: i64 = parts.get(1).and_then(|s| s.parse().ok()).unwrap_or(10);
                let step: i64 = parts.get(2).and_then(|s| s.parse().ok()).unwrap_or(1);

                let choices: Vec<String> = (start..stop)
                    .step_by(step.max(1) as usize)
                    .map(|v| format!("{}={}", key, v))
                    .collect();
                dimensions.push(choices);
            } else if value.contains(',') && !value.starts_with('[') && !value.starts_with('{') {
                // Simple choice sweep: a=1,2,3
                let choices: Vec<String> = value
                    .split(',')
                    .map(|v| format!("{}={}", key, v.trim()))
                    .collect();
                dimensions.push(choices);
            } else {
                // Non-sweep value
                dimensions.push(vec![ovr.to_string()]);
            }
        } else {
            // Not a key=value override (maybe a delete or flag)
            dimensions.push(vec![ovr.to_string()]);
        }
    }

    cartesian_product(&dimensions)
}

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

    #[test]
    fn test_simple_sweep_expansion() {
        let overrides = vec!["db=mysql,postgres", "server=dev,prod"];
        let result = expand_simple_sweeps(&overrides);

        assert_eq!(result.len(), 4);
        assert!(result.contains(&vec!["db=mysql".to_string(), "server=dev".to_string()]));
        assert!(result.contains(&vec!["db=mysql".to_string(), "server=prod".to_string()]));
        assert!(result.contains(&vec!["db=postgres".to_string(), "server=dev".to_string()]));
        assert!(result.contains(&vec!["db=postgres".to_string(), "server=prod".to_string()]));
    }

    #[test]
    fn test_range_sweep_expansion() {
        let overrides = vec!["x=range(1,4)"];
        let result = expand_simple_sweeps(&overrides);

        assert_eq!(result.len(), 3);
        assert_eq!(result[0], vec!["x=1".to_string()]);
        assert_eq!(result[1], vec!["x=2".to_string()]);
        assert_eq!(result[2], vec!["x=3".to_string()]);
    }

    #[test]
    fn test_mixed_sweep_and_static() {
        let overrides = vec!["db=mysql,postgres", "port=3306"];
        let result = expand_simple_sweeps(&overrides);

        assert_eq!(result.len(), 2);
        assert!(result.contains(&vec!["db=mysql".to_string(), "port=3306".to_string()]));
        assert!(result.contains(&vec!["db=postgres".to_string(), "port=3306".to_string()]));
    }

    #[test]
    fn test_single_override() {
        let overrides = vec!["db=mysql"];
        let result = expand_simple_sweeps(&overrides);

        assert_eq!(result.len(), 1);
        assert_eq!(result[0], vec!["db=mysql".to_string()]);
    }

    #[test]
    fn test_empty_overrides() {
        let overrides: Vec<&str> = vec![];
        let result = expand_simple_sweeps(&overrides);

        assert_eq!(result.len(), 1);
        assert_eq!(result[0], Vec::<String>::new());
    }

    #[test]
    fn test_large_sweep() {
        let overrides = vec!["a=1,2,3", "b=4,5,6", "c=7,8,9"];
        let result = expand_simple_sweeps(&overrides);

        // 3 * 3 * 3 = 27 combinations
        assert_eq!(result.len(), 27);
    }

    #[test]
    fn test_cartesian_product() {
        let dims = vec![
            vec!["a".to_string(), "b".to_string()],
            vec!["1".to_string(), "2".to_string()],
        ];
        let result = cartesian_product(&dims);

        assert_eq!(result.len(), 4);
        assert!(result.contains(&vec!["a".to_string(), "1".to_string()]));
        assert!(result.contains(&vec!["a".to_string(), "2".to_string()]));
        assert!(result.contains(&vec!["b".to_string(), "1".to_string()]));
        assert!(result.contains(&vec!["b".to_string(), "2".to_string()]));
    }
}