Leave these fields empty (spam trap):
You can leave this blank to post anonymously, or you can create a Tripcode by using the format Name#Password
[i]Italic Text[/i]
[b]Bold Text[/b]
[spoiler]Spoiler Text[/spoiler]
>Highlight/Quote Text
[pre]Preformatted & Monospace Text[/pre]
[super]Superset Text[/super]
[sub]Subset Text[/sub]
1. Numbered lists become ordered lists
* Bulleted lists become unordered lists



- Mon, 09 Apr 2018 09:00:46 EST 9B4LusOJ No.37498
File: 1523278846948.jpg -(24430B / 23.86KB, 576x768) Thumbnail displayed, click image for full size. C++
I'm looking for something a bit like std::map, except that I don't care about a <key, value> pair; I just want to be able to say to the thing, "here, keep this integer". And "hey, have you got that integer, yes or no?"

Something tells me a hashmap isn't the right tool for the job, but I can't seem to figure out what is. Any ideas?
Albert Hingerdat - Mon, 09 Apr 2018 09:33:39 EST 8hwK1pxu No.37499 Reply
You probably want std::hash

It's like std::map, except it only takes a key and instead of having to implement less than, you have to implement a hash function for the type you are using if it doesn't have one
Shitting Gumbleman - Sun, 06 May 2018 03:33:29 EST Xm/W+3lL No.37527 Reply
If all you care about is "could this item potentially be in this set?", then you might want to look into using a Bloom filter datastructure (not the kind used in graphics, but the other kind used in general computer science).

Report Post
Please be descriptive with report notes,
this helps staff resolve issues quicker.