{"id":24081488,"url":"https://github.com/beh01der/memory-savvy-queue","last_synced_at":"2026-05-12T22:36:17.293Z","repository":{"id":183336618,"uuid":"669967081","full_name":"Beh01der/memory-savvy-queue","owner":"Beh01der","description":null,"archived":false,"fork":false,"pushed_at":"2023-07-24T03:25:12.000Z","size":4,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-09-14T07:19:12.803Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":null,"language":"TypeScript","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/Beh01der.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null}},"created_at":"2023-07-24T02:01:52.000Z","updated_at":"2023-08-03T02:29:10.000Z","dependencies_parsed_at":"2023-07-24T03:30:58.044Z","dependency_job_id":null,"html_url":"https://github.com/Beh01der/memory-savvy-queue","commit_stats":null,"previous_names":["beh01der/memory-savvy-queue"],"tags_count":1,"template":false,"template_full_name":null,"purl":"pkg:github/Beh01der/memory-savvy-queue","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Beh01der%2Fmemory-savvy-queue","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Beh01der%2Fmemory-savvy-queue/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Beh01der%2Fmemory-savvy-queue/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Beh01der%2Fmemory-savvy-queue/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/Beh01der","download_url":"https://codeload.github.com/Beh01der/memory-savvy-queue/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Beh01der%2Fmemory-savvy-queue/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":32960295,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-05-12T09:19:52.626Z","status":"ssl_error","status_checked_at":"2026-05-12T09:17:33.438Z","response_time":102,"last_error":"SSL_connect returned=1 errno=0 peeraddr=140.82.121.6:443 state=error: unexpected eof while reading","robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":false,"can_crawl_api":true,"host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":[],"created_at":"2025-01-09T23:16:59.037Z","updated_at":"2026-05-12T22:36:17.277Z","avatar_url":"https://github.com/Beh01der.png","language":"TypeScript","funding_links":[],"categories":[],"sub_categories":[],"readme":"A simple FIFO queue that limits memory usage\n\nIt's designed to be used in case when we want to postpone item consumption but at the same time limiting memory usage.\n\nConsider 2 scenarios:\n\n1. Memory limit is not reached\n\n```typescript\nasync function run() {\n  const queue = new MemSavvyQueue\u003cUint32Array\u003e({\n    memoryUsageLimitBytes: 1200,\n    itemConsumer: async (item) =\u003e {\n      console.log(\"Consuming item %d\", item[0]);\n      return Promise.resolve();\n    },\n  });\n\n  for (let i = 0; i \u003c 3; i++) {\n    await queue.push(new Uint32Array(100).fill(i));\n    console.log(\"Added item %d\", i);\n  }\n\n  console.log(\"Consuming all items\");\n  await queue.consumeAll();\n}\n\nrun().then(() =\u003e console.log(\"Done\"));\n```\n\noutput would be:\n\n```\nAdded item 0\nAdded item 1\nAdded item 2\nConsuming all items\nConsuming item 0\nConsuming item 1\nConsuming item 2\nDone\n```\n\nAs we can see, when there is no memory pressure, our queue acts like a buffer allowing us to consume stored items at our own pace.\n\n2. Memory limit is exceeded\n\n```typescript\nasync function run() {\n  const queue = new MemSavvyQueue\u003cUint32Array\u003e({\n    memoryUsageLimitBytes: 800,\n    itemConsumer: async (item) =\u003e {\n      console.log(\"Consuming item %d\", item[0]);\n      return Promise.resolve();\n    },\n  });\n\n  for (let i = 0; i \u003c 5; i++) {\n    await queue.push(new Uint32Array(100).fill(i));\n    console.log(\"Added item %d\", i);\n  }\n\n  console.log(\"Consuming all items\");\n  await queue.consumeAll();\n}\n\nrun().then(() =\u003e console.log(\"Done\"));\n```\n\noutput would be:\n\n```\nAdded item 0\nAdded item 1\nConsuming item 0\nAdded item 2\nConsuming item 1\nAdded item 3\nConsuming item 2\nAdded item 4\nConsuming all items\nConsuming item 3\nConsuming item 4\nDone\n```\n\nIn this case we exceeded defined memory limit at some point, and queue started calling `itemConsumer` on the \"oldest\" items to free up memory required to store new item.\n\n## API\n\n```typescript\nexport type MemSavvyQueueConfig\u003cITEM\u003e = {\n  // consumer function\n  itemConsumer: (item: ITEM) =\u003e Promise\u003cvoid\u003e;\n  // memory usage limit in bytes (default = 1Mb)\n  memoryUsageLimitBytes?: number;\n};\n\nexport class MemSavvyQueue\u003cITEM\u003e {\n  constructor(config: MemSavvyQueueConfig\u003cITEM\u003e);\n\n  // push new item - returns number of forcefully consumed items\n  public async push(item: ITEM): Promise\u003cnumber\u003e;\n\n  // consume one oldest item - returns true if item was consumed\n  public async consumeOne(): Promise\u003cboolean\u003e;\n\n  // consume all items - returns number of consumed items\n  public async consumeAll(): Promise\u003cnumber\u003e;\n\n  // returns item count\n  public getCount(): number;\n\n  // returns true if there are some items\n  public hasItems(): boolean;\n}\n```\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fbeh01der%2Fmemory-savvy-queue","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fbeh01der%2Fmemory-savvy-queue","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fbeh01der%2Fmemory-savvy-queue/lists"}