actions
/
setup-dotnet
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Rerun build

This commit is contained in:
GGG KILLER 2021-04-22 12:22:10 -03:00
parent 87189a16c7
commit 291588df6a
1 changed files with 32 additions and 33 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

65
dist/index.js vendored
View File

@ -5048,7 +5048,7 @@ module.exports = {"name":"@octokit/rest","version":"16.28.9","publishConfig":{"a
module.exports = XMLDummy = class XMLDummy extends XMLNode {
// Initializes a new instance of `XMLDummy`
// `XMLDummy` is a special node representing a node with
// `XMLDummy` is a special node representing a node with
// a null value. Dummy nodes are created while recursively
// building the XML tree. Simply skipping null values doesn't
// work because that would break the recursive chain.
@ -9151,7 +9151,7 @@ function escapeProperty(s) {
};
// DOM level 1
Object.defineProperty(XMLNamedNodeMap.prototype, 'length', {
get: function() {
@ -10956,7 +10956,7 @@ exports.FetchError = FetchError;
document(doc, options) {
var child, i, j, k, len1, len2, ref, ref1, results;
ref = doc.children;
// set a flag so that we don't insert a newline after the last root level node
// set a flag so that we don't insert a newline after the last root level node
for (i = j = 0, len1 = ref.length; j < len1; i = ++j) {
child = ref[i];
child.isLastRootNode = i === doc.children.length - 1;
@ -12067,14 +12067,14 @@ function authenticationBeforeRequest (state, options) {
} else {
this.writerOptions.state = WriterState.OpenTag;
chunk = this.writer.indent(node, this.writerOptions, this.currentLevel) + '<!DOCTYPE ' + node.rootNodeName;
// external identifier
if (node.pubID && node.sysID) {
chunk += ' PUBLIC "' + node.pubID + '" "' + node.sysID + '"';
} else if (node.sysID) {
chunk += ' SYSTEM "' + node.sysID + '"';
}
// internal subset
if (node.children) {
chunk += ' [';
@ -12479,9 +12479,9 @@ function addHook (state, kind, name, hook) {
// `feature` package name of the feature to test. In Level 1, the
// legal values are "HTML" and "XML" (case-insensitive).
// `version` version number of the package name to test.
// In Level 1, this is the string "1.0". If the version is
// not specified, supporting any version of the feature will
// `version` version number of the package name to test.
// In Level 1, this is the string "1.0". If the version is
// not specified, supporting any version of the feature will
// cause the method to return true.
hasFeature(feature, version) {
return true;
@ -12512,7 +12512,7 @@ function addHook (state, kind, name, hook) {
throw new Error("This DOM method is not implemented.");
}
// Returns a specialized object which implements the specialized APIs
// Returns a specialized object which implements the specialized APIs
// of the specified feature and version.
// `feature` name of the feature requested.
@ -14549,7 +14549,7 @@ module.exports = require("net");
this.value = '';
}
// Creates and returns a deep clone of `this`
clone() {
return Object.create(this);
@ -15519,7 +15519,7 @@ exports.convertToJson = convertToJson;
}
}
// Sets the parent node of this node and its children recursively
// `parent` the parent node
@ -15591,7 +15591,7 @@ exports.convertToJson = convertToJson;
// skip null and undefined nodes
} else if (!this.options.keepNullNodes && (val == null)) {
lastChild = this.dummy();
// expand list by creating child nodes
} else if (!this.options.separateArrayItems && Array.isArray(val)) {
for (k = 0, len1 = val.length; k < len1; k++) {
@ -15600,7 +15600,7 @@ exports.convertToJson = convertToJson;
childNode[key] = item;
lastChild = this.element(childNode);
}
// expand child nodes under parent
} else if (isObject(val)) {
// if the key is #text expand child nodes under this node to support mixed content
@ -15611,7 +15611,7 @@ exports.convertToJson = convertToJson;
lastChild.element(val);
}
} else {
// text node
lastChild = this.element(key, val);
}
@ -15663,10 +15663,10 @@ exports.convertToJson = convertToJson;
// temporarily remove children starting *with* refChild
i = children.indexOf(refChild);
removed = children.splice(i);
// add the new child
children.push(newChild);
// add back removed children after new child
Array.prototype.push.apply(children, removed);
} else {
@ -15677,14 +15677,14 @@ exports.convertToJson = convertToJson;
if (this.isRoot) {
throw new Error("Cannot insert elements at root level. " + this.debugInfo(name));
}
// temporarily remove children starting *with* this
i = this.parent.children.indexOf(this);
removed = this.parent.children.splice(i);
// add the new child
child = this.parent.element(name, attributes, text);
// add back removed children after new child
Array.prototype.push.apply(this.parent.children, removed);
return child;
@ -15701,14 +15701,14 @@ exports.convertToJson = convertToJson;
if (this.isRoot) {
throw new Error("Cannot insert elements at root level. " + this.debugInfo(name));
}
// temporarily remove children starting *after* this
i = this.parent.children.indexOf(this);
removed = this.parent.children.splice(i + 1);
// add the new child
child = this.parent.element(name, attributes, text);
// add back removed children after new child
Array.prototype.push.apply(this.parent.children, removed);
return child;
@ -16043,7 +16043,7 @@ exports.convertToJson = convertToJson;
return this;
}
// Returns debug string for this node
debugInfo(name) {
var ref1, ref2;
@ -16264,7 +16264,7 @@ exports.convertToJson = convertToJson;
return other === this || this.isDescendant(other);
}
// An object A is called a descendant of an object B, if either A is
// An object A is called a descendant of an object B, if either A is
// a child of B or A is a child of an object C that is a descendant of B.
isDescendant(node) {
var child, isDescendantChild, j, len, ref1;
@ -16288,7 +16288,7 @@ exports.convertToJson = convertToJson;
return node.isDescendant(this);
}
// An object A is preceding an object B if A and B are in the
// An object A is preceding an object B if A and B are in the
// same tree and A comes before B in tree order.
isPreceding(node) {
var nodePos, thisPos;
@ -16301,7 +16301,7 @@ exports.convertToJson = convertToJson;
}
}
// An object A is folllowing an object B if A and B are in the
// An object A is folllowing an object B if A and B are in the
// same tree and A comes after B in tree order.
isFollowing(node) {
var nodePos, thisPos;
@ -16333,7 +16333,7 @@ exports.convertToJson = convertToJson;
}
}
// Depth-first preorder traversal through the XML tree
foreachTreeNode(node, func) {
var child, j, len, ref1, res;
@ -16882,7 +16882,6 @@ class DotNetVersionInfo {
this.isExactVersionSet = true;
return;
}
//Note: No support for previews when using generic
const parts = version.split('.');
if (parts.length < 2 || parts.length > 3)
this.throwInvalidVersionFormat();
@ -20470,7 +20469,7 @@ module.exports = set;
return this.options.writer.attribute(this, this.options.writer.filterOptions(options));
}
// Returns debug string for this node
debugInfo(name) {
name = name || this.name;
@ -22018,7 +22017,7 @@ const validator = __webpack_require__(971);
exports.parse = function(xmlData, options, validationOption) {
if( validationOption){
if(validationOption === true) validationOption = {}
const result = validator.validate(xmlData, validationOption);
if (result !== true) {
throw Error( result.err.msg)
@ -22062,11 +22061,11 @@ function print(xmlNode, indentation){
//console.log(indentation + " \""+index+"\" : [")
print(item, indentation2);
})
console.log(indentation + "],")
console.log(indentation + "],")
}else{
console.log(indentation + " \""+key+"\" : {")
print(node, indentation2);
console.log(indentation + "},")
console.log(indentation + "},")
}
});
console.log(indentation + "},")
@ -22077,4 +22076,4 @@ function print(xmlNode, indentation){
/***/ })
/******/ });
/******/ });