knot 1.8.1

Codebase Graph + Vector RAG Indexer for Java, TypeScript, JavaScript, Kotlin, Rust, Python, Groovy, C/C++, C#, Build Systems, and HTML/CSS codebases
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
use anyhow::{Context, Result};
use neo4rs::query;
use std::collections::HashMap;

use super::GraphDb;
use super::query::{RootCandidate, rank_root_candidates, target_resolution_tiers};
use crate::models::{
    RootCandidateLite, RootResolution, SubgraphDirection, SubgraphEdge, SubgraphNode,
    SubgraphQueryOptions, SubgraphResult,
};

/// Maximum number of candidates surfaced in the `root_resolution.candidates`
/// disclosure payload. Keeps the JSON response bounded — the ranking total
/// is reported separately via `total_candidates`.
const ROOT_RESOLUTION_CANDIDATES_CAP: usize = 10;

/// Extension trait for subgraph traversal operations.
#[expect(
    async_fn_in_trait,
    reason = "async trait method is required for the db interfaces"
)]
pub trait SubgraphQueryExt {
    async fn get_entity_subgraph(
        &self,
        options: SubgraphQueryOptions<'_>,
    ) -> Result<SubgraphResult>;
}

impl SubgraphQueryExt for GraphDb {
    #[expect(clippy::too_many_lines, reason = "Query generation logic is complex")]
    #[expect(
        clippy::cognitive_complexity,
        reason = "Query generation logic is complex"
    )]
    async fn get_entity_subgraph(
        &self,
        options: SubgraphQueryOptions<'_>,
    ) -> Result<SubgraphResult> {
        let valid_rels: &[&str] = &[
            "CALLS",
            "EXTENDS",
            "IMPLEMENTS",
            "REFERENCES",
            "REFERENCES_DOM",
            "USES_CSS_CLASS",
            "IMPORTS_SCRIPT",
            "IMPORTS_STYLESHEET",
            "MACRO_CALLS",
            "CONTAINS",
            "GENERIC_BOUND",
            "DEPENDS_ON",
            "OVERRIDES",
        ];

        for rel in options.relationships {
            if !valid_rels.contains(rel) {
                anyhow::bail!(
                    "Invalid relationship type '{rel}'. Valid types are: {}",
                    valid_rels.join(", ")
                );
            }
        }

        let depth = options.depth.clamp(1, 5);

        // --- 1. Find the root entity ---
        //
        // Two paths:
        // - `entity_uuid` set → deterministic UUID lookup (no ladder).
        // - `entity_name` only → walk the resolution ladder
        //   (`target_resolution_tiers`), apply `rank_root_candidates` to the
        //   winning tier, anchor the traversal on the chosen UUID. Disclosure
        //   (`root_resolution`) is filled when the name path resolves.
        let mut root_node: Option<SubgraphNode> = None;
        let mut root_resolution: Option<RootResolution> = None;

        if let Some(uuid) = options.entity_uuid {
            let mut rows = self
                .graph
                .execute(
                    query(
                        "MATCH (root:Entity {uuid: $uuid, repo_name: $repo_name})
                         RETURN root.uuid, root.name, root.kind, root.fqn,
                                root.signature, root.docstring, root.file_path, root.start_line
                         LIMIT 1",
                    )
                    .param("uuid", uuid)
                    .param("repo_name", options.repo_name),
                )
                .await
                .context("Failed to query root entity by uuid")?;
            if let Ok(Some(row)) = rows.next().await {
                root_node = Some(SubgraphNode {
                    uuid: row
                        .get::<String>("root.uuid")
                        .context("root.uuid is required")?,
                    name: row
                        .get::<String>("root.name")
                        .context("root.name is required")?,
                    kind: row.get::<String>("root.kind").ok(),
                    fqn: row.get::<String>("root.fqn").ok(),
                    signature: row.get::<String>("root.signature").ok(),
                    docstring: row.get::<String>("root.docstring").ok(),
                    file_path: row.get::<String>("root.file_path").ok(),
                    start_line: row.get::<i64>("root.start_line").ok(),
                });
            }
        } else {
            // Name resolution: walk the ladder, rank, build disclosure.
            match self
                .resolve_subgraph_root(options.entity_name, options.repo_name)
                .await
                .context("Failed to resolve subgraph root by name")?
            {
                Some((winner, tier, total_candidates)) => {
                    // Re-query all candidates in the winning tier so the
                    // disclosure can carry them (ranked). Use the same tier
                    // predicates via `target_resolution_tiers` to find the
                    // matching tier string.
                    let (_, predicate) = target_resolution_tiers(options.entity_name)
                        .into_iter()
                        .find(|(t, _)| *t == tier)
                        .unwrap_or((tier, "target.name = $name"));
                    let disclosure_query = format!(
                        "MATCH (target:Entity)
                         WHERE target.repo_name = $repo_name AND ({predicate})
                         RETURN target.uuid, target.name, target.fqn, target.kind,
                                target.signature, target.docstring, target.file_path, target.start_line
                         ORDER BY target.fqn
                         LIMIT 25"
                    );
                    let mut rows = self
                        .graph
                        .execute(
                            query(&disclosure_query)
                                .param("name", options.entity_name)
                                .param("repo_name", options.repo_name),
                        )
                        .await
                        .context("Failed to query candidates for disclosure")?;
                    let mut candidates = Vec::new();
                    while let Ok(Some(row)) = rows.next().await {
                        let uuid = row.get::<String>("target.uuid").unwrap_or_default();
                        let nm = row.get::<String>("target.name").unwrap_or_default();
                        let fqn = row.get::<String>("target.fqn").ok();
                        let kind = row.get::<String>("target.kind").ok();
                        let signature = row.get::<String>("target.signature").ok();
                        let docstring = row.get::<String>("target.docstring").ok();
                        let file_path = row.get::<String>("target.file_path").ok();
                        let start_line = row.get::<i64>("target.start_line").ok();
                        candidates.push(RootCandidate {
                            uuid,
                            name: nm,
                            fqn,
                            kind,
                            signature,
                            docstring,
                            file_path,
                            start_line,
                        });
                    }
                    let ranked = rank_root_candidates(candidates);
                    let disclosure_candidates: Vec<RootCandidateLite> = ranked
                        .iter()
                        .take(ROOT_RESOLUTION_CANDIDATES_CAP)
                        .cloned()
                        .map(RootCandidateLite::from)
                        .collect();
                    root_node = Some(SubgraphNode {
                        uuid: winner.uuid.clone(),
                        name: winner.name.clone(),
                        kind: winner.kind.clone(),
                        fqn: winner.fqn.clone(),
                        signature: winner.signature.clone(),
                        docstring: winner.docstring.clone(),
                        file_path: winner.file_path.clone(),
                        start_line: winner.start_line,
                    });
                    root_resolution = Some(RootResolution {
                        query: options.entity_name.to_string(),
                        tier,
                        total_candidates,
                        chosen: RootCandidateLite::from(winner),
                        candidates: disclosure_candidates,
                    });
                }
                None => {
                    // Root not found — return empty result
                    return Ok(SubgraphResult {
                        root_id: None,
                        nodes: vec![],
                        edges: vec![],
                        truncated: false,
                        total_nodes_found: 0,
                        root_resolution: None,
                    });
                }
            }
        }

        let root_node = match root_node {
            Some(n) => n,
            None => {
                // entity_uuid branch yielded no row.
                return Ok(SubgraphResult {
                    root_id: None,
                    nodes: vec![],
                    edges: vec![],
                    truncated: false,
                    total_nodes_found: 0,
                    root_resolution: None,
                });
            }
        };

        let root_uuid = root_node.uuid.clone();

        // --- 2. Collect nearby nodes ---
        //
        // Traversal is anchored on the resolved UUID only — never on the bare
        // name. This fixes the homonym-union defect (the prior implementation
        // re-bound every homonym by name, returning the union of their
        // neighbourhoods under a single `root_id`).
        let mut all_nodes: HashMap<String, SubgraphNode> = HashMap::new();
        all_nodes.insert(root_uuid.clone(), root_node);

        let mut traversal_rels = options.relationships.to_vec();
        if let Some(kinds) = options.visible_kinds
            && !kinds.is_empty()
            && !traversal_rels.contains(&"CONTAINS")
        {
            traversal_rels.push("CONTAINS");
        }
        let traversal_rel_filter = traversal_rels.join("|");

        let direction_arrow = match options.direction {
            SubgraphDirection::Outgoing => format!("-[:{traversal_rel_filter}*1..{depth}]->"),
            SubgraphDirection::Incoming => format!("<-[:{traversal_rel_filter}*1..{depth}]-"),
            SubgraphDirection::Both => format!("-[:{traversal_rel_filter}*1..{depth}]-"),
        };

        let kind_filter = if let Some(kinds) = options.visible_kinds {
            if !kinds.is_empty() {
                let quoted: Vec<String> = kinds.iter().map(|k| format!("'{}'", k)).collect();
                format!("\n   AND related.kind IN [{}]", quoted.join(", "))
            } else {
                String::new()
            }
        } else {
            String::new()
        };

        let cypher = format!(
            "MATCH (root:Entity {{uuid: $root_uuid, repo_name: $repo_name}}){arrow}(related:Entity)
             WHERE related.repo_name = $repo_name{kind_filter}
             RETURN DISTINCT related.uuid, related.name, related.kind, related.fqn,
                    related.signature, related.docstring, related.file_path, related.start_line",
            arrow = direction_arrow,
            kind_filter = kind_filter,
        );

        let traversal_q = query(&cypher)
            .param("root_uuid", root_uuid.clone())
            .param("repo_name", options.repo_name);
        let mut rows = self
            .graph
            .execute(traversal_q)
            .await
            .context("Failed to traverse relationships")?;

        while let Ok(Some(row)) = rows.next().await {
            let uuid = match row.get::<String>("related.uuid") {
                Ok(u) => u,
                Err(_) => continue,
            };
            all_nodes.entry(uuid.clone()).or_insert(SubgraphNode {
                uuid,
                name: row.get::<String>("related.name").ok().unwrap_or_default(),
                kind: row.get::<String>("related.kind").ok(),
                fqn: row.get::<String>("related.fqn").ok(),
                signature: row.get::<String>("related.signature").ok(),
                docstring: row.get::<String>("related.docstring").ok(),
                file_path: row.get::<String>("related.file_path").ok(),
                start_line: row.get::<i64>("related.start_line").ok(),
            });
        }

        let total_nodes_found = all_nodes.len();
        let truncated = total_nodes_found > options.max_nodes;

        let mut nodes: Vec<SubgraphNode> = all_nodes.into_values().collect();
        // Deterministic truncation: sort by uuid before truncating so the
        // retained subset is stable across calls.
        nodes.sort_by(|a, b| a.uuid.cmp(&b.uuid));
        if truncated && nodes.len() > options.max_nodes {
            nodes.truncate(options.max_nodes);
        }

        // --- 3. Extract edges between collected nodes ---
        let mut edges: Vec<SubgraphEdge> = Vec::new();

        if nodes.len() > 1 {
            let uuids_list: Vec<String> = nodes.iter().map(|n| format!("'{}'", n.uuid)).collect();
            let uuids_str = uuids_list.join(", ");

            let edge_q = if let Some(kinds) = options.visible_kinds {
                if !kinds.is_empty() {
                    let visible_list: Vec<String> =
                        kinds.iter().map(|k| format!("'{}'", k)).collect();
                    let visible_kind_list = visible_list.join(", ");

                    // Ensure CONTAINS is included in the output filter if we are in kind-aware mode
                    // to maintain structural connectivity (e.g. Inner Classes).
                    let mut edge_rels = options.relationships.to_vec();
                    if !edge_rels.contains(&"CONTAINS") {
                        edge_rels.push("CONTAINS");
                    }
                    let rel_filter = edge_rels.join("|");

                    let edge_cypher = format!(
                        "MATCH (a:Entity)-[r:{rel_filter}]->(b:Entity)
                         WHERE a.uuid IN [{uuids_str}] AND b.uuid IN [{uuids_str}]
                         RETURN DISTINCT a.uuid AS source_uuid, b.uuid AS target_uuid, type(r) AS relationship
                         UNION
                         MATCH (c1:Entity)-[:CONTAINS]->(m1:Entity)-[r:{rel_filter}]->(m2:Entity)<-[:CONTAINS]-(c2:Entity)
                         WHERE c1.uuid IN [{uuids_str}] AND c2.uuid IN [{uuids_str}] AND c1.uuid <> c2.uuid
                           AND NOT m1.kind IN [{visible_kind_list}]
                           AND NOT m2.kind IN [{visible_kind_list}]
                         RETURN DISTINCT c1.uuid AS source_uuid, c2.uuid AS target_uuid, type(r) AS relationship
                         UNION
                         MATCH (c1:Entity)-[:CONTAINS]->(m1:Entity)-[r:{rel_filter}]->(b:Entity)
                         WHERE c1.uuid IN [{uuids_str}] AND b.uuid IN [{uuids_str}] AND c1.uuid <> b.uuid
                           AND NOT m1.kind IN [{visible_kind_list}]
                           AND b.kind IN [{visible_kind_list}]
                         RETURN DISTINCT c1.uuid AS source_uuid, b.uuid AS target_uuid, type(r) AS relationship
                         UNION
                         MATCH (a:Entity)-[r:{rel_filter}]->(m2:Entity)<-[:CONTAINS]-(c2:Entity)
                         WHERE a.uuid IN [{uuids_str}] AND c2.uuid IN [{uuids_str}] AND a.uuid <> c2.uuid
                           AND a.kind IN [{visible_kind_list}]
                           AND NOT m2.kind IN [{visible_kind_list}]
                         RETURN DISTINCT a.uuid AS source_uuid, c2.uuid AS target_uuid, type(r) AS relationship",
                        rel_filter = rel_filter,
                        visible_kind_list = visible_kind_list,
                        uuids_str = uuids_str,
                    );
                    query(&edge_cypher)
                } else {
                    query(&format!(
                        "MATCH (a:Entity)-[r]->(b:Entity)
                         WHERE a.uuid IN [{uuids_str}] AND b.uuid IN [{uuids_str}]
                         RETURN a.uuid AS source_uuid, b.uuid AS target_uuid, type(r) AS relationship",
                        uuids_str = uuids_str,
                    ))
                }
            } else {
                query(&format!(
                    "MATCH (a:Entity)-[r]->(b:Entity)
                     WHERE a.uuid IN [{uuids_str}] AND b.uuid IN [{uuids_str}]
                     RETURN a.uuid AS source_uuid, b.uuid AS target_uuid, type(r) AS relationship",
                    uuids_str = uuids_str,
                ))
            };

            let mut rows = self
                .graph
                .execute(edge_q)
                .await
                .context("Failed to query subgraph edges")?;

            while let Ok(Some(row)) = rows.next().await {
                if let (Ok(source_uuid), Ok(target_uuid), Ok(relationship)) = (
                    row.get::<String>("source_uuid"),
                    row.get::<String>("target_uuid"),
                    row.get::<String>("relationship"),
                ) {
                    edges.push(SubgraphEdge {
                        source_uuid,
                        target_uuid,
                        relationship,
                    });
                }
            }
        }

        Ok(SubgraphResult {
            root_id: Some(root_uuid),
            nodes,
            edges,
            truncated,
            total_nodes_found,
            root_resolution,
        })
    }
}

