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

Function peg$parseMIN

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

Source from the content-addressed store, hash-verified

14137 }
14138
14139 function peg$parseMIN() {
14140 let s0, s1, s2, s3;
14141
14142 s0 = peg$currPos;
14143 s1 = input.substr(peg$currPos, 3);
14144 if (s1.toLowerCase() === peg$c43) {
14145 peg$currPos += (3);
14146 } else {
14147 s1 = peg$FAILED;
14148 if (peg$silentFails === 0) { peg$fail(peg$e48); }
14149 }
14150 if (s1 !== peg$FAILED) {
14151 s2 = peg$currPos;
14152 peg$silentFails++;
14153 s3 = peg$parseIdentifierPart();
14154 peg$silentFails--;
14155 if (s3 === peg$FAILED) {
14156 s2 = undefined;
14157 } else {
14158 peg$currPos = s2;
14159 s2 = peg$FAILED;
14160 }
14161 if (s2 !== peg$FAILED) {
14162 s1 = [s1, s2];
14163 s0 = s1;
14164 } else {
14165 peg$currPos = s0;
14166 s0 = peg$FAILED;
14167 }
14168 } else {
14169 peg$currPos = s0;
14170 s0 = peg$FAILED;
14171 }
14172
14173 return s0;
14174 }
14175
14176 function peg$parseMAX() {
14177 let s0, s1, s2, s3;

Callers 3

peg$parseWithExpressionFunction · 0.85
peg$parseReturnItemFunction · 0.85
peg$parseKeywordFunction · 0.85

Calls 2

peg$failFunction · 0.85
peg$parseIdentifierPartFunction · 0.85

Tested by

no test coverage detected