There's another way to think about it which I actually use. Look in the empty bin and say "zero", then move an apple and say "one".
That would be wrong in every technical sense. You're saying that .first()
would skip the 0th item.
First = leftmost.
What were the limitations they overcame with BitNet, and what are some unresolved issues mentioned in the reprint?
@spikespaz
@programming.dev