#[cfg(test)]
mod tests {
    use super::*;
    use crate::db::graph::connection::ConnectExt;

    #[ignore = "requires local Neo4j instance running on bolt://localhost:7687"]
    #[tokio::test]
    async fn test_get_entity_subgraph_not_found() {
        let graph_db = GraphDb::connect("bolt://localhost:7687", "neo4j", "password")
            .await
            .expect("Failed to connect to Neo4j");

        let result = graph_db
            .get_entity_subgraph(SubgraphQueryOptions {
                entity_name: "nonexistent_entity",
                repo_name: "test-repo",
                depth: 3,
                relationships: &["CALLS"],
                direction: SubgraphDirection::Both,
                max_nodes: 500,
                entity_uuid: None,
                visible_kinds: None,
            })
            .await;
        assert!(result.is_ok());
        let sub = result.unwrap();
        assert!(sub.nodes.is_empty());
        assert!(sub.edges.is_empty());
        assert!(!sub.truncated);
        assert_eq!(sub.total_nodes_found, 0);
    }

    #[ignore = "requires local Neo4j instance running on bolt://localhost:7687"]
    #[tokio::test]
    async fn test_get_entity_subgraph_valid_entity() {
        let graph_db = GraphDb::connect("bolt://localhost:7687", "neo4j", "password")
            .await
            .expect("Failed to connect to Neo4j");

        let result = graph_db
            .get_entity_subgraph(SubgraphQueryOptions {
                entity_name: "TestClass",
                repo_name: "test-repo",
                depth: 2,
                relationships: &["CALLS", "EXTENDS"],
                direction: SubgraphDirection::Both,
                max_nodes: 500,
                entity_uuid: None,
                visible_kinds: None,
            })
            .await;
        assert!(result.is_ok());
        let sub = result.unwrap();
        assert!(!sub.truncated);
    }

