jemfinch

106 ms·

991.
by jemfinch 17y ago
I'd really like to see the source of that overhead. I'm looking at the Zend source and only seeing 16-20 bytes of overhead per `zval`, depending on alignment.
992.
by jemfinch 17y ago
Alas, the Romans took it back.
993.
by jemfinch 17y ago
> If the list size is known, it's very easy to construct a hash table or hash set If the list size is known, you already know there's not a cycle.
994.
by jemfinch 17y ago
Not my experience in US airports. That restriction didn't exist at most airports (any airports that I boarded or arrived at) until after 9/11. Watch TV shows from the era (Friends, for example, or the Jet Li "Romeo and Juliet" movie) and y
995.
by jemfinch 17y ago
Because multiplying/dividing by 1.6 is too hard?
996.
by jemfinch 17y ago
No, you can't have a list containing different ordered types because the signature for comparison only permits two values of the same exact type, not any arbitrary member of class `Ord`. As I said before, Haskell passes [runtime dictionarie
997.
by jemfinch 17y ago
That Haskell code, as I understand it, will dynamically dispatch the call to max through the Ord typeclass dictionary passed at runtime. The C++ code will statically choose the appropriate function.
998.
by jemfinch 17y ago
Among other reasons, because when compiling to assembly you can invent your own, model-appropriate calling conventions.
999.
by jemfinch 17y ago
First, I think it's important to note that as the original claimant here, the onus is on you to prove your claim, not on me to disprove it. If you think OCaml's "easy genericness" is "more flexible than C++ templates" then provide an exa
1000.
by jemfinch 17y ago
Python refcounts and it has a real mark+sweep collector for collecting cycles. It's not a dichotomy, you know.
1001.
by jemfinch 17y ago
> Much more friendly and option 3 will give them greater revenue. Or perhaps not: if this were the option offered, no one would pay for standard EC2 instances at all, they'd just put up spot reservations and take the lower price when it
1002.
by jemfinch 17y ago
Since C++ templates are Turing-complete, and at least OCaml's type system is not, I'm fairly confident that the claim that OCaml's "easy genericness" is "more flexible than C++ templates" is demonstrably false.
1003.
by jemfinch 17y ago
Honestly, it reads like Markov chain-generated text.
1004.
by jemfinch 17y ago
In what way can it reasonably be said that the inventors of Go also invented regular expressions?