awesome-repositories.com
Blog
MCP
awesome-repositories.com

Discover the best open-source repositories with AI-powered search.

ExploreCurated searchesOpen-source alternativesSelf-hosted softwareBlogSitemap
ProjectMCP serverAboutHow we rankPress
LegalPrivacyTerms
© 2026 Bringes Technology SRL·VAT RO45896025·hello@awesome-repositories.com
·
goossaert avatar

goossaert/hashmap

0
View on GitHub↗
256 stars·85 forks·C++·MIT·1 view

Hashmap

Various open addressing hashmap algorithms in C++

Features

  • Containers - Implementation of open-addressed hash table algorithms.
  • Data Structures - Open addressing hash table implementation.

Star history

Star history chart for goossaert/hashmapStar history chart for goossaert/hashmap

AI search

Explore more awesome repositories

Describe what you need in plain English — the AI ranks thousands of curated open-source projects by relevance.

Start searching with AI

Open-source alternatives to Hashmap

Similar open-source projects, ranked by how many features they share with Hashmap.
  • xtaci/algorithmsxtaci avatar

    xtaci/algorithms

    5,454View on GitHub↗

    This is a collection of classical algorithms and data structures implemented as a header-only C++ library. It provides a suite of tools for general algorithm implementation, including data structure management, graph theory analysis, and string processing. The library is distinguished by its specialized toolkits for cryptographic hashing and encoding, featuring implementations of MD5, SHA-1, and Base64. It also includes advanced capabilities for high-performance string processing via suffix trees and arrays, as well as computational number theory for primality testing and arbitrary-precision

    C++
    View on GitHub↗5,454
  • adrianbrad/queueadrianbrad avatar

    adrianbrad/queue

    357View on GitHub↗

    ⏪️ Go package providing multiple queue implementations. Developed in a thread-safe generic way.

    Go
    View on GitHub↗357
  • agext/levenshteinagext avatar

    agext/levenshtein

    92View on GitHub↗

    Levenshtein distance and similarity metrics with customizable edit costs and Winkler-like bonus for common prefix.

    Go
    View on GitHub↗92
  • accelerationnet/accessAccelerationNet avatar

    AccelerationNet/access

    91View on GitHub↗

    A common lisp library to unify access to common dictionary-like data-structures

    Common Lisp
    View on GitHub↗91
See all 30 alternatives to Hashmap→

Frequently asked questions

What does goossaert/hashmap do?

Various open addressing hashmap algorithms in C++

What are the main features of goossaert/hashmap?

The main features of goossaert/hashmap are: Containers, Data Structures.

What are some open-source alternatives to goossaert/hashmap?

Open-source alternatives to goossaert/hashmap include: xtaci/algorithms — This is a collection of classical algorithms and data structures implemented as a header-only C++ library. It provides… adrianbrad/queue — ⏪️ Go package providing multiple queue implementations. Developed in a thread-safe generic way. agext/levenshtein — Levenshtein distance and similarity metrics with customizable edit costs and Winkler-like bonus for common prefix. agnivade/levenshtein — Go implementation to calculate Levenshtein Distance. aio-arch/graphlib — Topological sort lib,Sorting and pruning of DAG graphs. accelerationnet/access — A common lisp library to unify access to common dictionary-like data-structures.