interstellar 0.2.0

A high-performance graph database with Gremlin-style traversals and GQL query language
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
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
1069
1070
1071
1072
1073
1074
1075
1076
1077
1078
1079
1080
1081
1082
1083
1084
1085
1086
1087
1088
1089
1090
1091
1092
1093
1094
1095
1096
1097
1098
1099
1100
1101
1102
1103
1104
1105
1106
1107
1108
1109
1110
1111
1112
1113
1114
1115
1116
1117
1118
1119
1120
1121
1122
1123
1124
1125
1126
1127
1128
1129
1130
1131
1132
1133
1134
1135
1136
1137
1138
1139
1140
1141
1142
1143
1144
1145
1146
1147
1148
1149
1150
1151
1152
1153
1154
1155
1156
1157
1158
1159
1160
1161
1162
1163
1164
1165
1166
1167
1168
1169
1170
1171
1172
1173
1174
1175
1176
1177
1178
1179
1180
1181
1182
1183
1184
1185
1186
1187
1188
1189
1190
1191
1192
1193
1194
1195
1196
1197
1198
1199
1200
1201
1202
1203
1204
1205
1206
1207
1208
1209
1210
1211
1212
1213
1214
1215
1216
1217
1218
1219
1220
1221
1222
1223
1224
1225
1226
1227
1228
1229
1230
1231
1232
1233
1234
1235
1236
1237
1238
1239
1240
1241
1242
1243
1244
1245
1246
1247
1248
1249
1250
1251
1252
1253
1254
1255
1256
1257
1258
1259
1260
1261
1262
1263
1264
1265
1266
1267
1268
1269
1270
1271
1272
1273
1274
1275
1276
1277
1278
1279
1280
1281
1282
1283
1284
1285
1286
1287
1288
1289
1290
1291
1292
1293
1294
1295
1296
1297
1298
1299
1300
1301
1302
1303
1304
1305
1306
1307
1308
1309
1310
1311
1312
1313
1314
1315
1316
1317
1318
1319
1320
1321
1322
1323
1324
1325
1326
1327
1328
1329
1330
1331
1332
1333
1334
1335
1336
1337
1338
1339
1340
1341
1342
1343
1344
1345
1346
1347
1348
1349
1350
1351
1352
1353
1354
1355
1356
1357
1358
1359
1360
1361
1362
1363
1364
1365
1366
1367
1368
1369
1370
1371
1372
1373
1374
1375
1376
1377
1378
1379
1380
1381
1382
1383
1384
1385
1386
1387
1388
1389
1390
1391
1392
1393
1394
1395
1396
1397
1398
1399
1400
1401
1402
1403
1404
1405
1406
1407
1408
1409
1410
1411
1412
1413
1414
1415
1416
1417
1418
1419
1420
1421
1422
1423
1424
1425
1426
1427
1428
1429
1430
1431
1432
1433
1434
1435
//! Expression tests for GQL.
//!
//! Tests for expression evaluation including:
//! - EXISTS subqueries
//! - COALESCE function
//! - CASE expressions
//! - Type conversion functions (toString, toInteger, toFloat, toBoolean)
//! - String functions (upper, lower, length, trim, substring, replace)
//! - Math functions (abs, round, floor, ceil)

#![allow(unused_variables)]
use interstellar::prelude::*;
use interstellar::storage::Graph;
use std::collections::HashMap;
use std::sync::Arc;

// =============================================================================
// EXISTS Expression Tests
// =============================================================================

/// Helper to create a graph with relationships for EXISTS testing
fn create_exists_test_graph() -> Arc<Graph> {
    let graph = Arc::new(Graph::new());

    // Create players
    let mut mj_props = HashMap::new();
    mj_props.insert("name".to_string(), Value::from("Michael Jordan"));
    mj_props.insert("position".to_string(), Value::from("Shooting Guard"));
    let mj_id = graph.add_vertex("player", mj_props);

    let mut kobe_props = HashMap::new();
    kobe_props.insert("name".to_string(), Value::from("Kobe Bryant"));
    kobe_props.insert("position".to_string(), Value::from("Shooting Guard"));
    let kobe_id = graph.add_vertex("player", kobe_props);

    let mut barkley_props = HashMap::new();
    barkley_props.insert("name".to_string(), Value::from("Charles Barkley"));
    barkley_props.insert("position".to_string(), Value::from("Power Forward"));
    let barkley_id = graph.add_vertex("player", barkley_props);

    let mut nash_props = HashMap::new();
    nash_props.insert("name".to_string(), Value::from("Steve Nash"));
    nash_props.insert("position".to_string(), Value::from("Point Guard"));
    let nash_id = graph.add_vertex("player", nash_props);

    // Create teams
    let mut bulls_props = HashMap::new();
    bulls_props.insert("name".to_string(), Value::from("Chicago Bulls"));
    bulls_props.insert("championships".to_string(), Value::Int(6));
    let bulls_id = graph.add_vertex("team", bulls_props);

    let mut lakers_props = HashMap::new();
    lakers_props.insert("name".to_string(), Value::from("Los Angeles Lakers"));
    lakers_props.insert("championships".to_string(), Value::Int(17));
    let lakers_id = graph.add_vertex("team", lakers_props);

    let mut suns_props = HashMap::new();
    suns_props.insert("name".to_string(), Value::from("Phoenix Suns"));
    suns_props.insert("championships".to_string(), Value::Int(0));
    let suns_id = graph.add_vertex("team", suns_props);

    // Add championship relationships (only MJ and Kobe have won)
    let mut ring_props = HashMap::new();
    ring_props.insert("years".to_string(), Value::from("1991-1993,1996-1998"));
    let _ = graph.add_edge(mj_id, bulls_id, "won_championship_with", ring_props.clone());

    ring_props.insert("years".to_string(), Value::from("2000-2002,2009-2010"));
    let _ = graph.add_edge(kobe_id, lakers_id, "won_championship_with", ring_props);

    // Add played_for relationships
    let played_props = HashMap::new();
    let _ = graph.add_edge(mj_id, bulls_id, "played_for", played_props.clone());
    let _ = graph.add_edge(kobe_id, lakers_id, "played_for", played_props.clone());
    let _ = graph.add_edge(barkley_id, suns_id, "played_for", played_props.clone());
    let _ = graph.add_edge(nash_id, suns_id, "played_for", played_props);

    graph
}

