I could write a program that generates more creative comebacks than yours. But in any case, they don't hide your incompetence, and only expose your lack of maturity.
>>36
While I am somewhat frustrated by the apathetic guy's lack of motivation to improve their knowledge on closures, I am unaffected by any transaction of wit, and hold no desire for my words to leave any impact other than progression towards enlightenment.
>>37
You assume that efficiency is just a measure of the speed of the generated code, excluding the time and mental effort required to form (and no doubt eventually unwind) the thing in the first place.
It's your own fault if you register the advice in that way and respond to it by engaging in such an exchange. You are responsible for your own actions. I am simply making you aware that you have more to learn on closures, and that in investigating compilers, you will find your needed answers. If you want the exchange to be more productive, respond to it by educating yourself, as opposed to spouting an abused version of the anus meme.
>>42
I'll have you know I invented that meme. Perhaps if you would like your exchanges to unfold in a manner closer to your ideal, whatever that is, you could display an ounce more humility, or at lease make less assumptions, or stop arguing semantics in a desperate attempt to remain "right", or something, or anything.
Using nested definitions has the advantage of giving your function a name, which can aid documentation. Not to mention, the size of the expressions that use the functions is reduced, making them easier to read sometimes. But then in other situations it makes more sense to embed the lambda into the call of the higher order function. Which would result in faster code development depends on the circumstances of the use case, so it is useful to support both in a language. If that's what you meant in the original post, I wouldn't have responded. My bad.
OK, I'm sorry. I wasn't concerned about being right, I just thought you were someone who didn't yet have a clear understanding of the implementation of a closure, and I took the FUCK YOUR ANUS reply as a refusal to learn, which ticked me off. I'll keep the ambiguity of this text based interface in mind in the future.
Name:
Anonymous2013-02-02 17:46
plz stop saying i invented this meme it has never been funny and it never will be funny go back to reddit plz
Cardinality is defined in terms of bijective functions. Two sets have the same cardinality if and only if there is a bijection between them. In the case of finite sets, this agrees with the intuitive notion of size. In the case of infinite sets, the behavior is more complex. A fundamental theorem due to Georg Cantor shows that it is possible for infinite sets to have different cardinalities, and in particular the cardinality of the set of real numbers is greater than the cardinality of the set of natural numbers. It is also possible for a proper subset of an infinite set to have the same cardinality as the original set, something that cannot happen with proper subsets of finite sets.
Name:
Anonymous2013-08-31 23:30
(1 ≤ ν and κ ≤ μ) → (νκ ≤ ν[sup]μ) and
Name:
Anonymous2013-09-01 0:15
In physics, approximations of real numbers are used for continuous measurements and natural numbers are used for discrete measurements (i.e. counting).
Name:
Anonymous2013-09-01 1:00
There are many technical advantages to this restriction, and little generality is lost, because essentially all mathematical concepts can be modeled by pure sets. Sets in the von Neumann universe are organized into a cumulative hierarchy, based on how deeply their members, members of members, etc. are nested.
Name:
Anonymous2013-09-01 1:46
Outside set theory, the word "class" is sometimes used synonymously with "set". This usage dates from a historical period where classes and sets were not distinguished as they are in modern set-theoretic terminology.
Name:
Anonymous2013-09-01 2:31
First we might try to proceed as if X were finite. If we try to choose an element from each set, then, because X is infinite, our choice procedure will never come to an end, and consequently, we will never be able to produce a choice function for all of X. Next we might try specifying the least element from each set.
Name:
Anonymous2013-09-01 3:16
In the product topology, the closure of a product of subsets is equal to the product of the closures.