@messenger-box/platform-client 10.0.3-alpha.37 → 10.0.3-alpha.38

package/CHANGELOG.md

@@ -3,6 +3,10 @@
 All notable changes to this project will be documented in this file.
 See [Conventional Commits](https://conventionalcommits.org) for commit guidelines.
 
+## [10.0.3-alpha.38](https://github.com/CDEBase/messenger-box/compare/v10.0.3-alpha.37...v10.0.3-alpha.38) (2025-04-25)
+
+**Note:** Version bump only for package @messenger-box/platform-client
+
 ## [10.0.3-alpha.37](https://github.com/CDEBase/messenger-box/compare/v10.0.3-alpha.36...v10.0.3-alpha.37) (2025-04-25)
 
 **Note:** Version bump only for package @messenger-box/platform-client

package/lib/graphql/policies/messages-policies.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"messages-policies.d.ts","sourceRoot":"","sources":["../../../src/graphql/policies/messages-policies.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,YAAY,EAAE,MAAM,gBAAgB,CAAC;AAE9C,eAAO,MAAM,gBAAgB,EAAE,YA2L9B,CAAC"}
+{"version":3,"file":"messages-policies.d.ts","sourceRoot":"","sources":["../../../src/graphql/policies/messages-policies.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,YAAY,EAAE,MAAM,gBAAgB,CAAC;AAE9C,eAAO,MAAM,gBAAgB,EAAE,YA8T9B,CAAC"}

package/lib/graphql/policies/messages-policies.js

@@ -29,32 +29,42 @@ const messagesPolicies = {
       data: {
         keyArgs: ['channelId', 'parentId'],
         merge: (existing = [], incoming = [], {
-          readField,
-          mergeObjects
+          readField
         }) => {
-          // Create a map of existing messages by ID for efficient lookups
+          // Use a Map for O(1) lookups instead of array iterations
           const existingMap = new Map();
-          existing.forEach(item => {
-            const id = readField('id', item);
-            if (id) existingMap.set(id, item);
-          });
-          // Create a new array by merging incoming with existing
-          const merged = incoming.map(incomingItem => {
-            const id = readField('id', incomingItem);
-            // If item already exists, merge them, otherwise use incoming
-            if (id && existingMap.has(id)) {
-              return mergeObjects(existingMap.get(id), incomingItem);
+          // Populate map with existing messages
+          if (existing && existing.length > 0) {
+            for (let i = 0; i < existing.length; i++) {
+              const id = readField('id', existing[i]);
+              if (id) {
+                existingMap.set(id, existing[i]);
+              }
+            }
+          }
+          // Create result array with same capacity as total items
+          const result = [];
+          // Add incoming items, overwriting existing ones
+          if (incoming && incoming.length > 0) {
+            for (let i = 0; i < incoming.length; i++) {
+              const item = incoming[i];
+              const id = readField('id', item);
+              if (id) {
+                existingMap.set(id, item);
+              }
+              result.push(item);
             }
-            return incomingItem;
-          });
-          // Add any existing items that aren't in the incoming list
-          existing.forEach(existingItem => {
-            const id = readField('id', existingItem);
-            if (id && !merged.some(item => readField('id', item) === id)) {
-              merged.push(existingItem);
+          }
+          // Add remaining existing items not in incoming
+          if (existing && existing.length > 0) {
+            for (let i = 0; i < existing.length; i++) {
+              const id = readField('id', existing[i]);
+              if (id && !result.some(item => readField('id', item) === id)) {
+                result.push(existing[i]);
+              }
             }
-          });
-          return merged;
+          }
+          return result;
         }
       },
       totalCount: {
@@ -114,80 +124,194 @@ const messagesPolicies = {
         }) {
           if (!incoming) return existing;
           if (!existing) return incoming;
-          // Create a deep copy of the existing data
-          const result = {
-            ...existing,
-            totalCount: incoming.totalCount ?? existing.totalCount
-          };
-          // If there's no data in either, return the basic structure
-          if (!existing.data || !incoming.data) {
-            return result;
-          }
-          // Create a map of existing messages by ID
-          const existingMessages = new Map();
-          existing.data.forEach(message => {
-            const id = readField('id', message);
-            if (id) existingMessages.set(id, message);
-          });
-          // Create merged data array with deduplication
-          let mergedData = [...existing.data];
-          // Add new messages, replacing existing ones with same ID
-          incoming.data.forEach(incomingMessage => {
-            const id = readField('id', incomingMessage);
-            if (!id) return;
-            // If message already exists, update it at its current position
-            const existingIndex = mergedData.findIndex(msg => readField('id', msg) === id);
-            if (existingIndex >= 0) {
-              // Replace the existing message with the incoming one
-              mergedData[existingIndex] = incomingMessage;
+          // Fast return if incoming has no data
+          if (!incoming.data || incoming.data.length === 0) {
+            return {
+              ...existing,
+              totalCount: incoming.totalCount ?? existing.totalCount
+            };
+          }
+          // Fast return if existing has no data
+          if (!existing.data || existing.data.length === 0) {
+            return incoming;
+          }
+          // Determine if this is likely a new message or pagination
+          const isNewMessage = args && args.skip === 0;
+          // Create a map for existing messages for fast lookups
+          const idSet = new Set();
+          const mergedData = [...existing.data];
+          // Mark all existing IDs
+          for (let i = 0; i < mergedData.length; i++) {
+            const id = readField('id', mergedData[i]);
+            if (id) idSet.add(id);
+          }
+          // Process incoming messages
+          for (let i = 0; i < incoming.data.length; i++) {
+            const incomingMsg = incoming.data[i];
+            const id = readField('id', incomingMsg);
+            if (!id) continue;
+            if (idSet.has(id)) {
+              // Replace existing message with same ID
+              const existingIndex = mergedData.findIndex(msg => readField('id', msg) === id);
+              if (existingIndex >= 0) {
+                mergedData[existingIndex] = incomingMsg;
+              }
             } else {
-              // Add the new message
-              // For optimistic updates with sendMessage mutation, we want to add to the beginning
-              // For pagination/fetchMore, we should add according to the sort order
-              if (args && args.skip === 0) {
-                // This is likely a new message or an optimistic update
-                mergedData.unshift(incomingMessage);
+              // Add new message
+              if (isNewMessage) {
+                // Add to beginning for new messages
+                mergedData.unshift(incomingMsg);
               } else {
-                // This is likely from pagination
-                mergedData.push(incomingMessage);
+                // Add to end for pagination
+                mergedData.push(incomingMsg);
               }
+              idSet.add(id);
             }
-          });
-          // Ensure no duplicate messages
-          const uniqueIds = new Set();
-          mergedData = mergedData.filter(message => {
-            const id = readField('id', message);
-            if (!id || uniqueIds.has(id)) return false;
-            uniqueIds.add(id);
-            return true;
-          });
+          }
           return {
-            ...result,
+            ...existing,
+            totalCount: incoming.totalCount ?? existing.totalCount,
             data: mergedData
           };
         }
       }
     }
   },
+  FilesInfo: {
+    merge: true,
+    // Use default merging behavior for FilesInfo
+    fields: {
+      data: {
+        merge(existing = [], incoming = [], {
+          readField
+        }) {
+          // If no existing data, just return incoming
+          if (!existing || existing.length === 0) {
+            return incoming;
+          }
+          // If no incoming data, keep existing
+          if (!incoming || incoming.length === 0) {
+            return existing;
+          }
+          // Create a map for efficient lookup
+          const fileMap = new Map();
+          // Add existing files to map
+          for (let i = 0; i < existing.length; i++) {
+            const file = existing[i];
+            if (file) {
+              const id = readField('id', file);
+              if (id) {
+                fileMap.set(id, file);
+              }
+            }
+          }
+          // Merge in incoming files, overwriting existing ones
+          for (let i = 0; i < incoming.length; i++) {
+            const file = incoming[i];
+            if (file) {
+              const id = readField('id', file);
+              if (id) {
+                fileMap.set(id, file);
+              }
+            }
+          }
+          // Convert map values back to array
+          return Array.from(fileMap.values());
+        }
+      }
+    }
+  },
+  FileInfo: {
+    // Use ID as key field
+    keyFields: ['id'],
+    fields: {
+      url: {
+        // Ensure URL is always preserved and not normalized
+        merge(existing, incoming) {
+          return incoming ?? existing;
+        }
+      }
+    }
+  },
   Post: {
     fields: {
       replies: {
         merge(existing, incoming) {
           if (!incoming) return existing;
           if (!existing) return incoming;
+          // Use a Set for fast duplicate checking
+          const uniqueIds = new Set();
+          const mergedData = [];
+          // Add all existing items to the result and track IDs
+          if (existing.data && existing.data.length > 0) {
+            for (let i = 0; i < existing.data.length; i++) {
+              const item = existing.data[i];
+              if (item && item.id && !uniqueIds.has(item.id)) {
+                uniqueIds.add(item.id);
+                mergedData.push(item);
+              }
+            }
+          }
+          // Add incoming items that don't exist yet
+          if (incoming.data && incoming.data.length > 0) {
+            for (let i = 0; i < incoming.data.length; i++) {
+              const item = incoming.data[i];
+              if (item && item.id && !uniqueIds.has(item.id)) {
+                uniqueIds.add(item.id);
+                mergedData.push(item);
+              }
+            }
+          }
           return {
             ...incoming,
-            data: [...(existing?.data || []), ...(incoming?.data || [])].filter((message, index, self) => index === self.findIndex(m => m.id === message.id))
+            data: mergedData
           };
         }
       },
       files: {
-        merge(existing, incoming) {
+        merge(existing, incoming, {
+          readField
+        }) {
           if (!incoming) return existing;
           if (!existing) return incoming;
+          // If either has no data or totalCount is 0, prefer the one with data
+          if (!existing.data || existing.data.length === 0) {
+            return incoming;
+          }
+          if (!incoming.data || incoming.data.length === 0) {
+            return existing;
+          }
+          // Create a map for efficient lookup
+          const fileMap = new Map();
+          // Add existing files to map
+          if (existing.data) {
+            for (let i = 0; i < existing.data.length; i++) {
+              const file = existing.data[i];
+              if (file) {
+                const id = readField('id', file);
+                if (id) {
+                  fileMap.set(id, file);
+                }
+              }
+            }
+          }
+          // Merge in incoming files, overwriting existing ones
+          if (incoming.data) {
+            for (let i = 0; i < incoming.data.length; i++) {
+              const file = incoming.data[i];
+              if (file) {
+                const id = readField('id', file);
+                if (id) {
+                  fileMap.set(id, file);
+                }
+              }
+            }
+          }
+          // Create merged result
           return {
-            ...incoming,
-            data: [...(existing?.data || []), ...(incoming?.data || [])].filter((file, index, self) => index === self.findIndex(f => f.id === file.id))
+            __typename: 'FilesInfo',
+            totalCount: Math.max(existing.totalCount || 0, incoming.totalCount || 0, fileMap.size),
+            data: Array.from(fileMap.values())
           };
         }
       }

package/lib/graphql/policies/messages-policies.js.map

@@ -1 +1 @@
-{"version":3,"file":"messages-policies.js","sources":["../../../src/graphql/policies/messages-policies.ts"],"sourcesContent":[null],"names":[],"mappings":"AAEa,MAAA,gBAAgB,GAAiB;AAC1C,EAAA,QAAA,EAAQ;;;;AAIJ,IAAA,MAAA,EAAA;AACI,MAAA,EAAA,EAAA;AACI,QAAA,IAAA,CAAA,QAAK,EAAA;AACD,UAAA;AACA,SAAA,EAAA;gBACJ;AACH,YAAA,SAAA;AACD,YAAA;AACI,WAAA,GAAA,SAAK;AACD,UAAA,OAAA,QAAA,GAAQ,CAAS,EAAA,qBAAoB,iBAAU,CAAA,CAAA;AAC/C;;AAEP,MAAA,aAAA,EAAA;AACD,QAAA,IAAA,CAAA,QAAM,EAAA;AACF,UAAA;AACA,SAAA,EAAA;;AAEI,YAAA,SAAA;AACA,YAAA;;AAEI,UAAA,OAAA,QAAA,GAAI,CAAE,EAAA,SAAA,CAAA,CAAA,EAAA,QAAA,CAAA,CAAA,GAAA,CAAA,EAAA,SAAA,CAAA,CAAA;AAAE;AACZ,OAAA;;6BAGM,EAAA,UAAiB,CAAA;wBACnB,GAAM,EAAA,EAAA,QAAc,GAAA,EAAA;;;;;AAKpB,UAAA,MAAA,WAAA,GAAA;AACJ,UAAA,QAAA,CAAA,OAAG,CAAA,IAAA,IAAA;oBAEH,GAA0D,SAAA,CAAA,IAAA,EAAA,IAAA,CAAA;AAC1D,YAAA,IAAA,EAAA,EAAA,WAAgB,CAAA,GAAA,CAAA,EAAE,EAAA,IAAA,CAAA;;;AAGV,UAAA,MAAA,MAAA,GAAA,QAAA,CAAM,GAAC,CAAA,YAAK,IAAc;gCAC7B,CAAA,IAAA,EAAA,YAAA,CAAA;AACL;AAEA,YAAA,IAAA,EAAA,IAAA,WAAa,CAAC,GAAA,CAAA,EAAA,CAAA,EAAA;qBACjB,YAAA,CAAA,WAAA,CAAA,GAAA,CAAA,EAAA,CAAA,EAAA,YAAA,CAAA;AACJ;AACD,YAAA,OAAA,YAAY;AACR,WAAA,CAAA;;0BAEW,CAAA,YAAa,IAAA;kBACvB,EAAA,GAAA,SAAA,CAAA,IAAA,EAAA,YAAA,CAAA;AACJ,YAAA,IAAA,EAAA,IAAA,CAAA,MAAA,CAAA,IAAA,CAAA,IAAA,IAAA,SAAA,CAAA,IAAA,EAAA,IAAA,CAAA,KAAA,EAAA,CAAA,EAAA;cACS,MAAA,CAAA,IAAA,CAAA,YAAA,CAAA;;YAEV;iBAC4D,MAAA;;;gBAGT,EAAA;eACC,EAAA,CAAA,WAAA,EAAA,UAAA,CAAA;aACxC,CAAA,QAAA,EAAA,QAAA,EAAA;iBACa,QAAA,KAAA,SAAA,GAAA,QAAA,GAAA,QAAA;;;AAG5B;AACJ;AACD;;AAEI;AACI;AACI;AACI;AACA;;AAEP;AACD;AACI;AACI,GAAA;AACA,EAAA,kBAAA,EAAA;;AAEP,IAAA,MAAA,EAAA;AACJ,MAAA,mBAAA,EAAA;AACJ,QAAA,IAAA,CAAA,QAAA,EAAA;AACD,UAAO;AACH,SAAA,EAAA;AACI,UAAA,MAAA;AACI,YAAA,SAAA;;AAEI,WAAA,GAAA,SAAA;AAAe,UAAA,OAAA,QAAA,GAAA,CAAA,EAAO,SAAS,CAAA,CAAA,EAAA,QAAA,CAAA,CAAA,GAAA,CAAA,EAAA,SAAA,CAAA,CAAA;AAC/B;AAAe,OAAA;;AAGf,QAAA,IAAA,CAAA,QAAA,EAAA;AACI,UAAA;AACA,SAAA,EAAA;;qBAGuD;;AAEvD,WAAA,GAAA,SAAA;yBACH,GAAA,CAAA,EAAA,SAAA,CAAA,CAAA,EAAA,QAAA,CAAA,CAAA,GAAA,CAAA,EAAA,SAAA,CAAA,CAAA;;AAGD;;;AAGI,EAAA,KAAA,EAAA;AAAQ,IAAA,MAAA,EAAA;AACZ,MAAA,QAAA,EAAA;6BAE8C,EAAA,UAAA,CAAA;sBAC1C,EAAA,QAAA,EAAU;;;;AAKV,UAAA,IAAA,CAAA,QAAA,EAAA,OAAO,QAAA;gCAAS,QAAA;;yBAGV;AAEN,YAAA,GAAA,QAAA;gCACyD,CAAA,UAAA,IAAA,QAAA,CAAA;AACrD,WAAA;;gCACI,CAAA,QAAA,CAAA,IAAA,EAAA;;;;gCAIA,GAAA,OAAY,EAAA;gCACZ,OAAuD,IAAA;AACvD,YAAA,MAAA,EAAA,GAAA,SAAA,CAAA,IAAA,EAAA,OAAW,CAAA;oCACd,CAAA,GAAA,CAAA,EAAA,EAAA,OAAA,CAAA;;;AAEG,UAAA,IAAA,UAAA,GAAA,CAAA,GAAA,QAAA,CAAA,IAAW,CAAA;;wBAEnB,OAAC,CAAA,eAAA,IAAA;AACL,YAAA,MAAA,EAAA,GAAG,SAAA,CAAA,IAAA,EAAA,eAAA,CAAA;qBAE4B;AAC/B;+BACU,aAAc,CAAA,SAAQ,CAAA,GAAA,IAAW,SAAA,CAAA,IAAA,EAAA,GAAA,CAAA,KAAA,EAAA,CAAA;6BACjC,OAAc;;AACU,cAAA,UAAA,CAAA,iBAAa,eAAA;AAC3C,aAAA,MAAA;AACA;AACJ;;AAGI,cAAA,IAAA,IAAA,IAAA,IAAS,CAAA,IAAA,KAAA,CAAA,EAAA;AACT;0BACF,CAAA,OAAA,CAAA,eAAA,CAAA;qBACL;AACJ;AACJ,gBAAA,UAAA,CAAA,IAAA,CAAA,eAAA,CAAA;AACJ;AACD;AACI,WAAA,CAAA;AACI;gBACI,SAAc,GAAA,IAAE,GAAQ,EAAA;AACpB,UAAA,UAAA,GAAA,UAAa,CAAA,MAAA,CAAA,OAAA,IAAA;AAAE,YAAA,MAAA,EAAA,GAAA,gBAAe,OAAC,CAAA;AAC/B,YAAA,IAAA,CAAA,EAAA,IAAA,SAAa,CAAA,GAAA,CAAA,EAAA,CAAA,EAAA,OAAA,KAAA;AAAE,YAAA,SAAA,CAAA,GAAA,CAAA,EAAA,CAAA;uBAER;AACH,WAAA,CAAA;;qBAIH;gBACL,EAAC;AACJ,WAAA;AACD;;AAEQ;AAAe,GAAA;AACf,EAAA,IAAA,EAAA;AAAe,IAAA,MAAA,EAAA;;AAGX,QAAA,KAAA,CAAA,QAAA,EAAA,QAAW,EAAA;yBACP,OAAM;uBAGZ,EAAA,OAAA,QAAA;iBACL;AACJ,YAAA,GAAA,QAAA;AACJ,YAAA,IAAA,EAAA,CAAA,IAAA,QAAA,EAAA,IAAA,IAAA,EAAA,CAAA,EAAA,IAAA,QAAA,EAAA,IAAA,IAAA,EAAA,CAAA,CAAA,CAAA,MAAA,CAAA,CAAA,OAAA,EAAA,KAAA,EAAA,IAAA,KAAA,KAAA,KAAA,IAAA,CAAA,SAAA,CAAA,CAAA,IAAA,CAAA,CAAA,EAAA,KAAA,OAAA,CAAA,EAAA,CAAA;AACJ,WAAA;;;;;;;;;;;;;;;"}
+{"version":3,"file":"messages-policies.js","sources":["../../../src/graphql/policies/messages-policies.ts"],"sourcesContent":[null],"names":[],"mappings":"AAEa,MAAA,gBAAgB,GAAiB;AAC1C,EAAA,QAAA,EAAQ;;;;AAIJ,IAAA,MAAA,EAAA;AACI,MAAA,EAAA,EAAA;AACI,QAAA,IAAA,CAAA,QAAK,EAAA;AACD,UAAA;AACA,SAAA,EAAA;gBACJ;AACH,YAAA,SAAA;AACD,YAAA;AACI,WAAA,GAAA,SAAK;AACD,UAAA,OAAA,QAAA,GAAQ,CAAS,EAAA,qBAAoB,iBAAU,CAAA,CAAA;AAC/C;;AAEP,MAAA,aAAA,EAAA;AACD,QAAA,IAAA,CAAA,QAAM,EAAA;AACF,UAAA;AACA,SAAA,EAAA;;AAEI,YAAA,SAAA;;uBAGI;AACA,UAAA,OAAA,QAAA,GAAA,CAAK,EAAI,SAAO,CAAC,CAAA,EAAG,QAAQ,CAAC,CAAM,GAAA,CAAA,EAAA,SAAQ,CAAA,CAAA;;;;6BAItC,EAAA,UAAA,CAAA;wBACL,GAAC,EAAA,EAAA,QAAA,GAAA,EAAA,EAAA;;;;2BAM2C,GAAA,IAAA,GAAA,EAAA;;AAE5C,UAAA,IAAA,QAAA,IAAA,QAAU,CAAG,MAAI,GAAG,CAAQ,EAAA;AACxB,YAAA,KAAA,IAAA,CAAA,GAAA,CAAA,EAAA,CAAA,GAAA,QAAa,CAAA,MAAA,EAAQ,CAAC,EAAE,EAAC;kCACnB,CAAA,IAAK,EAAS,QAAC,IAAI;;AAErB,gBAAA,WAAA,CAAA,GAAA,CAAA,EAAA,EAAA,QAAY,CAAG,CAAA,CAAA,CAAC;;AAEpB;;;sBAIuC,GAAA,EAAA;;AAE3C,UAAA,IAAA,QAAA,IAAA,QAAU,CAAG,MAAI,GAAG,CAAQ,EAAA;4BACxB,CAAM,GAAA,QAAK,CAAA,MAAA,EAAU,CAAA,EAAA,EAAM;sCACjB;kCACA,CAAA,IAAC,MAAK,CAAA;;2BAEnB,CAAA,GAAA,CAAA,EAAA,EAAA,IAAA,CAAA;;AAGL,cAAA,MAAA,CAAA,IAAA,CAAA;;AAEP;AACD;AACI,UAAA,IAAA,QAAA,IAAU,QAAW,CAAA;iBAChB,IAAA,CAAC,GAAQ,CAAA,EAAA,CAAA,GAAE,QAAQ,CAAA,MAAA,EAAA,CAAA,EAAA,EAAA;oBACpB,EAAO,GAAA,SAAA,CAAQ,IAAK,EAAA,QAAS,CAAC,CAAC,CAAC,CAAA;kBACnC,EAAA,IAAA,CAAA,MAAA,CAAA,IAAA,CAAA,IAAA,IAAA,SAAA,CAAA,IAAA,EAAA,IAAA,CAAA,KAAA,EAAA,CAAA,EAAA;AACJ,gBAAA,MAAA,CAAA,IAAA,CAAA,QAAA,CAAA,CAAA,CAAA,CAAA;;;;iBAI2D,MAAA;;;gBAGT,EAAA;eACC,EAAA,CAAA,WAAA,EAAA,UAAA,CAAA;aACxC,CAAA,QAAA,EAAA,QAAA,EAAA;iBACa,QAAA,KAAA,SAAA,GAAA,QAAA,GAAA,QAAA;;;AAG5B;AACJ;AACD;;AAEI;AACI;AACI;AACI;AACA;;AAEP;AACD;AACI;AACI,GAAA;AACA,EAAA,kBAAA,EAAA;;AAEP,IAAA,MAAA,EAAA;AACJ,MAAA,mBAAA,EAAA;AACJ,QAAA,IAAA,CAAA,QAAA,EAAA;AACD,UAAO;AACH,SAAA,EAAA;AACI,UAAA,MAAA;AACI,YAAA,SAAA;;AAEI,WAAA,GAAA,SAAA;AAAe,UAAA,OAAA,QAAA,GAAA,CAAA,EAAO,SAAS,CAAA,CAAA,EAAA,QAAA,CAAA,CAAA,GAAA,CAAA,EAAA,SAAA,CAAA,CAAA;AAC/B;AAAe,OAAA;;AAGf,QAAA,IAAA,CAAA,QAAA,EAAA;;AAEQ,SAAA,EAAA;AACA,UAAA,MAAA;;;uBAI8B;AACtC,UAAA,OAAA,QAAK,GAAA,CAAA,EAAA,SAAiB,CAAA,CAAA,EAAA,QAAS,CAAA,CAAA,GAAK,CAAA,EAAA,UAAc,CAAC;AAC/C;;;;;AAOJ,IAAA,MAAA,EAAA;;6BAGwB,EAAA,UAAA,CAAA;AACxB,QAAA,KAAA,CAAA,QAAA,EAAA,QAAa,EAAC;;AAEV,UAAA;AAAQ,SAAA,EAAA;uBACX,EAAA,OAAA,QAAA;uBAE2B,EAAA,OAAA,QAAA;AAC5B;wBACI,IAAM,IAAA,QAAA,CAAW,IAAW,CAAA,MAAA,KAAK,CAAC,EAAE;;AAGpC,cAAA,GAAA,QAAA;kCAAkB,CAAA,UAAA,IAAA,QAAA,CAAA;AAElB,aAAA;;;AAGI,UAAA,IAAA,CAAA,QAAA,CAAA,IAAA,IAAI,QAAa,CAAA,IAAA,CAAA,MAAO,KAAC,CAAA,EAAA;AACrB,YAAA,OAAA,QAAA;;;+BAEA,IAAA,IAAA,IAAA,CAAA,IAAA,KAAA,CAAA;;4BAEJ,GAAI,EAAA;iCACoC,QAAA,CAAA,IAAA,CAAA;AACpC;8BACH,UAAA,CAAA,MAAA,EAAA,CAAA,EAAA,EAAA;iCAAM,IAAC,EAAA,UAAA,CAAA,CAAA,CAAA,CAAA;gCACJ,CAA4B;AAC5B;;AAEJ,UAAA,KAAA,IAAA,CAAA,GAAA,CAAA,EAAA,CAAA,GAAA,QAAU,CAAA,IAAI,CAAA,MAAA,EAAA,CAAA,EAAA,EAAA;6BACjB,GAAA,QAAA,CAAA,IAAA,CAAA,CAAA,CAAA;oBACL,GAAC,SAAA,CAAA,IAAA,EAAA,WAAA,CAAA;qBAEM;AACH,YAAA,IAAA,KAAA,CAAA,GAAA,CAAA,EAAW,CAAA,EAAA;AACX;AACA,cAAA,MAAA,aAAgB,GAAA,UAAA,CAAA,SAAA,CAAA,GAAA,IAAA,SAAA,CAAA,IAAA,EAAA,GAAA,CAAA,KAAA,EAAA,CAAA;+BAClB,IAAA,CAAA,EAAA;gBACN,UAAC,CAAA,aAAA,CAAA,GAAA,WAAA;AACJ;AACJ,aAAA,MAAA;AACJ;AACD,cAAW,IAAA,YAAA,EAAA;;AAEP,gBAAQ,UAAA,CAAA,OAAA,CAAA,WAAA,CAAA;AACJ,eAAA,MAAM;;0BAE8C,CAAA,IAAA,CAAA,WAAA,CAAA;;AAExC,cAAA,KAAA,CAAA,GAAA,CAAA,EAAA,CAAA;;;;AAKA,YAAA,GAAA,QAAA;sBACH,EAAA,QAAA,CAAA,UAAA,IAAA,QAAA,CAAA,UAAA;;AAGD,WAAA;;AAGA;AACI;;;;AAIQ;;;sBAGX,GAAA,EAAA,EAAA,QAAA,GAAA,EAAA,EAAA;;AAGD,SAAA,EAAA;AACI;2BACI,QAAO,CAAA,MAAA,KAAA,CAAA,EAAA;;;AAGH;mCACH,CAAA,MAAA,KAAA,CAAA,EAAA;2BACJ;;;uBAIE,GAAA,IAAA,GAAM,EAAI;;AAExB,UAAA,KAAA,IAAA,CAAA,GAAA,CAAA,EAAA,CAAA,GAAA,QAAA,CAAA,MAAA,EAAA,CAAA,EAAA,EAAA;AACJ,YAAA,MAAA,IAAA,GAAA,QAAA,CAAA,CAAA,CAAA;AACJ,YAAA,IAAA,IAAA,EAAA;AACD,cAAU,MAAA,EAAA,GAAA,SAAA,CAAA,IAAA,EAAA,IAAA,CAAA;cACgB,IAAA,EAAA,EAAA;gBACb,OAAG,CAAI,GAAC,CAAA,EAAA,EAAA,IAAA,CAAA;AACjB;AACI;;;oBAGQ,GAAO,CAAA,EAAA,CAAA,GAAA,QAAY,CAAA,MAAA,EAAQ,CAAC,EAAA,EAAA;kBAC/B,IAAA,GAAA,QAAA,CAAA,CAAA,CAAA;AACJ,YAAA,IAAA,IAAA,EAAA;AACJ,cAAA,MAAA,EAAA,GAAA,SAAA,CAAA,IAAA,EAAA,IAAA,CAAA;AACJ,cAAA,IAAA,EAAA,EAAA;AACD,gBAAM,OAAA,CAAA,GAAA,CAAA,EAAA,EAAA,IAAA,CAAA;AACF;AACI;;AAEQ;AAAe,UAAA,OAAA,KAAA,CAAA,IAAA,CAAA,cAAgB,EAAA,CAAA;AAC/B;AAAe;;AAGf,GAAA;;;AAIA,IAAA,SAAA,EAAA,CAAA,IAAA,CAAA;AACI,IAAA,MAAA,EAAA;;AAEI;AACI,QAAA,KAAA,CAAA,QAAA,EAAA,QAAA,EAAA;AACA,UAAA,OAAA,QAAA,IAAA,QAAA;;;;;AAMZ,EAAA,IAAA,EAAA;AACI,IAAA,MAAA,EAAA;;AAEI,QAAA,KAAA,CAAA,QAAA,EAAA,QAAI;AACA,UAAA,IAAA,CAAA,QAAA,EAAA,OAAA,QAAA;AACA,UAAA,IAAA,CAAA,QAAA,EAAA,OAAA,QAAA;;yBAEP,GAAA,IAAA,GAAA,EAAA;0BACJ,GAAA,EAAA;;AAGG,UAAA,IAAA,QAAA,CAAA,IAAG,IAAQ,QAAA,CAAA,IAAA,CAAA,MAAA,GAAA,CAAA,EAAA;AACX,YAAA,KAAA,IAAA,CAAA,GAAA,CAAA,EAAI,IAAY,QAAA,CAAA,IAAA,CAAA,MAAA,EAAA,CAAA,EAAA,EAAA;wBAClB,GAAA,QAAA,CAAA,IAAA,CAAA,CAAA,CAAA;kBACL,IAAA,IAAA,IAAA,CAAA,EAAA,IAAA,CAAA,SAAA,CAAA,GAAA,CAAA,IAAA,CAAA,EAAA,CAAA,EAAA;AACJ,gBAAA,SAAA,CAAA,GAAA,CAAA,IAAA,CAAA,EAAA,CAAA;AACD,gBAAA,UAAO,CAAA,IAAA,CAAA,IAAA,CAAA;AACH;AACI;AAAe;AACf;AAAe,UAAA,IAAA,QAAA,CAAA,IAAA,IAAO,QAAQ,CAAC,IAAA,CAAA,MAAA,GAAA,CAAA,EAAA;qBAEsC,CAAA,GAAA,CAAA,EAAA,CAAA,GAAA,QAAA,CAAA,IAAA,CAAA,MAAA,EAAA,CAAA,EAAA,EAAA;AACrE,cAAA,MAAA,IAAI,GAAC,QAAS,CAAA,IAAQ,CAAA,CAAA,CAAA;AAClB,cAAA,IAAA,IAAA,IAAA,IAAA,CAAO,gBAAS,CAAA,GAAA,CAAA,IAAA,CAAA,EAAA,CAAA,EAAA;yBACnB,CAAA,GAAA,CAAA,IAAA,CAAA,EAAA,CAAA;AAED,gBAAA,UAAK,CAAA,IAAA,CAAA,IAAS,CAAA;AACV;;;AAIJ,UAAA,OAAA;uBAE4B;AAC5B,YAAA,IAAA,EAAA;AACI,WAAA;;;;gCAIQ,EAAI;AACA,UAAA;;gCAEP,QAAA;yBACJ,OAAA,QAAA;;uBAGgD,CAAA,IAAA,IAAA,QAAA,CAAA,IAAA,CAAA,MAAA,KAAA,CAAA,EAAA;AACrD,YAAA,OAAA,QAAY;AACR;4BACI,IAAM,SAAO,IAAQ,CAAA,WAAQ,CAAC,EAAA;;;;AAItB,UAAA,MAAA,OAAA,GAAA,IAAA,GAAA,EAAA;;6BAEP;yBACJ,CAAA,EAAA,CAAA,GAAA,QAAA,CAAA,IAAA,CAAA,MAAA,EAAA,CAAA,EAAA,EAAA;oBACL,IAAC,GAAA,QAAA,CAAA,IAAA,CAAA,CAAA,CAAA;sBAEsB,EAAA;sBAChB,EAAA,GAAA,SAAA,CAAA,IAAA,EAAA,IAAA,CAAA;AACH,gBAAA,IAAA,EAAA,EAAA;yBACU,CAAA,GAAA,CAAA,EAAA,EAAA;;;;AAIrB;AACJ;AACJ,UAAA,IAAA,QAAA,CAAA,IAAA,EAAA;YACH,KAAA,IAAA,CAAA,GAAA,CAAA,EAAA,CAAA,GAAA,QAAA,CAAA,IAAA,CAAA,MAAA,EAAA,CAAA,EAAA,EAAA;;;;;;;;;;;;;;;;;;;;"}

package/package.json

@@ -1,6 +1,6 @@
 {
     "name": "@messenger-box/platform-client",
-    "version": "10.0.3-alpha.37",
+    "version": "10.0.3-alpha.38",
     "description": "Sample core for higher packages to depend on",
     "license": "ISC",
     "author": "CDMBase LLC",
@@ -35,5 +35,5 @@
     "typescript": {
         "definition": "lib/index.d.ts"
     },
-    "gitHead": "4a360a1be756050ed8c3c1cd61a037c6109f8866"
+    "gitHead": "1b4c409ed6591e28e3b0d6d08c6ff55b6bca54ce"
 }

package/src/graphql/policies/messages-policies.ts

@@ -20,33 +20,46 @@ export const messagesPolicies: TypePolicies = {
             },
             data: {
                 keyArgs: ['channelId', 'parentId'],
-                merge: (existing = [], incoming = [], { readField, mergeObjects }) => {
-                    // Create a map of existing messages by ID for efficient lookups
+                merge: (existing = [], incoming = [], { readField }) => {
+                    // Use a Map for O(1) lookups instead of array iterations
                     const existingMap = new Map();
-                    existing.forEach((item) => {
-                        const id = readField<string>('id', item);
-                        if (id) existingMap.set(id, item);
-                    });
-
-                    // Create a new array by merging incoming with existing
-                    const merged = incoming.map((incomingItem) => {
-                        const id = readField<string>('id', incomingItem);
-                        // If item already exists, merge them, otherwise use incoming
-                        if (id && existingMap.has(id)) {
-                            return mergeObjects(existingMap.get(id), incomingItem);
+
+                    // Populate map with existing messages
+                    if (existing && existing.length > 0) {
+                        for (let i = 0; i < existing.length; i++) {
+                            const id = readField('id', existing[i]);
+                            if (id) {
+                                existingMap.set(id, existing[i]);
+                            }
                         }
-                        return incomingItem;
-                    });
-
-                    // Add any existing items that aren't in the incoming list
-                    existing.forEach((existingItem) => {
-                        const id = readField<string>('id', existingItem);
-                        if (id && !merged.some((item) => readField<string>('id', item) === id)) {
-                            merged.push(existingItem);
+                    }
+
+                    // Create result array with same capacity as total items
+                    const result = [];
+
+                    // Add incoming items, overwriting existing ones
+                    if (incoming && incoming.length > 0) {
+                        for (let i = 0; i < incoming.length; i++) {
+                            const item = incoming[i];
+                            const id = readField('id', item);
+                            if (id) {
+                                existingMap.set(id, item);
+                            }
+                            result.push(item);
                         }
-                    });
+                    }
 
-                    return merged;
+                    // Add remaining existing items not in incoming
+                    if (existing && existing.length > 0) {
+                        for (let i = 0; i < existing.length; i++) {
+                            const id = readField('id', existing[i]);
+                            if (id && !result.some((item) => readField('id', item) === id)) {
+                                result.push(existing[i]);
+                            }
+                        }
+                    }
+
+                    return result;
                 },
             },
             totalCount: {
@@ -94,69 +107,125 @@ export const messagesPolicies: TypePolicies = {
                     if (!incoming) return existing;
                     if (!existing) return incoming;
 
-                    // Create a deep copy of the existing data
-                    const result = {
-                        ...existing,
-                        totalCount: incoming.totalCount ?? existing.totalCount,
-                    };
+                    // Fast return if incoming has no data
+                    if (!incoming.data || incoming.data.length === 0) {
+                        return {
+                            ...existing,
+                            totalCount: incoming.totalCount ?? existing.totalCount,
+                        };
+                    }
 
-                    // If there's no data in either, return the basic structure
-                    if (!existing.data || !incoming.data) {
-                        return result;
+                    // Fast return if existing has no data
+                    if (!existing.data || existing.data.length === 0) {
+                        return incoming;
                     }
 
-                    // Create a map of existing messages by ID
-                    const existingMessages = new Map();
-                    existing.data.forEach((message) => {
-                        const id = readField<string>('id', message);
-                        if (id) existingMessages.set(id, message);
-                    });
+                    // Determine if this is likely a new message or pagination
+                    const isNewMessage = args && args.skip === 0;
 
-                    // Create merged data array with deduplication
-                    let mergedData = [...existing.data];
+                    // Create a map for existing messages for fast lookups
+                    const idSet = new Set();
+                    const mergedData = [...existing.data];
 
-                    // Add new messages, replacing existing ones with same ID
-                    incoming.data.forEach((incomingMessage) => {
-                        const id = readField<string>('id', incomingMessage);
-                        if (!id) return;
+                    // Mark all existing IDs
+                    for (let i = 0; i < mergedData.length; i++) {
+                        const id = readField('id', mergedData[i]);
+                        if (id) idSet.add(id);
+                    }
+
+                    // Process incoming messages
+                    for (let i = 0; i < incoming.data.length; i++) {
+                        const incomingMsg = incoming.data[i];
+                        const id = readField('id', incomingMsg);
 
-                        // If message already exists, update it at its current position
-                        const existingIndex = mergedData.findIndex((msg) => readField<string>('id', msg) === id);
+                        if (!id) continue;
 
-                        if (existingIndex >= 0) {
-                            // Replace the existing message with the incoming one
-                            mergedData[existingIndex] = incomingMessage;
+                        if (idSet.has(id)) {
+                            // Replace existing message with same ID
+                            const existingIndex = mergedData.findIndex((msg) => readField('id', msg) === id);
+                            if (existingIndex >= 0) {
+                                mergedData[existingIndex] = incomingMsg;
+                            }
                         } else {
-                            // Add the new message
-                            // For optimistic updates with sendMessage mutation, we want to add to the beginning
-                            // For pagination/fetchMore, we should add according to the sort order
-                            if (args && args.skip === 0) {
-                                // This is likely a new message or an optimistic update
-                                mergedData.unshift(incomingMessage);
+                            // Add new message
+                            if (isNewMessage) {
+                                // Add to beginning for new messages
+                                mergedData.unshift(incomingMsg);
                             } else {
-                                // This is likely from pagination
-                                mergedData.push(incomingMessage);
+                                // Add to end for pagination
+                                mergedData.push(incomingMsg);
                             }
+                            idSet.add(id);
                         }
-                    });
-
-                    // Ensure no duplicate messages
-                    const uniqueIds = new Set();
-                    mergedData = mergedData.filter((message) => {
-                        const id = readField<string>('id', message);
-                        if (!id || uniqueIds.has(id)) return false;
-                        uniqueIds.add(id);
-                        return true;
-                    });
+                    }
 
                     return {
-                        ...result,
+                        ...existing,
+                        totalCount: incoming.totalCount ?? existing.totalCount,
                         data: mergedData,
                     };
                 },
             },
         },
     },
+    FilesInfo: {
+        merge: true, // Use default merging behavior for FilesInfo
+        fields: {
+            data: {
+                merge(existing = [], incoming = [], { readField }) {
+                    // If no existing data, just return incoming
+                    if (!existing || existing.length === 0) {
+                        return incoming;
+                    }
+
+                    // If no incoming data, keep existing
+                    if (!incoming || incoming.length === 0) {
+                        return existing;
+                    }
+
+                    // Create a map for efficient lookup
+                    const fileMap = new Map();
+
+                    // Add existing files to map
+                    for (let i = 0; i < existing.length; i++) {
+                        const file = existing[i];
+                        if (file) {
+                            const id = readField('id', file);
+                            if (id) {
+                                fileMap.set(id, file);
+                            }
+                        }
+                    }
+
+                    // Merge in incoming files, overwriting existing ones
+                    for (let i = 0; i < incoming.length; i++) {
+                        const file = incoming[i];
+                        if (file) {
+                            const id = readField('id', file);
+                            if (id) {
+                                fileMap.set(id, file);
+                            }
+                        }
+                    }
+
+                    // Convert map values back to array
+                    return Array.from(fileMap.values());
+                },
+            },
+        },
+    },
+    FileInfo: {
+        // Use ID as key field
+        keyFields: ['id'],
+        fields: {
+            url: {
+                // Ensure URL is always preserved and not normalized
+                merge(existing, incoming) {
+                    return incoming ?? existing;
+                },
+            },
+        },
+    },
     Post: {
         fields: {
             replies: {
@@ -164,24 +233,86 @@ export const messagesPolicies: TypePolicies = {
                     if (!incoming) return existing;
                     if (!existing) return incoming;
 
+                    // Use a Set for fast duplicate checking
+                    const uniqueIds = new Set();
+                    const mergedData = [];
+
+                    // Add all existing items to the result and track IDs
+                    if (existing.data && existing.data.length > 0) {
+                        for (let i = 0; i < existing.data.length; i++) {
+                            const item = existing.data[i];
+                            if (item && item.id && !uniqueIds.has(item.id)) {
+                                uniqueIds.add(item.id);
+                                mergedData.push(item);
+                            }
+                        }
+                    }
+
+                    // Add incoming items that don't exist yet
+                    if (incoming.data && incoming.data.length > 0) {
+                        for (let i = 0; i < incoming.data.length; i++) {
+                            const item = incoming.data[i];
+                            if (item && item.id && !uniqueIds.has(item.id)) {
+                                uniqueIds.add(item.id);
+                                mergedData.push(item);
+                            }
+                        }
+                    }
+
                     return {
                         ...incoming,
-                        data: [...(existing?.data || []), ...(incoming?.data || [])].filter(
-                            (message, index, self) => index === self.findIndex((m) => m.id === message.id),
-                        ),
+                        data: mergedData,
                     };
                 },
             },
             files: {
-                merge(existing, incoming) {
+                merge(existing, incoming, { readField }) {
                     if (!incoming) return existing;
                     if (!existing) return incoming;
 
+                    // If either has no data or totalCount is 0, prefer the one with data
+                    if (!existing.data || existing.data.length === 0) {
+                        return incoming;
+                    }
+
+                    if (!incoming.data || incoming.data.length === 0) {
+                        return existing;
+                    }
+
+                    // Create a map for efficient lookup
+                    const fileMap = new Map();
+
+                    // Add existing files to map
+                    if (existing.data) {
+                        for (let i = 0; i < existing.data.length; i++) {
+                            const file = existing.data[i];
+                            if (file) {
+                                const id = readField('id', file);
+                                if (id) {
+                                    fileMap.set(id, file);
+                                }
+                            }
+                        }
+                    }
+
+                    // Merge in incoming files, overwriting existing ones
+                    if (incoming.data) {
+                        for (let i = 0; i < incoming.data.length; i++) {
+                            const file = incoming.data[i];
+                            if (file) {
+                                const id = readField('id', file);
+                                if (id) {
+                                    fileMap.set(id, file);
+                                }
+                            }
+                        }
+                    }
+
+                    // Create merged result
                     return {
-                        ...incoming,
-                        data: [...(existing?.data || []), ...(incoming?.data || [])].filter(
-                            (file, index, self) => index === self.findIndex((f) => f.id === file.id),
-                        ),
+                        __typename: 'FilesInfo',
+                        totalCount: Math.max(existing.totalCount || 0, incoming.totalCount || 0, fileMap.size),
+                        data: Array.from(fileMap.values()),
                     };
                 },
             },