tdg
He says there are IQ differences between people. Who are these "people" if not men and women? He either means men are smarter or he just randomly went on a tangent.
Let me ask you, when he says there are IQ differences between people, which groups of people do you think he means?
I don't know how else to read that other than "men are smarter". Is there any other reading?
"[...] the Left tends to deny science concerning biological differences between people (e.g., IQ and sex differences)"
I don't know how else to read that other than "men are smarter". Is there any other reading?
If you are very worried about such a scenario, verify that your vote is on the blockchain, then destroy your receipt.
https://www.mikeash.com/pyblog/friday-qa-2013-09-27-arm64-an...
They store it in isa field. Still, as long as you also call any virtual method of the object (or due to cache lines, use any field), it will still be pretty fast.
Regardless, your explanation is mostly correct. There will be an incref/decref pair for most accesses. However, LLVM (and Apple's refcount implementation) does 2 very important optimizations:
- LLVM can recognize (via static code analysis) redundant incref/decref pairs and take them out.
- I can't find the link for it right now, but Objective-C usually stores refcount inside the pointer (in other words, the memory address) itself. So as long as your refcount is small enough (which it will be 99% of the time), incref and decrefs don't thrash caches but work on the value already in register.
Server X and User Y are communicating. Some guy Z has X's private key. Z is also passively listening the communication.
- Y sends its public key to X. X sends its public key.
- Y generates a random number (A), encrypts with X's public key sends to X.
- Both X and Z decrypt the number. Now X, Y and Z all know the number A.
- X generates a random number (B), encrypts with Y's public key, sends to Y.
- Since Z does not have Y's private key, it can't decrypt it . At this point, X and Y know A and B, Z only knows A.
- X and Y use a predetermined algorithm using A and B as inputs to generate a new key. Further communications are encrypted/decrypted with this key.
- Z can't decrypt the communication.
The second important argument is that (again, right now), this emphasis on austerity is actively making things worse.
It is up to executorService to decide how many threads to use to execute those tasks. But they will be executed in threads. So you are unlikely to have more than a few hundred(maybe a few thousand?) of them around at any time.
[1] http://static.googleusercontent.com/external_content/untrust...
That being said, it will be interesting to see how this compares to all the stories about dangers of rewriting. I definitely want to see an update in a few months about the results.