#[test]
fn test_gql_exists_basic() {
    let graph = create_exists_test_graph();
    let snapshot = graph.snapshot();

    // Find players who have won championships
    let results: Vec<_> = graph
        .gql(
            r#"
        MATCH (p:player)
        WHERE EXISTS { (p)-[:won_championship_with]->() }
        RETURN p.name
    "#,
        )
        .unwrap();

    // Should find MJ and Kobe
    assert_eq!(results.len(), 2);

    let names: Vec<String> = results
        .iter()
        .filter_map(|v| match v {
            Value::String(s) => Some(s.clone()),
            _ => None,
        })
        .collect();

    assert!(names.contains(&"Michael Jordan".to_string()));
    assert!(names.contains(&"Kobe Bryant".to_string()));
}

#[test]
fn test_gql_not_exists() {
    let graph = create_exists_test_graph();
    let snapshot = graph.snapshot();

    // Find players who have NOT won championships
    let results: Vec<_> = graph
        .gql(
            r#"
        MATCH (p:player)
        WHERE NOT EXISTS { (p)-[:won_championship_with]->() }
        RETURN p.name
    "#,
        )
        .unwrap();

    // Should find Barkley and Nash
    assert_eq!(results.len(), 2);

    let names: Vec<String> = results
        .iter()
        .filter_map(|v| match v {
            Value::String(s) => Some(s.clone()),
            _ => None,
        })
        .collect();

    assert!(names.contains(&"Charles Barkley".to_string()));
    assert!(names.contains(&"Steve Nash".to_string()));
}

#[test]
fn test_gql_exists_with_target_label() {
    let graph = create_exists_test_graph();
    let snapshot = graph.snapshot();

    // Find players who played for a team (all players should match)
    let results: Vec<_> = graph
        .gql(
            r#"
        MATCH (p:player)
        WHERE EXISTS { (p)-[:played_for]->(t:team) }
        RETURN p.name
    "#,
        )
        .unwrap();

    // All 4 players have played for a team
    assert_eq!(results.len(), 4);
}

#[test]
fn test_gql_exists_combined_with_and() {
    let graph = create_exists_test_graph();
    let snapshot = graph.snapshot();

    // Find shooting guards who have won championships
    let results: Vec<_> = graph
        .gql(
            r#"
        MATCH (p:player)
        WHERE p.position = 'Shooting Guard' AND EXISTS { (p)-[:won_championship_with]->() }
        RETURN p.name
    "#,
        )
        .unwrap();

    // MJ and Kobe are both shooting guards with championships
    assert_eq!(results.len(), 2);
}

#[test]
fn test_gql_exists_combined_with_or() {
    let graph = create_exists_test_graph();
    let snapshot = graph.snapshot();

    // Find point guards OR players who have won championships
    let results: Vec<_> = graph
        .gql(
            r#"
        MATCH (p:player)
        WHERE p.position = 'Point Guard' OR EXISTS { (p)-[:won_championship_with]->() }
        RETURN p.name
    "#,
        )
        .unwrap();

    // Should find: MJ, Kobe (champions), Nash (point guard)
    assert_eq!(results.len(), 3);
}

#[test]
fn test_gql_exists_no_match() {
    let graph = create_exists_test_graph();
    let snapshot = graph.snapshot();

    // Find players who have an edge type that doesn't exist
    let results: Vec<_> = graph
        .gql(
            r#"
        MATCH (p:player)
        WHERE EXISTS { (p)-[:nonexistent_relationship]->() }
        RETURN p.name
    "#,
        )
        .unwrap();

    // No players have this relationship type
    assert_eq!(results.len(), 0);
}

#[test]
fn test_gql_exists_with_count() {
    let graph = create_exists_test_graph();
    let snapshot = graph.snapshot();

    // Count players who have won championships
    let results: Vec<_> = graph
        .gql(
            r#"
        MATCH (p:player)
        WHERE EXISTS { (p)-[:won_championship_with]->() }
        RETURN count(*)
    "#,
        )
        .unwrap();

    assert_eq!(results.len(), 1);
    assert_eq!(results[0], Value::Int(2));
}

#[test]
fn test_gql_parse_exists_expression() {
    use interstellar::gql::parse;

    // Test that EXISTS expressions parse correctly
    let ast = parse(
        r#"
        MATCH (p:player)
        WHERE EXISTS { (p)-[:won_championship_with]->() }
        RETURN p.name
    "#,
    )
    .unwrap();

    assert!(ast.where_clause.is_some());

    // The where clause should contain an EXISTS expression
    let where_clause = ast.where_clause.unwrap();
    match where_clause.expression {
        interstellar::gql::Expression::Exists {
            negated, pattern, ..
        } => {
            assert!(!negated);
            assert!(!pattern.elements.is_empty());
        }
        _ => panic!("Expected EXISTS expression"),
    }
}

