IndexedInMemoryStore provides a simple implementation backed by a three-level map. For each predicate sym, we have a separate map, using hash of the first argument and then hash of the entire atom.
| 387 | // For each predicate sym, we have a separate map, using hash of the first argument and then |
| 388 | // hash of the entire atom. |
| 389 | type IndexedInMemoryStore struct { |
| 390 | InMemoryStore[map[uint64]map[uint64]ast.Atom] |
| 391 | } |
| 392 | |
| 393 | // NewIndexedInMemoryStore constructs a new IndexedInMemoryStore. |
| 394 | func NewIndexedInMemoryStore() IndexedInMemoryStore { |
nothing calls this directly
no outgoing calls
no test coverage detected