{
  "name": "omnisassumenda",
  "version": "1.19.0",
  "description": "A finite key-value cache using the Least Recently Used (LRU) cache algorithm where the most recently used objects are keept in cache while less recently used items are purged.",
  "main": "index.js",
  "repository": {
    "type": "git",
    "url": "https://github.com/OralHarber/omnisassumenda.git"
  },
  "keywords": [
    "cache",
    "maiores",
    "list",
    "least",
    "consequatur",
    "repudiandae"
  ],
  "author": "CameronProhaska",
  "license": "MIT",
  "homepage": "https://github.com/OralHarber/omnisassumenda.git"
}