#[test]
fn test_gql_parse_not_exists_expression() {
    use interstellar::gql::parse;

    // Test that NOT EXISTS expressions parse correctly
    // NOT EXISTS is parsed as UnaryOp(Not, Exists { negated: false, ... })
    let ast = parse(
        r#"
        MATCH (p:player)
        WHERE NOT EXISTS { (p)-[:knows]->() }
        RETURN p.name
    "#,
    )
    .unwrap();

    assert!(ast.where_clause.is_some());

    let where_clause = ast.where_clause.unwrap();
    match where_clause.expression {
        interstellar::gql::Expression::UnaryOp { op, expr } => {
            assert!(matches!(op, interstellar::gql::UnaryOperator::Not));
            match *expr {
                interstellar::gql::Expression::Exists {
                    negated, pattern, ..
                } => {
                    assert!(!negated);
                    assert!(!pattern.elements.is_empty());
                }
                _ => panic!("Expected EXISTS expression inside NOT"),
            }
        }
        interstellar::gql::Expression::Exists {
            negated, pattern, ..
        } => {
            // Alternative: if grammar is changed to support NOT directly
            assert!(negated);
            assert!(!pattern.elements.is_empty());
        }
        _ => panic!("Expected NOT(EXISTS) or EXISTS(negated=true) expression"),
    }
}

#[test]
fn test_gql_exists_incoming_edge() {
    let graph = create_exists_test_graph();
    let snapshot = graph.snapshot();

    // Find teams that have players who played for them
    let results: Vec<_> = graph
        .gql(
            r#"
        MATCH (t:team)
        WHERE EXISTS { (t)<-[:played_for]-() }
        RETURN t.name
    "#,
        )
        .unwrap();

    // All teams have at least one player
    assert_eq!(results.len(), 3);
}

#[test]
fn test_gql_exists_bidirectional() {
    let graph = create_exists_test_graph();
    let snapshot = graph.snapshot();

    // Find vertices with any played_for relationship (bidirectional)
    let results: Vec<_> = graph
        .gql(
            r#"
        MATCH (n)
        WHERE EXISTS { (n)-[:played_for]-() }
        RETURN n
    "#,
        )
        .unwrap();

    // Should find all players and teams (7 total: 4 players + 3 teams)
    assert_eq!(results.len(), 7);
}

#[test]
fn test_gql_exists_with_property_filter() {
    let graph = create_exists_test_graph();
    let snapshot = graph.snapshot();

    // Find players who played for a team with 6+ championships
    // Only Bulls have exactly 6 championships, Lakers have 17
    let results: Vec<_> = graph
        .gql(
            r#"
        MATCH (p:player)
        WHERE EXISTS { (p)-[:played_for]->(t:team {championships: 6}) }
        RETURN p.name
    "#,
        )
        .unwrap();

    // Only MJ played for the Bulls (6 championships)
    assert_eq!(results.len(), 1);

    let names: Vec<String> = results
        .iter()
        .filter_map(|v| match v {
            Value::String(s) => Some(s.clone()),
            _ => None,
        })
        .collect();

    assert!(names.contains(&"Michael Jordan".to_string()));
}

#[test]
fn test_gql_exists_with_target_property_filter_multiple_results() {
    let graph = create_exists_test_graph();
    let snapshot = graph.snapshot();

    // Find players who played for a team with 0 championships
    // Only Suns have 0 championships
    let results: Vec<_> = graph
        .gql(
            r#"
        MATCH (p:player)
        WHERE EXISTS { (p)-[:played_for]->(t:team {championships: 0}) }
        RETURN p.name
    "#,
        )
        .unwrap();

    // Barkley and Nash played for the Suns (0 championships)
    assert_eq!(results.len(), 2);

    let names: Vec<String> = results
        .iter()
        .filter_map(|v| match v {
            Value::String(s) => Some(s.clone()),
            _ => None,
        })
        .collect();

    assert!(names.contains(&"Charles Barkley".to_string()));
    assert!(names.contains(&"Steve Nash".to_string()));
}

#[test]
fn test_gql_exists_multiple_conditions_complex() {
    let graph = create_exists_test_graph();
    let snapshot = graph.snapshot();

    // Find shooting guards who have NOT won championships
    // This combines property filter with NOT EXISTS
    let results: Vec<_> = graph
        .gql(
            r#"
        MATCH (p:player)
        WHERE p.position = 'Shooting Guard' AND NOT EXISTS { (p)-[:won_championship_with]->() }
        RETURN p.name
    "#,
        )
        .unwrap();

    // No shooting guards without championships (MJ and Kobe both won)
    assert_eq!(results.len(), 0);
}

#[test]
fn test_gql_exists_with_order_by() {
    let graph = create_exists_test_graph();
    let snapshot = graph.snapshot();

    // Find players who have won championships, ordered by name
    let results: Vec<_> = graph
        .gql(
            r#"
        MATCH (p:player)
        WHERE EXISTS { (p)-[:won_championship_with]->() }
        RETURN p.name
        ORDER BY p.name
    "#,
        )
        .unwrap();

    assert_eq!(results.len(), 2);
    // Should be alphabetically ordered: Kobe Bryant, Michael Jordan
    assert_eq!(results[0], Value::String("Kobe Bryant".to_string()));
    assert_eq!(results[1], Value::String("Michael Jordan".to_string()));
}

#[test]
fn test_gql_exists_with_limit() {
    let graph = create_exists_test_graph();
    let snapshot = graph.snapshot();

    // Find first player who has NOT won championships
    let results: Vec<_> = graph
        .gql(
            r#"
        MATCH (p:player)
        WHERE NOT EXISTS { (p)-[:won_championship_with]->() }
        RETURN p.name
        LIMIT 1
    "#,
        )
        .unwrap();

    assert_eq!(results.len(), 1);
    // Should be either Barkley or Nash
    let name = match &results[0] {
        Value::String(s) => s.clone(),
        _ => panic!("Expected string"),
    };
    assert!(name == "Charles Barkley" || name == "Steve Nash");
}

