tidwall / tidwall/hashmap.c

How to implement hashmap_filter

Open
#41 7 comments 0 reactions 0 assignees View on GitHub

Nobody has claimed this yet.

Dominant language
C
Stars
1k
Forks
138
PR merge metrics
No merged PRs in 30d

Description

Thanks for making this software, it's very useful.

Is it safe to call hashmap_delete while using hashmap_iter (or hashmap_scan)? Would this ever result in invalid pointers, or in some items being skipped by the iterator?

If it's not safe, how would you suggest implementing a "filter" function? Could it be added as a feature?

Contributor guide

No contributing guide indexed for this repository

First steps

  1. Read the whole issue, then the project's contributing guide.
  2. Comment on the issue to say you are picking it up — it saves two people doing the same work.
  3. Fork the repository and make your change on a branch.
  4. Open a pull request that references the issue number.

Research direction

Start by reading the hashmap_delete, hashmap_iter, and hashmap_scan APIs and their related tests, if present. Establish whether deletion during iteration is supported and what behavior a filter operation should guarantee. Done means the safety question is answered and any proposed filter scope and expected iteration behavior are clearly defined.

Written by the indexing model from the issue text.

Assessment

Tech stack
c
Domain
backend
Issue type
Feature
Difficulty
4/5
Estimated time
3-5 days
Activity status
Stale
Clarity
Mostly clear
Newbie friendliness
35/100

Get new issues in your inbox

A short digest of beginner-friendly GitHub issues.