mirror of
https://github.com/Instadapp/Swap-Aggregator-Subgraph.git
synced 2024-07-29 21:57:12 +00:00
118 lines
5.6 KiB
JavaScript
118 lines
5.6 KiB
JavaScript
import _slicedToArray from "@babel/runtime/helpers/slicedToArray";
|
|
import _classCallCheck from "@babel/runtime/helpers/classCallCheck";
|
|
import _createClass from "@babel/runtime/helpers/createClass";
|
|
import _get from "@babel/runtime/helpers/get";
|
|
import _inherits from "@babel/runtime/helpers/inherits";
|
|
import _possibleConstructorReturn from "@babel/runtime/helpers/possibleConstructorReturn";
|
|
import _getPrototypeOf from "@babel/runtime/helpers/getPrototypeOf";
|
|
|
|
function _createForOfIteratorHelper(o) { if (typeof Symbol === "undefined" || o[Symbol.iterator] == null) { if (Array.isArray(o) || (o = _unsupportedIterableToArray(o))) { var i = 0; var F = function F() {}; return { s: F, n: function n() { if (i >= o.length) return { done: true }; return { done: false, value: o[i++] }; }, e: function e(_e) { throw _e; }, f: F }; } throw new TypeError("Invalid attempt to iterate non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method."); } var it, normalCompletion = true, didErr = false, err; return { s: function s() { it = o[Symbol.iterator](); }, n: function n() { var step = it.next(); normalCompletion = step.done; return step; }, e: function e(_e2) { didErr = true; err = _e2; }, f: function f() { try { if (!normalCompletion && it.return != null) it.return(); } finally { if (didErr) throw err; } } }; }
|
|
|
|
function _unsupportedIterableToArray(o, minLen) { if (!o) return; if (typeof o === "string") return _arrayLikeToArray(o, minLen); var n = Object.prototype.toString.call(o).slice(8, -1); if (n === "Object" && o.constructor) n = o.constructor.name; if (n === "Map" || n === "Set") return Array.from(n); if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _arrayLikeToArray(o, minLen); }
|
|
|
|
function _arrayLikeToArray(arr, len) { if (len == null || len > arr.length) len = arr.length; for (var i = 0, arr2 = new Array(len); i < len; i++) { arr2[i] = arr[i]; } return arr2; }
|
|
|
|
function _createSuper(Derived) { return function () { var Super = _getPrototypeOf(Derived), result; if (_isNativeReflectConstruct()) { var NewTarget = _getPrototypeOf(this).constructor; result = Reflect.construct(Super, arguments, NewTarget); } else { result = Super.apply(this, arguments); } return _possibleConstructorReturn(this, result); }; }
|
|
|
|
function _isNativeReflectConstruct() { if (typeof Reflect === "undefined" || !Reflect.construct) return false; if (Reflect.construct.sham) return false; if (typeof Proxy === "function") return true; try { Date.prototype.toString.call(Reflect.construct(Date, [], function () {})); return true; } catch (e) { return false; } }
|
|
|
|
import { YAMLMap } from './Map';
|
|
import { Pair } from './Pair';
|
|
import { Scalar } from './Scalar';
|
|
import { YAMLSeq } from './Seq';
|
|
export var MERGE_KEY = '<<';
|
|
export var Merge = /*#__PURE__*/function (_Pair) {
|
|
_inherits(Merge, _Pair);
|
|
|
|
var _super = _createSuper(Merge);
|
|
|
|
function Merge(pair) {
|
|
var _this;
|
|
|
|
_classCallCheck(this, Merge);
|
|
|
|
if (pair instanceof Pair) {
|
|
var seq = pair.value;
|
|
|
|
if (!(seq instanceof YAMLSeq)) {
|
|
seq = new YAMLSeq();
|
|
seq.items.push(pair.value);
|
|
seq.range = pair.value.range;
|
|
}
|
|
|
|
_this = _super.call(this, pair.key, seq);
|
|
_this.range = pair.range;
|
|
} else {
|
|
_this = _super.call(this, new Scalar(MERGE_KEY), new YAMLSeq());
|
|
}
|
|
|
|
_this.type = Pair.Type.MERGE_PAIR;
|
|
return _possibleConstructorReturn(_this);
|
|
} // If the value associated with a merge key is a single mapping node, each of
|
|
// its key/value pairs is inserted into the current mapping, unless the key
|
|
// already exists in it. If the value associated with the merge key is a
|
|
// sequence, then this sequence is expected to contain mapping nodes and each
|
|
// of these nodes is merged in turn according to its order in the sequence.
|
|
// Keys in mapping nodes earlier in the sequence override keys specified in
|
|
// later mapping nodes. -- http://yaml.org/type/merge.html
|
|
|
|
|
|
_createClass(Merge, [{
|
|
key: "addToJSMap",
|
|
value: function addToJSMap(ctx, map) {
|
|
var _iterator = _createForOfIteratorHelper(this.value.items),
|
|
_step;
|
|
|
|
try {
|
|
for (_iterator.s(); !(_step = _iterator.n()).done;) {
|
|
var source = _step.value.source;
|
|
if (!(source instanceof YAMLMap)) throw new Error('Merge sources must be maps');
|
|
var srcMap = source.toJSON(null, ctx, Map);
|
|
|
|
var _iterator2 = _createForOfIteratorHelper(srcMap),
|
|
_step2;
|
|
|
|
try {
|
|
for (_iterator2.s(); !(_step2 = _iterator2.n()).done;) {
|
|
var _step2$value = _slicedToArray(_step2.value, 2),
|
|
key = _step2$value[0],
|
|
value = _step2$value[1];
|
|
|
|
if (map instanceof Map) {
|
|
if (!map.has(key)) map.set(key, value);
|
|
} else if (map instanceof Set) {
|
|
map.add(key);
|
|
} else {
|
|
if (!Object.prototype.hasOwnProperty.call(map, key)) map[key] = value;
|
|
}
|
|
}
|
|
} catch (err) {
|
|
_iterator2.e(err);
|
|
} finally {
|
|
_iterator2.f();
|
|
}
|
|
}
|
|
} catch (err) {
|
|
_iterator.e(err);
|
|
} finally {
|
|
_iterator.f();
|
|
}
|
|
|
|
return map;
|
|
}
|
|
}, {
|
|
key: "toString",
|
|
value: function toString(ctx, onComment) {
|
|
var seq = this.value;
|
|
if (seq.items.length > 1) return _get(_getPrototypeOf(Merge.prototype), "toString", this).call(this, ctx, onComment);
|
|
this.value = seq.items[0];
|
|
|
|
var str = _get(_getPrototypeOf(Merge.prototype), "toString", this).call(this, ctx, onComment);
|
|
|
|
this.value = seq;
|
|
return str;
|
|
}
|
|
}]);
|
|
|
|
return Merge;
|
|
}(Pair); |