Originally Posted by

**PABLO DICKBAR OPEN TOASTHOLE 4 U**

You can just consider U and Upside down U as bitwise AND and bitwise OR, but you compare wheter it contains something or not.

Lets say E = {1,3,7,8} and F = {2, 3, 5}, you can transform them in bit train or w/e you call that in english, and you get

E = {0,1,0,1,0,0,0,1,1}

F = {0,0,1,1,0,1,0,0,0}

where the first bit is 0 because it doesn't contain the number 0, the second one is 1 because it contains 1, the third one is 0 because E doesn't contain 2, etc...

after that you do {0,1,0,1,0,0,0,1,1} AND {0,0,1,1,0,1,0,0,0},

which gives you

{0,0,0,1,0,0,0,0,0}

Therefore E AND F = {3}

NOw you can't do that for huuuuge arrays, but thats the logic behind these operators.