@devwithbobby/loops 0.1.19 → 0.2.0

package/dist/component/http.js

@@ -82,7 +82,7 @@ http.route({
                 source: url.searchParams.get("source") ?? undefined,
                 subscribed: booleanFromQuery(url.searchParams.get("subscribed")),
                 limit: numberFromQuery(url.searchParams.get("limit"), 100),
-                offset: numberFromQuery(url.searchParams.get("offset"), 0),
+                cursor: url.searchParams.get("cursor") ?? null,
             });
             return jsonResponse(data);
         }

package/dist/component/lib.d.ts

@@ -36,9 +36,15 @@ export declare const logEmailOperation: import("convex/server").RegisteredMutati
  * Count contacts in the database
  * Can filter by audience criteria (userGroup, source, subscribed status)
  *
- * Note: When multiple filters are provided, only one index can be used.
- * Additional filters are applied in-memory, which is efficient for small result sets.
- * For large contact lists with multiple filters, consider using a composite index.
+ * For userGroup-only filtering, uses efficient O(log n) aggregate counting.
+ * For other filters (source, subscribed), uses indexed queries with a read limit.
+ *
+ * IMPORTANT: Before using this with existing data, run the backfillContactAggregate
+ * mutation to populate the aggregate with existing contacts.
+ *
+ * NOTE: When filtering by source or subscribed, counts are capped at MAX_COUNT_LIMIT
+ * to avoid query read limit errors. For exact counts with large datasets, use
+ * userGroup-only filtering which uses efficient aggregate counting.
  */
 export declare const countContacts: import("convex/server").RegisteredQuery<"public", {
     userGroup?: string | undefined;
@@ -46,19 +52,22 @@ export declare const countContacts: import("convex/server").RegisteredQuery<"pub
     subscribed?: boolean | undefined;
 }, Promise<number>>;
 /**
- * List contacts from the database with pagination
+ * List contacts from the database with cursor-based pagination
  * Can filter by audience criteria (userGroup, source, subscribed status)
  * Returns actual contact data, not just a count
  *
+ * Uses cursor-based pagination for efficient querying - only reads documents
+ * from the cursor position forward, not all preceding documents.
+ *
  * Note: When multiple filters are provided, only one index can be used.
- * Additional filters are applied in-memory before pagination.
+ * Additional filters are applied in-memory after fetching.
  */
 export declare const listContacts: import("convex/server").RegisteredQuery<"public", {
     limit: number;
-    offset: number;
     userGroup?: string | undefined;
     source?: string | undefined;
     subscribed?: boolean | undefined;
+    cursor?: string | null | undefined;
 }, Promise<{
     contacts: {
         _id: string;
@@ -73,10 +82,8 @@ export declare const listContacts: import("convex/server").RegisteredQuery<"publ
         userGroup?: string | undefined;
         loopsContactId?: string | undefined;
     }[];
-    total: number;
-    limit: number;
-    offset: number;
-    hasMore: boolean;
+    continueCursor: string | null;
+    isDone: boolean;
 }>>;
 /**
  * Add or update a contact in Loops
@@ -242,7 +249,10 @@ export declare const resubscribeContact: import("convex/server").RegisteredActio
 }>>;
 /**
  * Check for spam patterns: too many emails to the same recipient in a time window
- * Returns email addresses that received too many emails
+ * Returns email addresses that received too many emails.
+ *
+ * NOTE: Analysis is limited to the most recent MAX_SPAM_DETECTION_LIMIT operations
+ * in the time window to avoid query read limit errors.
  */
 export declare const detectRecipientSpam: import("convex/server").RegisteredQuery<"public", {
     timeWindowMs: number;
@@ -255,7 +265,10 @@ export declare const detectRecipientSpam: import("convex/server").RegisteredQuer
 }[]>>;
 /**
  * Check for spam patterns: too many emails from the same actor/user
- * Returns actor IDs that sent too many emails
+ * Returns actor IDs that sent too many emails.
+ *
+ * NOTE: Analysis is limited to the most recent MAX_SPAM_DETECTION_LIMIT operations
+ * in the time window to avoid query read limit errors.
  */
 export declare const detectActorSpam: import("convex/server").RegisteredQuery<"public", {
     timeWindowMs: number;
@@ -266,7 +279,11 @@ export declare const detectActorSpam: import("convex/server").RegisteredQuery<"p
     timeWindowMs: number;
 }[]>>;
 /**
- * Get recent email operation statistics for monitoring
+ * Get recent email operation statistics for monitoring.
+ *
+ * NOTE: Statistics are calculated from the most recent MAX_SPAM_DETECTION_LIMIT
+ * operations in the time window to avoid query read limit errors. For high-volume
+ * applications, consider using scheduled jobs with pagination for exact statistics.
  */
 export declare const getEmailStats: import("convex/server").RegisteredQuery<"public", {
     timeWindowMs: number;
@@ -281,7 +298,10 @@ export declare const getEmailStats: import("convex/server").RegisteredQuery<"pub
 }>>;
 /**
  * Detect rapid-fire email sending patterns (multiple emails sent in quick succession)
- * Returns suspicious patterns indicating potential spam
+ * Returns suspicious patterns indicating potential spam.
+ *
+ * NOTE: Analysis is limited to the most recent MAX_SPAM_DETECTION_LIMIT operations
+ * in the time window to avoid query read limit errors.
  */
 export declare const detectRapidFirePatterns: import("convex/server").RegisteredQuery<"public", {
     timeWindowMs: number;
@@ -296,7 +316,10 @@ export declare const detectRapidFirePatterns: import("convex/server").Registered
 }[]>>;
 /**
  * Rate limiting: Check if an email can be sent to a recipient
- * Based on recent email operations in the database
+ * Based on recent email operations in the database.
+ *
+ * Uses efficient .take() query - only reads the minimum number of documents
+ * needed to determine if the rate limit is exceeded.
  */
 export declare const checkRecipientRateLimit: import("convex/server").RegisteredQuery<"public", {
     email: string;
@@ -312,7 +335,10 @@ export declare const checkRecipientRateLimit: import("convex/server").Registered
 }>>;
 /**
  * Rate limiting: Check if an actor/user can send more emails
- * Based on recent email operations in the database
+ * Based on recent email operations in the database.
+ *
+ * Uses efficient .take() query - only reads the minimum number of documents
+ * needed to determine if the rate limit is exceeded.
  */
 export declare const checkActorRateLimit: import("convex/server").RegisteredQuery<"public", {
     actorId: string;
@@ -327,7 +353,10 @@ export declare const checkActorRateLimit: import("convex/server").RegisteredQuer
 }>>;
 /**
  * Rate limiting: Check global email sending rate
- * Checks total email operations across all senders
+ * Checks total email operations across all senders.
+ *
+ * Uses efficient .take() query - only reads the minimum number of documents
+ * needed to determine if the rate limit is exceeded.
  */
 export declare const checkGlobalRateLimit: import("convex/server").RegisteredQuery<"public", {
     timeWindowMs: number;
@@ -338,4 +367,24 @@ export declare const checkGlobalRateLimit: import("convex/server").RegisteredQue
     limit: number;
     timeWindowMs: number;
 }>>;
