@osdk/client 2.8.0-beta.31 → 2.8.0-beta.32
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/CHANGELOG.md +13 -0
- package/build/browser/createMediaFromReference.js +5 -7
- package/build/browser/createMediaFromReference.js.map +1 -1
- package/build/browser/observable/internal/OrderByCanonicalizer.js +1 -1
- package/build/browser/observable/internal/OrderByCanonicalizer.js.map +1 -1
- package/build/browser/observable/internal/WhereClauseCanonicalizer.js +1 -1
- package/build/browser/observable/internal/WhereClauseCanonicalizer.js.map +1 -1
- package/build/browser/util/UserAgent.js +2 -2
- package/build/cjs/MediaReferenceProperty-3LVGUKXN.cjs +22 -0
- package/build/cjs/{MediaReferenceProperty-MZ2PACD4.cjs.map → MediaReferenceProperty-3LVGUKXN.cjs.map} +1 -1
- package/build/cjs/{chunk-7NPAYZLW.cjs → chunk-3LPMQ5DJ.cjs} +82 -73
- package/build/cjs/chunk-3LPMQ5DJ.cjs.map +1 -0
- package/build/cjs/{chunk-ZZ6DP3W4.cjs → chunk-6MWGZMBV.cjs} +10 -10
- package/build/cjs/{chunk-ZZ6DP3W4.cjs.map → chunk-6MWGZMBV.cjs.map} +1 -1
- package/build/cjs/{chunk-GSVXEVM4.cjs → chunk-LCI6OHTV.cjs} +3 -3
- package/build/cjs/{chunk-GSVXEVM4.cjs.map → chunk-LCI6OHTV.cjs.map} +1 -1
- package/build/cjs/index.cjs +11 -11
- package/build/cjs/public/internal.cjs +8 -8
- package/build/cjs/public/unstable-do-not-use.cjs +70 -70
- package/build/cjs/public/unstable-do-not-use.cjs.map +1 -1
- package/build/esm/createMediaFromReference.js +5 -7
- package/build/esm/createMediaFromReference.js.map +1 -1
- package/build/esm/observable/internal/OrderByCanonicalizer.js +1 -1
- package/build/esm/observable/internal/OrderByCanonicalizer.js.map +1 -1
- package/build/esm/observable/internal/WhereClauseCanonicalizer.js +1 -1
- package/build/esm/observable/internal/WhereClauseCanonicalizer.js.map +1 -1
- package/build/esm/util/UserAgent.js +2 -2
- package/package.json +11 -11
- package/build/cjs/MediaReferenceProperty-MZ2PACD4.cjs +0 -22
- package/build/cjs/chunk-7NPAYZLW.cjs.map +0 -1
package/CHANGELOG.md
CHANGED
|
@@ -1,5 +1,18 @@
|
|
|
1
1
|
# @osdk/client
|
|
2
2
|
|
|
3
|
+
## 2.8.0-beta.32
|
|
4
|
+
|
|
5
|
+
### Minor Changes
|
|
6
|
+
|
|
7
|
+
- 46f0a47: Update platform SDK to 2.57.0 and handle new typeReference query data type
|
|
8
|
+
|
|
9
|
+
### Patch Changes
|
|
10
|
+
|
|
11
|
+
- Updated dependencies [46f0a47]
|
|
12
|
+
- @osdk/generator-converters@2.8.0-beta.32
|
|
13
|
+
- @osdk/api@2.8.0-beta.32
|
|
14
|
+
- @osdk/client.unstable@2.8.0-beta.32
|
|
15
|
+
|
|
3
16
|
## 2.8.0-beta.31
|
|
4
17
|
|
|
5
18
|
### Minor Changes
|
|
@@ -15,6 +15,7 @@
|
|
|
15
15
|
*/
|
|
16
16
|
|
|
17
17
|
import { MediaSets } from "@osdk/foundry.mediasets";
|
|
18
|
+
import invariant from "tiny-invariant";
|
|
18
19
|
/**
|
|
19
20
|
* @internal
|
|
20
21
|
* Creates a Media object from a MediaReference for query results.
|
|
@@ -37,20 +38,17 @@ export function createMediaFromReference(client, mediaReference) {
|
|
|
37
38
|
} : undefined);
|
|
38
39
|
},
|
|
39
40
|
async fetchMetadata() {
|
|
40
|
-
const metadata = await MediaSets.metadata(client, mediaSetRid, mediaItemRid, {
|
|
41
|
-
preview: true
|
|
42
|
-
}, token ? {
|
|
43
|
-
ReadToken: token
|
|
44
|
-
} : undefined);
|
|
45
41
|
const info = await MediaSets.info(client, mediaSetRid, mediaItemRid, {
|
|
46
42
|
preview: true
|
|
47
43
|
}, token ? {
|
|
48
44
|
ReadToken: token
|
|
49
45
|
} : undefined);
|
|
46
|
+
!(info.sizeBytes != null) ? process.env.NODE_ENV !== "production" ? invariant(false, "Expected sizeBytes in media info") : invariant(false) : void 0;
|
|
47
|
+
!(info.mimeType != null) ? process.env.NODE_ENV !== "production" ? invariant(false, "Expected mimeType in media info") : invariant(false) : void 0;
|
|
50
48
|
return {
|
|
51
49
|
path: info.path,
|
|
52
|
-
sizeBytes:
|
|
53
|
-
mediaType:
|
|
50
|
+
sizeBytes: info.sizeBytes,
|
|
51
|
+
mediaType: info.mimeType
|
|
54
52
|
};
|
|
55
53
|
},
|
|
56
54
|
getMediaReference() {
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"createMediaFromReference.js","names":["MediaSets","createMediaFromReference","client","mediaReference","mediaSetRid","mediaItemRid","reference","mediaSetViewItem","token","fetchContents","read","preview","ReadToken","undefined","fetchMetadata","
|
|
1
|
+
{"version":3,"file":"createMediaFromReference.js","names":["MediaSets","invariant","createMediaFromReference","client","mediaReference","mediaSetRid","mediaItemRid","reference","mediaSetViewItem","token","fetchContents","read","preview","ReadToken","undefined","fetchMetadata","info","sizeBytes","process","env","NODE_ENV","mimeType","path","mediaType","getMediaReference"],"sources":["createMediaFromReference.ts"],"sourcesContent":["/*\n * Copyright 2024 Palantir Technologies, Inc. All rights reserved.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport type { Media, MediaMetadata, MediaReference } from \"@osdk/api\";\nimport { MediaSets } from \"@osdk/foundry.mediasets\";\nimport invariant from \"tiny-invariant\";\nimport type { MinimalClient } from \"./MinimalClientContext.js\";\n\n/**\n * @internal\n * Creates a Media object from a MediaReference for query results.\n * Unlike MediaReferencePropertyImpl, this doesn't require object context\n * and directly accesses the media set APIs. This is intended for MediaReferences returned\n * from query results or to be used by the functions runtime,\n */\nexport function createMediaFromReference(\n client: MinimalClient,\n mediaReference: MediaReference,\n): Media {\n const { mediaSetRid, mediaItemRid } =\n mediaReference.reference.mediaSetViewItem;\n const token = mediaReference.reference.mediaSetViewItem.token;\n return {\n async fetchContents(): Promise<Response> {\n return MediaSets.read(\n client,\n mediaSetRid,\n mediaItemRid,\n { preview: true },\n token ? { ReadToken: token } : undefined,\n );\n },\n\n async fetchMetadata(): Promise<MediaMetadata> {\n const info = await MediaSets.info(\n client,\n mediaSetRid,\n mediaItemRid,\n { preview: true },\n token ? { ReadToken: token } : undefined,\n );\n\n invariant(info.sizeBytes != null, \"Expected sizeBytes in media info\");\n invariant(info.mimeType != null, \"Expected mimeType in media info\");\n\n return {\n path: info.path,\n sizeBytes: info.sizeBytes,\n mediaType: info.mimeType,\n };\n },\n\n getMediaReference(): MediaReference {\n return mediaReference;\n },\n };\n}\n"],"mappings":"AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAGA,SAASA,SAAS,QAAQ,yBAAyB;AACnD,OAAOC,SAAS,MAAM,gBAAgB;AAGtC;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO,SAASC,wBAAwBA,CACtCC,MAAqB,EACrBC,cAA8B,EACvB;EACP,MAAM;IAAEC,WAAW;IAAEC;EAAa,CAAC,GACjCF,cAAc,CAACG,SAAS,CAACC,gBAAgB;EAC3C,MAAMC,KAAK,GAAGL,cAAc,CAACG,SAAS,CAACC,gBAAgB,CAACC,KAAK;EAC7D,OAAO;IACL,MAAMC,aAAaA,CAAA,EAAsB;MACvC,OAAOV,SAAS,CAACW,IAAI,CACnBR,MAAM,EACNE,WAAW,EACXC,YAAY,EACZ;QAAEM,OAAO,EAAE;MAAK,CAAC,EACjBH,KAAK,GAAG;QAAEI,SAAS,EAAEJ;MAAM,CAAC,GAAGK,SACjC,CAAC;IACH,CAAC;IAED,MAAMC,aAAaA,CAAA,EAA2B;MAC5C,MAAMC,IAAI,GAAG,MAAMhB,SAAS,CAACgB,IAAI,CAC/Bb,MAAM,EACNE,WAAW,EACXC,YAAY,EACZ;QAAEM,OAAO,EAAE;MAAK,CAAC,EACjBH,KAAK,GAAG;QAAEI,SAAS,EAAEJ;MAAM,CAAC,GAAGK,SACjC,CAAC;MAED,EAAUE,IAAI,CAACC,SAAS,IAAI,IAAI,IAAAC,OAAA,CAAAC,GAAA,CAAAC,QAAA,oBAAhCnB,SAAS,QAAyB,kCAAkC,IAApEA,SAAS;MACT,EAAUe,IAAI,CAACK,QAAQ,IAAI,IAAI,IAAAH,OAAA,CAAAC,GAAA,CAAAC,QAAA,oBAA/BnB,SAAS,QAAwB,iCAAiC,IAAlEA,SAAS;MAET,OAAO;QACLqB,IAAI,EAAEN,IAAI,CAACM,IAAI;QACfL,SAAS,EAAED,IAAI,CAACC,SAAS;QACzBM,SAAS,EAAEP,IAAI,CAACK;MAClB,CAAC;IACH,CAAC;IAEDG,iBAAiBA,CAAA,EAAmB;MAClC,OAAOpB,cAAc;IACvB;EACF,CAAC;AACH","ignoreList":[]}
|
|
@@ -17,7 +17,7 @@
|
|
|
17
17
|
import { WeakRefTrie } from "./WeakRefTrie.js";
|
|
18
18
|
export class OrderByCanonicalizer {
|
|
19
19
|
#trie = new WeakRefTrie(array => {
|
|
20
|
-
const pairs = array.reduce(
|
|
20
|
+
const pairs = array.reduce((result, _, index, array) => {
|
|
21
21
|
if (index % 2 === 0 && array[index] != null) {
|
|
22
22
|
result.push(array.slice(index, index + 2));
|
|
23
23
|
}
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"OrderByCanonicalizer.js","names":["WeakRefTrie","OrderByCanonicalizer","trie","array","pairs","reduce","result","_","index","push","slice","data","Object","fromEntries","canonicalize","orderBy","undefined","strings","entries","flat","lookupArray"],"sources":["OrderByCanonicalizer.ts"],"sourcesContent":["/*\n * Copyright 2025 Palantir Technologies, Inc. All rights reserved.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport type { ObjectTypeDefinition } from \"@osdk/api\";\nimport type { OrderBy } from \"../ObservableClient.js\";\nimport type { Canonical } from \"./Canonical.js\";\nimport { WeakRefTrie } from \"./WeakRefTrie.js\";\n\nexport class OrderByCanonicalizer {\n #trie = new WeakRefTrie(\n (array: Array<string>) => {\n const pairs = array.reduce<Array<[string, \"asc\" | \"desc\"]>>(\n
|
|
1
|
+
{"version":3,"file":"OrderByCanonicalizer.js","names":["WeakRefTrie","OrderByCanonicalizer","trie","array","pairs","reduce","result","_","index","push","slice","data","Object","fromEntries","canonicalize","orderBy","undefined","strings","entries","flat","lookupArray"],"sources":["OrderByCanonicalizer.ts"],"sourcesContent":["/*\n * Copyright 2025 Palantir Technologies, Inc. All rights reserved.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport type { ObjectTypeDefinition } from \"@osdk/api\";\nimport type { OrderBy } from \"../ObservableClient.js\";\nimport type { Canonical } from \"./Canonical.js\";\nimport { WeakRefTrie } from \"./WeakRefTrie.js\";\n\nexport class OrderByCanonicalizer {\n #trie = new WeakRefTrie(\n (array: Array<string>) => {\n const pairs = array.reduce<Array<[string, \"asc\" | \"desc\"]>>(\n (result, _, index, array) => {\n if (index % 2 === 0 && array[index] != null) {\n result.push(\n array.slice(index, index + 2) as [string, \"asc\" | \"desc\"],\n );\n }\n return result;\n },\n [],\n );\n const data = Object.fromEntries(pairs) satisfies Record<\n string,\n \"asc\" | \"desc\"\n > as Canonical<OrderBy<ObjectTypeDefinition>>;\n return data;\n },\n );\n\n canonicalize(\n orderBy: Record<string, \"asc\" | \"desc\" | undefined>,\n ): Canonical<Record<string, \"asc\" | \"desc\" | undefined>>;\n canonicalize(\n orderBy: Record<string, \"asc\" | \"desc\" | undefined> | undefined,\n ): Canonical<Record<string, \"asc\" | \"desc\" | undefined>> | undefined;\n canonicalize(\n orderBy: Record<string, \"asc\" | \"desc\" | undefined> | undefined,\n ): Canonical<Record<string, \"asc\" | \"desc\" | undefined>> | undefined {\n if (orderBy == null) {\n return undefined;\n }\n const strings = Object.entries(orderBy).flat();\n return this.#trie.lookupArray(strings);\n }\n}\n"],"mappings":"AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAKA,SAASA,WAAW,QAAQ,kBAAkB;AAE9C,OAAO,MAAMC,oBAAoB,CAAC;EAChC,CAACC,IAAI,GAAG,IAAIF,WAAW,CACpBG,KAAoB,IAAK;IACxB,MAAMC,KAAK,GAAGD,KAAK,CAACE,MAAM,CACxB,CAACC,MAAM,EAAEC,CAAC,EAAEC,KAAK,EAAEL,KAAK,KAAK;MAC3B,IAAIK,KAAK,GAAG,CAAC,KAAK,CAAC,IAAIL,KAAK,CAACK,KAAK,CAAC,IAAI,IAAI,EAAE;QAC3CF,MAAM,CAACG,IAAI,CACTN,KAAK,CAACO,KAAK,CAACF,KAAK,EAAEA,KAAK,GAAG,CAAC,CAC9B,CAAC;MACH;MACA,OAAOF,MAAM;IACf,CAAC,EACD,EACF,CAAC;IACD,MAAMK,IAAI,GAAGC,MAAM,CAACC,WAAW,CAACT,KAAK,CAGQ;IAC7C,OAAOO,IAAI;EACb,CACF,CAAC;EAQDG,YAAYA,CACVC,OAA+D,EACI;IACnE,IAAIA,OAAO,IAAI,IAAI,EAAE;MACnB,OAAOC,SAAS;IAClB;IACA,MAAMC,OAAO,GAAGL,MAAM,CAACM,OAAO,CAACH,OAAO,CAAC,CAACI,IAAI,CAAC,CAAC;IAC9C,OAAO,IAAI,CAAC,CAACjB,IAAI,CAACkB,WAAW,CAACH,OAAO,CAAC;EACxC;AACF","ignoreList":[]}
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"WhereClauseCanonicalizer.js","names":["Trie","deepEqual","invariant","WhereClauseCanonicalizer","cache","WeakMap","trie","existingOptions","Map","canonicalize","where","undefined","has","get","keysSet","Set","calculatedCanon","toCanon","cacheKey","lookupArray","Array","from","sort","lookupEntry","options","set","canon","find","ref","deref","push","WeakRef","#toCanon","process","env","NODE_ENV","isArray","$and","Object","keys","length","fromEntries","entries","a","b","localeCompare","map","k","v","add","x"],"sources":["WhereClauseCanonicalizer.ts"],"sourcesContent":["/*\n * Copyright 2025 Palantir Technologies, Inc. All rights reserved.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport type {\n ObjectOrInterfaceDefinition,\n SimplePropertyDef,\n WhereClause,\n} from \"@osdk/api\";\nimport { Trie } from \"@wry/trie\";\nimport deepEqual from \"fast-deep-equal\";\nimport invariant from \"tiny-invariant\";\nimport type { Canonical } from \"./Canonical.js\";\nimport type { SimpleWhereClause } from \"./SimpleWhereClause.js\";\n\nexport class WhereClauseCanonicalizer {\n /**\n * This is a shortcut cache for any WhereClause's that we have\n * seen and already canonicalized. The theory behind this\n * is that well behaving React applications will either `useMemo`\n * their where clause, or store it in state or pass it through as\n * props such that we are likely to get the same WhereClause\n * object multiple times and we can skip unnecessary work.\n */\n #cache = new WeakMap<\n | WhereClause<\n ObjectOrInterfaceDefinition,\n Record<string, SimplePropertyDef>\n >\n | SimpleWhereClause,\n Canonical<SimpleWhereClause>\n >();\n\n /**\n * This is a trie that stores the sorted collapsed keys of a where clause to\n * the cache key for canonicalized options. In theory this keeps the number of\n * deepEqual comparisons down to a minimum but its probably overkill.\n */\n #trie = new Trie<object>();\n\n /**\n * This is a cache from the cacheKey provided by `this.#trie` to the potential\n * canonicalized options.\n */\n #existingOptions: Map<object, {\n options: WeakRef<Canonical<SimpleWhereClause>>[];\n }> = new Map();\n\n public canonicalize<\n T extends ObjectOrInterfaceDefinition,\n RDPs extends Record<string, SimplePropertyDef> = {},\n >(\n where: WhereClause<T, RDPs> | SimpleWhereClause,\n ): Canonical<SimpleWhereClause>;\n public canonicalize(\n where: object | undefined,\n ): Canonical<SimpleWhereClause> | undefined;\n public canonicalize<\n T extends ObjectOrInterfaceDefinition,\n RDPs extends Record<string, SimplePropertyDef> = {},\n >(\n where: WhereClause<T, RDPs> | SimpleWhereClause | undefined,\n ): Canonical<SimpleWhereClause> | undefined {\n if (where == null) {\n return undefined;\n }\n // fastest shortcut\n if (this.#cache.has(where)) {\n return this.#cache.get(where)!;\n }\n\n const keysSet = new Set<string>();\n const calculatedCanon = this.#toCanon(where, keysSet);\n const cacheKey = this.#trie.lookupArray(Array.from(keysSet).sort());\n const lookupEntry = this.#existingOptions.get(cacheKey)\n ?? { options: [] as WeakRef<Canonical<SimpleWhereClause>>[] };\n this.#existingOptions.set(cacheKey, lookupEntry);\n\n const canon =\n lookupEntry.options.find((ref) => deepEqual(ref.deref(), calculatedCanon))\n ?.deref()\n ?? calculatedCanon;\n\n if (canon === calculatedCanon) {\n // This means no existing options were found\n lookupEntry.options.push(new WeakRef(canon));\n }\n\n this.#cache.set(where, canon);\n return canon;\n }\n\n #toCanon = <\n T extends ObjectOrInterfaceDefinition,\n RDPs extends Record<string, SimplePropertyDef> = {},\n >(\n where: WhereClause<T, RDPs> | SimpleWhereClause,\n set: Set<string> = new Set<string>(),\n ): Canonical<SimpleWhereClause> => {\n if (\"$and\" in where) {\n if (process.env.NODE_ENV !== \"production\") {\n invariant(Array.isArray(where.$and), \"expected $and to be an array\");\n invariant(\n Object.keys(where).length === 1,\n \"expected only $and to be present\",\n );\n }\n if ((where as { $and: SimpleWhereClause[] }).$and.length === 0) {\n // empty $and is a no-op\n return {} as Canonical<SimpleWhereClause>;\n }\n if ((where as { $and: SimpleWhereClause[] }).$and.length === 1) {\n return this.#toCanon(\n (where as { $and: SimpleWhereClause[] }).$and[0],\n set,\n );\n }\n }\n // This is incomplete for all the cases possible but it gets us started\n\n return Object.fromEntries(\n Object.entries(where)\n .sort(([a], [b]) => a.localeCompare(b))\n .map(([k, v]) => {\n set.add(k);\n if (k === \"$and\" || k === \"$or\") {\n return [\n k,\n (v as Array<SimpleWhereClause>).map(x => this.#toCanon(x, set)),\n ];\n }\n if (\n k !== \"$not\" && typeof v === \"object\" && v != null && \"$eq\" in v\n ) {\n return [k, v
|
|
1
|
+
{"version":3,"file":"WhereClauseCanonicalizer.js","names":["Trie","deepEqual","invariant","WhereClauseCanonicalizer","cache","WeakMap","trie","existingOptions","Map","canonicalize","where","undefined","has","get","keysSet","Set","calculatedCanon","toCanon","cacheKey","lookupArray","Array","from","sort","lookupEntry","options","set","canon","find","ref","deref","push","WeakRef","#toCanon","process","env","NODE_ENV","isArray","$and","Object","keys","length","fromEntries","entries","a","b","localeCompare","map","k","v","add","x","$eq"],"sources":["WhereClauseCanonicalizer.ts"],"sourcesContent":["/*\n * Copyright 2025 Palantir Technologies, Inc. All rights reserved.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport type {\n ObjectOrInterfaceDefinition,\n SimplePropertyDef,\n WhereClause,\n} from \"@osdk/api\";\nimport { Trie } from \"@wry/trie\";\nimport deepEqual from \"fast-deep-equal\";\nimport invariant from \"tiny-invariant\";\nimport type { Canonical } from \"./Canonical.js\";\nimport type { SimpleWhereClause } from \"./SimpleWhereClause.js\";\n\nexport class WhereClauseCanonicalizer {\n /**\n * This is a shortcut cache for any WhereClause's that we have\n * seen and already canonicalized. The theory behind this\n * is that well behaving React applications will either `useMemo`\n * their where clause, or store it in state or pass it through as\n * props such that we are likely to get the same WhereClause\n * object multiple times and we can skip unnecessary work.\n */\n #cache = new WeakMap<\n | WhereClause<\n ObjectOrInterfaceDefinition,\n Record<string, SimplePropertyDef>\n >\n | SimpleWhereClause,\n Canonical<SimpleWhereClause>\n >();\n\n /**\n * This is a trie that stores the sorted collapsed keys of a where clause to\n * the cache key for canonicalized options. In theory this keeps the number of\n * deepEqual comparisons down to a minimum but its probably overkill.\n */\n #trie = new Trie<object>();\n\n /**\n * This is a cache from the cacheKey provided by `this.#trie` to the potential\n * canonicalized options.\n */\n #existingOptions: Map<object, {\n options: WeakRef<Canonical<SimpleWhereClause>>[];\n }> = new Map();\n\n public canonicalize<\n T extends ObjectOrInterfaceDefinition,\n RDPs extends Record<string, SimplePropertyDef> = {},\n >(\n where: WhereClause<T, RDPs> | SimpleWhereClause,\n ): Canonical<SimpleWhereClause>;\n public canonicalize(\n where: object | undefined,\n ): Canonical<SimpleWhereClause> | undefined;\n public canonicalize<\n T extends ObjectOrInterfaceDefinition,\n RDPs extends Record<string, SimplePropertyDef> = {},\n >(\n where: WhereClause<T, RDPs> | SimpleWhereClause | undefined,\n ): Canonical<SimpleWhereClause> | undefined {\n if (where == null) {\n return undefined;\n }\n // fastest shortcut\n if (this.#cache.has(where)) {\n return this.#cache.get(where)!;\n }\n\n const keysSet = new Set<string>();\n const calculatedCanon = this.#toCanon(where, keysSet);\n const cacheKey = this.#trie.lookupArray(Array.from(keysSet).sort());\n const lookupEntry = this.#existingOptions.get(cacheKey)\n ?? { options: [] as WeakRef<Canonical<SimpleWhereClause>>[] };\n this.#existingOptions.set(cacheKey, lookupEntry);\n\n const canon =\n lookupEntry.options.find((ref) => deepEqual(ref.deref(), calculatedCanon))\n ?.deref()\n ?? calculatedCanon;\n\n if (canon === calculatedCanon) {\n // This means no existing options were found\n lookupEntry.options.push(new WeakRef(canon));\n }\n\n this.#cache.set(where, canon);\n return canon;\n }\n\n #toCanon = <\n T extends ObjectOrInterfaceDefinition,\n RDPs extends Record<string, SimplePropertyDef> = {},\n >(\n where: WhereClause<T, RDPs> | SimpleWhereClause,\n set: Set<string> = new Set<string>(),\n ): Canonical<SimpleWhereClause> => {\n if (\"$and\" in where) {\n if (process.env.NODE_ENV !== \"production\") {\n invariant(Array.isArray(where.$and), \"expected $and to be an array\");\n invariant(\n Object.keys(where).length === 1,\n \"expected only $and to be present\",\n );\n }\n if ((where as { $and: SimpleWhereClause[] }).$and.length === 0) {\n // empty $and is a no-op\n return {} as Canonical<SimpleWhereClause>;\n }\n if ((where as { $and: SimpleWhereClause[] }).$and.length === 1) {\n return this.#toCanon(\n (where as { $and: SimpleWhereClause[] }).$and[0],\n set,\n );\n }\n }\n // This is incomplete for all the cases possible but it gets us started\n\n return Object.fromEntries(\n Object.entries(where)\n .sort(([a], [b]) => a.localeCompare(b))\n .map(([k, v]) => {\n set.add(k);\n if (k === \"$and\" || k === \"$or\") {\n return [\n k,\n (v as Array<SimpleWhereClause>).map(x => this.#toCanon(x, set)),\n ];\n }\n if (\n k !== \"$not\" && typeof v === \"object\" && v != null && \"$eq\" in v\n ) {\n return [k, v.$eq];\n }\n return [k, v];\n }),\n ) as Canonical<SimpleWhereClause>;\n };\n}\n"],"mappings":"AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAOA,SAASA,IAAI,QAAQ,WAAW;AAChC,OAAOC,SAAS,MAAM,iBAAiB;AACvC,OAAOC,SAAS,MAAM,gBAAgB;AAItC,OAAO,MAAMC,wBAAwB,CAAC;EACpC;AACF;AACA;AACA;AACA;AACA;AACA;AACA;EACE,CAACC,KAAK,GAAG,IAAIC,OAAO,CAOlB,CAAC;;EAEH;AACF;AACA;AACA;AACA;EACE,CAACC,IAAI,GAAG,IAAIN,IAAI,CAAS,CAAC;;EAE1B;AACF;AACA;AACA;EACE,CAACO,eAAe,GAEX,IAAIC,GAAG,CAAC,CAAC;EAWPC,YAAYA,CAIjBC,KAA2D,EACjB;IAC1C,IAAIA,KAAK,IAAI,IAAI,EAAE;MACjB,OAAOC,SAAS;IAClB;IACA;IACA,IAAI,IAAI,CAAC,CAACP,KAAK,CAACQ,GAAG,CAACF,KAAK,CAAC,EAAE;MAC1B,OAAO,IAAI,CAAC,CAACN,KAAK,CAACS,GAAG,CAACH,KAAK,CAAC;IAC/B;IAEA,MAAMI,OAAO,GAAG,IAAIC,GAAG,CAAS,CAAC;IACjC,MAAMC,eAAe,GAAG,IAAI,CAAC,CAACC,OAAO,CAACP,KAAK,EAAEI,OAAO,CAAC;IACrD,MAAMI,QAAQ,GAAG,IAAI,CAAC,CAACZ,IAAI,CAACa,WAAW,CAACC,KAAK,CAACC,IAAI,CAACP,OAAO,CAAC,CAACQ,IAAI,CAAC,CAAC,CAAC;IACnE,MAAMC,WAAW,GAAG,IAAI,CAAC,CAAChB,eAAe,CAACM,GAAG,CAACK,QAAQ,CAAC,IAClD;MAAEM,OAAO,EAAE;IAA8C,CAAC;IAC/D,IAAI,CAAC,CAACjB,eAAe,CAACkB,GAAG,CAACP,QAAQ,EAAEK,WAAW,CAAC;IAEhD,MAAMG,KAAK,GACTH,WAAW,CAACC,OAAO,CAACG,IAAI,CAAEC,GAAG,IAAK3B,SAAS,CAAC2B,GAAG,CAACC,KAAK,CAAC,CAAC,EAAEb,eAAe,CAAC,CAAC,EACtEa,KAAK,CAAC,CAAC,IACNb,eAAe;IAEtB,IAAIU,KAAK,KAAKV,eAAe,EAAE;MAC7B;MACAO,WAAW,CAACC,OAAO,CAACM,IAAI,CAAC,IAAIC,OAAO,CAACL,KAAK,CAAC,CAAC;IAC9C;IAEA,IAAI,CAAC,CAACtB,KAAK,CAACqB,GAAG,CAACf,KAAK,EAAEgB,KAAK,CAAC;IAC7B,OAAOA,KAAK;EACd;EAEA,CAACT,OAAO,GAAGe,CAITtB,KAA+C,EAC/Ce,GAAgB,GAAG,IAAIV,GAAG,CAAS,CAAC,KACH;IACjC,IAAI,MAAM,IAAIL,KAAK,EAAE;MACnB,IAAIuB,OAAO,CAACC,GAAG,CAACC,QAAQ,KAAK,YAAY,EAAE;QACzC,CAAUf,KAAK,CAACgB,OAAO,CAAC1B,KAAK,CAAC2B,IAAI,CAAC,GAAAJ,OAAA,CAAAC,GAAA,CAAAC,QAAA,oBAAnCjC,SAAS,QAA4B,8BAA8B,IAAnEA,SAAS;QACT,EACEoC,MAAM,CAACC,IAAI,CAAC7B,KAAK,CAAC,CAAC8B,MAAM,KAAK,CAAC,IAAAP,OAAA,CAAAC,GAAA,CAAAC,QAAA,oBADjCjC,SAAS,QAEP,kCAAkC,IAFpCA,SAAS;MAIX;MACA,IAAKQ,KAAK,CAAmC2B,IAAI,CAACG,MAAM,KAAK,CAAC,EAAE;QAC9D;QACA,OAAO,CAAC,CAAC;MACX;MACA,IAAK9B,KAAK,CAAmC2B,IAAI,CAACG,MAAM,KAAK,CAAC,EAAE;QAC9D,OAAO,IAAI,CAAC,CAACvB,OAAO,CACjBP,KAAK,CAAmC2B,IAAI,CAAC,CAAC,CAAC,EAChDZ,GACF,CAAC;MACH;IACF;IACA;;IAEA,OAAOa,MAAM,CAACG,WAAW,CACvBH,MAAM,CAACI,OAAO,CAAChC,KAAK,CAAC,CAClBY,IAAI,CAAC,CAAC,CAACqB,CAAC,CAAC,EAAE,CAACC,CAAC,CAAC,KAAKD,CAAC,CAACE,aAAa,CAACD,CAAC,CAAC,CAAC,CACtCE,GAAG,CAAC,CAAC,CAACC,CAAC,EAAEC,CAAC,CAAC,KAAK;MACfvB,GAAG,CAACwB,GAAG,CAACF,CAAC,CAAC;MACV,IAAIA,CAAC,KAAK,MAAM,IAAIA,CAAC,KAAK,KAAK,EAAE;QAC/B,OAAO,CACLA,CAAC,EACAC,CAAC,CAA8BF,GAAG,CAACI,CAAC,IAAI,IAAI,CAAC,CAACjC,OAAO,CAACiC,CAAC,EAAEzB,GAAG,CAAC,CAAC,CAChE;MACH;MACA,IACEsB,CAAC,KAAK,MAAM,IAAI,OAAOC,CAAC,KAAK,QAAQ,IAAIA,CAAC,IAAI,IAAI,IAAI,KAAK,IAAIA,CAAC,EAChE;QACA,OAAO,CAACD,CAAC,EAAEC,CAAC,CAACG,GAAG,CAAC;MACnB;MACA,OAAO,CAACJ,CAAC,EAAEC,CAAC,CAAC;IACf,CAAC,CACL,CAAC;EACH,CAAC;AACH","ignoreList":[]}
|
|
@@ -14,6 +14,6 @@
|
|
|
14
14
|
* limitations under the License.
|
|
15
15
|
*/
|
|
16
16
|
|
|
17
|
-
export const USER_AGENT = `osdk-client/${"2.8.0-beta.
|
|
18
|
-
export const OBSERVABLE_USER_AGENT = `osdk-observable-client/${"2.8.0-beta.
|
|
17
|
+
export const USER_AGENT = `osdk-client/${"2.8.0-beta.32"}`;
|
|
18
|
+
export const OBSERVABLE_USER_AGENT = `osdk-observable-client/${"2.8.0-beta.32"}`;
|
|
19
19
|
//# sourceMappingURL=UserAgent.js.map
|
|
@@ -0,0 +1,22 @@
|
|
|
1
|
+
'use strict';
|
|
2
|
+
|
|
3
|
+
var chunkLCI6OHTV_cjs = require('./chunk-LCI6OHTV.cjs');
|
|
4
|
+
require('./chunk-D26YLHTV.cjs');
|
|
5
|
+
require('./chunk-HEMBBCBS.cjs');
|
|
6
|
+
|
|
7
|
+
|
|
8
|
+
|
|
9
|
+
Object.defineProperty(exports, "getMediaContent", {
|
|
10
|
+
enumerable: true,
|
|
11
|
+
get: function () { return chunkLCI6OHTV_cjs.getMediaContent; }
|
|
12
|
+
});
|
|
13
|
+
Object.defineProperty(exports, "getMediaMetadata", {
|
|
14
|
+
enumerable: true,
|
|
15
|
+
get: function () { return chunkLCI6OHTV_cjs.getMediaMetadata; }
|
|
16
|
+
});
|
|
17
|
+
Object.defineProperty(exports, "upload", {
|
|
18
|
+
enumerable: true,
|
|
19
|
+
get: function () { return chunkLCI6OHTV_cjs.upload; }
|
|
20
|
+
});
|
|
21
|
+
//# sourceMappingURL=MediaReferenceProperty-3LVGUKXN.cjs.map
|
|
22
|
+
//# sourceMappingURL=MediaReferenceProperty-3LVGUKXN.cjs.map
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"sources":[],"names":[],"mappings":"","file":"MediaReferenceProperty-
|
|
1
|
+
{"version":3,"sources":[],"names":[],"mappings":"","file":"MediaReferenceProperty-3LVGUKXN.cjs"}
|