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

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.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
+
 ## [10.0.3-alpha.36](https://github.com/CDEBase/messenger-box/compare/v10.0.3-alpha.35...v10.0.3-alpha.36) (2025-04-23)
 
 **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,YA0G9B,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,YA2L9B,CAAC"}

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

@@ -27,29 +27,40 @@ const messagesPolicies = {
         }
       },
       data: {
-        keyArgs: false,
+        keyArgs: ['channelId', 'parentId'],
         merge: (existing = [], incoming = [], {
           readField,
           mergeObjects
         }) => {
-          // console.log('existing', existing);
-          // console.log('incoming', incoming);
-          const merged = [...incoming];
-          const existingIds = existing.map(item => readField('id', item));
-          merged.forEach((item, index) => {
-            const itemId = readField('id', item);
-            const existingIndex = existingIds.findIndex(id => id === itemId);
-            if (existingIndex !== -1) {
-              merged[index] = mergeObjects(existing[existingIndex], merged[index]);
+          // Create a map of existing messages by ID for efficient lookups
+          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);
+            }
+            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);
             }
           });
           return merged;
         }
       },
       totalCount: {
-        keyArgs: false,
+        keyArgs: ['channelId', 'parentId'],
         merge(existing, incoming) {
-          return existing && existing > incoming ? existing : incoming;
+          return incoming !== undefined ? incoming : existing;
         }
       }
       // data: {