#[test]
fn test_gql_exists_nested_not() {
    let graph = create_exists_test_graph();
    let snapshot = graph.snapshot();

    // Double negation: NOT NOT EXISTS should equal EXISTS
    // Find players where it's NOT true that they have NOT won championships
    // (i.e., players who HAVE won championships)
    let results: Vec<_> = graph
        .gql(
            r#"
        MATCH (p:player)
        WHERE NOT NOT EXISTS { (p)-[:won_championship_with]->() }
        RETURN p.name
    "#,
        )
        .unwrap();

    // Same as EXISTS - should find MJ and Kobe
    assert_eq!(results.len(), 2);

    let names: Vec<String> = results
        .iter()
        .filter_map(|v| match v {
            Value::String(s) => Some(s.clone()),
            _ => None,
        })
        .collect();

    assert!(names.contains(&"Michael Jordan".to_string()));
    assert!(names.contains(&"Kobe Bryant".to_string()));
}

#[test]
fn test_gql_exists_with_distinct() {
    let graph = create_exists_test_graph();
    let snapshot = graph.snapshot();

    // Get distinct positions of players who have won championships
    let results: Vec<_> = graph
        .gql(
            r#"
        MATCH (p:player)
        WHERE EXISTS { (p)-[:won_championship_with]->() }
        RETURN DISTINCT p.position
    "#,
        )
        .unwrap();

    // Both MJ and Kobe are Shooting Guards, so we should get only 1 distinct position
    assert_eq!(results.len(), 1);
    assert_eq!(results[0], Value::String("Shooting Guard".to_string()));
}

#[test]
fn test_gql_exists_return_multiple_properties() {
    let graph = create_exists_test_graph();
    let snapshot = graph.snapshot();

    // Return multiple properties for players who have won championships
    let results: Vec<_> = graph
        .gql(
            r#"
        MATCH (p:player)
        WHERE EXISTS { (p)-[:won_championship_with]->() }
        RETURN p.name AS name, p.position AS pos
    "#,
        )
        .unwrap();

    assert_eq!(results.len(), 2);

    // Each result should be a map with name and pos
    for result in &results {
        if let Value::Map(map) = result {
            assert!(map.contains_key("name"));
            assert!(map.contains_key("pos"));
            assert_eq!(
                map.get("pos"),
                Some(&Value::String("Shooting Guard".to_string()))
            );
        } else {
            panic!("Expected map result");
        }
    }
}

#[test]
fn test_gql_exists_empty_graph() {
    let graph = Arc::new(Graph::new());
    let snapshot = graph.snapshot();

    // EXISTS on empty graph should return no results
    let results: Vec<_> = graph
        .gql(
            r#"
        MATCH (p:player)
        WHERE EXISTS { (p)-[:won_championship_with]->() }
        RETURN p.name
    "#,
        )
        .unwrap();

    assert_eq!(results.len(), 0);
}

#[test]
fn test_gql_exists_no_edges() {
    // Create a graph with vertices but no edges
    let graph = Arc::new(Graph::new());

    let mut props = HashMap::new();
    props.insert("name".to_string(), Value::from("Lonely Player"));
    graph.add_vertex("player", props);

    let snapshot = graph.snapshot();

    // EXISTS should return false for a player with no outgoing edges
    let results: Vec<_> = graph
        .gql(
            r#"
        MATCH (p:player)
        WHERE EXISTS { (p)-[:any_relationship]->() }
        RETURN p.name
    "#,
        )
        .unwrap();

    assert_eq!(results.len(), 0);

    // NOT EXISTS should return true for a player with no outgoing edges
    let results: Vec<_> = graph
        .gql(
            r#"
        MATCH (p:player)
        WHERE NOT EXISTS { (p)-[:any_relationship]->() }
        RETURN p.name
    "#,
        )
        .unwrap();

    assert_eq!(results.len(), 1);
    assert_eq!(results[0], Value::String("Lonely Player".to_string()));
}

#[test]
fn test_gql_exists_self_loop() {
    // Create a graph with a self-loop
    let graph = Arc::new(Graph::new());

    let mut props = HashMap::new();
    props.insert("name".to_string(), Value::from("Narcissist"));
    let id = graph.add_vertex("player", props);

    let _ = graph.add_edge(id, id, "admires", HashMap::new());

    let snapshot = graph.snapshot();

    // EXISTS should work with self-loops
    let results: Vec<_> = graph
        .gql(
            r#"
        MATCH (p:player)
        WHERE EXISTS { (p)-[:admires]->(p) }
        RETURN p.name
    "#,
        )
        .unwrap();

    // The player admires themselves
    assert_eq!(results.len(), 1);
    assert_eq!(results[0], Value::String("Narcissist".to_string()));
}

#[test]
fn test_gql_exists_aggregate_over_filtered() {
    let graph = create_exists_test_graph();
    let snapshot = graph.snapshot();

    // Count and collect names of championship winners
    let results: Vec<_> = graph
        .gql(
            r#"
        MATCH (p:player)
        WHERE EXISTS { (p)-[:won_championship_with]->() }
        RETURN count(*) AS total, collect(p.name) AS winners
    "#,
        )
        .unwrap();

    assert_eq!(results.len(), 1);

    if let Value::Map(map) = &results[0] {
        assert_eq!(map.get("total"), Some(&Value::Int(2)));

        if let Some(Value::List(winners)) = map.get("winners") {
            assert_eq!(winners.len(), 2);
            assert!(winners.contains(&Value::String("Michael Jordan".to_string())));
            assert!(winners.contains(&Value::String("Kobe Bryant".to_string())));
        } else {
            panic!("Expected list for winners");
        }
    } else {
        panic!("Expected map result");
    }
}

