mirror of
https://github.com/PR0M3TH3AN/bitvid.git
synced 2026-10-27 16:02:26 +00:00
perf: optimize ProfileCache.clearMemoryCache to O(1)
Refactor ProfileCache memoryCache from a flat Map to a nested Map (Pubkey -> Section -> Data). This allows clearing a user's cache in O(1) time instead of O(N) by deleting the user's entry directly, avoiding a full scan of all cache keys. Benchmark showed improvement from ~58ms to ~0.0014ms for clearing a user in a cache with 20,000 users (100,000 entries). Co-authored-by: PR0M3TH3AN <[email protected]>
This commit is contained in:
1 parent
830f4da7bd
commit
ecc9041cbd
1 file changed
+28
-20
+28
-20
@@ -26,7 +26,7 @@ function sanitizeProfileString(value) {
|
||||
class ProfileCache {
|
||||
constructor() {
|
||||
this.activePubkey = null;
|
||||
this.memoryCache = new Map(); // For runtime decrypted data: pubkey:section -> data
|
||||
this.memoryCache = new Map(); // For runtime decrypted data: pubkey -> Map(section -> data)
|
||||
this.listeners = new Set();
|
||||
}
|
||||
|
||||
@@ -240,9 +240,11 @@ class ProfileCache {
|
||||
|
||||
getProfileData(pubkey, section) {
|
||||
// 1. Check memory cache (runtime data)
|
||||
const memKey = `${pubkey}:${section}`;
|
||||
if (this.memoryCache.has(memKey)) {
|
||||
return this.memoryCache.get(memKey);
|
||||
if (this.memoryCache.has(pubkey)) {
|
||||
const userCache = this.memoryCache.get(pubkey);
|
||||
if (userCache.has(section)) {
|
||||
return userCache.get(section);
|
||||
}
|
||||
}
|
||||
|
||||
// 2. Load from persistence
|
||||
@@ -273,7 +275,10 @@ class ProfileCache {
|
||||
}
|
||||
|
||||
// Populate memory cache to avoid repeat parsing
|
||||
this.memoryCache.set(memKey, parsed);
|
||||
if (!this.memoryCache.has(pubkey)) {
|
||||
this.memoryCache.set(pubkey, new Map());
|
||||
}
|
||||
this.memoryCache.get(pubkey).set(section, parsed);
|
||||
return parsed;
|
||||
}
|
||||
} catch (error) {
|
||||
@@ -302,39 +307,42 @@ class ProfileCache {
|
||||
}
|
||||
|
||||
// Update memory cache
|
||||
const memKey = `${pubkey}:${section}`;
|
||||
this.memoryCache.set(memKey, data);
|
||||
if (!this.memoryCache.has(pubkey)) {
|
||||
this.memoryCache.set(pubkey, new Map());
|
||||
}
|
||||
this.memoryCache.get(pubkey).set(section, data);
|
||||
|
||||
this.emit("update", { pubkey, section, data });
|
||||
this.emit("partition-updated", { pubkey, key: section });
|
||||
}
|
||||
|
||||
setMemoryDataForPubkey(pubkey, section, data) {
|
||||
const memKey = `${pubkey}:${section}`;
|
||||
this.memoryCache.set(memKey, data);
|
||||
if (!this.memoryCache.has(pubkey)) {
|
||||
this.memoryCache.set(pubkey, new Map());
|
||||
}
|
||||
this.memoryCache.get(pubkey).set(section, data);
|
||||
|
||||
this.emit("update", { pubkey, section, data });
|
||||
}
|
||||
|
||||
setMemoryData(section, data) {
|
||||
if (!this.activePubkey) return;
|
||||
const key = `${this.activePubkey}:${section}`;
|
||||
this.memoryCache.set(key, data);
|
||||
if (!this.memoryCache.has(this.activePubkey)) {
|
||||
this.memoryCache.set(this.activePubkey, new Map());
|
||||
}
|
||||
this.memoryCache.get(this.activePubkey).set(section, data);
|
||||
}
|
||||
|
||||
getMemoryData(section) {
|
||||
if (!this.activePubkey) return null;
|
||||
const key = `${this.activePubkey}:${section}`;
|
||||
return this.memoryCache.get(key);
|
||||
if (this.memoryCache.has(this.activePubkey)) {
|
||||
return this.memoryCache.get(this.activePubkey).get(section);
|
||||
}
|
||||
return undefined;
|
||||
}
|
||||
|
||||
clearMemoryCache(pubkey) {
|
||||
// Clear all entries starting with pubkey:
|
||||
const prefix = `${pubkey}:`;
|
||||
for (const key of this.memoryCache.keys()) {
|
||||
if (key.startsWith(prefix)) {
|
||||
this.memoryCache.delete(key);
|
||||
}
|
||||
}
|
||||
this.memoryCache.delete(pubkey);
|
||||
}
|
||||
|
||||
clearSignerRuntime(pubkey) {
|
||||
|
||||
Reference in new issue
Block a user