@aj-archipelago/cortex 1.3.2 → 1.3.4

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@aj-archipelago/cortex",
-  "version": "1.3.2",
+  "version": "1.3.4",
   "description": "Cortex is a GraphQL API for AI. It provides a simple, extensible interface for using AI services from OpenAI, Azure and others.",
   "private": false,
   "repository": {

package/pathways/system/entity/memory/sys_memory_update.js

@@ -33,7 +33,7 @@ const modifyText = (text, modifications) => {
     return modifiedText;
 };
 
-const enforceTokenLimit = (text, maxTokens = 5000, isTopicsSection = false) => {
+export const enforceTokenLimit = (text, maxTokens = 5000, isTopicsSection = false) => {
     if (!text) return text;
     
     const lines = text.split('\n')
@@ -77,7 +77,7 @@ const enforceTokenLimit = (text, maxTokens = 5000, isTopicsSection = false) => {
             return true;
         });
 
-    prioritizedLines.sort((a, b) => a.priority - b.priority);
+    prioritizedLines.sort((a, b) => b.priority - a.priority);
 
     let tokens = encode(prioritizedLines.map(x => x.line).join('\n')).length;
     let safetyCounter = 0;

package/tests/memoryfunction.test.js

@@ -0,0 +1,64 @@
+import test from 'ava';
+import { enforceTokenLimit } from '../pathways/system/entity/memory/sys_memory_update.js';
+
+test('enforceTokenLimit preserves priority order correctly', t => {
+    const input = `
+[P1] Highest priority item
+[P2] High priority item
+[P3] Medium priority item
+[P4] Low priority item
+[P5] Lowest priority item`.trim();
+
+    // Enforce trimming
+    const result = enforceTokenLimit(input, 20);
+    
+    // Should keep P1, P2 only
+    t.true(result.includes('[P1]'));
+    t.true(result.includes('[P2]'));
+    t.false(result.includes('[P3]'));
+    t.false(result.includes('[P4]'));
+    t.false(result.includes('[P5]'));
+});
+
+test('enforceTokenLimit handles empty input', t => {
+    t.is(enforceTokenLimit(''), '');
+    t.is(enforceTokenLimit(null), null);
+});
+
+test('enforceTokenLimit removes duplicates', t => {
+    const input = `
+[P3] Duplicate item
+[P3] Duplicate item
+[P2] Unique item`.trim();
+
+    const result = enforceTokenLimit(input);
+    
+    // Count occurrences of "Duplicate item"
+    const matches = result.match(/Duplicate item/g) || [];
+    t.is(matches.length, 1);
+});
+
+test('enforceTokenLimit handles topics section differently', t => {
+    const input = `
+2024-03-19T10:00:00Z Discussed AI ethics
+2024-03-19T11:00:00Z Discussed programming
+2024-03-19T12:00:00Z Discussed testing`.trim();
+
+    const result = enforceTokenLimit(input, 20, true);
+    
+    // For topics, should remove oldest entries first regardless of content
+    t.false(result.includes('10:00:00Z'));
+    t.false(result.includes('11:00:00Z'));
+    t.true(result.includes('12:00:00Z'));
+});
+
+test('enforceTokenLimit adds P3 to unprioritized lines', t => {
+    const input = `
+Item without priority
+[P1] Item with priority`.trim();
+
+    const result = enforceTokenLimit(input);
+    
+    t.true(result.includes('[P3] Item without priority'));
+    t.true(result.includes('[P1] Item with priority'));
+});