// =============================================================================
// EXISTS Subquery Form Tests (`EXISTS { MATCH ... [WHERE ...] }`)
// =============================================================================

#[test]
fn test_gql_exists_subquery_match_form() {
    // The subquery form `EXISTS { MATCH (...) }` should be equivalent to the
    // bare pattern form `EXISTS { (...) }`.
    let graph = create_exists_test_graph();
    let _snapshot = graph.snapshot();

    let results: Vec<_> = graph
        .gql(
            r#"
        MATCH (p:player)
        WHERE EXISTS { MATCH (p)-[:won_championship_with]->() }
        RETURN p.name
    "#,
        )
        .unwrap();

    assert_eq!(results.len(), 2);
    let names: Vec<String> = results
        .iter()
        .filter_map(|v| match v {
            Value::String(s) => Some(s.clone()),
            _ => None,
        })
        .collect();
    assert!(names.contains(&"Michael Jordan".to_string()));
    assert!(names.contains(&"Kobe Bryant".to_string()));
}

#[test]
fn test_gql_exists_subquery_with_where_filters_inner_pattern() {
    // The inner WHERE should be able to reference variables introduced inside
    // the EXISTS subquery (here, the team `t`).
    let graph = create_exists_test_graph();
    let _snapshot = graph.snapshot();

    // Players who played for a team with at least 6 championships.
    // MJ played for Bulls (6), Kobe for Lakers (17). Barkley/Nash played for
    // Suns (0), so they should not be returned.
    let results: Vec<_> = graph
        .gql(
            r#"
        MATCH (p:player)
        WHERE EXISTS { MATCH (p)-[:played_for]->(t:team) WHERE t.championships >= 6 }
        RETURN p.name
    "#,
        )
        .unwrap();

    assert_eq!(results.len(), 2);
    let names: Vec<String> = results
        .iter()
        .filter_map(|v| match v {
            Value::String(s) => Some(s.clone()),
            _ => None,
        })
        .collect();
    assert!(names.contains(&"Michael Jordan".to_string()));
    assert!(names.contains(&"Kobe Bryant".to_string()));
    assert!(!names.contains(&"Charles Barkley".to_string()));
    assert!(!names.contains(&"Steve Nash".to_string()));
}

#[test]
fn test_gql_not_exists_subquery_with_where() {
    // `NOT EXISTS { MATCH ... WHERE ... }` should select players for whom no
    // matching subgraph exists. Here: players who never played for a team with
    // 6+ championships.
    let graph = create_exists_test_graph();
    let _snapshot = graph.snapshot();

    let results: Vec<_> = graph
        .gql(
            r#"
        MATCH (p:player)
        WHERE NOT EXISTS { MATCH (p)-[:played_for]->(t:team) WHERE t.championships >= 6 }
        RETURN p.name
    "#,
        )
        .unwrap();

    assert_eq!(results.len(), 2);
    let names: Vec<String> = results
        .iter()
        .filter_map(|v| match v {
            Value::String(s) => Some(s.clone()),
            _ => None,
        })
        .collect();
    assert!(names.contains(&"Charles Barkley".to_string()));
    assert!(names.contains(&"Steve Nash".to_string()));
}

#[test]
fn test_gql_exists_subquery_where_no_matches() {
    // The inner WHERE filters out every otherwise-matching path, so no player
    // should satisfy the EXISTS.
    let graph = create_exists_test_graph();
    let _snapshot = graph.snapshot();

    let results: Vec<_> = graph
        .gql(
            r#"
        MATCH (p:player)
        WHERE EXISTS { MATCH (p)-[:played_for]->(t:team) WHERE t.championships > 100 }
        RETURN p.name
    "#,
        )
        .unwrap();

    assert!(results.is_empty(), "expected no players, got {:?}", results);
}

// =============================================================================
// COALESCE Function Tests
// =============================================================================

/// Helper to create a graph with null values for COALESCE tests
fn create_coalesce_test_graph() -> Arc<Graph> {
    let graph = Arc::new(Graph::new());

    // Person with both name and nickname
    let mut alice_props = HashMap::new();
    alice_props.insert("name".to_string(), Value::from("Alice"));
    alice_props.insert("nickname".to_string(), Value::from("Ali"));
    graph.add_vertex("Person", alice_props);

    // Person with name but no nickname
    let mut bob_props = HashMap::new();
    bob_props.insert("name".to_string(), Value::from("Bob"));
    // Note: no nickname property
    graph.add_vertex("Person", bob_props);

    // Person with nickname but no name (unusual case)
    let mut carol_props = HashMap::new();
    carol_props.insert("nickname".to_string(), Value::from("Carol the Great"));
    graph.add_vertex("Person", carol_props);

    graph
}

/// Test COALESCE returns first non-null value
#[test]
fn test_gql_coalesce_first_value() {
    let graph = create_coalesce_test_graph();
    let snapshot = graph.snapshot();

    // Alice has nickname, so COALESCE should return nickname
    let results = graph
        .gql("MATCH (p:Person) WHERE p.name = 'Alice' RETURN coalesce(p.nickname, p.name)")
        .unwrap();

    assert_eq!(results.len(), 1);
    assert_eq!(results[0], Value::String("Ali".to_string()));
}

