lex-agentic-memory 0.1.5 → 0.1.8

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
checksums.yaml CHANGED
@@ -1,7 +1,7 @@
1
1
  ---
2
2
  SHA256:
3
- metadata.gz: c20af8021bf914fea9be62a7cbfc8ebbf4f71c0a4ceb49defac2867fa2469b12
4
- data.tar.gz: e4d005aa924f4007f1f8ea91a81311a8ada4e7c9501bab4d7f72559e31416c1c
3
+ metadata.gz: 9df4d40acddf847a91c9b778461c54d9ce0353a071f54d232e12a249df899b01
4
+ data.tar.gz: a41a803969657a0029fae7262f8889ecd2641483aed0dc628d3482990aa3c067
5
5
  SHA512:
6
- metadata.gz: 2128a3c7c86aee317d516df8a04b1849b7e886c9e309f76c32d63c9dbc67df6eaa34172d87614778c5670396ca6bcc9d31ca1049ebfd7c2a0260112f66d5b157
7
- data.tar.gz: 34730c557e9c0438fa2093748f7878aa0104b53d81d51dd89a5ca29c2ff196410c315f6ea103ae3ddb20ac4b41341f854de847706575b2ce13a4835bf4b9537d
6
+ metadata.gz: c8e84baa2ab49fa7b8c79e6c0b572c5ab1f051b69ead4220435492e46a851b4052f67dd19b40ed3a0097c18895d9349212b34e9b50e3e66be00e6980d243b20a
7
+ data.tar.gz: 66c47eb11ed41a51e284681d82c6f5936a88771fd218cc74ffeec913605ff9b07507af8522d490fa6eeeb4edb316d97c9f1bb157019bcca1801632e4f575c227
data/CHANGELOG.md CHANGED
@@ -1,5 +1,27 @@
1
1
  # Changelog
2
2
 
3
+ ## [Unreleased]
4
+
5
+ ### Fixed
6
+ - Add Mutex synchronization to trace Store and CacheStore for thread safety during concurrent tick cycles
7
+
8
+ ## [0.1.7] - 2026-03-24
9
+
10
+ ### Fixed
11
+ - Add Mutex synchronization to CacheStore for thread-safety across concurrent store/iterate/flush operations
12
+ - Add rescue blocks to `flush_associations` and `flush_index` for graceful handling of oversized cache entries
13
+
14
+ ## [0.1.6] - 2026-03-23
15
+
16
+ ### Fixed
17
+ - Fix trace migration path registration (`'memory/local_migrations'` -> `'trace/local_migrations'`)
18
+ - Refactor CacheStore from single-blob storage to per-trace individual cache keys with index, preventing OOM on flush
19
+
20
+ ### Changed
21
+ - CacheStore now uses `legion:memory:trace:<uuid>` keys instead of serializing all traces into one key
22
+ - Dirty set tracking replaces dirty flag for more efficient selective flushing
23
+ - Batch flush in groups of 500 traces
24
+
3
25
  ## [0.1.5] - 2026-03-22
4
26
 
5
27
  ### Changed
