Press n or j to go to the next uncovered block, b, p or k for the previous block.
| 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 | 18x 18x 18x 18x 13x 4x 9x 9x 1x 1x 8x 8x 25x 25x 2x 25x 25x 25x 12x 8x 4x 4x 4x 2x 2x 2x 2x 2x 2x 2x 2x 2x 8x 8x 8x 8x 2x 2x 2x 1x 2x 1x 14x 14x 14x 14x 14x 17x 3x 3x 14x 14x 1x 1x 1x 13x 13x 13x 19x 3x 19x 19x 19x 19x 13x 13x 13x 13x 3x 1x 1x 1x 1x 1x 1x 3x 3x 1x 1x 1x 3x 2x 2x 1x 1x 1x 1x 3x 3x 3x 1x 1x 1x 1x 3x 1x 1x 1x 2x 4x 4x 4x 1x 1x 1x 1x 1x 2x 2x 2x 6x 6x 8x 5x 10x 10x 3x 7x 7x 7x 1x 4x 7x 7x 7x 7x 7x 4x 4x 3x 3x 4x 1x 1x 1x 1x 1x 1x | /**
* Coherent.js Advanced Caching
*
* Smart caching strategies for performance optimization
*
* @module performance/cache
*/
/**
* LRU Cache
* Least Recently Used cache implementation
*/
export class LRUCache {
constructor(options = {}) {
this.maxSize = options.maxSize || 100;
this.ttl = options.ttl || null; // Time to live in ms
this.cache = new Map();
this.accessOrder = [];
}
/**
* Get value from cache
*/
get(key) {
if (!this.cache.has(key)) {
return undefined;
}
const entry = this.cache.get(key);
// Check TTL
if (this.ttl && Date.now() - entry.timestamp > this.ttl) {
this.delete(key);
return undefined;
}
// Update access order
this.updateAccessOrder(key);
return entry.value;
}
/**
* Set value in cache
*/
set(key, value) {
// Remove if exists
Iif (this.cache.has(key)) {
this.delete(key);
}
// Evict if at capacity
if (this.cache.size >= this.maxSize) {
this.evict();
}
// Add new entry
this.cache.set(key, {
value,
timestamp: Date.now()
});
this.accessOrder.push(key);
return this;
}
/**
* Check if key exists
*/
has(key) {
if (!this.cache.has(key)) {
return false;
}
const entry = this.cache.get(key);
// Check TTL
Iif (this.ttl && Date.now() - entry.timestamp > this.ttl) {
this.delete(key);
return false;
}
return true;
}
/**
* Delete key
*/
delete(key) {
this.cache.delete(key);
const index = this.accessOrder.indexOf(key);
Eif (index > -1) {
this.accessOrder.splice(index, 1);
}
return this;
}
/**
* Clear cache
*/
clear() {
this.cache.clear();
this.accessOrder = [];
return this;
}
/**
* Get cache size
*/
size() {
return this.cache.size;
}
/**
* Update access order
*/
updateAccessOrder(key) {
const index = this.accessOrder.indexOf(key);
Eif (index > -1) {
this.accessOrder.splice(index, 1);
}
this.accessOrder.push(key);
}
/**
* Evict least recently used
*/
evict() {
Eif (this.accessOrder.length > 0) {
const oldest = this.accessOrder.shift();
this.cache.delete(oldest);
}
}
/**
* Get all keys
*/
keys() {
return Array.from(this.cache.keys());
}
/**
* Get all values
*/
values() {
return Array.from(this.cache.values()).map(entry => entry.value);
}
/**
* Get statistics
*/
getStats() {
return {
size: this.cache.size,
maxSize: this.maxSize,
utilizationPercent: (this.cache.size / this.maxSize * 100).toFixed(2),
oldestKey: this.accessOrder[0],
newestKey: this.accessOrder[this.accessOrder.length - 1]
};
}
}
/**
* Memory Cache with strategies
*/
export class MemoryCache {
constructor(options = {}) {
this.options = {
strategy: 'lru', // lru, lfu, fifo
maxSize: 100,
ttl: null,
...options
};
this.cache = new Map();
this.metadata = new Map();
this.hits = 0;
this.misses = 0;
}
/**
* Get from cache
*/
get(key) {
if (!this.cache.has(key)) {
this.misses++;
return undefined;
}
const entry = this.cache.get(key);
// Check TTL
if (entry.ttl && Date.now() > entry.expiresAt) {
this.delete(key);
this.misses++;
return undefined;
}
// Update metadata
this.updateMetadata(key);
this.hits++;
return entry.value;
}
/**
* Set in cache
*/
set(key, value, options = {}) {
// Evict if needed
if (this.cache.size >= this.options.maxSize && !this.cache.has(key)) {
this.evict();
}
const ttl = options.ttl || this.options.ttl;
this.cache.set(key, {
value,
ttl,
expiresAt: ttl ? Date.now() + ttl : null,
createdAt: Date.now()
});
this.metadata.set(key, {
accessCount: 0,
lastAccess: Date.now()
});
return this;
}
/**
* Update metadata based on strategy
*/
updateMetadata(key) {
const meta = this.metadata.get(key);
Eif (meta) {
meta.accessCount++;
meta.lastAccess = Date.now();
}
}
/**
* Evict based on strategy
*/
evict() {
let keyToEvict;
switch (this.options.strategy) {
case 'lru': // Least Recently Used
keyToEvict = this.findLRU();
break;
case 'lfu': // Least Frequently Used
keyToEvict = this.findLFU();
break;
case 'fifo': // First In First Out
keyToEvict = this.findFIFO();
break;
default:
keyToEvict = this.cache.keys().next().value;
}
Eif (keyToEvict) {
this.delete(keyToEvict);
}
}
/**
* Find least recently used key
*/
findLRU() {
let oldest = null;
let oldestTime = Infinity;
for (const [key, meta] of this.metadata.entries()) {
if (meta.lastAccess < oldestTime) {
oldestTime = meta.lastAccess;
oldest = key;
}
}
return oldest;
}
/**
* Find least frequently used key
*/
findLFU() {
let leastUsed = null;
let minCount = Infinity;
for (const [key, meta] of this.metadata.entries()) {
Eif (meta.accessCount < minCount) {
minCount = meta.accessCount;
leastUsed = key;
}
}
return leastUsed;
}
/**
* Find first in (oldest)
*/
findFIFO() {
let oldest = null;
let oldestTime = Infinity;
for (const [key, entry] of this.cache.entries()) {
if (entry.createdAt < oldestTime) {
oldestTime = entry.createdAt;
oldest = key;
}
}
return oldest;
}
/**
* Check if key exists
*/
has(key) {
return this.cache.has(key);
}
/**
* Delete key
*/
delete(key) {
this.cache.delete(key);
this.metadata.delete(key);
return this;
}
/**
* Clear cache
*/
clear() {
this.cache.clear();
this.metadata.clear();
this.hits = 0;
this.misses = 0;
return this;
}
/**
* Get cache statistics
*/
getStats() {
const total = this.hits + this.misses;
const hitRate = total > 0 ? (this.hits / total * 100).toFixed(2) : 0;
return {
size: this.cache.size,
maxSize: this.options.maxSize,
hits: this.hits,
misses: this.misses,
hitRate: `${hitRate}%`,
strategy: this.options.strategy
};
}
}
/**
* Memoization cache
*/
export class MemoCache {
constructor(options = {}) {
this.cache = new LRUCache(options);
this.keyGenerator = options.keyGenerator || this.defaultKeyGenerator;
}
/**
* Default key generator
*/
defaultKeyGenerator(...args) {
return JSON.stringify(args);
}
/**
* Memoize a function
*/
memoize(fn) {
return (...args) => {
const key = this.keyGenerator(...args);
if (this.cache.has(key)) {
return this.cache.get(key);
}
const result = fn(...args);
this.cache.set(key, result);
return result;
};
}
/**
* Clear memoization cache
*/
clear() {
this.cache.clear();
}
/**
* Get statistics
*/
getStats() {
return this.cache.getStats();
}
}
/**
* Component render cache
*/
export class RenderCache {
constructor(options = {}) {
this.cache = new MemoryCache({
maxSize: options.maxSize || 50,
ttl: options.ttl || 60000, // 1 minute default
strategy: 'lru'
});
}
/**
* Generate cache key for component
*/
generateKey(component, props) {
const componentName = component.name || 'anonymous';
const propsKey = this.hashProps(props);
return `${componentName}:${propsKey}`;
}
/**
* Hash props for cache key
*/
hashProps(props) {
try {
return JSON.stringify(props, Object.keys(props).sort());
} catch {
return String(Date.now());
}
}
/**
* Get cached render
*/
get(component, props) {
const key = this.generateKey(component, props);
return this.cache.get(key);
}
/**
* Cache render result
*/
set(component, props, result, options = {}) {
const key = this.generateKey(component, props);
this.cache.set(key, result, options);
}
/**
* Clear cache
*/
clear() {
this.cache.clear();
}
/**
* Get statistics
*/
getStats() {
return this.cache.getStats();
}
}
/**
* Create a cache instance
*/
export function createCache(type = 'lru', options = {}) {
switch (type) {
case 'lru':
return new LRUCache(options);
case 'memory':
return new MemoryCache(options);
case 'memo':
return new MemoCache(options);
case 'render':
return new RenderCache(options);
default:
return new LRUCache(options);
}
}
/**
* Memoize a function
*/
export function memoize(fn, options = {}) {
const cache = new MemoCache(options);
return cache.memoize(fn);
}
export default {
LRUCache,
MemoryCache,
MemoCache,
RenderCache,
createCache,
memoize
};
|