()
| 2831 | } |
| 2832 | |
| 2833 | function peg$parseNonEmptyQuerySegment() { |
| 2834 | let s0, s1, s2, s3, s4, s5, s6, s7, s8, s9; |
| 2835 | |
| 2836 | s0 = peg$currPos; |
| 2837 | s1 = []; |
| 2838 | s2 = peg$parseMatchClauseWithWhere(); |
| 2839 | if (s2 !== peg$FAILED) { |
| 2840 | while (s2 !== peg$FAILED) { |
| 2841 | s1.push(s2); |
| 2842 | s2 = peg$parseMatchClauseWithWhere(); |
| 2843 | } |
| 2844 | } else { |
| 2845 | s1 = peg$FAILED; |
| 2846 | } |
| 2847 | if (s1 !== peg$FAILED) { |
| 2848 | s2 = []; |
| 2849 | s3 = peg$parseUnwindClause(); |
| 2850 | while (s3 !== peg$FAILED) { |
| 2851 | s2.push(s3); |
| 2852 | s3 = peg$parseUnwindClause(); |
| 2853 | } |
| 2854 | s3 = []; |
| 2855 | s4 = peg$parseCallClause(); |
| 2856 | while (s4 !== peg$FAILED) { |
| 2857 | s3.push(s4); |
| 2858 | s4 = peg$parseCallClause(); |
| 2859 | } |
| 2860 | s4 = []; |
| 2861 | s5 = peg$parseForeachClause(); |
| 2862 | while (s5 !== peg$FAILED) { |
| 2863 | s4.push(s5); |
| 2864 | s5 = peg$parseForeachClause(); |
| 2865 | } |
| 2866 | s5 = []; |
| 2867 | s6 = peg$parseMutationClause(); |
| 2868 | while (s6 !== peg$FAILED) { |
| 2869 | s5.push(s6); |
| 2870 | s6 = peg$parseMutationClause(); |
| 2871 | } |
| 2872 | s6 = peg$parseSetClause(); |
| 2873 | if (s6 === peg$FAILED) { |
| 2874 | s6 = null; |
| 2875 | } |
| 2876 | s7 = peg$parseRemoveClause(); |
| 2877 | if (s7 === peg$FAILED) { |
| 2878 | s7 = null; |
| 2879 | } |
| 2880 | s8 = peg$parseDeleteClause(); |
| 2881 | if (s8 === peg$FAILED) { |
| 2882 | s8 = null; |
| 2883 | } |
| 2884 | s9 = peg$parseWithClause(); |
| 2885 | if (s9 === peg$FAILED) { |
| 2886 | s9 = null; |
| 2887 | } |
| 2888 | peg$savedPos = s0; |
| 2889 | s0 = peg$f8(s1, s2, s3, s4, s5, s6, s7, s8, s9); |
| 2890 | } else { |
no test coverage detected