data/LICENSE CHANGED
@@ -1,21 +1,201 @@
1
- MIT License
2
-
3
- Copyright (c) 2026 Matthew Iverson
4
-
5
- Permission is hereby granted, free of charge, to any person obtaining a copy
6
- of this software and associated documentation files (the "Software"), to deal
7
- in the Software without restriction, including without limitation the rights
8
- to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
9
- copies of the Software, and to permit persons to whom the Software is
10
- furnished to do so, subject to the following conditions:
11
-
12
- The above copyright notice and this permission notice shall be included in all
13
- copies or substantial portions of the Software.
14
-
15
- THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
16
- IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
17
- FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
18
- AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
19
- LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
20
- OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
21
- SOFTWARE.
1
+ Apache License
2
+ Version 2.0, January 2004
3
+ http://www.apache.org/licenses/
4
+
5
+ TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
6
+
7
+ 1. Definitions.
8
+
9
+ "License" shall mean the terms and conditions for use, reproduction,
10
+ and distribution as defined by Sections 1 through 9 of this document.
11
+
12
+ "Licensor" shall mean the copyright owner or entity authorized by
13
+ the copyright owner that is granting the License.
14
+
15
+ "Legal Entity" shall mean the union of the acting entity and all
16
+ other entities that control, are controlled by, or are under common
17
+ control with that entity. For the purposes of this definition,
18
+ "control" means (i) the power, direct or indirect, to cause the
19
+ direction or management of such entity, whether by contract or
20
+ otherwise, or (ii) ownership of fifty percent (50%) or more of the
21
+ outstanding shares, or (iii) beneficial ownership of such entity.
22
+
23
+ "You" (or "Your") shall mean an individual or Legal Entity
24
+ exercising permissions granted by this License.
25
+
26
+ "Source" form shall mean the preferred form for making modifications,
27
+ including but not limited to software source code, documentation
28
+ source, and configuration files.
29
+
30
+ "Object" form shall mean any form resulting from mechanical
31
+ transformation or translation of a Source form, including but
32
+ not limited to compiled object code, generated documentation,
33
+ and conversions to other media types.
34
+
35
+ "Work" shall mean the work of authorship, whether in Source or
36
+ Object form, made available under the License, as indicated by a
37
+ copyright notice that is included in or attached to the work
38
+ (an example is provided in the Appendix below).
39
+
40
+ "Derivative Works" shall mean any work, whether in Source or Object
41
+ form, that is based on (or derived from) the Work and for which the
42
+ editorial revisions, annotations, elaborations, or other modifications
43
+ represent, as a whole, an original work of authorship. For the purposes
44
+ of this License, Derivative Works shall not include works that remain
45
+ separable from, or merely link (or bind by name) to the interfaces of,
46
+ the Work and Derivative Works thereof.
47
+
48
+ "Contribution" shall mean any work of authorship, including
49
+ the original version of the Work and any modifications or additions
50
+ to that Work or Derivative Works thereof, that is intentionally
51
+ submitted to Licensor for inclusion in the Work by the copyright owner
52
+ or by an individual or Legal Entity authorized to submit on behalf of
53
+ the copyright owner. For the purposes of this definition, "submitted"
54
+ means any form of electronic, verbal, or written communication sent
55
+ to the Licensor or its representatives, including but not limited to
56
+ communication on electronic mailing lists, source code control systems,
57
+ and issue tracking systems that are managed by, or on behalf of, the
58
+ Licensor for the purpose of discussing and improving the Work, but
59
+ excluding communication that is conspicuously marked or otherwise
60
+ designated in writing by the copyright owner as "Not a Contribution."
61
+
62
+ "Contributor" shall mean Licensor and any individual or Legal Entity
63
+ on behalf of whom a Contribution has been received by Licensor and
64
+ subsequently incorporated within the Work.
65
+
66
+ 2. Grant of Copyright License. Subject to the terms and conditions of
67
+ this License, each Contributor hereby grants to You a perpetual,
68
+ worldwide, non-exclusive, no-charge, royalty-free, irrevocable
69
+ copyright license to reproduce, prepare Derivative Works of,
70
+ publicly display, publicly perform, sublicense, and distribute the
71
+ Work and such Derivative Works in Source or Object form.
72
+
73
+ 3. Grant of Patent License. Subject to the terms and conditions of
74
+ this License, each Contributor hereby grants to You a perpetual,
75
+ worldwide, non-exclusive, no-charge, royalty-free, irrevocable
76
+ (except as stated in this section) patent license to make, have made,
77
+ use, offer to sell, sell, import, and otherwise transfer the Work,
78
+ where such license applies only to those patent claims licensable
79
+ by such Contributor that are necessarily infringed by their
80
+ Contribution(s) alone or by combination of their Contribution(s)
81
+ with the Work to which such Contribution(s) was submitted. If You
82
+ institute patent litigation against any entity (including a
83
+ cross-claim or counterclaim in a lawsuit) alleging that the Work
84
+ or a Contribution incorporated within the Work constitutes direct
85
+ or contributory patent infringement, then any patent licenses
86
+ granted to You under this License for that Work shall terminate
87
+ as of the date such litigation is filed.
88
+
89
+ 4. Redistribution. You may reproduce and distribute copies of the
90
+ Work or Derivative Works thereof in any medium, with or without
91
+ modifications, and in Source or Object form, provided that You
92
+ meet the following conditions:
93
+
94
+ (a) You must give any other recipients of the Work or
95
+ Derivative Works a copy of this License; and
96
+
97
+ (b) You must cause any modified files to carry prominent notices
98
+ stating that You changed the files; and
99
+
100
+ (c) You must retain, in the Source form of any Derivative Works
101
+ that You distribute, all copyright, patent, trademark, and
102
+ attribution notices from the Source form of the Work,
103
+ excluding those notices that do not pertain to any part of
104
+ the Derivative Works; and
105
+
106
+ (d) If the Work includes a "NOTICE" text file as part of its
107
+ distribution, then any Derivative Works that You distribute must
108
+ include a readable copy of the attribution notices contained
109
+ within such NOTICE file, excluding those notices that do not
110
+ pertain to any part of the Derivative Works, in at least one
111
+ of the following places: within a NOTICE text file distributed
112
+ as part of the Derivative Works; within the Source form or
113
+ documentation, if provided along with the Derivative Works; or,
114
+ within a display generated by the Derivative Works, if and
115
+ wherever such third-party notices normally appear. The contents
116
+ of the NOTICE file are for informational purposes only and
117
+ do not modify the License. You may add Your own attribution
118
+ notices within Derivative Works that You distribute, alongside
119
+ or as an addendum to the NOTICE text from the Work, provided
120
+ that such additional attribution notices cannot be construed
121
+ as modifying the License.
122
+
123
+ You may add Your own copyright statement to Your modifications and
124
+ may provide additional or different license terms and conditions
125
+ for use, reproduction, or distribution of Your modifications, or
126
+ for any such Derivative Works as a whole, provided Your use,
127
+ reproduction, and distribution of the Work otherwise complies with
128
+ the conditions stated in this License.
129
+
130
+ 5. Submission of Contributions. Unless You explicitly state otherwise,
131
+ any Contribution intentionally submitted for inclusion in the Work
132
+ by You to the Licensor shall be under the terms and conditions of
133
+ this License, without any additional terms or conditions.
134
+ Notwithstanding the above, nothing herein shall supersede or modify
135
+ the terms of any separate license agreement you may have executed
136
+ with Licensor regarding such Contributions.
137
+
138
+ 6. Trademarks. This License does not grant permission to use the trade
139
+ names, trademarks, service marks, or product names of the Licensor,
140
+ except as required for reasonable and customary use in describing the
141
+ origin of the Work and reproducing the content of the NOTICE file.
142
+
143
+ 7. Disclaimer of Warranty. Unless required by applicable law or
144
+ agreed to in writing, Licensor provides the Work (and each
145
+ Contributor provides its Contributions) on an "AS IS" BASIS,
146
+ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
147
+ implied, including, without limitation, any warranties or conditions
148
+ of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
149
+ PARTICULAR PURPOSE. You are solely responsible for determining the
150
+ appropriateness of using or redistributing the Work and assume any
151
+ risks associated with Your exercise of permissions under this License.
152
+
153
+ 8. Limitation of Liability. In no event and under no legal theory,
154
+ whether in tort (including negligence), contract, or otherwise,
155
+ unless required by applicable law (such as deliberate and grossly
156
+ negligent acts) or agreed to in writing, shall any Contributor be
157
+ liable to You for damages, including any direct, indirect, special,
158
+ incidental, or consequential damages of any character arising as a
159
+ result of this License or out of the use or inability to use the
160
+ Work (including but not limited to damages for loss of goodwill,
161
+ work stoppage, computer failure or malfunction, or any and all
162
+ other commercial damages or losses), even if such Contributor
163
+ has been advised of the possibility of such damages.
164
+
165
+ 9. Accepting Warranty or Additional Liability. While redistributing
166
+ the Work or Derivative Works thereof, You may choose to offer,
167
+ and charge a fee for, acceptance of support, warranty, indemnity,
168
+ or other liability obligations and/or rights consistent with this
169
+ License. However, in accepting such obligations, You may act only
170
+ on Your own behalf and on Your sole responsibility, not on behalf
171
+ of any other Contributor, and only if You agree to indemnify,
172
+ defend, and hold each Contributor harmless for any liability
173
+ incurred by, or claims asserted against, such Contributor by reason
174
+ of your accepting any such warranty or additional liability.
175
+
176
+ END OF TERMS AND CONDITIONS
177
+
178
+ APPENDIX: How to apply the Apache License to your work.
179
+
180
+ To apply the Apache License to your work, attach the following
181
+ boilerplate notice, with the fields enclosed by brackets "[]"
182
+ replaced with your own identifying information. (Don't include
183
+ the brackets!) The text should be enclosed in the appropriate
184
+ comment syntax for the file format. We also recommend that a
185
+ file or class name and description of purpose be included on the
186
+ same "printed page" as the copyright notice for easier
187
+ identification within third-party archives.
188
+
189
+ Copyright 2021 Esity
190
+
191
+ Licensed under the Apache License, Version 2.0 (the "License");
192
+ you may not use this file except in compliance with the License.
193
+ You may obtain a copy of the License at
194
+
195
+ http://www.apache.org/licenses/LICENSE-2.0
196
+
197
+ Unless required by applicable law or agreed to in writing, software
198
+ distributed under the License is distributed on an "AS IS" BASIS,
199
+ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
200
+ See the License for the specific language governing permissions and
201
+ limitations under the License.
@@ -25,7 +25,7 @@ module Legion
25
25
  [(0.7...0.9), :substantial],
