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

Function peg$parseCONTAINS

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

Source from the content-addressed store, hash-verified

15432 }
15433
15434 function peg$parseCONTAINS() {
15435 let s0, s1, s2, s3;
15436
15437 s0 = peg$currPos;
15438 s1 = input.substr(peg$currPos, 8);
15439 if (s1.toLowerCase() === peg$c78) {
15440 peg$currPos += (8);
15441 } else {
15442 s1 = peg$FAILED;
15443 if (peg$silentFails === 0) { peg$fail(peg$e83); }
15444 }
15445 if (s1 !== peg$FAILED) {
15446 s2 = peg$currPos;
15447 peg$silentFails++;
15448 s3 = peg$parseIdentifierPart();
15449 peg$silentFails--;
15450 if (s3 === peg$FAILED) {
15451 s2 = undefined;
15452 } else {
15453 peg$currPos = s2;
15454 s2 = peg$FAILED;
15455 }
15456 if (s2 !== peg$FAILED) {
15457 s1 = [s1, s2];
15458 s0 = s1;
15459 } else {
15460 peg$currPos = s0;
15461 s0 = peg$FAILED;
15462 }
15463 } else {
15464 peg$currPos = s0;
15465 s0 = peg$FAILED;
15466 }
15467
15468 return s0;
15469 }
15470
15471 function peg$parseFOREACH() {
15472 let s0, s1, s2, s3;

Callers 3

peg$parseKeywordFunction · 0.85

Calls 2

peg$failFunction · 0.85
peg$parseIdentifierPartFunction · 0.85

Tested by

no test coverage detected