arael 0.1.0

Nonlinear optimization framework with compile-time symbolic differentiation
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
// Sparse vs Dense solver benchmark using SLAM model.
//
// SLAM has landmarks creating off-diagonal fill in the hessian -- truly sparse,
// not block-tridiagonal. This benchmarks dense Cholesky vs sparse solvers.
//
// Run:
//   cargo run -r --features faer --example bench_sparse
//   OMP_NUM_THREADS=1 OPENBLAS_NUM_THREADS=1 cargo run -r --features faer --example bench_sparse

use arael::model::{Model, Param, SelfBlock, CrossBlock, SimpleEulerAngleParam};
use arael::vect::{vect3f, vect2f};
use arael::matrix::matrix3f;
use arael::refs::{self, Ref};
use arael::geometry::Camera;

use rand::prelude::*;
use rand::rngs::StdRng;
use rand_distr::Normal;

// ---------------------------------------------------------------------------
// Model structs (same as slam_demo)
// ---------------------------------------------------------------------------

#[arael::model]
#[allow(dead_code)]
struct PointFeature {
    pixel: vect2f,
    mf2r: matrix3f,
    #[arael(skip)]
    camera: Ref<Camera>,
    camera_pos: vect3f,
    isigma: vect2f,
}

#[arael::model]
struct GpsData {
    pos: vect3f,
    cov_r: matrix3f,
    cov_isigma: vect3f,
}

#[arael::model]
struct PoseInfo {
    delta_pos: vect3f,
    delta_ea: vect3f,
    delta_pos_cov_r: matrix3f,
    delta_pos_cov_isigma: vect3f,
    delta_ea_cov_r: matrix3f,
    delta_ea_cov_isigma: vect3f,
    gps: Option<GpsData>,
    tilt_roll: f32,
    tilt_pitch: f32,
    features: refs::Vec<PointFeature>,
}

fn decompose_cov(cov: matrix3f) -> (matrix3f, vect3f) {
    let (r, d) = cov.symmetric_eigen();
    let isigma = vect3f::new(1.0 / d.x.sqrt(), 1.0 / d.y.sqrt(), 1.0 / d.z.sqrt());
    (r, isigma)
}

#[arael::model]
#[arael(constraint(hb_pose, guard = self.info.gps.is_some(), {
    let gamma = path.gamma;
    let raw = pose.pos - pose.info.gps.pos;
    let rt_raw = pose.info.gps.cov_r.transpose() * raw;
    let p0 = rt_raw.x * pose.info.gps.cov_isigma.x;
    let p1 = rt_raw.y * pose.info.gps.cov_isigma.y;
    let p2 = rt_raw.z * pose.info.gps.cov_isigma.z;
    [gamma * atan(p0 / gamma), gamma * atan(p1 / gamma), gamma * atan(p2 / gamma)]
}))]
#[arael(constraint(hb_pose, {
    let pos_drift = pose.pos - pose.pos_value;
    let ea_drift = pose.ea - pose.ea_value;
    [pos_drift.x * path.drift_pos_isigma, pos_drift.y * path.drift_pos_isigma, pos_drift.z * path.drift_pos_isigma,
     ea_drift.x * path.drift_ea_isigma, ea_drift.y * path.drift_ea_isigma, ea_drift.z * path.drift_ea_isigma]
}))]
#[arael(constraint(hb_pose, {
    [(pose.ea.x - pose.info.tilt_roll) * path.tilt_isigma,
     (pose.ea.y - pose.info.tilt_pitch) * path.tilt_isigma]
}))]
struct Pose {
    pos: Param<vect3f>,
    ea: SimpleEulerAngleParam<f32>,
    info: PoseInfo,
    hb_pose: SelfBlock<Pose>,
}

