GeezerVisonThe World Wide Web, restored to 800 pixels of glory. |
| Home|About|Gaming cabinet|Archives|How it works|Starter sites |
GeezerVison is showing github.com — Build software better, together
#
unordered-mapHere are 56 public repositories matching this topic...Sort: Most stars
Sort options
A family of header-only, very fast and memory-friendly hashmap and btree containers.
concurrency parallel hash multi-thread tables parallel-programming memory-footprint unordered-map unordered-set hash-container
A fast & densely stored hashmap and hashset
c-plus-plus cpp hash cpp17 stl-containers no-dependencies hash-tables unordered-map unordered-set header-only-library
A collection of std-like containers written in C++11. Features fast unordered flat map/set, configurable double-ended vector and sparse deque.
benchmark container simd sparse std deque open-addressing double-ended unordered-map unordered-set erase-friendly devector sparque
Drop-in C++ STL for C — same push_back, insert, begin/end. Header-only.
c map set list stack queue datastructures vector c99 container priority-queue header-only stl-containers c11 deque c17 unordered-map unordered-set c23 cstl
A benchmark for hash tables and hash functions in C++, evaluate on different data as comprehensively as possible
Compile-time single-header hash-map written in C++ 17
cpp constexpr array templates hash-map header-only cpp17 compile-time hash-table no-dependencies constant constexpr-context compile-time-meta-programming unordered-map constexpr-constructors
C++ STL containers reimplemented in C
c linked-list libraries containers data-structures vectors stacks hash-tables queues sets linked-lists unordered-map unordered-set hash-maps
C++ template containers with optimized memory consumption
A collection of generic header only data structures written in C
c cpp boost data-structures unordered-map boostcpp adts-library flat-map header-only-library unordered-flat-map
A simple dictionary implementation in C
c map dictionary header-only no-dependencies independent dependency-free associative-array unordered-map
Fast C++ flat (open addressing) hash set, map
A robust C++ solution for validating parentheses in strings. This project features a well-tested algorithm that handles different types of parentheses, including (), {}, and []. It is designed to cover a wide range of scenarios, from simple to complex nested structures, ensuring the correct ordering and pairing of parentheses.
validation stack algorithms cpp data-structures coding-challenge string-processing associative-array unordered-map
Implement an Unordered Map in C++ using Hash Functions. Without any inbuilt function of C++.
Collection of STL and algorithms code snippets with tutorials for quick reference and learning.
A collection of slot maps and hash maps optimized for unsigned keys.
Simple implementation of Hash Table in C++. It's mainly intended to show how hash tables are implemented by libraries like STL.
A console-based, multi-role E-Commerce Inventory Management System in C++. Simulates a marketplace with Admin, Seller, and Buyer roles — manage stores, products, inventory, and sales using unordered_maps and stacks. Built with OOP, class inheritance, and STL containers. Windows CLI app (conio.h/windows.h).
windows cli ecommerce cplusplus cpp oop university-project stl data-structures console-application student-project object-oriented-programming unordered-map
Documentation Of C++ Standard Template Library (STLs) Used In Competitive Programming
map set list stack queue cpp vector priority-queue competitive-programming stl-containers dequeue forward-list unordered-map unordered-set
Add this topic to your repoTo associate your repository with the unordered-map topic, visit your repo's landing page and select "manage topics." |
| You are visitor 01402503 — GeezerVison does not store the pages you look up. Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required. |