@@ -5048,7 +5048,7 @@ module.exports = {"name":"@octokit/rest","version":"16.28.9","publishConfig":{"a
5048
5048
module.exports = XMLDummy = class XMLDummy extends XMLNode {
5049
5049
// Initializes a new instance of `XMLDummy`
5050
5050
5051
- // `XMLDummy` is a special node representing a node with
5051
+ // `XMLDummy` is a special node representing a node with
5052
5052
// a null value. Dummy nodes are created while recursively
5053
5053
// building the XML tree. Simply skipping null values doesn't
5054
5054
// work because that would break the recursive chain.
@@ -9151,7 +9151,7 @@ function escapeProperty(s) {
9151
9151
9152
9152
};
9153
9153
9154
-
9154
+
9155
9155
// DOM level 1
9156
9156
Object.defineProperty(XMLNamedNodeMap.prototype, 'length', {
9157
9157
get: function() {
@@ -10956,7 +10956,7 @@ exports.FetchError = FetchError;
10956
10956
document(doc, options) {
10957
10957
var child, i, j, k, len1, len2, ref, ref1, results;
10958
10958
ref = doc.children;
10959
- // set a flag so that we don't insert a newline after the last root level node
10959
+ // set a flag so that we don't insert a newline after the last root level node
10960
10960
for (i = j = 0, len1 = ref.length; j < len1; i = ++j) {
10961
10961
child = ref[i];
10962
10962
child.isLastRootNode = i === doc.children.length - 1;
@@ -12067,14 +12067,14 @@ function authenticationBeforeRequest (state, options) {
12067
12067
} else {
12068
12068
this.writerOptions.state = WriterState.OpenTag;
12069
12069
chunk = this.writer.indent(node, this.writerOptions, this.currentLevel) + '<!DOCTYPE ' + node.rootNodeName;
12070
-
12070
+
12071
12071
// external identifier
12072
12072
if (node.pubID && node.sysID) {
12073
12073
chunk += ' PUBLIC "' + node.pubID + '" "' + node.sysID + '"';
12074
12074
} else if (node.sysID) {
12075
12075
chunk += ' SYSTEM "' + node.sysID + '"';
12076
12076
}
12077
-
12077
+
12078
12078
// internal subset
12079
12079
if (node.children) {
12080
12080
chunk += ' [';
@@ -12479,9 +12479,9 @@ function addHook (state, kind, name, hook) {
12479
12479
12480
12480
// `feature` package name of the feature to test. In Level 1, the
12481
12481
// legal values are "HTML" and "XML" (case-insensitive).
12482
- // `version` version number of the package name to test.
12483
- // In Level 1, this is the string "1.0". If the version is
12484
- // not specified, supporting any version of the feature will
12482
+ // `version` version number of the package name to test.
12483
+ // In Level 1, this is the string "1.0". If the version is
12484
+ // not specified, supporting any version of the feature will
12485
12485
// cause the method to return true.
12486
12486
hasFeature(feature, version) {
12487
12487
return true;
@@ -12512,7 +12512,7 @@ function addHook (state, kind, name, hook) {
12512
12512
throw new Error("This DOM method is not implemented.");
12513
12513
}
12514
12514
12515
- // Returns a specialized object which implements the specialized APIs
12515
+ // Returns a specialized object which implements the specialized APIs
12516
12516
// of the specified feature and version.
12517
12517
12518
12518
// `feature` name of the feature requested.
@@ -14549,7 +14549,7 @@ module.exports = require("net");
14549
14549
this.value = '';
14550
14550
}
14551
14551
14552
-
14552
+
14553
14553
// Creates and returns a deep clone of `this`
14554
14554
clone() {
14555
14555
return Object.create(this);
@@ -15519,7 +15519,7 @@ exports.convertToJson = convertToJson;
15519
15519
}
15520
15520
}
15521
15521
15522
-
15522
+
15523
15523
// Sets the parent node of this node and its children recursively
15524
15524
15525
15525
// `parent` the parent node
@@ -15591,7 +15591,7 @@ exports.convertToJson = convertToJson;
15591
15591
// skip null and undefined nodes
15592
15592
} else if (!this.options.keepNullNodes && (val == null)) {
15593
15593
lastChild = this.dummy();
15594
-
15594
+
15595
15595
// expand list by creating child nodes
15596
15596
} else if (!this.options.separateArrayItems && Array.isArray(val)) {
15597
15597
for (k = 0, len1 = val.length; k < len1; k++) {
@@ -15600,7 +15600,7 @@ exports.convertToJson = convertToJson;
15600
15600
childNode[key] = item;
15601
15601
lastChild = this.element(childNode);
15602
15602
}
15603
-
15603
+
15604
15604
// expand child nodes under parent
15605
15605
} else if (isObject(val)) {
15606
15606
// if the key is #text expand child nodes under this node to support mixed content
@@ -15611,7 +15611,7 @@ exports.convertToJson = convertToJson;
15611
15611
lastChild.element(val);
15612
15612
}
15613
15613
} else {
15614
-
15614
+
15615
15615
// text node
15616
15616
lastChild = this.element(key, val);
15617
15617
}
@@ -15663,10 +15663,10 @@ exports.convertToJson = convertToJson;
15663
15663
// temporarily remove children starting *with* refChild
15664
15664
i = children.indexOf(refChild);
15665
15665
removed = children.splice(i);
15666
-
15666
+
15667
15667
// add the new child
15668
15668
children.push(newChild);
15669
-
15669
+
15670
15670
// add back removed children after new child
15671
15671
Array.prototype.push.apply(children, removed);
15672
15672
} else {
@@ -15677,14 +15677,14 @@ exports.convertToJson = convertToJson;
15677
15677
if (this.isRoot) {
15678
15678
throw new Error("Cannot insert elements at root level. " + this.debugInfo(name));
15679
15679
}
15680
-
15680
+
15681
15681
// temporarily remove children starting *with* this
15682
15682
i = this.parent.children.indexOf(this);
15683
15683
removed = this.parent.children.splice(i);
15684
-
15684
+
15685
15685
// add the new child
15686
15686
child = this.parent.element(name, attributes, text);
15687
-
15687
+
15688
15688
// add back removed children after new child
15689
15689
Array.prototype.push.apply(this.parent.children, removed);
15690
15690
return child;
@@ -15701,14 +15701,14 @@ exports.convertToJson = convertToJson;
15701
15701
if (this.isRoot) {
15702
15702
throw new Error("Cannot insert elements at root level. " + this.debugInfo(name));
15703
15703
}
15704
-
15704
+
15705
15705
// temporarily remove children starting *after* this
15706
15706
i = this.parent.children.indexOf(this);
15707
15707
removed = this.parent.children.splice(i + 1);
15708
-
15708
+
15709
15709
// add the new child
15710
15710
child = this.parent.element(name, attributes, text);
15711
-
15711
+
15712
15712
// add back removed children after new child
15713
15713
Array.prototype.push.apply(this.parent.children, removed);
15714
15714
return child;
@@ -16043,7 +16043,7 @@ exports.convertToJson = convertToJson;
16043
16043
return this;
16044
16044
}
16045
16045
16046
-
16046
+
16047
16047
// Returns debug string for this node
16048
16048
debugInfo(name) {
16049
16049
var ref1, ref2;
@@ -16264,7 +16264,7 @@ exports.convertToJson = convertToJson;
16264
16264
return other === this || this.isDescendant(other);
16265
16265
}
16266
16266
16267
- // An object A is called a descendant of an object B, if either A is
16267
+ // An object A is called a descendant of an object B, if either A is
16268
16268
// a child of B or A is a child of an object C that is a descendant of B.
16269
16269
isDescendant(node) {
16270
16270
var child, isDescendantChild, j, len, ref1;
@@ -16288,7 +16288,7 @@ exports.convertToJson = convertToJson;
16288
16288
return node.isDescendant(this);
16289
16289
}
16290
16290
16291
- // An object A is preceding an object B if A and B are in the
16291
+ // An object A is preceding an object B if A and B are in the
16292
16292
// same tree and A comes before B in tree order.
16293
16293
isPreceding(node) {
16294
16294
var nodePos, thisPos;
@@ -16301,7 +16301,7 @@ exports.convertToJson = convertToJson;
16301
16301
}
16302
16302
}
16303
16303
16304
- // An object A is folllowing an object B if A and B are in the
16304
+ // An object A is folllowing an object B if A and B are in the
16305
16305
// same tree and A comes after B in tree order.
16306
16306
isFollowing(node) {
16307
16307
var nodePos, thisPos;
@@ -16333,7 +16333,7 @@ exports.convertToJson = convertToJson;
16333
16333
}
16334
16334
}
16335
16335
16336
-
16336
+
16337
16337
// Depth-first preorder traversal through the XML tree
16338
16338
foreachTreeNode(node, func) {
16339
16339
var child, j, len, ref1, res;
@@ -16882,7 +16882,6 @@ class DotNetVersionInfo {
16882
16882
this.isExactVersionSet = true;
16883
16883
return;
16884
16884
}
16885
- //Note: No support for previews when using generic
16886
16885
const parts = version.split('.');
16887
16886
if (parts.length < 2 || parts.length > 3)
16888
16887
this.throwInvalidVersionFormat();
@@ -20470,7 +20469,7 @@ module.exports = set;
20470
20469
return this.options.writer.attribute(this, this.options.writer.filterOptions(options));
20471
20470
}
20472
20471
20473
-
20472
+
20474
20473
// Returns debug string for this node
20475
20474
debugInfo(name) {
20476
20475
name = name || this.name;
@@ -22018,7 +22017,7 @@ const validator = __webpack_require__(971);
22018
22017
exports.parse = function(xmlData, options, validationOption) {
22019
22018
if( validationOption){
22020
22019
if(validationOption === true) validationOption = {}
22021
-
22020
+
22022
22021
const result = validator.validate(xmlData, validationOption);
22023
22022
if (result !== true) {
22024
22023
throw Error( result.err.msg)
@@ -22062,11 +22061,11 @@ function print(xmlNode, indentation){
22062
22061
//console.log(indentation + " \""+index+"\" : [")
22063
22062
print(item, indentation2);
22064
22063
})
22065
- console.log(indentation + "],")
22064
+ console.log(indentation + "],")
22066
22065
}else{
22067
22066
console.log(indentation + " \""+key+"\" : {")
22068
22067
print(node, indentation2);
22069
- console.log(indentation + "},")
22068
+ console.log(indentation + "},")
22070
22069
}
22071
22070
});
22072
22071
console.log(indentation + "},")
@@ -22077,4 +22076,4 @@ function print(xmlNode, indentation){
22077
22076
22078
22077
/***/ })
22079
22078
22080
- /******/ });
22079
+ /******/ });
0 commit comments