#[arael::model]
#[arael(constraint(hb_drift, {
    let drift = pointlandmark.pos - pointlandmark.pos_value;
    [drift.x * path.drift_lm_isigma, drift.y * path.drift_lm_isigma, drift.z * path.drift_lm_isigma]
}))]
struct PointLandmark {
    pos: Param<vect3f>,
    frines: std::vec::Vec<PointFrine>,
    hb_drift: SelfBlock<PointLandmark>,
}

#[arael::model]
#[arael(constraint(hb, parent=lm, {
    let gamma = path.gamma;
    let mr2w = pose.ea.rotation_matrix();
    let lm_r = mr2w.transpose() * (lm.pos - pose.pos);
    let r_r = lm_r - feature.camera_pos;
    let r_f = feature.mf2r.transpose() * r_r;
    let plain1 = atan2(r_f.y, r_f.x) * feature.isigma.x;
    let plain2 = atan2(r_f.z, r_f.x) * feature.isigma.y;
    [gamma * atan(plain1 / gamma), gamma * atan(plain2 / gamma)]
}))]
struct PointFrine {
    #[arael(ref = root.poses)]
    pose: Ref<Pose>,
    #[arael(ref = pose.info.features)]
    feature: Ref<PointFeature>,
    hb: CrossBlock<PointLandmark, Pose>,
}

#[arael::model]
#[arael(constraint(hb, {
    let mr2w_prev = prev.ea.rotation_matrix();
    let pos_diff = mr2w_prev.transpose() * (cur.pos - prev.pos);
    let pos_err = pos_diff - cur.info.delta_pos;
    let pos_w = cur.info.delta_pos_cov_r.transpose() * pos_err;
    let mr2w_cur = cur.ea.rotation_matrix();
    let expected = mr2w_prev * cur.info.delta_ea.rotation_matrix();
    let error_rot = expected.transpose() * mr2w_cur;
    let ea_err = error_rot.get_euler_angles();
    let ea_w = cur.info.delta_ea_cov_r.transpose() * ea_err;
    [pos_w.x * cur.info.delta_pos_cov_isigma.x, pos_w.y * cur.info.delta_pos_cov_isigma.y, pos_w.z * cur.info.delta_pos_cov_isigma.z,
     ea_w.x * cur.info.delta_ea_cov_isigma.x, ea_w.y * cur.info.delta_ea_cov_isigma.y, ea_w.z * cur.info.delta_ea_cov_isigma.z]
}))]
struct PosePair {
    #[arael(ref = root.poses)]
    prev: Ref<Pose>,
    #[arael(ref = root.poses)]
    cur: Ref<Pose>,
    hb: CrossBlock<Pose, Pose>,
}

#[arael::model]
#[arael(root)]
struct Path {
    poses: refs::Deque<Pose>,
    landmarks: refs::Vec<PointLandmark>,
    pose_pairs: std::vec::Vec<PosePair>,
    gamma: f32,
    drift_pos_isigma: f32,
    drift_ea_isigma: f32,
    drift_lm_isigma: f32,
    tilt_isigma: f32,
}

// ---------------------------------------------------------------------------
// Scene generation (from slam_demo)
// ---------------------------------------------------------------------------

struct SceneConfig {
    num_poses: usize,
    num_landmarks: usize,
    seed: u64,
    outlier_fraction: f32,
    outlier_scale: f32,
    s_amplitude: f32,
    s_frequency: f32,
    step_size: f32,
    gps_sigma: f32,
    gps_rel_noise: f32,
    odo_pos_k: f32,
    odo_pos_base: f32,
    odo_ea_k: f32,
    odo_ea_base: f32,
    lm_visibility_range: usize,
    lm_visibility_prob: f32,
}

impl Default for SceneConfig {
    fn default() -> Self {
        SceneConfig {
            num_poses: 20, num_landmarks: 40, seed: 42,
            outlier_fraction: 0.5, outlier_scale: 30.0,
            s_amplitude: 1.5, s_frequency: 0.8, step_size: 0.25,
            gps_sigma: 2.5, gps_rel_noise: 0.02,
            odo_pos_k: 0.10, odo_pos_base: 0.03, odo_ea_k: 0.01, odo_ea_base: 0.001,
            lm_visibility_range: 15, lm_visibility_prob: 0.75,
        }
    }
}

