@webex/plugin-meetings 3.10.0-next.27 → 3.10.0-next.29

package/dist/hashTree/utils.js.map

@@ -1 +1 @@
-{"version":3,"names":["deleteNestedObjectsWithHtMeta","exports","currentLocusPart","parent","currentKey","_typeof2","default","undefined","htMeta","_isArray","splice","Number","i","length","_i","_Object$keys","_keys","key","Object","prototype","hasOwnProperty","call"],"sources":["utils.ts"],"sourcesContent":["/* eslint-disable import/prefer-default-export */\n\n/**\n * Analyzes given part of Locus DTO recursively and delete any nested objects that have their own htMeta\n *\n * @param {Object} currentLocusPart part of locus DTO to analyze\n * @param {Object} parent parent object\n * @param {string|number} currentKey key of the parent object that currentLocusPart is\n * @returns {void}\n */\nexport const deleteNestedObjectsWithHtMeta = (\n  currentLocusPart: any,\n  parent?: any,\n  currentKey?: string | number\n) => {\n  if (typeof currentLocusPart !== 'object' || currentLocusPart === null) {\n    return;\n  }\n\n  if (parent && currentKey !== undefined && currentLocusPart.htMeta) {\n    if (Array.isArray(parent)) {\n      parent.splice(Number(currentKey), 1);\n    } else {\n      delete parent[currentKey];\n    }\n\n    return;\n  }\n\n  if (Array.isArray(currentLocusPart)) {\n    // iterate array in reverse, so that indexes remain valid when deleting elements\n    for (let i = currentLocusPart.length - 1; i >= 0; i -= 1) {\n      deleteNestedObjectsWithHtMeta(currentLocusPart[i], currentLocusPart, i);\n    }\n  } else {\n    for (const key of Object.keys(currentLocusPart)) {\n      if (Object.prototype.hasOwnProperty.call(currentLocusPart, key)) {\n        deleteNestedObjectsWithHtMeta(currentLocusPart[key], currentLocusPart, key);\n      }\n    }\n  }\n};\n"],"mappings":";;;;;;;;;;;AAAA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO,IAAMA,8BAA6B,GAAAC,OAAA,CAAAD,6BAAA,GAAG,SAAhCA,6BAA6BA,CACxCE,gBAAqB,EACrBC,MAAY,EACZC,UAA4B,EACzB;EACH,IAAI,IAAAC,QAAA,CAAAC,OAAA,EAAOJ,gBAAgB,MAAK,QAAQ,IAAIA,gBAAgB,KAAK,IAAI,EAAE;IACrE;EACF;EAEA,IAAIC,MAAM,IAAIC,UAAU,KAAKG,SAAS,IAAIL,gBAAgB,CAACM,MAAM,EAAE;IACjE,IAAI,IAAAC,QAAA,CAAAH,OAAA,EAAcH,MAAM,CAAC,EAAE;MACzBA,MAAM,CAACO,MAAM,CAACC,MAAM,CAACP,UAAU,CAAC,EAAE,CAAC,CAAC;IACtC,CAAC,MAAM;MACL,OAAOD,MAAM,CAACC,UAAU,CAAC;IAC3B;IAEA;EACF;EAEA,IAAI,IAAAK,QAAA,CAAAH,OAAA,EAAcJ,gBAAgB,CAAC,EAAE;IACnC;IACA,KAAK,IAAIU,CAAC,GAAGV,gBAAgB,CAACW,MAAM,GAAG,CAAC,EAAED,CAAC,IAAI,CAAC,EAAEA,CAAC,IAAI,CAAC,EAAE;MACxDZ,8BAA6B,CAACE,gBAAgB,CAACU,CAAC,CAAC,EAAEV,gBAAgB,EAAEU,CAAC,CAAC;IACzE;EACF,CAAC,MAAM;IACL,SAAAE,EAAA,MAAAC,YAAA,GAAkB,IAAAC,KAAA,CAAAV,OAAA,EAAYJ,gBAAgB,CAAC,EAAAY,EAAA,GAAAC,YAAA,CAAAF,MAAA,EAAAC,EAAA,IAAE;MAA5C,IAAMG,GAAG,GAAAF,YAAA,CAAAD,EAAA;MACZ,IAAII,MAAM,CAACC,SAAS,CAACC,cAAc,CAACC,IAAI,CAACnB,gBAAgB,EAAEe,GAAG,CAAC,EAAE;QAC/DjB,8BAA6B,CAACE,gBAAgB,CAACe,GAAG,CAAC,EAAEf,gBAAgB,EAAEe,GAAG,CAAC;MAC7E;IACF;EACF;AACF,CAAC","ignoreList":[]}
+{"version":3,"names":["_types","require","isSelf","object","htMeta","elementId","type","toLowerCase","ObjectType","self","deleteNestedObjectsWithHtMeta","exports","currentLocusPart","parent","currentKey","_typeof2","default","undefined","_isArray","splice","Number","i","length","_i","_Object$keys","_keys","key","Object","prototype","hasOwnProperty","call"],"sources":["utils.ts"],"sourcesContent":["/* eslint-disable import/prefer-default-export */\n\nimport {ObjectType, HashTreeObject} from './types';\n\n/**\n * Checks if the given hash tree object is of type \"self\"\n * @param {HashTreeObject} object object to check\n * @returns {boolean} True if the object is of type \"self\", false otherwise\n */\nexport function isSelf(object: HashTreeObject) {\n  return object.htMeta.elementId.type.toLowerCase() === ObjectType.self;\n}\n\n/**\n * Analyzes given part of Locus DTO recursively and delete any nested objects that have their own htMeta\n *\n * @param {Object} currentLocusPart part of locus DTO to analyze\n * @param {Object} parent parent object\n * @param {string|number} currentKey key of the parent object that currentLocusPart is\n * @returns {void}\n */\nexport const deleteNestedObjectsWithHtMeta = (\n  currentLocusPart: any,\n  parent?: any,\n  currentKey?: string | number\n) => {\n  if (typeof currentLocusPart !== 'object' || currentLocusPart === null) {\n    return;\n  }\n\n  if (parent && currentKey !== undefined && currentLocusPart.htMeta) {\n    if (Array.isArray(parent)) {\n      parent.splice(Number(currentKey), 1);\n    } else {\n      delete parent[currentKey];\n    }\n\n    return;\n  }\n\n  if (Array.isArray(currentLocusPart)) {\n    // iterate array in reverse, so that indexes remain valid when deleting elements\n    for (let i = currentLocusPart.length - 1; i >= 0; i -= 1) {\n      deleteNestedObjectsWithHtMeta(currentLocusPart[i], currentLocusPart, i);\n    }\n  } else {\n    for (const key of Object.keys(currentLocusPart)) {\n      if (Object.prototype.hasOwnProperty.call(currentLocusPart, key)) {\n        deleteNestedObjectsWithHtMeta(currentLocusPart[key], currentLocusPart, key);\n      }\n    }\n  }\n};\n"],"mappings":";;;;;;;;;;;;AAEA,IAAAA,MAAA,GAAAC,OAAA;AAFA;;AAIA;AACA;AACA;AACA;AACA;AACO,SAASC,MAAMA,CAACC,MAAsB,EAAE;EAC7C,OAAOA,MAAM,CAACC,MAAM,CAACC,SAAS,CAACC,IAAI,CAACC,WAAW,CAAC,CAAC,KAAKC,iBAAU,CAACC,IAAI;AACvE;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO,IAAMC,8BAA6B,GAAAC,OAAA,CAAAD,6BAAA,GAAG,SAAhCA,6BAA6BA,CACxCE,gBAAqB,EACrBC,MAAY,EACZC,UAA4B,EACzB;EACH,IAAI,IAAAC,QAAA,CAAAC,OAAA,EAAOJ,gBAAgB,MAAK,QAAQ,IAAIA,gBAAgB,KAAK,IAAI,EAAE;IACrE;EACF;EAEA,IAAIC,MAAM,IAAIC,UAAU,KAAKG,SAAS,IAAIL,gBAAgB,CAACR,MAAM,EAAE;IACjE,IAAI,IAAAc,QAAA,CAAAF,OAAA,EAAcH,MAAM,CAAC,EAAE;MACzBA,MAAM,CAACM,MAAM,CAACC,MAAM,CAACN,UAAU,CAAC,EAAE,CAAC,CAAC;IACtC,CAAC,MAAM;MACL,OAAOD,MAAM,CAACC,UAAU,CAAC;IAC3B;IAEA;EACF;EAEA,IAAI,IAAAI,QAAA,CAAAF,OAAA,EAAcJ,gBAAgB,CAAC,EAAE;IACnC;IACA,KAAK,IAAIS,CAAC,GAAGT,gBAAgB,CAACU,MAAM,GAAG,CAAC,EAAED,CAAC,IAAI,CAAC,EAAEA,CAAC,IAAI,CAAC,EAAE;MACxDX,8BAA6B,CAACE,gBAAgB,CAACS,CAAC,CAAC,EAAET,gBAAgB,EAAES,CAAC,CAAC;IACzE;EACF,CAAC,MAAM;IACL,SAAAE,EAAA,MAAAC,YAAA,GAAkB,IAAAC,KAAA,CAAAT,OAAA,EAAYJ,gBAAgB,CAAC,EAAAW,EAAA,GAAAC,YAAA,CAAAF,MAAA,EAAAC,EAAA,IAAE;MAA5C,IAAMG,GAAG,GAAAF,YAAA,CAAAD,EAAA;MACZ,IAAII,MAAM,CAACC,SAAS,CAACC,cAAc,CAACC,IAAI,CAAClB,gBAAgB,EAAEc,GAAG,CAAC,EAAE;QAC/DhB,8BAA6B,CAACE,gBAAgB,CAACc,GAAG,CAAC,EAAEd,gBAAgB,EAAEc,GAAG,CAAC;MAC7E;IACF;EACF;AACF,CAAC","ignoreList":[]}

