MCPcopy Create free account
hub / github.com/codemix/graph / peg$parseCreateNodePattern

Function peg$parseCreateNodePattern

packages/graph/src/grammar.js:3865–3912  ·  view source on GitHub ↗
()

Source from the content-addressed store, hash-verified

3863 }
3864
3865 function peg$parseCreateNodePattern() {
3866 let s0, s1, s2, s3, s4, s5, s6, s7, s8;
3867
3868 s0 = peg$currPos;
3869 if (input.charCodeAt(peg$currPos) === 40) {
3870 s1 = peg$c4;
3871 peg$currPos++;
3872 } else {
3873 s1 = peg$FAILED;
3874 if (peg$silentFails === 0) { peg$fail(peg$e4); }
3875 }
3876 if (s1 !== peg$FAILED) {
3877 s2 = peg$parse_();
3878 s3 = peg$parseIdentifier();
3879 if (s3 === peg$FAILED) {
3880 s3 = null;
3881 }
3882 s4 = peg$parseNodeLabels();
3883 if (s4 === peg$FAILED) {
3884 s4 = null;
3885 }
3886 s5 = peg$parse_();
3887 s6 = peg$parsePropertyMap();
3888 if (s6 === peg$FAILED) {
3889 s6 = null;
3890 }
3891 s7 = peg$parse_();
3892 if (input.charCodeAt(peg$currPos) === 41) {
3893 s8 = peg$c5;
3894 peg$currPos++;
3895 } else {
3896 s8 = peg$FAILED;
3897 if (peg$silentFails === 0) { peg$fail(peg$e5); }
3898 }
3899 if (s8 !== peg$FAILED) {
3900 peg$savedPos = s0;
3901 s0 = peg$f33(s3, s4, s6);
3902 } else {
3903 peg$currPos = s0;
3904 s0 = peg$FAILED;
3905 }
3906 } else {
3907 peg$currPos = s0;
3908 s0 = peg$FAILED;
3909 }
3910
3911 return s0;
3912 }
3913
3914 function peg$parseCreateChainPattern() {
3915 let s0, s1, s2, s3, s4;

Callers 1

peg$parseCreatePatternFunction · 0.85

Calls 6

peg$failFunction · 0.85
peg$parse_Function · 0.85
peg$parseIdentifierFunction · 0.85
peg$parseNodeLabelsFunction · 0.85
peg$parsePropertyMapFunction · 0.85
peg$f33Function · 0.85

Tested by

no test coverage detected