/// Test COALESCE falls back to second value when first is null
#[test]
fn test_gql_coalesce_fallback() {
    let graph = create_coalesce_test_graph();
    let snapshot = graph.snapshot();

    // Bob has no nickname, so COALESCE should return name
    let results = graph
        .gql("MATCH (p:Person) WHERE p.name = 'Bob' RETURN coalesce(p.nickname, p.name)")
        .unwrap();

    assert_eq!(results.len(), 1);
    assert_eq!(results[0], Value::String("Bob".to_string()));
}

/// Test COALESCE with literal default
#[test]
fn test_gql_coalesce_literal_default() {
    let graph = create_coalesce_test_graph();
    let snapshot = graph.snapshot();

    // Bob has no nickname, so return default literal
    let results = graph
        .gql("MATCH (p:Person) WHERE p.name = 'Bob' RETURN coalesce(p.nickname, 'No Nickname')")
        .unwrap();

    assert_eq!(results.len(), 1);
    assert_eq!(results[0], Value::String("No Nickname".to_string()));
}

/// Test COALESCE with multiple arguments
#[test]
fn test_gql_coalesce_multiple_args() {
    let graph = create_coalesce_test_graph();
    let snapshot = graph.snapshot();

    // For Carol: name is null, nickname exists
    let results = graph
        .gql("MATCH (p:Person) WHERE p.nickname = 'Carol the Great' RETURN coalesce(p.name, p.nickname, 'Unknown')")
        .unwrap();

    assert_eq!(results.len(), 1);
    assert_eq!(results[0], Value::String("Carol the Great".to_string()));
}

/// Test COALESCE case insensitivity
#[test]
fn test_gql_coalesce_case_insensitive() {
    let graph = create_coalesce_test_graph();
    let snapshot = graph.snapshot();

    let results = graph
        .gql("MATCH (p:Person) WHERE p.name = 'Bob' RETURN COALESCE(p.nickname, p.name)")
        .unwrap();

    assert_eq!(results.len(), 1);
    assert_eq!(results[0], Value::String("Bob".to_string()));
}

// =============================================================================
// CASE Expression Tests
// =============================================================================

/// Helper to create a graph for CASE expression tests
fn create_case_test_graph() -> Arc<Graph> {
    let graph = Arc::new(Graph::new());

    let people = vec![
        ("Alice", 32i64, 92i64),
        ("Bob", 25i64, 75i64),
        ("Carol", 42i64, 88i64),
        ("Dave", 18i64, 65i64),
        ("Eve", 55i64, 45i64),
    ];

    for (name, age, score) in people {
        let mut props = HashMap::new();
        props.insert("name".to_string(), Value::from(name));
        props.insert("age".to_string(), Value::from(age));
        props.insert("score".to_string(), Value::from(score));
        graph.add_vertex("Person", props);
    }

    graph
}

/// Test CASE expression with age categorization
#[test]
fn test_gql_case_age_category() {
    let graph = create_case_test_graph();
    let snapshot = graph.snapshot();

    let results = graph
        .gql(
            r#"
            MATCH (p:Person) 
            WHERE p.name = 'Carol'
            RETURN CASE 
                WHEN p.age > 40 THEN 'Senior'
                WHEN p.age > 30 THEN 'Middle'
                ELSE 'Young'
            END
        "#,
        )
        .unwrap();

    assert_eq!(results.len(), 1);
    assert_eq!(results[0], Value::String("Senior".to_string()));
}

/// Test CASE expression returns ELSE when no WHEN matches
#[test]
fn test_gql_case_else_branch() {
    let graph = create_case_test_graph();
    let snapshot = graph.snapshot();

    let results = graph
        .gql(
            r#"
            MATCH (p:Person) 
            WHERE p.name = 'Dave'
            RETURN CASE 
                WHEN p.age > 40 THEN 'Senior'
                WHEN p.age > 30 THEN 'Middle'
                ELSE 'Young'
            END
        "#,
        )
        .unwrap();

    assert_eq!(results.len(), 1);
    assert_eq!(results[0], Value::String("Young".to_string()));
}

/// Test CASE expression with grade categorization
#[test]
fn test_gql_case_grade() {
    let graph = create_case_test_graph();
    let snapshot = graph.snapshot();

    // Alice has score 92, should be 'A'
    let results = graph
        .gql(
            r#"
            MATCH (p:Person) 
            WHERE p.name = 'Alice'
            RETURN p.name, CASE 
                WHEN p.score >= 90 THEN 'A'
                WHEN p.score >= 80 THEN 'B'
                WHEN p.score >= 70 THEN 'C'
                ELSE 'F'
            END AS grade
        "#,
        )
        .unwrap();

    assert_eq!(results.len(), 1);
    if let Value::Map(map) = &results[0] {
        assert_eq!(map.get("grade"), Some(&Value::String("A".to_string())));
    } else {
        panic!("Expected Map result");
    }
}

/// Test CASE expression without ELSE returns null
#[test]
fn test_gql_case_no_else_returns_null() {
    let graph = create_case_test_graph();
    let snapshot = graph.snapshot();

    // Eve (age 55) won't match any WHEN condition if we check for age < 20
    let results = graph
        .gql(
            r#"
            MATCH (p:Person) 
            WHERE p.name = 'Eve'
            RETURN CASE 
                WHEN p.age < 20 THEN 'Teen'
            END
        "#,
        )
        .unwrap();

    assert_eq!(results.len(), 1);
    assert_eq!(results[0], Value::Null);
}