26
26
  [(0.5...0.7), :partial],
27
27
  [(0.3...0.5), :degraded],
28
- [(..0.3), :fragmentary]
28
+ [..0.3, :fragmentary]
29
29
  ].freeze
30
30
 
31
31
  # Resolution labels mapping hologram resolution to symbol
@@ -34,7 +34,7 @@ module Legion
34
34
  [(0.7...0.9), :high],
35
35
  [(0.5...0.7), :medium],
36
36
  [(0.3...0.5), :low],
37
- [(..0.3), :fragmentary]
37
+ [..0.3, :fragmentary]
38
38
  ].freeze
39
39
 
40
40
  # Fidelity labels for individual fragments
@@ -43,7 +43,7 @@ module Legion
43
43
  [(0.6...0.8), :clear],
44
44
  [(0.4...0.6), :hazy],
45
45
  [(0.2...0.4), :clouded],
46
- [(..0.2), :corrupted]
46
+ [..0.2, :corrupted]
47
47
  ].freeze
48
48
 
49
49
  # Interference strength labels
@@ -51,7 +51,7 @@ module Legion
51
51
  [(0.7..), :strong],
52
52
  [(0.4...0.7), :moderate],
53
53
  [(0.1...0.4), :weak],
54
- [(..0.1), :negligible]
54
+ [..0.1, :negligible]
55
55
  ].freeze