+/**
+ * Backfill the contact aggregate with existing contacts.
+ * Run this mutation after upgrading to a version with aggregate support.
+ *
+ * This processes contacts in batches to avoid timeout issues with large datasets.
+ * Call repeatedly with the returned cursor until isDone is true.
+ *
+ * Usage:
+ * 1. First call with clear: true to reset the aggregate
+ * 2. Subsequent calls with the returned cursor until isDone is true
+ */
+export declare const backfillContactAggregate: import("convex/server").RegisteredMutation<"public", {
+    batchSize: number;
+    cursor?: string | null | undefined;
+    clear?: boolean | undefined;
+}, Promise<{
+    processed: number;
+    cursor: string | null;
+    isDone: boolean;
+}>>;
 //# sourceMappingURL=lib.d.ts.map

package/dist/component/lib.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"lib.d.ts","sourceRoot":"","sources":["../../src/component/lib.ts"],"names":[],"mappings":"AAOA;;GAEG;AACH,eAAO,MAAM,YAAY;;;;;;;;;iBA6CvB,CAAC;AAEH;;GAEG;AACH,eAAO,MAAM,aAAa;;iBAexB,CAAC;AAEH;;GAEG;AACH,eAAO,MAAM,iBAAiB;;;;;;;;;;;iBAkC5B,CAAC;AAEH;;;;;;;GAOG;AACH,eAAO,MAAM,aAAa;;;;mBA0DxB,CAAC;AAEH;;;;;;;GAOG;AACH,eAAO,MAAM,YAAY;;;;;;;;;;;;;;;;;;;;;;;;GA8FvB,CAAC;AAEH;;;;GAIG;AACH,eAAO,MAAM,UAAU;;;;;;;;;;;;;;GA+GrB,CAAC;AAEH;;GAEG;AACH,eAAO,MAAM,aAAa;;;;;;;;;;;;GAgDxB,CAAC;AAEH;;GAEG;AACH,eAAO,MAAM,iBAAiB;;;;;;;;GAiD5B,CAAC;AAEH;;GAEG;AACH,eAAO,MAAM,SAAS;;;;;;;GAyCpB,CAAC;AAEH;;GAEG;AACH,eAAO,MAAM,aAAa;;;;;GA0BxB,CAAC;AAEH;;;;;;;;;;;;;;;GAeG;AACH,eAAO,MAAM,WAAW;;;;;;;;;GA4DtB,CAAC;AAEH;;;;GAIG;AACH,eAAO,MAAM,WAAW;;;;;;;;;;;;;;;;GA4DtB,CAAC;AAEH;;;;GAIG;AACH,eAAO,MAAM,mBAAmB;;;;;;;;;;;;;;;;;;;;GA8D9B,CAAC;AAEH;;;GAGG;AACH,eAAO,MAAM,kBAAkB;;;;;GA2B7B,CAAC;AAEH;;;GAGG;AACH,eAAO,MAAM,kBAAkB;;;;;GA2B7B,CAAC;AAEH;;;GAGG;AACH,eAAO,MAAM,mBAAmB;;;;;;;;KA8C9B,CAAC;AAEH;;;GAGG;AACH,eAAO,MAAM,eAAe;;;;;;;KA4C1B,CAAC;AAEH;;GAEG;AACH,eAAO,MAAM,aAAa;;;;;;;;;;GAkDxB,CAAC;AAEH;;;GAGG;AACH,eAAO,MAAM,uBAAuB;;;;;;;;;;KAsGlC,CAAC;AAEH;;;GAGG;AACH,eAAO,MAAM,uBAAuB;;;;;;;;;;;GA+ClC,CAAC;AAEH;;;GAGG;AACH,eAAO,MAAM,mBAAmB;;;;;;;;;;GA6C9B,CAAC;AAEH;;;GAGG;AACH,eAAO,MAAM,oBAAoB;;;;;;;;GA8B/B,CAAC"}
+{"version":3,"file":"lib.d.ts","sourceRoot":"","sources":["../../src/component/lib.ts"],"names":[],"mappings":"AAkBA;;GAEG;AACH,eAAO,MAAM,YAAY;;;;;;;;;iBA2DvB,CAAC;AAEH;;GAEG;AACH,eAAO,MAAM,aAAa;;iBAiBxB,CAAC;AAEH;;GAEG;AACH,eAAO,MAAM,iBAAiB;;;;;;;;;;;iBAkC5B,CAAC;AAUH;;;;;;;;;;;;;GAaG;AACH,eAAO,MAAM,aAAa;;;;mBA8DxB,CAAC;AAEH;;;;;;;;;;GAUG;AACH,eAAO,MAAM,YAAY;;;;;;;;;;;;;;;;;;;;;;GAgGvB,CAAC;AAEH;;;;GAIG;AACH,eAAO,MAAM,UAAU;;;;;;;;;;;;;;GA+GrB,CAAC;AAEH;;GAEG;AACH,eAAO,MAAM,aAAa;;;;;;;;;;;;GAgDxB,CAAC;AAEH;;GAEG;AACH,eAAO,MAAM,iBAAiB;;;;;;;;GAiD5B,CAAC;AAEH;;GAEG;AACH,eAAO,MAAM,SAAS;;;;;;;GAyCpB,CAAC;AAEH;;GAEG;AACH,eAAO,MAAM,aAAa;;;;;GA0BxB,CAAC;AAEH;;;;;;;;;;;;;;;GAeG;AACH,eAAO,MAAM,WAAW;;;;;;;;;GA4DtB,CAAC;AAEH;;;;GAIG;AACH,eAAO,MAAM,WAAW;;;;;;;;;;;;;;;;GA4DtB,CAAC;AAEH;;;;GAIG;AACH,eAAO,MAAM,mBAAmB;;;;;;;;;;;;;;;;;;;;GA8D9B,CAAC;AAEH;;;GAGG;AACH,eAAO,MAAM,kBAAkB;;;;;GA2B7B,CAAC;AAEH;;;GAGG;AACH,eAAO,MAAM,kBAAkB;;;;;GA2B7B,CAAC;AASH;;;;;;GAMG;AACH,eAAO,MAAM,mBAAmB;;;;;;;;KA8C9B,CAAC;AAEH;;;;;;GAMG;AACH,eAAO,MAAM,eAAe;;;;;;;KA4C1B,CAAC;AAEH;;;;;;GAMG;AACH,eAAO,MAAM,aAAa;;;;;;;;;;GAkDxB,CAAC;AAEH;;;;;;GAMG;AACH,eAAO,MAAM,uBAAuB;;;;;;;;;;KAsGlC,CAAC;AAEH;;;;;;GAMG;AACH,eAAO,MAAM,uBAAuB;;;;;;;;;;;GAiDlC,CAAC;AAEH;;;;;;GAMG;AACH,eAAO,MAAM,mBAAmB;;;;;;;;;;GA+C9B,CAAC;AAEH;;;;;;GAMG;AACH,eAAO,MAAM,oBAAoB;;;;;;;;GAiC/B,CAAC;AAEH;;;;;;;;;;GAUG;AACH,eAAO,MAAM,wBAAwB;;;;;;;;GAsCnC,CAAC"}