    #[ignore = "requires local Neo4j instance running on bolt://localhost:7687"]
    #[tokio::test]
    async fn test_get_entity_subgraph_invalid_relationship() {
        let graph_db = GraphDb::connect("bolt://localhost:7687", "neo4j", "password")
            .await
            .expect("Failed to connect to Neo4j");

        let result = graph_db
            .get_entity_subgraph(SubgraphQueryOptions {
                entity_name: "TestClass",
                repo_name: "test-repo",
                depth: 2,
                relationships: &["INVALID_REL"],
                direction: SubgraphDirection::Both,
                max_nodes: 500,
                entity_uuid: None,
                visible_kinds: None,
            })
            .await;
        assert!(result.is_err());
    }

    #[ignore = "requires local Neo4j instance running on bolt://localhost:7687"]
    #[tokio::test]
    async fn test_get_entity_subgraph_outgoing_only() {
        let graph_db = GraphDb::connect("bolt://localhost:7687", "neo4j", "password")
            .await
            .expect("Failed to connect to Neo4j");

        let result = graph_db
            .get_entity_subgraph(SubgraphQueryOptions {
                entity_name: "TestClass",
                repo_name: "test-repo",
                depth: 1,
                relationships: &["CALLS"],
                direction: SubgraphDirection::Outgoing,
                max_nodes: 500,
                entity_uuid: None,
                visible_kinds: None,
            })
            .await;
        assert!(result.is_ok());
    }