56
56
 
57
57
  def self.label_for(table, value)
@@ -7,27 +7,35 @@ module Legion
7
7
  module Trace
8
8
  module Helpers
9
9
  # Cache-backed store using Legion::Cache (Memcached/Redis).
10
- # Keeps a local copy in memory, syncs to/from cache on load/flush.
11
- # Call `flush` after a batch of writes, or it auto-flushes when dirty.
12
- # Call `reload` to pull latest state from cache (e.g. after another process wrote).
10
+ # Each trace is stored as an individual cache key for scalability.
11
+ # An index key tracks all known trace IDs.
12
+ # Keeps a local in-memory copy for fast reads; syncs to cache on flush.
13
13
  class CacheStore
14
- TRACES_KEY = 'legion:memory:traces'
15
- ASSOC_KEY = 'legion:memory:associations'
16
- TTL = 86_400 # 24 hours
14
+ TRACE_PREFIX = 'legion:memory:trace:'
15
+ INDEX_KEY = 'legion:memory:trace_index'
16
+ ASSOC_KEY = 'legion:memory:associations'
17
+ TTL = 86_400 # 24 hours
18
+ FLUSH_BATCH = 500 # traces per flush batch
17
19
 
18
20
  attr_reader :traces, :associations
19
21
 
20
22
  def initialize
