sugary/LarpixClient
1
0
Fork 0
forked from olcxjas-softworks/LarpixClient
Code Pull requests Activity

Add capacitorjs runtime

Browse source
This commit is contained in:
olcxja 2026-05-03 17:09:55 +02:00
commit f90c0e6c40
8362 changed files with 1502407 additions and 1 deletions
Download patch file Download diff file Expand all files Collapse all files

201
node_modules/gradle-to-js/LICENSE generated vendored Normal file
View file

@ -0,0 +1,201 @@
Apache License
Version 2.0, January 2004
http://www.apache.org/licenses/
TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
1. Definitions.
"License" shall mean the terms and conditions for use, reproduction,
and distribution as defined by Sections 1 through 9 of this document.
"Licensor" shall mean the copyright owner or entity authorized by
the copyright owner that is granting the License.
"Legal Entity" shall mean the union of the acting entity and all
other entities that control, are controlled by, or are under common
control with that entity. For the purposes of this definition,
"control" means (i) the power, direct or indirect, to cause the
direction or management of such entity, whether by contract or
otherwise, or (ii) ownership of fifty percent (50%) or more of the
outstanding shares, or (iii) beneficial ownership of such entity.
"You" (or "Your") shall mean an individual or Legal Entity
exercising permissions granted by this License.
"Source" form shall mean the preferred form for making modifications,
including but not limited to software source code, documentation
source, and configuration files.
"Object" form shall mean any form resulting from mechanical
transformation or translation of a Source form, including but
not limited to compiled object code, generated documentation,
and conversions to other media types.
"Work" shall mean the work of authorship, whether in Source or
Object form, made available under the License, as indicated by a
copyright notice that is included in or attached to the work
(an example is provided in the Appendix below).
"Derivative Works" shall mean any work, whether in Source or Object
form, that is based on (or derived from) the Work and for which the
editorial revisions, annotations, elaborations, or other modifications
represent, as a whole, an original work of authorship. For the purposes
of this License, Derivative Works shall not include works that remain
separable from, or merely link (or bind by name) to the interfaces of,
the Work and Derivative Works thereof.
"Contribution" shall mean any work of authorship, including
the original version of the Work and any modifications or additions
to that Work or Derivative Works thereof, that is intentionally
submitted to Licensor for inclusion in the Work by the copyright owner
or by an individual or Legal Entity authorized to submit on behalf of
the copyright owner. For the purposes of this definition, "submitted"
means any form of electronic, verbal, or written communication sent
to the Licensor or its representatives, including but not limited to
communication on electronic mailing lists, source code control systems,
and issue tracking systems that are managed by, or on behalf of, the
Licensor for the purpose of discussing and improving the Work, but
excluding communication that is conspicuously marked or otherwise
designated in writing by the copyright owner as "Not a Contribution."
"Contributor" shall mean Licensor and any individual or Legal Entity
on behalf of whom a Contribution has been received by Licensor and
subsequently incorporated within the Work.
2. Grant of Copyright License. Subject to the terms and conditions of
this License, each Contributor hereby grants to You a perpetual,
worldwide, non-exclusive, no-charge, royalty-free, irrevocable
copyright license to reproduce, prepare Derivative Works of,
publicly display, publicly perform, sublicense, and distribute the
Work and such Derivative Works in Source or Object form.
3. Grant of Patent License. Subject to the terms and conditions of
this License, each Contributor hereby grants to You a perpetual,
worldwide, non-exclusive, no-charge, royalty-free, irrevocable
(except as stated in this section) patent license to make, have made,
use, offer to sell, sell, import, and otherwise transfer the Work,
where such license applies only to those patent claims licensable
by such Contributor that are necessarily infringed by their
Contribution(s) alone or by combination of their Contribution(s)
with the Work to which such Contribution(s) was submitted. If You
institute patent litigation against any entity (including a
cross-claim or counterclaim in a lawsuit) alleging that the Work
or a Contribution incorporated within the Work constitutes direct
or contributory patent infringement, then any patent licenses
granted to You under this License for that Work shall terminate
as of the date such litigation is filed.
4. Redistribution. You may reproduce and distribute copies of the
Work or Derivative Works thereof in any medium, with or without
modifications, and in Source or Object form, provided that You
meet the following conditions:
(a) You must give any other recipients of the Work or
Derivative Works a copy of this License; and
(b) You must cause any modified files to carry prominent notices
stating that You changed the files; and
(c) You must retain, in the Source form of any Derivative Works
that You distribute, all copyright, patent, trademark, and
attribution notices from the Source form of the Work,
excluding those notices that do not pertain to any part of
the Derivative Works; and
(d) If the Work includes a "NOTICE" text file as part of its
distribution, then any Derivative Works that You distribute must
include a readable copy of the attribution notices contained
within such NOTICE file, excluding those notices that do not
pertain to any part of the Derivative Works, in at least one
of the following places: within a NOTICE text file distributed
as part of the Derivative Works; within the Source form or
documentation, if provided along with the Derivative Works; or,
within a display generated by the Derivative Works, if and
wherever such third-party notices normally appear. The contents
of the NOTICE file are for informational purposes only and
do not modify the License. You may add Your own attribution
notices within Derivative Works that You distribute, alongside
or as an addendum to the NOTICE text from the Work, provided
that such additional attribution notices cannot be construed
as modifying the License.
You may add Your own copyright statement to Your modifications and
may provide additional or different license terms and conditions
for use, reproduction, or distribution of Your modifications, or
for any such Derivative Works as a whole, provided Your use,
reproduction, and distribution of the Work otherwise complies with
the conditions stated in this License.
5. Submission of Contributions. Unless You explicitly state otherwise,
any Contribution intentionally submitted for inclusion in the Work
by You to the Licensor shall be under the terms and conditions of
this License, without any additional terms or conditions.
Notwithstanding the above, nothing herein shall supersede or modify
the terms of any separate license agreement you may have executed
with Licensor regarding such Contributions.
6. Trademarks. This License does not grant permission to use the trade
names, trademarks, service marks, or product names of the Licensor,
except as required for reasonable and customary use in describing the
origin of the Work and reproducing the content of the NOTICE file.
7. Disclaimer of Warranty. Unless required by applicable law or
agreed to in writing, Licensor provides the Work (and each
Contributor provides its Contributions) on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
implied, including, without limitation, any warranties or conditions
of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
PARTICULAR PURPOSE. You are solely responsible for determining the
appropriateness of using or redistributing the Work and assume any
risks associated with Your exercise of permissions under this License.
8. Limitation of Liability. In no event and under no legal theory,
whether in tort (including negligence), contract, or otherwise,
unless required by applicable law (such as deliberate and grossly
negligent acts) or agreed to in writing, shall any Contributor be
liable to You for damages, including any direct, indirect, special,
incidental, or consequential damages of any character arising as a
result of this License or out of the use or inability to use the
Work (including but not limited to damages for loss of goodwill,
work stoppage, computer failure or malfunction, or any and all
other commercial damages or losses), even if such Contributor
has been advised of the possibility of such damages.
9. Accepting Warranty or Additional Liability. While redistributing
the Work or Derivative Works thereof, You may choose to offer,
and charge a fee for, acceptance of support, warranty, indemnity,
or other liability obligations and/or rights consistent with this
License. However, in accepting such obligations, You may act only
on Your own behalf and on Your sole responsibility, not on behalf
of any other Contributor, and only if You agree to indemnify,
defend, and hold each Contributor harmless for any liability
incurred by, or claims asserted against, such Contributor by reason
of your accepting any such warranty or additional liability.
END OF TERMS AND CONDITIONS
APPENDIX: How to apply the Apache License to your work.
To apply the Apache License to your work, attach the following
boilerplate notice, with the fields enclosed by brackets "{}"
replaced with your own identifying information. (Don't include
the brackets!) The text should be enclosed in the appropriate
comment syntax for the file format. We also recommend that a
file or class name and description of purpose be included on the
same "printed page" as the copyright notice for easier
identification within third-party archives.
Copyright {yyyy} {name of copyright owner}
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.

