Skip to content

httpsanuj1807/lru-cache-in-c

View on GitHub ↗Related repositories →

This project implements a Least Recently Used (LRU) Cache using a combination of a doubly linked list and a hashmap in C. The LRU cache efficiently manages memory by automatically evicting the least recently accessed elements when the cache reaches its capacity, making it ideal for scenarios where fast access to frequently used data is required.

active 2024-08-302024-08-30 (UTC)

Complete coverage27,117 / 27,119 hourly files (100%) · 2 absent upstream2023-08-152026-09-17 (UTC)
Events
3
Pushes
1
Pull requests
0
Issues
0
Stars
0
Forks
0

Activity over time

Daily event counts in the loaded window

Line chart, 1 days from 2024-08-30 to 2024-08-30. Pushes: 1 total, peak 1 in a day. Pull requests: 0 total, peak 0 in a day. Issues: 0 total, peak 0 in a day. Comments: 0 total, peak 0 in a day. Stars: 0 total, peak 0 in a day.

  • Pushes
  • Pull requests
  • Issues
  • Comments
  • Stars

Top contributors

Pushes, PRs, issues, reviews and comments — stars and forks excluded, so this is contribution rather than popularity

ContributorContributionsPushesPRsComments
httpsanuj18071100

Recent activity

Latest issues, pull requests and releases

No issue or PR events — this repo's activity is pushes only.

Totals cover only the window loaded into ClickHouse and count events, not GitHub's lifetime totals — 0 stars here means stars gained during the window, not the repo's star count.