@azure/search-documents 12.2.0-alpha.20250718.1 → 12.2.0-alpha.20250722.2

package/dist/react-native/walk.js

@@ -2,24 +2,22 @@
 // Licensed under the MIT License.
 import { isDefined } from "@azure/core-util";
 export function walk(v, fn) {
-    var _a;
     const seen = new Set();
     const mutated = new Map();
     deepLazyApply(v);
     for (const value of mutated.values()) {
         replaceChildren(value);
     }
-    return (_a = mutated.get(v)) !== null && _a !== void 0 ? _a : v;
+    return mutated.get(v) ?? v;
     function deepLazyApply(value) {
-        var _a, _b;
         if (seen.has(value)) {
             return;
         }
         seen.add(value);
-        const children = getChildren((_a = cachedApply(value)) !== null && _a !== void 0 ? _a : value);
-        children === null || children === void 0 ? void 0 : children.forEach(deepLazyApply);
-        if (children === null || children === void 0 ? void 0 : children.some((node) => mutated.has(node))) {
-            mutated.set(value, (_b = mutated.get(value)) !== null && _b !== void 0 ? _b : shallowCopy(value));
+        const children = getChildren(cachedApply(value) ?? value);
+        children?.forEach(deepLazyApply);
+        if (children?.some((node) => mutated.has(node))) {
+            mutated.set(value, mutated.get(value) ?? shallowCopy(value));
         }
     }
     function cachedApply(value) {
@@ -39,14 +37,12 @@ export function walk(v, fn) {
         }
         else if (Array.isArray(applied)) {
             applied.forEach((e, i) => {
-                var _a;
-                applied[i] = (_a = mutated.get(e)) !== null && _a !== void 0 ? _a : e;
+                applied[i] = mutated.get(e) ?? e;
             });
         }
         else if (typeof applied === "object" && applied !== null) {
             Object.keys(applied).forEach((key) => {
-                var _a;
-                applied[key] = (_a = mutated.get(applied[key])) !== null && _a !== void 0 ? _a : applied[key];
+                applied[key] = mutated.get(applied[key]) ?? applied[key];
             });
         }
     }
@@ -71,7 +67,8 @@ function shallowCopy(value) {
     const maybeCopy = Array.isArray(value)
         ? value.map((v) => v)
         : typeof value === "object" && value !== null
-            ? Object.assign({}, value) : value;
+            ? { ...value }
+            : value;
     return value === maybeCopy
         ? value
         : Object.setPrototypeOf(maybeCopy, Object.getPrototypeOf(value));

package/dist/react-native/walk.js.map

@@ -1 +1 @@
-{"version":3,"file":"walk.js","sourceRoot":"","sources":["../../src/walk.ts"],"names":[],"mappings":"AAAA,uCAAuC;AACvC,kCAAkC;AAElC,OAAO,EAAE,SAAS,EAAE,MAAM,kBAAkB,CAAC;AAE7C,MAAM,UAAU,IAAI,CAAC,CAAU,EAAE,EAA0B;;IACzD,MAAM,IAAI,GAAG,IAAI,GAAG,EAAE,CAAC;IACvB,MAAM,OAAO,GAAG,IAAI,GAAG,EAAE,CAAC;IAC1B,aAAa,CAAC,CAAC,CAAC,CAAC;IACjB,KAAK,MAAM,KAAK,IAAI,OAAO,CAAC,MAAM,EAAE,EAAE,CAAC;QACrC,eAAe,CAAC,KAAK,CAAC,CAAC;IACzB,CAAC;IACD,OAAO,MAAA,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,mCAAI,CAAC,CAAC;IAE3B,SAAS,aAAa,CAAC,KAAc;;QACnC,IAAI,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;YACpB,OAAO;QACT,CAAC;QACD,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QAEhB,MAAM,QAAQ,GAAG,WAAW,CAAC,MAAA,WAAW,CAAC,KAAK,CAAC,mCAAI,KAAK,CAAC,CAAC;QAC1D,QAAQ,aAAR,QAAQ,uBAAR,QAAQ,CAAE,OAAO,CAAC,aAAa,CAAC,CAAC;QACjC,IAAI,QAAQ,aAAR,QAAQ,uBAAR,QAAQ,CAAE,IAAI,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC;YAChD,OAAO,CAAC,GAAG,CAAC,KAAK,EAAE,MAAA,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,mCAAI,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC;QAC/D,CAAC;IACH,CAAC;IAED,SAAS,WAAW,CAAC,KAAc;QACjC,MAAM,MAAM,GAAG,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QAClC,IAAI,SAAS,CAAC,MAAM,CAAC,EAAE,CAAC;YACtB,OAAO,MAAM,CAAC;QAChB,CAAC;QACD,MAAM,OAAO,GAAG,EAAE,CAAC,KAAK,CAAC,CAAC;QAC1B,IAAI,KAAK,KAAK,OAAO,EAAE,CAAC;YACtB,OAAO,CAAC,GAAG,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;QAC9B,CAAC;QACD,OAAO,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;IAC5B,CAAC;IAED,SAAS,eAAe,CAAC,OAAgB;QACvC,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,EAAE,CAAC;YACxB,OAAO;QACT,CAAC;aAAM,IAAI,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE,CAAC;YAClC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;;gBACvB,OAAO,CAAC,CAAC,CAAC,GAAG,MAAA,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,mCAAI,CAAC,CAAC;YACnC,CAAC,CAAC,CAAC;QACL,CAAC;aAAM,IAAI,OAAO,OAAO,KAAK,QAAQ,IAAI,OAAO,KAAK,IAAI,EAAE,CAAC;YAC3D,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,EAAE;;gBAClC,OAAe,CAAC,GAAG,CAAC,GAAG,MAAA,OAAO,CAAC,GAAG,CAAE,OAAe,CAAC,GAAG,CAAC,CAAC,mCAAK,OAAe,CAAC,GAAG,CAAC,CAAC;YACtF,CAAC,CAAC,CAAC;QACL,CAAC;IACH,CAAC;AACH,CAAC;AAED;;;GAGG;AACH,SAAS,SAAS,CAAC,CAAU;IAC3B,OAAO,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,KAAK,QAAQ,IAAI,CAAC,KAAK,IAAI,CAAC;AAClF,CAAC;AAED,SAAS,WAAW,CAAC,CAAU;IAC7B,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC;QAClB,OAAO;IACT,CAAC;IAED,IAAI,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC;QACrB,OAAO,CAAC,CAAC;IACX,CAAC;IAED,OAAO,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;AAC1B,CAAC;AAED,SAAS,WAAW,CAAC,KAAc;IACjC,MAAM,SAAS,GAAG,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC;QACpC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;QACrB,CAAC,CAAC,OAAO,KAAK,KAAK,QAAQ,IAAI,KAAK,KAAK,IAAI;YAC3C,CAAC,mBAAM,KAAK,EACZ,CAAC,CAAC,KAAK,CAAC;IAEZ,OAAO,KAAK,KAAK,SAAS;QACxB,CAAC,CAAC,KAAK;QACP,CAAC,CAAC,MAAM,CAAC,cAAc,CAAC,SAAS,EAAE,MAAM,CAAC,cAAc,CAAC,KAAK,CAAC,CAAC,CAAC;AACrE,CAAC","sourcesContent":["// Copyright (c) Microsoft Corporation.\n// Licensed under the MIT License.\n\nimport { isDefined } from \"@azure/core-util\";\n\nexport function walk(v: unknown, fn: <T>(val: T) => unknown): unknown {\n  const seen = new Set();\n  const mutated = new Map();\n  deepLazyApply(v);\n  for (const value of mutated.values()) {\n    replaceChildren(value);\n  }\n  return mutated.get(v) ?? v;\n\n  function deepLazyApply(value: unknown): void {\n    if (seen.has(value)) {\n      return;\n    }\n    seen.add(value);\n\n    const children = getChildren(cachedApply(value) ?? value);\n    children?.forEach(deepLazyApply);\n    if (children?.some((node) => mutated.has(node))) {\n      mutated.set(value, mutated.get(value) ?? shallowCopy(value));\n    }\n  }\n\n  function cachedApply(value: unknown): unknown | undefined {\n    const cached = mutated.get(value);\n    if (isDefined(cached)) {\n      return cached;\n    }\n    const applied = fn(value);\n    if (value !== applied) {\n      mutated.set(value, applied);\n    }\n    return mutated.get(value);\n  }\n\n  function replaceChildren(applied: unknown): void {\n    if (!isComplex(applied)) {\n      return;\n    } else if (Array.isArray(applied)) {\n      applied.forEach((e, i) => {\n        applied[i] = mutated.get(e) ?? e;\n      });\n    } else if (typeof applied === \"object\" && applied !== null) {\n      Object.keys(applied).forEach((key) => {\n        (applied as any)[key] = mutated.get((applied as any)[key]) ?? (applied as any)[key];\n      });\n    }\n  }\n}\n\n/**\n * Array inputs SHOULD not have both complex and non-complex elements. This function determines\n * whether an array is complex based solely on the first element.\n */\nfunction isComplex(v: unknown): v is object {\n  return Array.isArray(v) ? isComplex(v[0]) : typeof v === \"object\" && v !== null;\n}\n\nfunction getChildren(v: unknown): unknown[] | undefined {\n  if (!isComplex(v)) {\n    return;\n  }\n\n  if (Array.isArray(v)) {\n    return v;\n  }\n\n  return Object.values(v);\n}\n\nfunction shallowCopy(value: unknown): unknown {\n  const maybeCopy = Array.isArray(value)\n    ? value.map((v) => v)\n    : typeof value === \"object\" && value !== null\n      ? { ...value }\n      : value;\n\n  return value === maybeCopy\n    ? value\n    : Object.setPrototypeOf(maybeCopy, Object.getPrototypeOf(value));\n}\n"]}
+{"version":3,"file":"walk.js","sourceRoot":"","sources":["../../src/walk.ts"],"names":[],"mappings":"AAAA,uCAAuC;AACvC,kCAAkC;AAElC,OAAO,EAAE,SAAS,EAAE,MAAM,kBAAkB,CAAC;AAE7C,MAAM,UAAU,IAAI,CAAC,CAAU,EAAE,EAA0B;IACzD,MAAM,IAAI,GAAG,IAAI,GAAG,EAAE,CAAC;IACvB,MAAM,OAAO,GAAG,IAAI,GAAG,EAAE,CAAC;IAC1B,aAAa,CAAC,CAAC,CAAC,CAAC;IACjB,KAAK,MAAM,KAAK,IAAI,OAAO,CAAC,MAAM,EAAE,EAAE,CAAC;QACrC,eAAe,CAAC,KAAK,CAAC,CAAC;IACzB,CAAC;IACD,OAAO,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;IAE3B,SAAS,aAAa,CAAC,KAAc;QACnC,IAAI,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;YACpB,OAAO;QACT,CAAC;QACD,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QAEhB,MAAM,QAAQ,GAAG,WAAW,CAAC,WAAW,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC,CAAC;QAC1D,QAAQ,EAAE,OAAO,CAAC,aAAa,CAAC,CAAC;QACjC,IAAI,QAAQ,EAAE,IAAI,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC;YAChD,OAAO,CAAC,GAAG,CAAC,KAAK,EAAE,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC;QAC/D,CAAC;IACH,CAAC;IAED,SAAS,WAAW,CAAC,KAAc;QACjC,MAAM,MAAM,GAAG,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QAClC,IAAI,SAAS,CAAC,MAAM,CAAC,EAAE,CAAC;YACtB,OAAO,MAAM,CAAC;QAChB,CAAC;QACD,MAAM,OAAO,GAAG,EAAE,CAAC,KAAK,CAAC,CAAC;QAC1B,IAAI,KAAK,KAAK,OAAO,EAAE,CAAC;YACtB,OAAO,CAAC,GAAG,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;QAC9B,CAAC;QACD,OAAO,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;IAC5B,CAAC;IAED,SAAS,eAAe,CAAC,OAAgB;QACvC,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,EAAE,CAAC;YACxB,OAAO;QACT,CAAC;aAAM,IAAI,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE,CAAC;YAClC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;gBACvB,OAAO,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;YACnC,CAAC,CAAC,CAAC;QACL,CAAC;aAAM,IAAI,OAAO,OAAO,KAAK,QAAQ,IAAI,OAAO,KAAK,IAAI,EAAE,CAAC;YAC3D,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,EAAE;gBAClC,OAAe,CAAC,GAAG,CAAC,GAAG,OAAO,CAAC,GAAG,CAAE,OAAe,CAAC,GAAG,CAAC,CAAC,IAAK,OAAe,CAAC,GAAG,CAAC,CAAC;YACtF,CAAC,CAAC,CAAC;QACL,CAAC;IACH,CAAC;AACH,CAAC;AAED;;;GAGG;AACH,SAAS,SAAS,CAAC,CAAU;IAC3B,OAAO,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,KAAK,QAAQ,IAAI,CAAC,KAAK,IAAI,CAAC;AAClF,CAAC;AAED,SAAS,WAAW,CAAC,CAAU;IAC7B,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC;QAClB,OAAO;IACT,CAAC;IAED,IAAI,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC;QACrB,OAAO,CAAC,CAAC;IACX,CAAC;IAED,OAAO,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;AAC1B,CAAC;AAED,SAAS,WAAW,CAAC,KAAc;IACjC,MAAM,SAAS,GAAG,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC;QACpC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;QACrB,CAAC,CAAC,OAAO,KAAK,KAAK,QAAQ,IAAI,KAAK,KAAK,IAAI;YAC3C,CAAC,CAAC,EAAE,GAAG,KAAK,EAAE;YACd,CAAC,CAAC,KAAK,CAAC;IAEZ,OAAO,KAAK,KAAK,SAAS;QACxB,CAAC,CAAC,KAAK;QACP,CAAC,CAAC,MAAM,CAAC,cAAc,CAAC,SAAS,EAAE,MAAM,CAAC,cAAc,CAAC,KAAK,CAAC,CAAC,CAAC;AACrE,CAAC","sourcesContent":["// Copyright (c) Microsoft Corporation.\n// Licensed under the MIT License.\n\nimport { isDefined } from \"@azure/core-util\";\n\nexport function walk(v: unknown, fn: <T>(val: T) => unknown): unknown {\n  const seen = new Set();\n  const mutated = new Map();\n  deepLazyApply(v);\n  for (const value of mutated.values()) {\n    replaceChildren(value);\n  }\n  return mutated.get(v) ?? v;\n\n  function deepLazyApply(value: unknown): void {\n    if (seen.has(value)) {\n      return;\n    }\n    seen.add(value);\n\n    const children = getChildren(cachedApply(value) ?? value);\n    children?.forEach(deepLazyApply);\n    if (children?.some((node) => mutated.has(node))) {\n      mutated.set(value, mutated.get(value) ?? shallowCopy(value));\n    }\n  }\n\n  function cachedApply(value: unknown): unknown | undefined {\n    const cached = mutated.get(value);\n    if (isDefined(cached)) {\n      return cached;\n    }\n    const applied = fn(value);\n    if (value !== applied) {\n      mutated.set(value, applied);\n    }\n    return mutated.get(value);\n  }\n\n  function replaceChildren(applied: unknown): void {\n    if (!isComplex(applied)) {\n      return;\n    } else if (Array.isArray(applied)) {\n      applied.forEach((e, i) => {\n        applied[i] = mutated.get(e) ?? e;\n      });\n    } else if (typeof applied === \"object\" && applied !== null) {\n      Object.keys(applied).forEach((key) => {\n        (applied as any)[key] = mutated.get((applied as any)[key]) ?? (applied as any)[key];\n      });\n    }\n  }\n}\n\n/**\n * Array inputs SHOULD not have both complex and non-complex elements. This function determines\n * whether an array is complex based solely on the first element.\n */\nfunction isComplex(v: unknown): v is object {\n  return Array.isArray(v) ? isComplex(v[0]) : typeof v === \"object\" && v !== null;\n}\n\nfunction getChildren(v: unknown): unknown[] | undefined {\n  if (!isComplex(v)) {\n    return;\n  }\n\n  if (Array.isArray(v)) {\n    return v;\n  }\n\n  return Object.values(v);\n}\n\nfunction shallowCopy(value: unknown): unknown {\n  const maybeCopy = Array.isArray(value)\n    ? value.map((v) => v)\n    : typeof value === \"object\" && value !== null\n      ? { ...value }\n      : value;\n\n  return value === maybeCopy\n    ? value\n    : Object.setPrototypeOf(maybeCopy, Object.getPrototypeOf(value));\n}\n"]}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@azure/search-documents",
-  "version": "12.2.0-alpha.20250718.1",
+  "version": "12.2.0-alpha.20250722.2",
   "description": "Azure client library to use Cognitive Search for node.js and browser.",
   "sdk-type": "client",
   "main": "./dist/commonjs/index.js",
@@ -126,7 +126,7 @@
       "react-native"
     ],
     "selfLink": false,
-    "project": "./tsconfig.src.json"
+    "project": "../../../tsconfig.src.build.json"
   },
   "exports": {
     "./package.json": "./package.json",