/// Test CASE expression with multiple results
#[test]
fn test_gql_case_multiple_results() {
    let graph = create_case_test_graph();
    let snapshot = graph.snapshot();

    let results = graph
        .gql(
            r#"
            MATCH (p:Person)
            RETURN p.name, CASE 
                WHEN p.age > 40 THEN 'Senior'
                WHEN p.age > 25 THEN 'Adult'
                ELSE 'Young'
            END AS category
            ORDER BY p.name
        "#,
        )
        .unwrap();

    assert_eq!(results.len(), 5);

    // Verify categories are correct
    let categories: Vec<_> = results
        .iter()
        .filter_map(|v| {
            if let Value::Map(map) = v {
                let name = map.get("p.name").cloned();
                let category = map.get("category").cloned();
                Some((name, category))
            } else {
                None
            }
        })
        .collect();

    // Alice (32) -> Adult
    assert!(categories.contains(&(
        Some(Value::String("Alice".to_string())),
        Some(Value::String("Adult".to_string()))
    )));
    // Carol (42) -> Senior
    assert!(categories.contains(&(
        Some(Value::String("Carol".to_string())),
        Some(Value::String("Senior".to_string()))
    )));
    // Dave (18) -> Young
    assert!(categories.contains(&(
        Some(Value::String("Dave".to_string())),
        Some(Value::String("Young".to_string()))
    )));
}

// =============================================================================
// Type Conversion Function Tests
// =============================================================================

/// Helper to create a graph for type conversion tests
fn create_type_conversion_test_graph() -> Arc<Graph> {
    let graph = Arc::new(Graph::new());

    let mut props = HashMap::new();
    props.insert("name".to_string(), Value::from("Alice"));
    props.insert("age".to_string(), Value::from(30i64));
    props.insert("score".to_string(), Value::from(95.5));
    props.insert("active".to_string(), Value::from(true));
    props.insert("count_str".to_string(), Value::from("42"));
    props.insert("float_str".to_string(), Value::from("3.15"));
    props.insert("bool_str".to_string(), Value::from("true"));
    graph.add_vertex("Person", props);

    graph
}

/// Test toString() converts integer to string
#[test]
fn test_gql_tostring_integer() {
    let graph = create_type_conversion_test_graph();
    let snapshot = graph.snapshot();

    let results = graph
        .gql("MATCH (p:Person) RETURN toString(p.age)")
        .unwrap();

    assert_eq!(results.len(), 1);
    assert_eq!(results[0], Value::String("30".to_string()));
}

/// Test toString() converts float to string
#[test]
fn test_gql_tostring_float() {
    let graph = create_type_conversion_test_graph();
    let snapshot = graph.snapshot();

    let results = graph
        .gql("MATCH (p:Person) RETURN toString(p.score)")
        .unwrap();

    assert_eq!(results.len(), 1);
    if let Value::String(s) = &results[0] {
        assert!(s.starts_with("95.5"), "Expected '95.5...' got '{}'", s);
    } else {
        panic!("Expected String result");
    }
}

/// Test toString() converts boolean to string
#[test]
fn test_gql_tostring_boolean() {
    let graph = create_type_conversion_test_graph();
    let snapshot = graph.snapshot();

    let results = graph
        .gql("MATCH (p:Person) RETURN toString(p.active)")
        .unwrap();

    assert_eq!(results.len(), 1);
    assert_eq!(results[0], Value::String("true".to_string()));
}

/// Test toInteger() converts string to integer
#[test]
fn test_gql_tointeger_string() {
    let graph = create_type_conversion_test_graph();
    let snapshot = graph.snapshot();

    let results = graph
        .gql("MATCH (p:Person) RETURN toInteger(p.count_str)")
        .unwrap();

    assert_eq!(results.len(), 1);
    assert_eq!(results[0], Value::Int(42));
}

/// Test toInteger() converts float to integer (truncates)
#[test]
fn test_gql_tointeger_float() {
    let graph = create_type_conversion_test_graph();
    let snapshot = graph.snapshot();

    let results = graph
        .gql("MATCH (p:Person) RETURN toInteger(p.score)")
        .unwrap();

    assert_eq!(results.len(), 1);
    assert_eq!(results[0], Value::Int(95));
}

/// Test toInteger() with invalid string returns null
#[test]
fn test_gql_tointeger_invalid_string() {
    let graph = create_type_conversion_test_graph();
    let snapshot = graph.snapshot();

    let results = graph
        .gql("MATCH (p:Person) RETURN toInteger(p.name)")
        .unwrap();

    assert_eq!(results.len(), 1);
    assert_eq!(results[0], Value::Null);
}

/// Test toFloat() converts integer to float
#[test]
fn test_gql_tofloat_integer() {
    let graph = create_type_conversion_test_graph();
    let snapshot = graph.snapshot();

    let results = graph.gql("MATCH (p:Person) RETURN toFloat(p.age)").unwrap();

    assert_eq!(results.len(), 1);
    if let Value::Float(f) = results[0] {
        assert!((f - 30.0).abs() < 0.0001, "Expected 30.0, got {}", f);
    } else {
        panic!("Expected Float result");
    }
}

/// Test toFloat() converts string to float
#[test]
fn test_gql_tofloat_string() {
    let graph = create_type_conversion_test_graph();
    let snapshot = graph.snapshot();

    let results = graph
        .gql("MATCH (p:Person) RETURN toFloat(p.float_str)")
        .unwrap();

    assert_eq!(results.len(), 1);
    if let Value::Float(f) = results[0] {
        assert!((f - 3.15).abs() < 0.0001, "Expected 3.15, got {}", f);
    } else {
        panic!("Expected Float result");
    }
}

/// Test toBoolean() converts string "true" to true
#[test]
fn test_gql_toboolean_string_true() {
    let graph = create_type_conversion_test_graph();
    let snapshot = graph.snapshot();

    let results = graph
        .gql("MATCH (p:Person) RETURN toBoolean(p.bool_str)")
        .unwrap();

    assert_eq!(results.len(), 1);
    assert_eq!(results[0], Value::Bool(true));
}