package/dist/interpretation/index.js

@@ -372,7 +372,7 @@ var SimultaneousInterpretation = _webexCore.WebexPlugin.extend({
       throw error;
     });
   },
-  version: "3.10.0-next.27"
+  version: "3.10.0-next.29"
 });
 var _default = exports.default = SimultaneousInterpretation;
 //# sourceMappingURL=index.js.map

package/dist/interpretation/siLanguage.js

@@ -18,7 +18,7 @@ var SILanguage = _webexCore.WebexPlugin.extend({
     languageCode: 'number',
     languageName: 'string'
   },
-  version: "3.10.0-next.27"
+  version: "3.10.0-next.29"
 });
 var _default = exports.default = SILanguage;
 //# sourceMappingURL=siLanguage.js.map

package/dist/locus-info/index.js

@@ -48,6 +48,7 @@ var _metrics = _interopRequireDefault(require("../metrics"));
 var _constants2 = _interopRequireDefault(require("../metrics/constants"));
 var _hashTreeParser = _interopRequireWildcard(require("../hashTree/hashTreeParser"));
 var _types = require("../hashTree/types");
+var _utils = require("../hashTree/utils");
 function _interopRequireWildcard(e, t) { if ("function" == typeof _WeakMap) var r = new _WeakMap(), n = new _WeakMap(); return (_interopRequireWildcard = function _interopRequireWildcard(e, t) { if (!t && e && e.__esModule) return e; var o, i, f = { __proto__: null, default: e }; if (null === e || "object" != _typeof(e) && "function" != typeof e) return f; if (o = t ? n : r) { if (o.has(e)) return o.get(e); o.set(e, f); } for (var _t2 in e) "default" !== _t2 && {}.hasOwnProperty.call(e, _t2) && ((i = (o = _Object$defineProperty) && _Object$getOwnPropertyDescriptor(e, _t2)) && (i.get || i.set) ? o(f, _t2, i) : f[_t2] = e[_t2]); return f; })(e, t); }
 function _createForOfIteratorHelper(r, e) { var t = "undefined" != typeof _Symbol && r[_Symbol$iterator] || r["@@iterator"]; if (!t) { if (_Array$isArray2(r) || (t = _unsupportedIterableToArray(r)) || e && r && "number" == typeof r.length) { t && (r = t); var _n = 0, F = function F() {}; return { s: F, n: function n() { return _n >= r.length ? { done: !0 } : { done: !1, value: r[_n++] }; }, e: function e(r) { throw r; }, 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 o, a = !0, u = !1; return { s: function s() { t = t.call(r); }, n: function n() { var r = t.next(); return a = r.done, r; }, e: function e(r) { u = !0, o = r; }, f: function f() { try { a || null == t.return || t.return(); } finally { if (u) throw o; } } }; }
 function _unsupportedIterableToArray(r, a) { if (r) { if ("string" == typeof r) return _arrayLikeToArray(r, a); var t = {}.toString.call(r).slice(8, -1); return "Object" === t && r.constructor && (t = r.constructor.name), "Map" === t || "Set" === t ? _Array$from(r) : "Arguments" === t || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(t) ? _arrayLikeToArray(r, a) : void 0; } }
@@ -372,7 +373,7 @@ var LocusInfo = exports.default = /*#__PURE__*/function (_EventsScope) {
               // we need the SELF object to be in the received message, because it contains visibleDataSets
               // and these are needed to initialize all the hash trees
               selfObject = (_data$hashTreeMessage = data.hashTreeMessage.locusStateElements) === null || _data$hashTreeMessage === void 0 ? void 0 : _data$hashTreeMessage.find(function (el) {
-                return (0, _hashTreeParser.isSelf)(el);
+                return (0, _utils.isSelf)(el);
               });
               if (selfObject !== null && selfObject !== void 0 && (_selfObject$data = selfObject.data) !== null && _selfObject$data !== void 0 && _selfObject$data.visibleDataSets) {
                 _context.next = 2;