@@ -96,32 +107,89 @@ const messagesPolicies = {
   Query: {
     fields: {
       messages: {
-        // keyArgs: ['channelId', 'parentId', 'limit', 'skip'],
-        // keyArgs: ['channelId', 'parentId'],
+        keyArgs: ['channelId', 'parentId'],
+        merge(existing, incoming, {
+          args,
+          readField
+        }) {
+          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;
+            } 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);
+              } else {
+                // This is likely from pagination
+                mergedData.push(incomingMessage);
+              }
+            }
+          });
+          // 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,
+            data: mergedData
+          };
+        }
+      }
+    }
+  },
+  Post: {
+    fields: {
+      replies: {
+        merge(existing, incoming) {
+          if (!incoming) return existing;
+          if (!existing) return incoming;
+          return {
+            ...incoming,
+            data: [...(existing?.data || []), ...(incoming?.data || [])].filter((message, index, self) => index === self.findIndex(m => m.id === message.id))
+          };
+        }
+      },
+      files: {
         merge(existing, incoming) {
+          if (!incoming) return existing;
+          if (!existing) return incoming;
           return {
             ...incoming,
-            data: [...(existing?.data ?? []), ...(incoming.data ?? [])]
+            data: [...(existing?.data || []), ...(incoming?.data || [])].filter((file, index, self) => index === self.findIndex(f => f.id === file.id))
           };
         }
-        // merge(existing, incoming, { args, mergeObjects }) {
-        //     console.log('existing length', existing?.data?.length);
-        //     console.log('incoming length', incoming?.data?.length);
-        //     // console.log('existing', JSON.stringify(existing), 'incoming', JSON.stringify(incoming));
-        //     if (!incoming || incoming?.data?.length) return existing;
-        //     if (!existing || existing?.data?.length) return incoming;
-        //     //console.log('existing', JSON.stringify(existing), 'incoming', JSON.stringify(incoming));
-        //     const mergedData = existing ? existing?.data?.slice(0) : [];
-        //     // Insert the incoming elements in the right places, according to args.
-        //     const end = args?.skip + Math.min(args?.limit, incoming?.data?.length);
-        //     for (let i = args?.skip; i < end; ++i) {
-        //         mergedData[i] = incoming?.data[i - args?.skip];
-        //     }
-        //     const merged = { ...incoming, data: mergedData };
-        //     return merged;
-        //     // return mergeObjects(existing, incoming);
-        //     //return existing ? { ...existing, ...incoming } : incoming;
-        // },
       }
     }
   }

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;;qBAEyC;AACrC,YAAA;AACA,WAAA,GAAA,SAAA;yBAEM,eAAc,CAAE,CAAA,EAAA,QAAS,CAAA,CAAA,GAAA,CAAA,EAAA,SAAA,CAAA,CAAA;;AAE3B,OAAA;AACA,MAAA,IAAA,EAAA;AACI,QAAA,OAAA,EAAA,KAAA;wBACJ,GAAC,EAAA,EAAA,QAAA,GAAA,EAAA,EAAA;AACL,UAAA,SAAA;AACA,UAAA;;AAEP;AACD;AACI,UAAA,MAAA,MAAA,GAAS,CAAK,GAAA,QAAA,CAAA;gBACd,WAAc,GAAA,QAAU,CAAA,GAAA,CAAA,IAAA,IAAA,SAAA,CAAA,IAAA,EAAA,IAAA,CAAA,CAAA;AACpB,UAAA,MAAA,CAAA,OAAA,CAAA,CAAA,IAAe,EAAA,KAAA,KAAY;kBAC9B,MAAA,GAAA,SAAA,CAAA,IAAA,EAAA,IAAA,CAAA;AACJ,YAAA,MAAA,aAAA,GAAA,WAAA,CAAA,SAAA,CAAA,EAAA,IAAA,EAAA,KAAA,MAAA,CAAA;YACD,IAAU,aAAA,KAAA,EAAA,EAAA;cACgD,MAAA,CAAA,KAAA,CAAA,GAAA,YAAA,CAAA,QAAA,CAAA,aAAA,CAAA,EAAA,MAAA,CAAA,KAAA,CAAA,CAAA;;YAE1D;iBACkF,MAAA;;;gBAG9B,EAAA;eACxC,EAAA,KAAA;aACa,CAAA,QAAA,EAAA,QAAA,EAAA;iBAChB,QAAA,IAAA,QAAA,GAAA,QAAA,GAAA,QAAA,GAAA,QAAA;;AAEZ;AACJ;AACD;;AAEI;AACI;AACI;AACI;AACA;;AAEP;AACD;AACI;AACI;AACA,GAAA;oBACH,EAAA;AACJ;AACJ,IAAA,MAAA,EAAA;AACJ,MAAA,mBAAA,EAAA;AACD,QAAA,IAAO,CAAA,QAAA,EAAA;AACH,UAAA;AACI,SAAA,EAAA;gBACI;qBACsC;;uBAE3B;AACH,UAAA,OAAA,QAAA,GAAW,CAAA,EAAA,SAAA,CAAA,CAAA,EAAA,QAAA,CAAA,CAAA,GAAA,CAAA,EAAA,SAAA,CAAA,CAAA;AACX;;;qBAG8C,EAAA;;;gBAGtD;qBACgE;;uBAEiC;iBAC9B,QAAA,GAAA,CAAA,EAAA,SAAA,CAAA,CAAA,EAAA,QAAA,CAAA,CAAA,GAAA,CAAA,EAAA,SAAA,CAAA,CAAA;;;;;;;gBAQnE;;;sBAGK,EAAA,QAAA,EAAA;AACR,UAAA,OAAA;AACJ,YAAA,GAAA,QAAA;AACJ,YAAA,IAAA,EAAA,CAAA,IAAA,QAAA,EAAA,IAAA,IAAA,EAAA,CAAA,EAAA,IAAA,QAAA,CAAA,IAAA,IAAA,EAAA,CAAA;WACH;;;;;;;;;;;;;;;;;;;;;;;"}
+{"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;;;;;;;;;;;;;;;"}

package/package.json

@@ -1,6 +1,6 @@
 {
     "name": "@messenger-box/platform-client",
-    "version": "10.0.3-alpha.36",
+    "version": "10.0.3-alpha.37",
     "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": "c19b436784fffe67a8d77d89959a9ac898ab76c4"
+    "gitHead": "4a360a1be756050ed8c3c1cd61a037c6109f8866"
 }

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