21
- Legion::Logging.info '[memory] CacheStore initialized (memcached-backed)'
22
- @traces = Legion::Cache.get(TRACES_KEY) || {}
23
- @associations = Legion::Cache.get(ASSOC_KEY) || {}
24
- @dirty = false
23
+ Legion::Logging.info '[memory] CacheStore initialized (memcached-backed, per-key)'
24
+ @mutex = Mutex.new
25
+ @traces = {}
26
+ @associations = {}
27
+ @dirty_ids = Set.new
28
+ @deleted_ids = Set.new
29
+ @assoc_dirty = false
30
+ load_index
25
31
  Legion::Logging.info "[memory] CacheStore loaded #{@traces.size} traces from cache"
26
32
  end
27
33
 
28
34
  def store(trace)
29
- @traces[trace[:trace_id]] = trace
30
- @dirty = true
35
+ @mutex.synchronize do
36
+ @traces[trace[:trace_id]] = trace
37
+ @dirty_ids << trace[:trace_id]
38
+ end
31
39
  trace[:trace_id]
32
40
  end
33
41
 
@@ -36,24 +44,28 @@ module Legion
36
44
  end
37
45
 
38
46
  def delete(trace_id)
39
- @traces.delete(trace_id)
40
- @associations.delete(trace_id)
41
- @associations.each_value { |links| links.delete(trace_id) }
42
- @dirty = true
47
+ @mutex.synchronize do
48
+ @traces.delete(trace_id)
49
+ @associations.delete(trace_id)
50
+ @associations.each_value { |links| links.delete(trace_id) }
51
+ @dirty_ids.delete(trace_id)
52
+ @deleted_ids << trace_id
53
+ @assoc_dirty = true
54
+ end
43
55
  end
44
56
 
45
57
  def retrieve_by_type(type, min_strength: 0.0, limit: 100)
46
- @traces.values
47
- .select { |t| t[:trace_type] == type && t[:strength] >= min_strength }
48
- .sort_by { |t| -t[:strength] }
49
- .first(limit)
58
+ snapshot = @mutex.synchronize { @traces.values }
59
+ snapshot.select { |t| t[:trace_type] == type && t[:strength] >= min_strength }
60
+ .sort_by { |t| -t[:strength] }
61
+ .first(limit)
50
62
  end
51
63
 
52
64
  def retrieve_by_domain(domain_tag, min_strength: 0.0, limit: 100)
53
- @traces.values
54
- .select { |t| t[:domain_tags].include?(domain_tag) && t[:strength] >= min_strength }
55
- .sort_by { |t| -t[:strength] }
56
- .first(limit)
65
+ snapshot = @mutex.synchronize { @traces.values }
66
+ snapshot.select { |t| t[:domain_tags].include?(domain_tag) && t[:strength] >= min_strength }
67
+ .sort_by { |t| -t[:strength] }
68
+ .first(limit)
57
69
  end
58
70
 
59
71
  def retrieve_associated(trace_id, min_strength: 0.0, limit: 20)
@@ -70,30 +82,36 @@ module Legion
70
82
  def record_coactivation(trace_id_a, trace_id_b)
71
83
  return if trace_id_a == trace_id_b
72
84
 
73
- @associations[trace_id_a] ||= {}
74
- @associations[trace_id_b] ||= {}
75
- @associations[trace_id_a][trace_id_b] = (@associations[trace_id_a][trace_id_b] || 0) + 1
76
- @associations[trace_id_b][trace_id_a] = (@associations[trace_id_b][trace_id_a] || 0) + 1
85
+ @mutex.synchronize do
86
+ @associations[trace_id_a] ||= {}
87
+ @associations[trace_id_b] ||= {}
88
+ @associations[trace_id_a][trace_id_b] = (@associations[trace_id_a][trace_id_b] || 0) + 1
89
+ @associations[trace_id_b][trace_id_a] = (@associations[trace_id_b][trace_id_a] || 0) + 1
77
90
 
78
- threshold = Helpers::Trace::COACTIVATION_THRESHOLD
79
- link_traces(trace_id_a, trace_id_b) if @associations[trace_id_a][trace_id_b] >= threshold
80
- @dirty = true
91
+ threshold = Helpers::Trace::COACTIVATION_THRESHOLD
92
+ link_traces(trace_id_a, trace_id_b) if @associations[trace_id_a][trace_id_b] >= threshold
93
+ @assoc_dirty = true
94
+ end
81
95
  end
