UNPKG

graphql

Version:

A Query Language and Runtime which can target any service.

1 lines • 5.76 kB
{"version":3,"file":"SetMap.mjs","sourceRoot":"","sources":["../../src/jsutils/SetMap.ts"],"names":[],"mappings":"AAoBA,MAAM,OAAO,MAAM;IAMjB;QACE,IAAI,CAAC,QAAQ,GAAG,IAAI,GAAG,EAAE,CAAC;QAC1B,IAAI,CAAC,UAAU,GAAG,IAAI,GAAG,EAAE,CAAC;QAC5B,IAAI,CAAC,aAAa,GAAG,CAAC,CAAC;IACzB,CAAC;IAED,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC;IAC5B,CAAC;IAED,GAAG,CAAC,OAAuB;QACzB,OAAO,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,EAAE,KAAK,CAAC;IACtD,CAAC;IAED,WAAW,CAAC,OAAuB,EAAE,KAAQ;QAC3C,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QAC/B,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACrC,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;YACxB,OAAO,KAAK,CAAC,KAAK,CAAC;QACrB,CAAC;QAED,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC,CAAC;QAC3C,OAAO,KAAK,CAAC;IACf,CAAC;IAED,mBAAmB,CACjB,OAAuB,EACvB,YAA4C;QAE5C,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC;QACpD,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;YACxB,OAAO,KAAK,CAAC,KAAK,CAAC;QACrB,CAAC;QAED,MAAM,KAAK,GAAG,YAAY,CAAC,OAAO,CAAC,CAAC;QACpC,IAAI,CAAC,GAAG,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC;QACzB,OAAO,KAAK,CAAC;IACf,CAAC;IAED,GAAG,CAAC,OAAuB;QACzB,OAAO,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC;IAC/C,CAAC;IAED,GAAG,CAAC,OAAuB,EAAE,KAAQ;QACnC,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QAC/B,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACrC,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;YACxB,KAAK,CAAC,KAAK,GAAG,KAAK,CAAC;YACpB,OAAO,IAAI,CAAC;QACd,CAAC;QAED,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC,CAAC;QAC3C,OAAO,IAAI,CAAC;IACd,CAAC;IAED,CAAC,IAAI;QACH,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,EAAE,CAAC;YAC3C,MAAM,KAAK,CAAC,OAAO,CAAC;QACtB,CAAC;IACH,CAAC;IAED,CAAC,MAAM;QACL,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,EAAE,CAAC;YAC3C,MAAM,KAAK,CAAC,KAAK,CAAC;QACpB,CAAC;IACH,CAAC;IAED,CAAC,OAAO;QACN,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,EAAE,CAAC;YAC3C,MAAM,CAAC,KAAK,CAAC,OAAO,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC;QACrC,CAAC;IACH,CAAC;IAED,CAAC,MAAM,CAAC,QAAQ,CAAC;QACf,OAAO,IAAI,CAAC,OAAO,EAAE,CAAC;IACxB,CAAC;IAED,IAAI,CAAC,OAAuB;QAC1B,MAAM,GAAG,GAAG,EAAE,CAAC;QACf,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;YAC7B,IAAI,EAAE,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YACrC,IAAI,EAAE,KAAK,SAAS,EAAE,CAAC;gBACrB,EAAE,GAAG,IAAI,CAAC,aAAa,EAAE,CAAC;gBAC1B,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC;YAClC,CAAC;YACD,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACf,CAAC;QACD,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,EAAE,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC;QAClC,OAAO,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACvB,CAAC;CACF","sourcesContent":["interface SetMapEntry<T, V> {\n members: ReadonlySet<T>;\n value: V;\n}\n\n/**\n * Maps an order-independent set of member identities to a value. Unlike a\n * `Map<ReadonlySet<T>, V>`, two sets containing the same members address the\n * same entry even when they are different `Set` objects.\n *\n * Each member receives a map-local numeric ID. Sorting those IDs produces an\n * exact, order-independent key.\n *\n * Iteration follows insertion order and returns the first `Set` object stored\n * for each key. Key sets must not be mutated after insertion.\n *\n * @internal\n * @typeParam T - A member of a map key.\n * @typeParam V - The value associated with a set of members.\n */\nexport class SetMap<T, V> {\n // Retains the first Set object for each key and preserves insertion order.\n _entries: Map<string, SetMapEntry<T, V>>;\n _memberIds: Map<T, number>;\n _nextMemberId: number;\n\n constructor() {\n this._entries = new Map();\n this._memberIds = new Map();\n this._nextMemberId = 0;\n }\n\n get size(): number {\n return this._entries.size;\n }\n\n get(members: ReadonlySet<T>): V | undefined {\n return this._entries.get(this._key(members))?.value;\n }\n\n getOrInsert(members: ReadonlySet<T>, value: V): V {\n const key = this._key(members);\n const entry = this._entries.get(key);\n if (entry !== undefined) {\n return entry.value;\n }\n\n this._entries.set(key, { members, value });\n return value;\n }\n\n getOrInsertComputed(\n members: ReadonlySet<T>,\n computeValue: (members: ReadonlySet<T>) => V,\n ): V {\n const entry = this._entries.get(this._key(members));\n if (entry !== undefined) {\n return entry.value;\n }\n\n const value = computeValue(members);\n this.set(members, value);\n return value;\n }\n\n has(members: ReadonlySet<T>): boolean {\n return this._entries.has(this._key(members));\n }\n\n set(members: ReadonlySet<T>, value: V): this {\n const key = this._key(members);\n const entry = this._entries.get(key);\n if (entry !== undefined) {\n entry.value = value;\n return this;\n }\n\n this._entries.set(key, { members, value });\n return this;\n }\n\n *keys(): IterableIterator<ReadonlySet<T>> {\n for (const entry of this._entries.values()) {\n yield entry.members;\n }\n }\n\n *values(): IterableIterator<V> {\n for (const entry of this._entries.values()) {\n yield entry.value;\n }\n }\n\n *entries(): IterableIterator<[ReadonlySet<T>, V]> {\n for (const entry of this._entries.values()) {\n yield [entry.members, entry.value];\n }\n }\n\n [Symbol.iterator](): IterableIterator<[ReadonlySet<T>, V]> {\n return this.entries();\n }\n\n _key(members: ReadonlySet<T>): string {\n const ids = [];\n for (const member of members) {\n let id = this._memberIds.get(member);\n if (id === undefined) {\n id = this._nextMemberId++;\n this._memberIds.set(member, id);\n }\n ids.push(id);\n }\n ids.sort((id1, id2) => id1 - id2);\n return ids.join(',');\n }\n}\n"]}