but a is 0, so 'add' is not in the set

but a is 0, so 'add' is not in the set

Yeah

you want to check if 'eve' is in the set

eve matches e

Checked

e is 1 in the filter, so from the filter, eve could be in the set

but it is not, it is a false positive

you add the word "yes" in the set

And what happened to 'y' and 's'

but it is not, it is a false positive

Ohhhhh

And what happened to 'y' and 's'

i made the filter as "filter on the vowels"

i made the filter as "filter on the vowels"

Yeah i forgot

so you have a filter a(0) e(1) i(0) o(0) u(0) for the set ["yes"]

So the second 'e' is false positive as you said

In eve

so you have a filter a(0) e(1) i(0) o(0) u(0) for the set ["yes"]

Yeah

if you add "add" to the set you have a(1) e(1) i(0) o(0) u(0) ["add","yes"]

you can have false positive on any word that contains only 'e's or 'a's

but as long as the thing contains 'i', 'o', or 'u' you can rule it is not in the set

but as long as the thing contains 'i', 'o', or 'u' you can rule it is not in the set

Cuz they are zeros

exactly, so the bloom filter doesn't match

this allows you to save on IO in dtabases

sacrificing memory to do so

sacrificing memory to do so

Yeah

a bloom filter of 4GB will take about 400G keys covered

a bloom filter of 4GB will take about 400G keys covered

Huh?!!

400 billion keys

wait

wait for the misscalculation

Alright

Hey everybody

Huh?!!

It is closer to 10 billion keys

my bad

400 GB of keys in my case

Why so much keys

Why it is not void operator(int a)

because its called operator() not operator

They are more than the dataset

We use keys to search for data Not the data to look for the keys lol

Why so much keys

you want to have more room in your filter than keys

4GB is relatively cheap

literally 20e

20€?

where the fuck do you buy your USB-sticks?

10€ for 64GiB USB-sticks in my country.

lol

10€ for 64GiB USB-sticks in my country.

^

USB3.0 speed.

china is good to its people

weneedcommunism

weneedcommunism

lol

where the fuck do you buy your USB-sticks?

RAM

if you want to avoid IO you don't put the stuff on disk lol

RAM

oh okay

I don't agree with 3

being good does not have anything to do with speed

You could do everything in half a day with wordpress

but it would suck balls

You could do everything in half a day with wordpress

Logic of some beautiful people: 1. You know nothing. 2. You are inexperienced. 3. Wanna be freelancer. 4. Making websites on WordPress with 1753 extensions, plugins, bootstrap, jQuery. 5. Telling that you're programmer.

xD

😂

Yeah i read rules 👍🏻

Hello everyone, I am a beginner in C/C++ and of course in Assembly.

Please review my answer, is this a correct answer? if (intvar & count) { count++; } else { count = 0; }

I tried to compile it with gcc -S, but the result always different. That made me doubt, I know the compiler might produce the different instruction too, so I am trying to ask here.

As far as I know, the "test" operation is like "and" bitwise operation. But, the "test" doesn't modify any register's value, it is only performs the "and" bitwise operation and sets some flags. If the result of "and" bitwise operation is 0, then ZF flag is set to 1, otherwise ZF flag is set to 0. If the ZF flag is 1, then the je jump will be taken. Please correct my knowledge if it is wrong. Thank you in advance.

I was looking for the problem in google, but still doubt with this one. So, please don't warn me.

Sorry for my bad English too ^^.

Please review my answer, is this a correct answer? if (intvar & count) { count++; } else { count = 0; }

if (intvar == count) <whatever is in ecx> = 0; else <whatever is in ecx> ++;

if (intvar == count) <whatever is in ecx> = 0; else <whatever is in ecx> ++;

Could you explain to me, why is the operator ==?

operator== compares two statements and return a boolean

Do you want to use cmp jz

operator& performs "and" on every but and returns a variable

which here is probably cast to bool

Do you want to use cmp jz

testl is cmp, prolly

i hate different asm syntaxes

can't everybody agree on NASM?

oh wait no, test indeed does perform "and" on every bit

okay