82
96
 
83
97
  def all_traces(min_strength: 0.0)
84
- @traces.values.select { |t| t[:strength] >= min_strength }
98
+ snapshot = @mutex.synchronize { @traces.values }
99
+ snapshot.select { |t| t[:strength] >= min_strength }
85
100
  end
86
101
 
87
102
  def count
88
103
  @traces.size
89
104
  end
90
105
 
106
+ def synchronize(&) = @mutex.synchronize(&)
107
+
91
108
  def firmware_traces
92
109
  retrieve_by_type(:firmware)
93
110
  end
94
111
 
95
112
  def walk_associations(start_id:, max_hops: 12, min_strength: 0.1)
96
- return [] unless @traces.key?(start_id)
113
+ snapshot = @mutex.synchronize { @traces.dup }
114
+ return [] unless snapshot.key?(start_id)
97
115
 
98
116
  results = []
99
117
  visited = Set.new([start_id])
@@ -101,13 +119,13 @@ module Legion
101
119
 
102
120
  until queue.empty?
103
121
  current_id, depth, path = queue.shift
104
- current = @traces[current_id]
122
+ current = snapshot[current_id]
105
123
  next unless current
106
124
 
107
125
  current[:associated_traces].each do |neighbor_id|
108
126
  next if visited.include?(neighbor_id)
109
127
 
110
- neighbor = @traces[neighbor_id]
128
+ neighbor = snapshot[neighbor_id]
111
129
  next unless neighbor
112
130
  next unless neighbor[:strength] >= min_strength
113
131
 
@@ -121,26 +139,87 @@ module Legion
121
139
  results
122
140
  end
123
141
 
124
- # Write local state to cache
142
+ # Write dirty traces to cache as individual keys
125
143
  def flush
126
- return unless @dirty
127
-
128
- Legion::Cache.set(TRACES_KEY, @traces, TTL)
129
- Legion::Cache.set(ASSOC_KEY, strip_default_procs(@associations), TTL)
130
- @dirty = false
131
- Legion::Logging.debug "[memory] CacheStore flushed #{@traces.size} traces to cache"
144
+ @mutex.synchronize do
145
+ flush_deleted
146
+ flush_traces
147
+ flush_associations
148
+ flush_index
149
+ Legion::Logging.debug "[memory] CacheStore flushed #{@dirty_ids.size} dirty traces (#{@traces.size} total)"
150
+ @dirty_ids.clear
151
+ @deleted_ids.clear
152
+ end
132
153
  end
133
154
 
134
- # Pull latest state from cache (after another process wrote)
155
+ # Pull latest state from cache
135
156
  def reload
136
- @traces = Legion::Cache.get(TRACES_KEY) || {}
137
- @associations = Legion::Cache.get(ASSOC_KEY) || {}
138
- @dirty = false
157
+ @traces.clear
158
+ @associations = {}
159
+ @dirty_ids.clear
160
+ @deleted_ids.clear
161
+ @assoc_dirty = false
162
+ load_index
139
163
  Legion::Logging.debug "[memory] CacheStore reloaded #{@traces.size} traces from cache"
140
164
  end
141
165
 
142
166
  private
143
167
 