fn create_cameras() -> refs::Vec<Camera> {
    let mut cameras = refs::Vec::new();
    let w = 1024u32; let h = 768u32;
    let fov_deg = 80.0_f32;
    let fx = (w as f32 / 2.0) / (fov_deg / 2.0).to_radians().tan();
    let fy = fx;
    let n = 5;
    for i in 0..n {
        let yaw = (i as f32) * (360.0_f32 / n as f32).to_radians();
        let (sy, cy) = yaw.sin_cos();
        let mc2r = matrix3f::from_cols(
            vect3f::new(-sy, cy, 0.0),
            vect3f::new(0.0, 0.0, -1.0),
            vect3f::new(cy, sy, 0.0),
        );
        cameras.push(Camera {
            fx, fy, cx: w as f32 / 2.0, cy: h as f32 / 2.0,
            width: w, height: h,
            camera_pos: vect3f::new(cy * 0.1, sy * 0.1, 0.3),
            mc2r,
        });
    }
    cameras
}

fn build_path(cfg: &SceneConfig) -> Path {
    let mut rng = StdRng::seed_from_u64(cfg.seed);
    let normal01 = Normal::new(0.0, 1.0).unwrap();
    let cameras = create_cameras();

    let gps_offset = vect3f::new(
        cfg.gps_sigma * rng.sample(normal01) as f32,
        cfg.gps_sigma * rng.sample(normal01) as f32,
        cfg.gps_sigma * rng.sample(normal01) as f32);

    let mut gt_poses = Vec::new();
    let mut t = 0.0_f32;
    for _ in 0..cfg.num_poses {
        let x = t;
        let y = cfg.s_amplitude * (cfg.s_frequency * t).sin();
        let dy = cfg.s_amplitude * cfg.s_frequency * (cfg.s_frequency * t).cos();
        gt_poses.push((vect3f::new(x, y, 0.0), vect3f::new(0.0, 0.0, dy.atan2(1.0))));
        t += cfg.step_size;
    }

    let mut gt_landmarks: Vec<(vect3f, usize)> = Vec::new();
    for _ in 0..cfg.num_landmarks {
        loop {
            let anchor_idx = rng.random_range(0..gt_poses.len());
            let anchor = &gt_poses[anchor_idx].0;
            let angle = rng.random::<f32>() * 2.0 * std::f32::consts::PI;
            let dist = 5.0 + rng.random::<f32>() * 25.0;
            let lm = vect3f::new(anchor.x + dist * angle.cos(), anchor.y + dist * angle.sin(), rng.random::<f32>() * 2.0);
            let min_dist = gt_poses.iter().map(|(p, _)| (lm - *p).norm()).fold(f32::MAX, f32::min);
            if min_dist >= 5.0 && min_dist <= 30.0 { gt_landmarks.push((lm, anchor_idx)); break; }
        }
    }

    let mut path = Path {
        poses: refs::Deque::new(), landmarks: refs::Vec::new(),
        pose_pairs: Vec::new(),
        gamma: 2.0 * (25.0_f32).sqrt() / std::f32::consts::PI,
        drift_pos_isigma: 1.0 / 1000.0,
        drift_ea_isigma: 1.0 / 1800.0_f32.to_radians(),
        drift_lm_isigma: 1.0 / 1000.0,
        tilt_isigma: 1.0 / 0.25_f32.to_radians(),
    };

    let mut frine_data: Vec<(usize, Ref<Pose>, Ref<PointFeature>)> = Vec::new();

    for (pi, &(pos, ea)) in gt_poses.iter().enumerate() {
        let mr2w = matrix3f::rotation_from_euler_angles(ea);
        let (delta_pos, delta_ea) = if pi == 0 {
            (vect3f::default(), vect3f::default())
        } else {
            let (pp, pe) = gt_poses[pi - 1];
            let pmr = matrix3f::rotation_from_euler_angles(pe).transpose();
            (pmr * (pos - pp), (pmr * mr2w).get_euler_angles())
        };
        let dp_norm = delta_pos.norm().max(0.01);
        let de_norm = delta_ea.norm().max(0.001);
        let pos_sigma = vect3f::new(cfg.odo_pos_k * dp_norm + cfg.odo_pos_base, (cfg.odo_pos_k * dp_norm + cfg.odo_pos_base) * 0.5, (cfg.odo_pos_k * dp_norm + cfg.odo_pos_base) * 0.5);
        let ea_sigma = vect3f::new(cfg.odo_ea_k * de_norm + cfg.odo_ea_base, cfg.odo_ea_k * de_norm + cfg.odo_ea_base, cfg.odo_ea_k * de_norm + cfg.odo_ea_base);
        let dpc = matrix3f::from_elements(pos_sigma.x.powi(2),0.0,0.0, 0.0,pos_sigma.y.powi(2),0.0, 0.0,0.0,pos_sigma.z.powi(2));
        let dec = matrix3f::from_elements(ea_sigma.x.powi(2),0.0,0.0, 0.0,ea_sigma.y.powi(2),0.0, 0.0,0.0,ea_sigma.z.powi(2));

        let mut features: refs::Vec<PointFeature> = refs::Vec::new();
        for (li, &(lm_pos, anchor_idx)) in gt_landmarks.iter().enumerate() {
            let dist_to_anchor = if pi >= anchor_idx { pi - anchor_idx } else { anchor_idx - pi };
            if dist_to_anchor > cfg.lm_visibility_range { continue; }
            if rng.random::<f32>() > cfg.lm_visibility_prob { continue; }
            for cam_ref in cameras.refs() {
                let cam = &cameras[cam_ref];
                let p_cam = cam.world_to_camera(lm_pos, pos, mr2w);
                if p_cam.z < 0.5 { continue; }
                let pixel = cam.project(p_cam);
                if !cam.is_visible(pixel) { continue; }
                let is_outlier = rng.random::<f32>() < cfg.outlier_fraction;
                let ns = if is_outlier { cfg.outlier_scale } else { 1.0 };
                let np = vect2f::new(pixel.x + ns * (rng.random::<f32>()*2.0-1.0), pixel.y + ns * (rng.random::<f32>()*2.0-1.0));
                let dir = cam.unproject_to_robot(np);
                let cam_up = -(cam.mc2r.col(1));
                let up_proj = cam_up - dir * (cam_up * dir);
                let un = up_proj.norm();
                if un < 1e-6 { continue; }
                let col2 = up_proj * (1.0/un);
                let col1 = col2 % dir;
                let mf2r = matrix3f::from_cols(dir, col1, col2);
                let sigma = cam.pixel_angular_size(np);
                let isigma = vect2f::new(1.0/sigma.x, 1.0/sigma.y);
                let fr = features.push(PointFeature { pixel: np, mf2r, camera: cam_ref, camera_pos: cam.camera_pos, isigma });
                frine_data.push((li, Ref::new(path.poses.len() as u32), fr));
            }
        }

        let rel_noise = cfg.gps_rel_noise * (pos - gt_poses[0].0).norm();
        let gps_pos = vect3f::new(
            pos.x + gps_offset.x + rel_noise * rng.sample(normal01) as f32,
            pos.y + gps_offset.y + rel_noise * rng.sample(normal01) as f32,
            pos.z + gps_offset.z + rel_noise * rng.sample(normal01) as f32);
        let gps_cov = matrix3f::from_elements(cfg.gps_sigma.powi(2),0.0,0.0, 0.0,cfg.gps_sigma.powi(2),0.0, 0.0,0.0,cfg.gps_sigma.powi(2));
        let np = vect3f::new(pos.x+0.1*rng.sample(normal01) as f32, pos.y+0.1*rng.sample(normal01) as f32, pos.z+0.1*rng.sample(normal01) as f32);
        let ne = vect3f::new(ea.x+0.02*rng.sample(normal01) as f32, ea.y+0.02*rng.sample(normal01) as f32, ea.z+0.02*rng.sample(normal01) as f32);
        let (dpcr, dpci) = decompose_cov(dpc);
        let (decr, deci) = decompose_cov(dec);
        let (gcr, gci) = decompose_cov(gps_cov);

        path.poses.push_back(Pose {
            pos: Param::new(np), ea: SimpleEulerAngleParam::new(ne),
            info: PoseInfo {
                delta_pos, delta_ea, delta_pos_cov_r: dpcr, delta_pos_cov_isigma: dpci,
                delta_ea_cov_r: decr, delta_ea_cov_isigma: deci,
                gps: Some(GpsData { pos: gps_pos, cov_r: gcr, cov_isigma: gci }),
                tilt_roll: ea.x + 0.25_f32.to_radians() * rng.sample(normal01) as f32,
                tilt_pitch: ea.y + 0.25_f32.to_radians() * rng.sample(normal01) as f32,
                features,
            },
            hb_pose: SelfBlock::new(),
        });
    }

    for (li, &(lm_pos, _)) in gt_landmarks.iter().enumerate() {
        let noisy_lm = vect3f::new(lm_pos.x + 0.5*rng.sample(normal01) as f32, lm_pos.y + 0.5*rng.sample(normal01) as f32, lm_pos.z + 0.3*rng.sample(normal01) as f32);
        let frines: Vec<PointFrine> = frine_data.iter()
            .filter(|(lmi,_,_)| *lmi == li)
            .map(|(_,pose,feature)| PointFrine { pose: *pose, feature: *feature, hb: CrossBlock::new() })
            .collect();
        if frines.is_empty() { continue; }
        path.landmarks.push(PointLandmark { pos: Param::new(noisy_lm), frines, hb_drift: SelfBlock::new() });
    }

    let pose_refs: Vec<Ref<Pose>> = path.poses.refs().collect();
    for i in 1..pose_refs.len() {
        path.pose_pairs.push(PosePair { prev: pose_refs[i-1], cur: pose_refs[i], hb: CrossBlock::new() });
    }

    path
}

