|
261 | 261 | A |
262 | 262 | , B"#; |
263 | 263 |
|
264 | | - let root = cst::parse(&original).unwrap(); |
265 | | - let (new_root, _) = get_ts_tree_and_range_map(&original, &root); |
| 264 | + let root = cst::parse(original).unwrap(); |
| 265 | + let (new_root, _) = get_ts_tree_and_range_map(original, &root); |
266 | 266 |
|
267 | 267 | let whitespace_removed: String = original.split_whitespace().collect(); |
268 | 268 | // Lossless property of the CST is broken. |
|
355 | 355 | fn no_nested_from_list() { |
356 | 356 | let input = "select * from t1, t2;"; |
357 | 357 | let root = cst::parse(input).unwrap(); |
358 | | - let (new_root, _) = get_ts_tree_and_range_map(&input, &root); |
| 358 | + let (new_root, _) = get_ts_tree_and_range_map(input, &root); |
359 | 359 |
|
360 | 360 | assert_no_direct_nested_kind(&new_root, SyntaxKind::from_list); |
361 | 361 | } |
|
365 | 365 | let input = |
366 | 366 | "select t.a, t.b.c, t1.*, a[1], a[4][5], a[2:5], a[3].b, a[3][4].b, a[3:5].b;"; |
367 | 367 | let root = cst::parse(input).unwrap(); |
368 | | - let (new_root, _) = get_ts_tree_and_range_map(&input, &root); |
| 368 | + let (new_root, _) = get_ts_tree_and_range_map(input, &root); |
369 | 369 |
|
370 | 370 | assert_no_direct_nested_kind(&new_root, SyntaxKind::indirection); |
371 | 371 | } |
|
374 | 374 | fn no_nested_expr_list() { |
375 | 375 | let input = "select a from t where a in (1,2,3);"; |
376 | 376 | let root = cst::parse(input).unwrap(); |
377 | | - let (new_root, _) = get_ts_tree_and_range_map(&input, &root); |
| 377 | + let (new_root, _) = get_ts_tree_and_range_map(input, &root); |
378 | 378 |
|
379 | 379 | assert_no_direct_nested_kind(&new_root, SyntaxKind::expr_list); |
380 | 380 | } |
|
383 | 383 | fn no_nested_func_arg_list() { |
384 | 384 | let input = "select func(1, 2, func2(3, 4), 5);"; |
385 | 385 | let root = cst::parse(input).unwrap(); |
386 | | - let (new_root, _) = get_ts_tree_and_range_map(&input, &root); |
| 386 | + let (new_root, _) = get_ts_tree_and_range_map(input, &root); |
387 | 387 |
|
388 | 388 | assert_no_direct_nested_kind(&new_root, SyntaxKind::func_arg_list); |
389 | 389 | } |
|
392 | 392 | fn no_nested_when_clause_list() { |
393 | 393 | let input = "select case when a then b when c then d when e then f else g end;"; |
394 | 394 | let root = cst::parse(input).unwrap(); |
395 | | - let (new_root, _) = get_ts_tree_and_range_map(&input, &root); |
| 395 | + let (new_root, _) = get_ts_tree_and_range_map(input, &root); |
396 | 396 |
|
397 | 397 | assert_no_direct_nested_kind(&new_root, SyntaxKind::when_clause_list); |
398 | 398 | } |
|
401 | 401 | fn no_nested_sortby_list() { |
402 | 402 | let input = "select * from t order by a, b, c;"; |
403 | 403 | let root = cst::parse(input).unwrap(); |
404 | | - let (new_root, _) = get_ts_tree_and_range_map(&input, &root); |
| 404 | + let (new_root, _) = get_ts_tree_and_range_map(input, &root); |
405 | 405 |
|
406 | 406 | assert_no_direct_nested_kind(&new_root, SyntaxKind::sortby_list); |
407 | 407 | } |
|
410 | 410 | fn no_nested_groupby_list() { |
411 | 411 | let input = "select a, b, c from t group by a, b, c;"; |
412 | 412 | let root = cst::parse(input).unwrap(); |
413 | | - let (new_root, _) = get_ts_tree_and_range_map(&input, &root); |
| 413 | + let (new_root, _) = get_ts_tree_and_range_map(input, &root); |
414 | 414 |
|
415 | 415 | assert_no_direct_nested_kind(&new_root, SyntaxKind::group_by_list); |
416 | 416 | } |
|
419 | 419 | fn no_nested_for_locking_items() { |
420 | 420 | let input = "select * from t1, t2 for update of t1 for update of t2;"; |
421 | 421 | let root = cst::parse(input).unwrap(); |
422 | | - let (new_root, _) = get_ts_tree_and_range_map(&input, &root); |
| 422 | + let (new_root, _) = get_ts_tree_and_range_map(input, &root); |
423 | 423 |
|
424 | 424 | assert_no_direct_nested_kind(&new_root, SyntaxKind::for_locking_items); |
425 | 425 | } |
|
428 | 428 | fn no_nested_qualified_name_list() { |
429 | 429 | let input = "select a from t for update of t.a, t.b;"; |
430 | 430 | let root = cst::parse(input).unwrap(); |
431 | | - let (new_root, _) = get_ts_tree_and_range_map(&input, &root); |
| 431 | + let (new_root, _) = get_ts_tree_and_range_map(input, &root); |
432 | 432 |
|
433 | 433 | assert_no_direct_nested_kind(&new_root, SyntaxKind::qualified_name_list); |
434 | 434 | } |
|
437 | 437 | fn no_nested_cte_list() { |
438 | 438 | let input = "with a as (select 1), b as (select 2) select * from a, b;"; |
439 | 439 | let root = cst::parse(input).unwrap(); |
440 | | - let (new_root, _) = get_ts_tree_and_range_map(&input, &root); |
| 440 | + let (new_root, _) = get_ts_tree_and_range_map(input, &root); |
441 | 441 |
|
442 | 442 | assert_no_direct_nested_kind(&new_root, SyntaxKind::cte_list); |
443 | 443 | } |
|
446 | 446 | fn no_nested_name_list() { |
447 | 447 | let input = "with t (a, b) as (select 1) select * from t;"; |
448 | 448 | let root = cst::parse(input).unwrap(); |
449 | | - let (new_root, _) = get_ts_tree_and_range_map(&input, &root); |
| 449 | + let (new_root, _) = get_ts_tree_and_range_map(input, &root); |
450 | 450 |
|
451 | 451 | assert_no_direct_nested_kind(&new_root, SyntaxKind::name_list); |
452 | 452 | } |
|
455 | 455 | fn no_nested_set_clause_list() { |
456 | 456 | let input = "update t set a = 1, b = 2, c = 3;"; |
457 | 457 | let root = cst::parse(input).unwrap(); |
458 | | - let (new_root, _) = get_ts_tree_and_range_map(&input, &root); |
| 458 | + let (new_root, _) = get_ts_tree_and_range_map(input, &root); |
459 | 459 |
|
460 | 460 | assert_no_direct_nested_kind(&new_root, SyntaxKind::set_clause_list); |
461 | 461 | } |
|
464 | 464 | fn no_nested_set_target_list() { |
465 | 465 | let input = "update t set (a, b, c) = (1, 2, 3) where id = 1;"; |
466 | 466 | let root = cst::parse(input).unwrap(); |
467 | | - let (new_root, _) = get_ts_tree_and_range_map(&input, &root); |
| 467 | + let (new_root, _) = get_ts_tree_and_range_map(input, &root); |
468 | 468 |
|
469 | 469 | assert_no_direct_nested_kind(&new_root, SyntaxKind::set_target_list); |
470 | 470 | } |
|
473 | 473 | fn no_nested_insert_column_list() { |
474 | 474 | let input = "insert into t (a, b, c) values (1, 2, 3);"; |
475 | 475 | let root = cst::parse(input).unwrap(); |
476 | | - let (new_root, _) = get_ts_tree_and_range_map(&input, &root); |
| 476 | + let (new_root, _) = get_ts_tree_and_range_map(input, &root); |
477 | 477 |
|
478 | 478 | assert_no_direct_nested_kind(&new_root, SyntaxKind::insert_column_list); |
479 | 479 | } |
|
482 | 482 | fn no_nested_index_params() { |
483 | 483 | let input = "insert into t (a, b, c) values (1, 2, 3) on conflict (a, b) do nothing;"; |
484 | 484 | let root = cst::parse(input).unwrap(); |
485 | | - let (new_root, _) = get_ts_tree_and_range_map(&input, &root); |
| 485 | + let (new_root, _) = get_ts_tree_and_range_map(input, &root); |
486 | 486 |
|
487 | 487 | assert_no_direct_nested_kind(&new_root, SyntaxKind::index_params); |
488 | 488 | } |
|
491 | 491 | fn no_nested_values_clause() { |
492 | 492 | let input = "values (1,2,3), (4,5,6), (7,8,9);"; |
493 | 493 | let root = cst::parse(input).unwrap(); |
494 | | - let (new_root, _) = get_ts_tree_and_range_map(&input, &root); |
| 494 | + let (new_root, _) = get_ts_tree_and_range_map(input, &root); |
495 | 495 |
|
496 | 496 | assert_no_direct_nested_kind(&new_root, SyntaxKind::values_clause); |
497 | 497 | } |
|
0 commit comments