@@ -19,27 +19,40 @@ export const messagesPolicies: TypePolicies = {
                 },
             },
             data: {
-                keyArgs: false,
+                keyArgs: ['channelId', 'parentId'],
                 merge: (existing = [], incoming = [], { readField, mergeObjects }) => {
-                    // console.log('existing', existing);
-                    // console.log('incoming', incoming);
-                    const merged = [...incoming];
-                    const existingIds = existing.map((item) => readField<String>('id', item));
+                    // Create a map of existing messages by ID for efficient lookups
+                    const existingMap = new Map();
+                    existing.forEach((item) => {
+                        const id = readField<string>('id', item);
+                        if (id) existingMap.set(id, item);
+                    });
 
-                    merged.forEach((item, index) => {
-                        const itemId = readField<String>('id', item);
-                        const existingIndex = existingIds.findIndex((id) => id === itemId);
-                        if (existingIndex !== -1) {
-                            merged[index] = mergeObjects(existing[existingIndex], merged[index]);
+                    // 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);
                         }
+                        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);
+                        }
+                    });
+
                     return merged;
                 },
             },
             totalCount: {
-                keyArgs: false,
+                keyArgs: ['channelId', 'parentId'],
                 merge(existing, incoming) {
-                    return existing && existing > incoming ? existing : incoming;
+                    return incoming !== undefined ? incoming : existing;
                 },
             },
             // data: {
@@ -57,7 +70,7 @@ export const messagesPolicies: TypePolicies = {
         },
     },
     PostThreadMessages: {
-      //  keyFields: ['threadmessagesRefId'],
+        //  keyFields: ['threadmessagesRefId'],
         fields: {
             threadmessagesRefId: {
                 read(existing, { variables }) {
@@ -76,33 +89,101 @@ export const messagesPolicies: TypePolicies = {
     Query: {
         fields: {
             messages: {
-                // keyArgs: ['channelId', 'parentId', 'limit', 'skip'],
-                // keyArgs: ['channelId', 'parentId'],
+                keyArgs: ['channelId', 'parentId'],
+                merge(existing, incoming, { args, readField }) {
+                    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<string>('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<string>('id', incomingMessage);
+                        if (!id) return;
+
+                        // If message already exists, update it at its current position
+                        const existingIndex = mergedData.findIndex((msg) => readField<string>('id', msg) === id);
+
+                        if (existingIndex >= 0) {
+                            // Replace the existing message with the incoming one
+                            mergedData[existingIndex] = incomingMessage;
+                        } 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);
+                            } else {
+                                // This is likely from pagination
+                                mergedData.push(incomingMessage);
+                            }
+                        }
+                    });
+
+                    // 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,
+                        data: mergedData,
+                    };
+                },
+            },
+        },
+    },
+    Post: {
+        fields: {
+            replies: {
                 merge(existing, incoming) {
+                    if (!incoming) return existing;
+                    if (!existing) return incoming;
+
                     return {
                         ...incoming,
-                        data: [...(existing?.data ?? []), ...(incoming.data ?? [])],
+                        data: [...(existing?.data || []), ...(incoming?.data || [])].filter(
+                            (message, index, self) => index === self.findIndex((m) => m.id === message.id),
+                        ),
                     };
                 },
-                // merge(existing, incoming, { args, mergeObjects }) {
-                //     console.log('existing length', existing?.data?.length);
-                //     console.log('incoming length', incoming?.data?.length);
-                //     // console.log('existing', JSON.stringify(existing), 'incoming', JSON.stringify(incoming));
-                //     if (!incoming || incoming?.data?.length) return existing;
-                //     if (!existing || existing?.data?.length) return incoming;
-                //     //console.log('existing', JSON.stringify(existing), 'incoming', JSON.stringify(incoming));
-                //     const mergedData = existing ? existing?.data?.slice(0) : [];
-                //     // Insert the incoming elements in the right places, according to args.
-                //     const end = args?.skip + Math.min(args?.limit, incoming?.data?.length);
-                //     for (let i = args?.skip; i < end; ++i) {
-                //         mergedData[i] = incoming?.data[i - args?.skip];
-                //     }
+            },
+            files: {
+                merge(existing, incoming) {
+                    if (!incoming) return existing;
+                    if (!existing) return incoming;
 
-                //     const merged = { ...incoming, data: mergedData };
-                //     return merged;
-                //     // return mergeObjects(existing, incoming);
-                //     //return existing ? { ...existing, ...incoming } : incoming;
-                // },
+                    return {
+                        ...incoming,
+                        data: [...(existing?.data || []), ...(incoming?.data || [])].filter(
+                            (file, index, self) => index === self.findIndex((f) => f.id === file.id),
+                        ),
+                    };
+                },
             },
         },
     },