168
+ def trace_key(trace_id)
169
+ "#{TRACE_PREFIX}#{trace_id}"
170
+ end
171
+
172
+ def load_index
173
+ index = Legion::Cache.get(INDEX_KEY)
174
+ return unless index.is_a?(Array)
175
+
176
+ loaded = 0
177
+ index.each do |id|
178
+ trace = Legion::Cache.get(trace_key(id))
179
+ if trace
180
+ @traces[id] = trace
181
+ loaded += 1
182
+ end
183
+ end
184
+ Legion::Logging.debug "[memory] CacheStore loaded #{loaded}/#{index.size} traces from index" if defined?(Legion::Logging)
185
+ rescue StandardError => e
186
+ Legion::Logging.warn "[memory] CacheStore load_index failed: #{e.message}" if defined?(Legion::Logging)
187
+ end
188
+
189
+ def flush_traces
190
+ return if @dirty_ids.empty?
191
+
192
+ @dirty_ids.each_slice(FLUSH_BATCH) do |batch|
193
+ batch.each do |id|
194
+ trace = @traces[id]
195
+ Legion::Cache.set(trace_key(id), trace, TTL) if trace
196
+ end
197
+ end
198
+ end
199
+
200
+ def flush_deleted
201
+ @deleted_ids.each do |id|
202
+ Legion::Cache.delete(trace_key(id))
203
+ end
204
+ end
205
+
206
+ def flush_associations
207
+ return unless @assoc_dirty
208
+
209
+ Legion::Cache.set(ASSOC_KEY, strip_default_procs(@associations), TTL)
210
+ @assoc_dirty = false
211
+ rescue StandardError => e
212
+ Legion::Logging.warn "[memory] CacheStore flush_associations failed (#{@associations.size} entries): #{e.message}" if defined?(Legion::Logging)
213
+ end
214
+
215
+ def flush_index
216
+ return if @dirty_ids.empty? && @deleted_ids.empty?
217
+
218
+ Legion::Cache.set(INDEX_KEY, @traces.keys, TTL)
219
+ rescue StandardError => e
220
+ Legion::Logging.warn "[memory] CacheStore flush_index failed (#{@traces.size} traces): #{e.message}" if defined?(Legion::Logging)
221
+ end
222
+
144
223
  def strip_default_procs(hash)
145
224
  hash.each_with_object({}) do |(k, v), plain|
146
225
  plain[k] = v.is_a?(Hash) ? {}.merge(v) : v
@@ -14,13 +14,14 @@ module Legion
14
14
  attr_reader :traces, :associations
15
15
 
16
16
  def initialize
17
+ @mutex = Mutex.new
17
18
  @traces = {}
18
19
  @associations = Hash.new { |h, k| h[k] = Hash.new(0) }
19
20
  load_from_local
20
21
  end
21
22
 
22
23
  def store(trace)
23
- @traces[trace[:trace_id]] = trace
24
+ @mutex.synchronize { @traces[trace[:trace_id]] = trace }
24
25
  trace[:trace_id]
25
26
  end
26
27
 
@@ -29,23 +30,25 @@ module Legion
29
30
  end
30
31
 
31
32
  def delete(trace_id)
32
- @traces.delete(trace_id)
33
- @associations.delete(trace_id)
34
- @associations.each_value { |links| links.delete(trace_id) }
33
+ @mutex.synchronize do
34
+ @traces.delete(trace_id)
35
+ @associations.delete(trace_id)
36
+ @associations.each_value { |links| links.delete(trace_id) }
37
+ end
35
38
  end
36
39
 
37
40
  def retrieve_by_type(type, min_strength: 0.0, limit: 100)
38
- @traces.values
39
- .select { |t| t[:trace_type] == type && t[:strength] >= min_strength }
40
- .sort_by { |t| -t[:strength] }
41
- .first(limit)
41
+ snapshot = @mutex.synchronize { @traces.values }
42
+ snapshot.select { |t| t[:trace_type] == type && t[:strength] >= min_strength }
43
+ .sort_by { |t| -t[:strength] }
44
+ .first(limit)
42
45
  end
43
46
 
44
47
  def retrieve_by_domain(domain_tag, min_strength: 0.0, limit: 100)
45
- @traces.values
46
- .select { |t| t[:domain_tags].include?(domain_tag) && t[:strength] >= min_strength }
47
- .sort_by { |t| -t[:strength] }
48
- .first(limit)
48
+ snapshot = @mutex.synchronize { @traces.values }
49
+ snapshot.select { |t| t[:domain_tags].include?(domain_tag) && t[:strength] >= min_strength }
50
+ .sort_by { |t| -t[:strength] }
51
+ .first(limit)
49
52
  end
50
53
 
51
54
  def retrieve_associated(trace_id, min_strength: 0.0, limit: 20)
@@ -62,30 +65,33 @@ module Legion
62
65
  def record_coactivation(trace_id_a, trace_id_b)
63
66
  return if trace_id_a == trace_id_b
64
67
 