// ---------------------------------------------------------------------------
// Benchmark
// ---------------------------------------------------------------------------

fn main() {
    // Disable OMP threading for consistent benchmarks
    unsafe {
        std::env::set_var("OMP_NUM_THREADS", "1");
        std::env::set_var("OPENBLAS_NUM_THREADS", "1");
    }

    use arael::simple_lm::LmSolver;
    use arael::simple_lm::LmProblem;

    println!("Sparse solver step-level benchmark (SLAM model, f64)");
    println!("Measures individual solver steps, not full LM solve.");
    println!("OMP_NUM_THREADS=1, OPENBLAS_NUM_THREADS=1\n");

    for &(num_poses, num_landmarks) in &[(20, 40), (50, 100), (100, 200), (200, 400)] {
        let cfg = SceneConfig { num_poses, num_landmarks, ..Default::default() };
        let mut path = build_path(&cfg);
        let mut params: Vec<f64> = Vec::new();
        path.serialize64(&mut params);
        let n = params.len();

        // Compute sparsity info
        {
            let mut coo = arael::simple_lm::CooMatrix::new(n);
            let mut grad = vec![0.0f64; n];
            path.calc_grad_hessian_sparse(&params, &mut grad, &mut coo);
            let csc = coo.to_csc();
            let nnz = csc.nnz();
            let dense_upper = n * (n + 1) / 2;
            let fill_pct = nnz as f64 / dense_upper as f64 * 100.0;
            println!("--- {} poses, {} params, {} landmarks, nnz={}, fill={:.1}% ---",
                num_poses, n, num_landmarks, nnz, fill_pct);
        }

        let runs = if num_poses <= 50 { 50 } else { 20 };

        // Benchmark a single solver's steps
        fn bench_solver<S: LmSolver<f64>>(
            name: &str,
            solver: &mut S,
            problem: &mut dyn LmProblem<f64>,
            x0: &[f64],
            runs: usize,
        ) {
            let n = x0.len();
            let mut matrix = solver.new_matrix(n);
            let mut grad = vec![0.0f64; n];
            let mut diagonal = vec![0.0f64; n];
            let mut delta = vec![0.0f64; n];

            // Warmup: one full compute+solve to initialize symbolic factorization
            solver.compute(problem, x0, &mut grad, &mut matrix);
            solver.extract_diagonal(&matrix, &mut diagonal);
            
            solver.solve_damped(n, &mut matrix, &diagonal, 0.001, &grad, &mut delta);

            // Measure: assembly (compute)
            let mut assembly_us = Vec::new();
            for _ in 0..runs {
                let t0 = std::time::Instant::now();
                solver.compute(problem, x0, &mut grad, &mut matrix);
                assembly_us.push(t0.elapsed().as_nanos() as f64 / 1000.0);
            }

            solver.extract_diagonal(&matrix, &mut diagonal);

            // Measure: prepare_solve + solve_system (= numeric factorize + triangular solve)
            // This simulates a lambda-increase step (same hessian, different damping)
            let mut solve_us = Vec::new();
            for _ in 0..runs {
                let t0 = std::time::Instant::now();
                
                solver.solve_damped(n, &mut matrix, &diagonal, 0.001, &grad, &mut delta);
                solve_us.push(t0.elapsed().as_nanos() as f64 / 1000.0);
            }

            assembly_us.sort_by(|a, b| a.partial_cmp(b).unwrap());
            solve_us.sort_by(|a, b| a.partial_cmp(b).unwrap());
            let asm_med = assembly_us[assembly_us.len() / 2];
            let slv_med = solve_us[solve_us.len() / 2];

            println!("  {:>12}  asm={:>8.0}us  solve={:>8.0}us  total={:>8.0}us",
                name, asm_med, slv_med, asm_med + slv_med);
        }

        // Dense
        {
            let mut path = build_path(&cfg);
            let mut params: Vec<f64> = Vec::new();
            path.serialize64(&mut params);
            bench_solver("dense", &mut arael::simple_lm::Dense, &mut path, &params, runs);
        }

        // faer
        {
            let mut path = build_path(&cfg);
            let mut params: Vec<f64> = Vec::new();
            path.serialize64(&mut params);
            bench_solver("faer", &mut arael::simple_lm::SparseFaer::new(), &mut path, &params, runs);
        }

        // schur
        {
            let mut path = build_path(&cfg);
            let mut params: Vec<f64> = Vec::new();
            path.serialize64(&mut params);
            let np = cfg.num_poses * 6;
            bench_solver("schur", &mut arael::simple_lm::SparseSchur::new(np), &mut path, &params, runs);
        }

        // Eigen SimplicialLLT
        #[cfg(feature = "eigen")]
        {
            let mut path = build_path(&cfg);
            let mut params: Vec<f64> = Vec::new();
            path.serialize64(&mut params);
            bench_solver("eigen", &mut arael::simple_lm::SparseEigen::new(), &mut path, &params, runs);
        }

        // CHOLMOD
        #[cfg(feature = "cholmod")]
        {
            let mut path = build_path(&cfg);
            let mut params: Vec<f64> = Vec::new();
            path.serialize64(&mut params);
            bench_solver("cholmod", &mut arael::simple_lm::SparseCholmod::new(), &mut path, &params, runs);
        }

        println!();
    }
}