/// Test toBoolean() converts integer to boolean (0 = false)
#[test]
fn test_gql_toboolean_integer() {
    let graph = create_type_conversion_test_graph();
    let snapshot = graph.snapshot();

    // Non-zero integer should be true
    let results = graph
        .gql("MATCH (p:Person) RETURN toBoolean(p.age)")
        .unwrap();

    assert_eq!(results.len(), 1);
    assert_eq!(results[0], Value::Bool(true));
}

/// Test toBoolean() with "false" string
#[test]
fn test_gql_toboolean_string_false() {
    let graph = Arc::new(Graph::new());
    let mut props = HashMap::new();
    props.insert("status".to_string(), Value::from("false"));
    graph.add_vertex("Test", props);

    let snapshot = graph.snapshot();

    let results = graph
        .gql("MATCH (t:Test) RETURN toBoolean(t.status)")
        .unwrap();

    assert_eq!(results.len(), 1);
    assert_eq!(results[0], Value::Bool(false));
}

// =============================================================================
// String Function Tests
// =============================================================================

/// Test UPPER/TOUPPER function
#[test]
fn test_gql_upper_function() {
    let graph = create_type_conversion_test_graph();
    let snapshot = graph.snapshot();

    let results = graph.gql("MATCH (p:Person) RETURN upper(p.name)").unwrap();

    assert_eq!(results.len(), 1);
    assert_eq!(results[0], Value::String("ALICE".to_string()));
}

/// Test LOWER/TOLOWER function
#[test]
fn test_gql_lower_function() {
    let graph = create_type_conversion_test_graph();
    let snapshot = graph.snapshot();

    let results = graph.gql("MATCH (p:Person) RETURN lower(p.name)").unwrap();

    assert_eq!(results.len(), 1);
    assert_eq!(results[0], Value::String("alice".to_string()));
}

/// Test LENGTH/SIZE function for string
#[test]
fn test_gql_length_string() {
    let graph = create_type_conversion_test_graph();
    let snapshot = graph.snapshot();

    let results = graph.gql("MATCH (p:Person) RETURN length(p.name)").unwrap();

    assert_eq!(results.len(), 1);
    assert_eq!(results[0], Value::Int(5)); // "Alice" has 5 characters
}

/// Test ABS function
#[test]
fn test_gql_abs_function() {
    let graph = Arc::new(Graph::new());
    let mut props = HashMap::new();
    props.insert("balance".to_string(), Value::from(-100i64));
    graph.add_vertex("Account", props);

    let snapshot = graph.snapshot();

    let results = graph
        .gql("MATCH (a:Account) RETURN abs(a.balance)")
        .unwrap();

    assert_eq!(results.len(), 1);
    assert_eq!(results[0], Value::Int(100));
}

/// Test TRIM function
#[test]
fn test_gql_trim_function() {
    let graph = Arc::new(Graph::new());
    let mut props = HashMap::new();
    props.insert("text".to_string(), Value::from("  hello world  "));
    graph.add_vertex("Test", props);

    let snapshot = graph.snapshot();

    let results = graph.gql("MATCH (t:Test) RETURN trim(t.text)").unwrap();

    assert_eq!(results.len(), 1);
    assert_eq!(results[0], Value::String("hello world".to_string()));
}

/// Test ROUND function
#[test]
fn test_gql_round_function() {
    let graph = create_type_conversion_test_graph();
    let snapshot = graph.snapshot();

    let results = graph.gql("MATCH (p:Person) RETURN round(p.score)").unwrap();

    assert_eq!(results.len(), 1);
    if let Value::Float(f) = results[0] {
        assert!((f - 96.0).abs() < 0.0001, "Expected 96.0, got {}", f);
    } else {
        panic!("Expected Float result");
    }
}

/// Test FLOOR function
#[test]
fn test_gql_floor_function() {
    let graph = create_type_conversion_test_graph();
    let snapshot = graph.snapshot();

    let results = graph.gql("MATCH (p:Person) RETURN floor(p.score)").unwrap();

    assert_eq!(results.len(), 1);
    if let Value::Float(f) = results[0] {
        assert!((f - 95.0).abs() < 0.0001, "Expected 95.0, got {}", f);
    } else {
        panic!("Expected Float result");
    }
}

/// Test CEIL function
#[test]
fn test_gql_ceil_function() {
    let graph = create_type_conversion_test_graph();
    let snapshot = graph.snapshot();

    let results = graph.gql("MATCH (p:Person) RETURN ceil(p.score)").unwrap();

    assert_eq!(results.len(), 1);
    if let Value::Float(f) = results[0] {
        assert!((f - 96.0).abs() < 0.0001, "Expected 96.0, got {}", f);
    } else {
        panic!("Expected Float result");
    }
}

/// Test SUBSTRING function
#[test]
fn test_gql_substring_function() {
    let graph = create_type_conversion_test_graph();
    let snapshot = graph.snapshot();

    let results = graph
        .gql("MATCH (p:Person) RETURN substring(p.name, 0, 3)")
        .unwrap();

    assert_eq!(results.len(), 1);
    assert_eq!(results[0], Value::String("Ali".to_string()));
}

/// Test REPLACE function
#[test]
fn test_gql_replace_function() {
    let graph = Arc::new(Graph::new());
    let mut props = HashMap::new();
    props.insert("text".to_string(), Value::from("hello world"));
    graph.add_vertex("Test", props);

    let snapshot = graph.snapshot();

    let results = graph
        .gql("MATCH (t:Test) RETURN replace(t.text, 'world', 'there')")
        .unwrap();

    assert_eq!(results.len(), 1);
    assert_eq!(results[0], Value::String("hello there".to_string()));
}