    #[ignore = "requires local Neo4j instance running on bolt://localhost:7687"]
    #[tokio::test]
    async fn test_get_entity_subgraph_multiple_relationships() {
        let graph_db = GraphDb::connect("bolt://localhost:7687", "neo4j", "password")
            .await
            .expect("Failed to connect to Neo4j");

        let result = graph_db
            .get_entity_subgraph(SubgraphQueryOptions {
                entity_name: "TestClass",
                repo_name: "test-repo",
                depth: 2,
                relationships: &["CALLS", "EXTENDS", "IMPLEMENTS", "REFERENCES"],
                direction: SubgraphDirection::Both,
                max_nodes: 500,
                entity_uuid: None,
                visible_kinds: None,
            })
            .await;
        assert!(result.is_ok());
        let sub = result.unwrap();
        assert!(!sub.truncated || sub.total_nodes_found > 0);
    }

    #[ignore = "requires local Neo4j instance running on bolt://localhost:7687"]
    #[tokio::test]
    async fn test_get_entity_subgraph_truncation() {
        let graph_db = GraphDb::connect("bolt://localhost:7687", "neo4j", "password")
            .await
            .expect("Failed to connect to Neo4j");

        let result = graph_db
            .get_entity_subgraph(SubgraphQueryOptions {
                entity_name: "TestClass",
                repo_name: "test-repo",
                depth: 5,
                relationships: &["CALLS", "EXTENDS", "IMPLEMENTS", "REFERENCES"],
                direction: SubgraphDirection::Both,
                max_nodes: 2,
                entity_uuid: None,
                visible_kinds: None,
            })
            .await;
        assert!(result.is_ok());
        let sub = result.unwrap();
        if sub.total_nodes_found > 2 {
            assert!(sub.truncated);
            assert!(sub.nodes.len() <= 2);
        }
    }