65
- @associations[trace_id_a][trace_id_b] += 1
66
- @associations[trace_id_b][trace_id_a] += 1
67
-
68
- threshold = Helpers::Trace::COACTIVATION_THRESHOLD
69
-
70
- return unless @associations[trace_id_a][trace_id_b] >= threshold
68
+ @mutex.synchronize do
69
+ @associations[trace_id_a][trace_id_b] += 1
70
+ @associations[trace_id_b][trace_id_a] += 1
71
71
 
72
- link_traces(trace_id_a, trace_id_b)
72
+ threshold = Helpers::Trace::COACTIVATION_THRESHOLD
73
+ link_traces(trace_id_a, trace_id_b) if @associations[trace_id_a][trace_id_b] >= threshold
74
+ end
73
75
  end
74
76
 
75
77
  def all_traces(min_strength: 0.0)
76
- @traces.values.select { |t| t[:strength] >= min_strength }
78
+ snapshot = @mutex.synchronize { @traces.values }
79
+ snapshot.select { |t| t[:strength] >= min_strength }
77
80
  end
78
81
 
79
82
  def count
80
83
  @traces.size
81
84
  end
82
85
 
86
+ def synchronize(&) = @mutex.synchronize(&)
87
+
83
88
  def firmware_traces
84
89
  retrieve_by_type(:firmware)
85
90
  end
86
91
 
87
92
  def walk_associations(start_id:, max_hops: 12, min_strength: 0.1)
88
- return [] unless @traces.key?(start_id)
93
+ snapshot = @mutex.synchronize { @traces.dup }
94
+ return [] unless snapshot.key?(start_id)
89
95
 
90
96
  results = []
91
97
  visited = Set.new([start_id])
@@ -93,12 +99,12 @@ module Legion
93
99
 
94
100
  until queue.empty?
95
101
  current_id, depth, path = queue.shift
96
- next unless (current = @traces[current_id])
102
+ next unless (current = snapshot[current_id])
97
103
 
98
104
  current[:associated_traces].each do |neighbor_id|
99
105
  next if visited.include?(neighbor_id)
100
106
 
101
- neighbor = @traces[neighbor_id]
107
+ neighbor = snapshot[neighbor_id]
102
108
  next unless neighbor
103
109
  next unless neighbor[:strength] >= min_strength
104
110
 
@@ -117,8 +123,9 @@ module Legion
117
123
  return unless Legion::Data::Local.connection.table_exists?(:memory_traces)
118
124
 
119
125
  db = Legion::Data::Local.connection
126
+ traces_snapshot = @mutex.synchronize { @traces.dup }
120
127
 
121
- @traces.each_value do |trace|
128
+ traces_snapshot.each_value do |trace|
122
129
  row = serialize_trace_for_db(trace)
123
130
  existing = db[:memory_traces].where(trace_id: trace[:trace_id]).first
124
131
  if existing
@@ -129,7 +136,7 @@ module Legion
129
136
  end
130
137
 
131
138
  db_trace_ids = db[:memory_traces].select_map(:trace_id)
132
- memory_trace_ids = @traces.keys
139
+ memory_trace_ids = traces_snapshot.keys
133
140
  stale_ids = db_trace_ids - memory_trace_ids
134
141
  db[:memory_traces].where(trace_id: stale_ids).delete unless stale_ids.empty?
135
142
 
@@ -47,7 +47,7 @@ module Legion
47
47
  if defined?(Legion::Data::Local)
48
48
  Legion::Data::Local.register_migrations(
49
49
  name: :memory,
50
- path: File.join(__dir__, 'memory', 'local_migrations')
50
+ path: File.join(__dir__, 'trace', 'local_migrations')
51
51
  )
52
52
  end
53
53
  end
@@ -4,7 +4,7 @@ module Legion
4
4
  module Extensions
5
5
  module Agentic
6
6
  module Memory
7
- VERSION = '0.1.5'
7
+ VERSION = '0.1.8'
8
8
  end
9
9
  end
10
10
  end
metadata CHANGED
@@ -1,7 +1,7 @@
1
1
  --- !ruby/object:Gem::Specification
2
2
  name: lex-agentic-memory
3
3
  version: !ruby/object:Gem::Version
4
- version: 0.1.5
4
+ version: 0.1.8
5
5
  platform: ruby
6
6
  authors:
7
7
  - Esity