nowfound

Work · January 25, 2024

IM

Integer Map Data Structure

This project presents a new data structure for storing ordered integer maps. The proposed data structure is a compressive, cache-friendly, radix tree that has performance comparable to an unordered map (`std::unordered_map`) and is an order of magnitude faster than an ordered map (`std::map`).

Visit github.com ↗Alternatives

In plain words

Integer Map Data Structure is a new data structure for storing ordered integer maps. Built as a compressive, cache-friendly radix tree, it offers performance comparable to unordered maps while being substantially faster than ordered maps. The project targets developers needing efficient integer-to-value mappings with maintained ordering, available on GitHub.

written from the facts on this page · September 2026

More work this month

the category →
  • Clipto MCP▲640

    Let agents source clips from terabytes of your local video

    Work · 18d ago · clipto.com

  • HyNote for Mac▲383

    Free local transcription that is 100% Private

    Work · 17d ago · hynote.ai

  • VoiceOS App Store▲330

    The app store for voice native apps that lives in your notch

    Work · 28d ago · voiceos.com

  • Scrimba Explain▲325

    Ask any question, get a video back instantly

    Work · 24d ago · scrimba.com

  • The New Calendly▲211

    Handle all of the work before, during, and after meetings

    Work · 17d ago · calendly.com

Launched alongside, January 2024

the whole month →