    #[ignore = "requires local Neo4j instance running on bolt://localhost:7687"]
    #[tokio::test]
    async fn test_get_entity_subgraph_with_visible_kinds() {
        let graph_db = GraphDb::connect("bolt://localhost:7687", "neo4j", "password")
            .await
            .expect("Failed to connect to Neo4j");

        let result = graph_db
            .get_entity_subgraph(SubgraphQueryOptions {
                entity_name: "TestClass",
                repo_name: "test-repo",
                depth: 3,
                relationships: &["CALLS", "EXTENDS", "IMPLEMENTS"],
                direction: SubgraphDirection::Both,
                max_nodes: 500,
                entity_uuid: None,
                visible_kinds: Some(&["class", "interface"]),
            })
            .await;
        assert!(result.is_ok());
        let sub = result.unwrap();
        if !sub.nodes.is_empty() {
            for node in &sub.nodes {
                let kind = node.kind.as_deref().unwrap_or("");
                assert!(
                    kind == "class" || kind == "interface",
                    "Expected node kind in ['class', 'interface'], got '{kind}'"
                );
            }
        }
    }

    #[ignore = "requires local Neo4j instance running on bolt://localhost:7687"]
    #[tokio::test]
    async fn test_get_entity_subgraph_connectivity() {
        let graph_db = GraphDb::connect("bolt://localhost:7687", "neo4j", "password")
            .await
            .expect("Failed to connect to Neo4j");

        let result = graph_db
            .get_entity_subgraph(SubgraphQueryOptions {
                entity_name: "ClassA",
                repo_name: "test-repo",
                depth: 3,
                relationships: &["CALLS"],
                direction: SubgraphDirection::Outgoing,
                max_nodes: 500,
                entity_uuid: None,
                visible_kinds: Some(&["class", "rust_struct"]),
            })
            .await;
        assert!(result.is_ok());
    }
}