82
node_modules/gradle-to-js/README.md generated vendored Normal file
View file

@ -0,0 +1,82 @@
# gradle-to-js
[![NPM Version](https://img.shields.io/npm/v/gradle-to-js.svg)](https://www.npmjs.com/package/gradle-to-js)
[![Build Status][1]][2]
## What's this `gradle-to-js` thing?
gradle-to-js is a quick & dirty Gradle build file to JavaScript object parser. It is quick & dirty in the sense that it doesn't give you an exact replica of whatever the build file represents during runtime, as evaluations and similar bits are (currently) too much of a hassle to accurately represent while parsing.
## Installation
Simply run the following command to include it into your project:
```sh
npm install gradle-to-js --save
```
## Usage
### As a module
Using `gradle-to-js` as a module, you can parse both strings and files as seen below.
#### Files
```js
var g2js = require('gradle-to-js/lib/parser');
g2js.parseFile('path/to/buildfile').then(function(representation) {
console.log(representation);
});
```
#### Strings
```js
var g2js = require('gradle-to-js/lib/parser');
g2js.parseText('key "value"').then(function(representation) {
console.log(representation);
});
```
The promise will eventually resolve an object matching the build file structure and values.
### Using the CLI
You can also use the module directly from the CLI, and get a json representation out of it. Nifty ey? Currently only supporting files from this direction.
```bash
./index.js test/sample-data/small.build.gradle
```
```json
{
"testblock": {
"key1": "value1",
"key2": "value2",
"nestedKey": {
"key3": "value3",
"key4": "value4",
"key5": {
"key6": "value6"
}
}
},
"testblock2": {
"key1": "value1",
"key2": "value2"
},
"testblock3": "not really"
}
```
## Author
[Karl Lindmark](https://www.github.com/karllindmark)
## License
Apache 2.0
[1]: https://github.com/ninetwozero/gradle-to-js/workflows/ci/badge.svg
[2]: https://github.com/ninetwozero/gradle-to-js/actions

17
node_modules/gradle-to-js/cli.js generated vendored Executable file
View file

@ -0,0 +1,17 @@
#!/usr/bin/env node
'use strict';
var fs = require('fs');
var parser = require('./lib/parser');
var path = process.argv.slice(2).join('');
if (!path) {
console.error('No input detected');
return;
}
if (fs.statSync(path)) {
parser.parseFile(path).then(function(parsedValue) {
console.log(JSON.stringify(parsedValue, '', 2));
});
}

674
node_modules/gradle-to-js/lib/parser.js generated vendored Normal file
View file

@ -0,0 +1,674 @@
/* jshint node: true */
'use strict';
var stream = require('stream');
var fs = require('fs');
var deepAssign = require('lodash.merge')
var exports = module.exports = {};
var CHAR_TAB = 9;
var CHAR_NEWLINE = 10;
var CHAR_CARRIAGE_RETURN = 13;
var CHAR_SPACE = 32;
var CHAR_LEFT_PARENTHESIS = 40;
var CHAR_RIGHT_PARENTHESIS = 41;
var CHAR_PERIOD = 46;
var CHAR_SLASH = 47;
var CHAR_EQUALS = 61;
var CHAR_ARRAY_START = 91;
var CHAR_ARRAY_END = 93;
var CHAR_BLOCK_START = 123;
var CHAR_BLOCK_END = 125;
var KEYWORD_DEF = 'def';
var KEYWORD_IF = 'if';
var WHITESPACE_CHARACTERS = {};
WHITESPACE_CHARACTERS[CHAR_TAB] = true;
WHITESPACE_CHARACTERS[CHAR_NEWLINE] = true;
WHITESPACE_CHARACTERS[CHAR_CARRIAGE_RETURN] = true;
WHITESPACE_CHARACTERS[CHAR_SPACE] = true;
var SINGLE_LINE_COMMENT_START = '//';
var BLOCK_COMMENT_START = '/*';
var BLOCK_COMMENT_END = '*/';
var SPECIAL_KEYS = {
repositories: parseRepositoryClosure,
dependencies: parseDependencyClosure,
plugins: parsePluginsClosure
};
var DEPS_KEYWORD_STRING_PATTERN = '[ \\t]*([A-Za-z0-9_-]+)[ \\t]*';
var DEPS_KEYWORD_STRING_REGEX = RegExp(DEPS_KEYWORD_STRING_PATTERN);
var DEPS_EASY_GAV_STRING_REGEX = RegExp('(["\']?)([\\w.-]+):([\\w.-]+):([\\w\\[\\]\\(\\),+.-]+)\\1');
var DEPS_HARD_GAV_STRING_REGEX = RegExp(DEPS_KEYWORD_STRING_PATTERN + '(?:\\((.*)\\)|(.*))');
var DEPS_ITEM_BLOCK_REGEX = RegExp(DEPS_KEYWORD_STRING_PATTERN + '\\(((["\']?)(.*)\\3)\\)[ \\t]*\\{');
var DEPS_EXCLUDE_LINE_REGEX = RegExp('exclude[ \\t]+([^\\n]+)', 'g');
var PLUGINS_LINE_PATTERN = RegExp('(id|version)[ \\t]*\\(?(["\']?)([A-Za-z0-9._-]+)\\2\\)?', 'g');
function deepParse(chunk, state, keepFunctionCalls, skipEmptyValues) {
var out = {};
var chunkLength = chunk.length;
var character = 0;
var tempString = '';
var commentText = '';
var currentKey = '';
var parsingKey = true;
var isBeginningOfLine = true;
if (typeof skipEmptyValues === 'undefined') {
skipEmptyValues = true;
}
for (; state.index < chunkLength; state.index++) {
character = chunk[state.index];
if (isBeginningOfLine && isWhitespace(character)) {
continue;
}
if (!state.comment.parsing && isBeginningOfLine && isStartOfComment(tempString)) {
isBeginningOfLine = false;
if (isSingleLineComment(tempString)) {
state.comment.setSingleLine();
} else {
state.comment.setMultiLine();
}
continue;
}
if (state.comment.multiLine && isEndOfMultiLineComment(commentText)) {
state.comment.reset();
isBeginningOfLine = true;
tempString = '';
commentText = '';
continue;
}
if (state.comment.parsing && character != CHAR_NEWLINE) {
commentText += String.fromCharCode(character);
continue;
}
if (state.comment.parsing && isLineBreakCharacter(character)) {
if (state.comment.singleLine) {
state.comment.reset();
isBeginningOfLine = true;
currentKey = '';
tempString = '';
commentText = '';
continue;
} else {
// NO-OP
continue;
}
}
if (parsingKey && !keepFunctionCalls && character === CHAR_LEFT_PARENTHESIS) {
skipFunctionCall(chunk, state);
currentKey = '';
tempString = '';
isBeginningOfLine = true;
continue;
}
if (isLineBreakCharacter(character)) {
if (!currentKey && tempString) {
if (parsingKey) {
if (isFunctionCall(tempString) && !keepFunctionCalls) {
continue;
} else {
currentKey = tempString.trim();
tempString = '';
}
}
}
if (tempString || (currentKey && !skipEmptyValues)) {
addValueToStructure(out, currentKey, trimWrappingQuotes(tempString));
currentKey = '';
tempString = '';
}
parsingKey = true;
isBeginningOfLine = true;
state.comment.reset();
continue;
}
// Only parse as an array if the first *real* char is a [
if (!parsingKey && !tempString && character === CHAR_ARRAY_START) {
out[currentKey] = parseArray(chunk, state);
currentKey = '';
tempString = '';
continue;
}
if (character === CHAR_BLOCK_START) {
// We need to skip the current (=start) character so that we literally "step into" the next closure/block
state.index++;
if (SPECIAL_KEYS.hasOwnProperty(currentKey)) {
out[currentKey] = SPECIAL_KEYS[currentKey](chunk, state);
} else if (out[currentKey]) {
out[currentKey] = deepAssign({}, out[currentKey], deepParse(chunk, state, keepFunctionCalls, skipEmptyValues));
} else {
out[currentKey] = deepParse(chunk, state, keepFunctionCalls, skipEmptyValues);
}
currentKey = '';
} else if (character === CHAR_BLOCK_END) {
currentKey = '';
tempString = '';
break;
} else if (isDelimiter(character) && parsingKey) {
if (isKeyword(tempString)) {
if (tempString === KEYWORD_DEF) {
tempString = fetchDefinedNameOrSkipFunctionDefinition(chunk, state);
} else if (tempString === KEYWORD_IF) {
skipIfStatement(chunk, state);
currentKey = '';
tempString = '';
continue;
}
}
currentKey = tempString;
tempString = '';
parsingKey = false;
if (!currentKey) {
continue;
}
} else {
if (!tempString && isDelimiter(character)) {
continue;
}
tempString += String.fromCharCode(character);
isBeginningOfLine = isBeginningOfLine && (character === CHAR_SLASH || isStartOfComment(tempString));
}
}
// Add the last value to the structure
addValueToStructure(out, currentKey, trimWrappingQuotes(tempString));
return out;
}
function skipIfStatement(chunk, state) {
skipFunctionCall(chunk, state);
var character = '';
var hasFoundTheCurlyBraces = false;
var hasFoundAStatementWithoutBraces = false;
var curlyBraceCount = 0;
for (var max = chunk.length; state.index < max; state.index++) {
character = chunk[state.index];
if (hasFoundAStatementWithoutBraces) {
if (isLineBreakCharacter(character)) {
break;
}
} else {
if (character === CHAR_BLOCK_START) {
hasFoundTheCurlyBraces = true;
curlyBraceCount++;
} else if (character === CHAR_BLOCK_END) {
curlyBraceCount--;
} else if (!hasFoundTheCurlyBraces && !isWhitespace(character)) {
hasFoundAStatementWithoutBraces = true;
}
if ((hasFoundTheCurlyBraces && curlyBraceCount === 0)) {
break;
}
}
}
return curlyBraceCount === 0;
}
function skipFunctionDefinition(chunk, state) {
var start = state.index;
var parenthesisNest = 1;
var character = chunk[++state.index];
while (character !== undefined && parenthesisNest) {
if (character === CHAR_LEFT_PARENTHESIS) {
parenthesisNest++;
} else if (character === CHAR_RIGHT_PARENTHESIS) {
parenthesisNest--;
}
character = chunk[++state.index];
}
while (character && character !== CHAR_BLOCK_START) {
character = chunk[++state.index];
}
character = chunk[++state.index];
var blockNest = 1;
while (character !== undefined && blockNest) {
if (character === CHAR_BLOCK_START) {
blockNest++;
} else if (character === CHAR_BLOCK_END) {
blockNest--;
}
character = chunk[++state.index];
}
state.index--;
}
function parseDependencyClosure(chunk, state) {
return parseSpecialClosure(chunk, state, createStructureForDependencyItem);
}
function createStructureForDependencyItem(data) {
var out = { group: '', name: '', version: '', type: '' };
var compileBlockInfo = findDependencyItemBlock(data);
if (compileBlockInfo['gav']) {
out = parseGavString(compileBlockInfo['gav']);
out['type'] = compileBlockInfo['type'];
out['excludes'] = compileBlockInfo['excludes'];
} else {
out = parseGavString(data);
var parsed = DEPS_KEYWORD_STRING_REGEX.exec(data);
out['type'] = (parsed && parsed[1]) || '';
out['excludes'] = [];
}
return out;
}
function parsePluginsClosure(chunk, state) {
return parseSpecialClosure(chunk, state, createStructureForPlugin);
}
function createStructureForPlugin(pluginRow) {
var out = {};
var match;
while(match = PLUGINS_LINE_PATTERN.exec(pluginRow)) {
if (match && match[1]) {
out[match[1]] = match[3];
}
}
return out;
}
function findFirstSpaceOrTabPosition(input) {
var position = input.indexOf(' ');
if (position === -1) {
position = input.indexOf('\t');
}
return position;
}
function findDependencyItemBlock(data) {
var matches = DEPS_ITEM_BLOCK_REGEX.exec(data);
if (matches && matches[2]) {
var excludes = [];
var match;
while((match = DEPS_EXCLUDE_LINE_REGEX.exec(data))) {
excludes.push(parseMapNotation(match[0].substring(findFirstSpaceOrTabPosition(match[0]))));
}
return { gav: matches[2], type: matches[1], excludes: excludes };
}
return [];
}
function parseGavString(gavString) {
var out = { group: '', name: '', version: '' };
var easyGavStringMatches = DEPS_EASY_GAV_STRING_REGEX.exec(gavString);
if (easyGavStringMatches) {
out['group'] = easyGavStringMatches[2];
out['name'] = easyGavStringMatches[3];
out['version'] = easyGavStringMatches[4];
} else if (gavString.indexOf('project(') !== -1) {
out['name'] = gavString.match(/(project\([^\)]+\))/g)[0];
} else {
var hardGavMatches = DEPS_HARD_GAV_STRING_REGEX.exec(gavString);
if (hardGavMatches && (hardGavMatches[3] || hardGavMatches[2])) {
out = parseMapNotationWithFallback(out, hardGavMatches[3] || hardGavMatches[2]);
} else {
out = parseMapNotationWithFallback(out, gavString, gavString.slice(findFirstSpaceOrTabPosition(gavString)));
}
}
return out;
}
function parseMapNotationWithFallback(out, string, name) {
var outFromMapNotation = parseMapNotation(string);
if (outFromMapNotation['name']) {
out = outFromMapNotation;
} else {
out['name'] = name ? name : string;
}
return out;
}
function parseMapNotation(input) {
var out = {};
var currentKey = '';
var quotation = '';
for (var i = 0, max = input.length; i < max; i++) {
if (input[i] === ':') {
currentKey = currentKey.trim();
out[currentKey] = '';
for (var innerLoop = 0, i = i + 1; i < max; i++) {
if (innerLoop === 0) {
// Skip any leading spaces before the actual value
if (isWhitespaceLiteral(input[i])) {
continue;
}
}
// We just take note of what the "latest" quote was so that we can
if (input[i] === '"' || input[i] === "'") {
quotation = input[i];
continue;
}
// Moving on to the next value if we find a comma
if (input[i] === ',') {
out[currentKey] = out[currentKey].trim();
currentKey = '';
break;
}
out[currentKey] += input[i];
innerLoop++;
}
} else {
currentKey += input[i];
}
}
// If the last character contains a quotation mark, we remove it
if (out[currentKey]) {
out[currentKey] = out[currentKey].trim();
if (out[currentKey].slice(-1) === quotation) {
out[currentKey] = out[currentKey].slice(0, -1);
}
}
return out;
}
function parseRepositoryClosure(chunk, state) {
var out = [];
var repository = deepParse(chunk, state, true, false);
Object.keys(repository).map(function(item) {
if (repository[item]) {
out.push({type: item, data: repository[item]});
} else {
out.push({type: 'unknown', data: {name: item}});
}
});
return out;
}
function parseSpecialClosure(chunk, state, mapFunction) {
var out = [];
// openBlockCount starts at 1 due to us entering after "<key> {"
var openBlockCount = 1;
var currentKey = '';
var currentValue = '';
var isInItemBlock = false;
for (; state.index < chunk.length; state.index++) {
if (chunk[state.index] === CHAR_BLOCK_START) {
openBlockCount++;
} else if (chunk[state.index] === CHAR_BLOCK_END) {
openBlockCount--;
} else {
currentKey += String.fromCharCode(chunk[state.index]);
}
// Keys shouldn't have any leading nor trailing whitespace
currentKey = currentKey.trim();
if (isStartOfComment(currentKey)) {
var commentText = currentKey;
for (state.index = state.index + 1; state.index < chunk.length; state.index++) {
if (isCommentComplete(commentText, chunk[state.index])) {
currentKey = '';
break;
}
commentText += String.fromCharCode(chunk[state.index]);
}
}
if (currentKey && isWhitespace(chunk[state.index])) {
var character = '';
for (state.index = state.index + 1; state.index < chunk.length; state.index++) {
character = chunk[state.index];
currentValue += String.fromCharCode(character);
if (character === CHAR_BLOCK_START) {
isInItemBlock = true;
} else if (isInItemBlock && character === CHAR_BLOCK_END) {
isInItemBlock = false;
} else if (!isInItemBlock) {
if (isLineBreakCharacter(character) && currentValue) {
break;
}
}
}
out.push(mapFunction(currentKey + ' ' + currentValue));
currentKey = '';
currentValue = '';
}
if (openBlockCount == 0) {
break;
}
}
return out;
}
function fetchDefinedNameOrSkipFunctionDefinition(chunk, state) {
var character = 0;
var temp = '';
var isVariableDefinition = true;
for (var max = chunk.length; state.index < max; state.index++) {
character = chunk[state.index];
if (character === CHAR_EQUALS) {
// Variable definition, break and return name
break;
} else if (character === CHAR_LEFT_PARENTHESIS) {
// Function definition, skip parsing
isVariableDefinition = false;
skipFunctionDefinition(chunk, state);
break;
}
temp += String.fromCharCode(character);
}
if (isVariableDefinition) {
var values = temp.trim().split(' ');
return values[values.length - 1];
} else {
return '';
}
}
function parseArray(chunk, state) {
var character = 0;
var temp = '';
for (var max = chunk.length; state.index < max; state.index++) {
character = chunk[state.index];
if (character === CHAR_ARRAY_START) {
continue;
} else if (character === CHAR_ARRAY_END) {
break;
}
temp += String.fromCharCode(character);
}
return temp.split(',').map(function(item) {
return trimWrappingQuotes(item.trim());
});
}
function skipFunctionCall(chunk, state) {
var openParenthesisCount = 0;
var character = '';
for (var max = chunk.length; state.index < max; state.index++) {
character = chunk[state.index];
if (character === CHAR_LEFT_PARENTHESIS) {
openParenthesisCount++;
} else if (character === CHAR_RIGHT_PARENTHESIS) {
openParenthesisCount--;
}
if (openParenthesisCount === 0 && !isWhitespace(character)) {
state.index++;
break;
}
}
return openParenthesisCount === 0;
}
function addValueToStructure(structure, currentKey, value) {
if (currentKey) {
if (structure.hasOwnProperty(currentKey)) {
if (structure[currentKey].constructor === Array) {
structure[currentKey].push(getRealValue(value));
} else {
var oldValue = structure[currentKey];
structure[currentKey] = [oldValue, getRealValue(value)];
}
} else {
structure[currentKey] = getRealValue(value);
}
}
}
function getRealValue(value) {
if (value === 'true' || value === 'false') { // booleans
return value === 'true';
}
return value;
}
function trimWrappingQuotes(string) {
var firstCharacter = string.slice(0, 1);
if (firstCharacter === '"') {
return string.replace(/^"([^"]+)"$/g, '$1');
} else if (firstCharacter === '\'') {
return string.replace(/^'([^']+)'$/g, '$1');
}
return string;
}
function isDelimiter(character) {
return character === CHAR_SPACE || character === CHAR_EQUALS;
}
function isWhitespace(character) {
return WHITESPACE_CHARACTERS.hasOwnProperty(character);
}
function isWhitespaceLiteral(character) {
return isWhitespace(character.charCodeAt(0));
}
function isLineBreakCharacter(character) {
return character == CHAR_CARRIAGE_RETURN || character == CHAR_NEWLINE
}
function isKeyword(string) {
return string === KEYWORD_DEF || string === KEYWORD_IF;
}
function isSingleLineComment(comment) {
return comment.slice(0, 2) === SINGLE_LINE_COMMENT_START;
}
function isStartOfComment(snippet) {
return snippet === BLOCK_COMMENT_START || snippet === SINGLE_LINE_COMMENT_START;
}
function isCommentComplete(text, next) {
return (isLineBreakCharacter(next) && isSingleLineComment(text)) || (isWhitespace(next) && isEndOfMultiLineComment(text));
}
function isEndOfMultiLineComment(comment) {
return comment.slice(-2) === BLOCK_COMMENT_END;
}
function isFunctionCall(string) {
return string.match(/\w+\(.*\);?$/) !== null;
}
function parse(readableStream) {
return new Promise(function(resolve, reject) {
var out = {};
readableStream.on('data', function(chunk) {
var state = {
index: 0,
comment: {
parsing: false,
singleLine: false,
multiLine: false,
setSingleLine: function() {
this._setCommentState(true, false);
},
setMultiLine: function() {
this._setCommentState(false, true);
},
reset: function() {
this._setCommentState(false, false);
},
_setCommentState: function(singleLine, multiLine) {
this.singleLine = singleLine;
this.multiLine = multiLine;
this.parsing = singleLine || multiLine;
}
}
};
out = deepParse(chunk, state, false, undefined);
});
readableStream.on('end', function() {
resolve(out);
});
readableStream.on('error', function(error) {
reject('Error parsing stream: ' + error);
});
});
}
function parseText(text) {
var textAsStream = new stream.Readable();
textAsStream._read = function noop() {};
textAsStream.push(text);
textAsStream.push(null);
return parse(textAsStream);
}
function parseFile(path) {
var stream = fs.createReadStream(path);
return parse(stream);
}
module.exports = {
parseText: parseText,
parseFile: parseFile
};

39
node_modules/gradle-to-js/package.json generated vendored Normal file
View file

@ -0,0 +1,39 @@
{
"name": "gradle-to-js",
"version": "2.0.1",
"description": "A quick & dirty Gradle build file to JavaScript object parser",
"main": "lib/parser.js",
"bin": {
"gradle-to-js": "./cli.js"
},
"scripts": {
"test": "mocha --reporter spec"
},
"repository": {
"type": "git",
"url": "git+https://github.com/ninetwozero/gradle-to-js.git"
},
"keywords": [
"gradle",
"javascript",
"parsing"
],
"files": [
"lib/",
"cli.js"
],
"author": "Karl Lindmark",
"license": "Apache-2.0",
"bugs": {
"url": "https://github.com/ninetwozero/gradle-to-js/issues"
},
"homepage": "https://github.com/ninetwozero/gradle-to-js#readme",
"devDependencies": {
"chai": "^4.2.0",
"mocha": "^6.2.0",
"multiline": "^2.0.0"
},
"dependencies": {
"lodash.merge": "^4.6.2"
}
}