How to fix a “invalid operands to binary expression” error?
Alternatively you can add the operator overload as non-member: Online Demo Member vs nonmember operator overloading
definition
What is an example of the Liskov Substitution Principle?
A great example illustrating LSP (given by Uncle Bob in a podcast I heard recently) was how sometimes something that sounds right in natural language doesn’t quite work in code. In mathematics, a Square is a Rectangle. Indeed it is a specialization of a rectangle. The “is a” makes you want to model this with inheritance. However if … Read more
What is boilerplate code?
A coworker had never heard of this, and I couldn’t provide a real definition. For me, it’s always been an instance of ‘I-know-it-when-I-see-it’. Bonus question, who originated the term?
What is a “thread” (really)?
A thread is an independent set of values for the processor registers (for a single core). Since this includes the Instruction Pointer (aka Program Counter), it controls what executes in what order. It also includes the Stack Pointer, which had better point to a unique area of memory for each thread or else they will … Read more
SOAP vs REST (differences)
Unfortunately, there are a lot of misinformation and misconceptions around REST. Not only your question and the answer by @cmd reflect those, but most of the questions and answers related to the subject on Stack Overflow. SOAP and REST can’t be compared directly, since the first is a protocol (or at least tries to be) … Read more
What is a loop invariant?
In simple words, a loop invariant is some predicate (condition) that holds for every iteration of the loop. For example, let’s look at a simple for loop that looks like this: In this example it is true (for every iteration) that i + j == 9. A weaker invariant that is also true is that i >= 0 && … Read more
What is a loop invariant?
In simple words, a loop invariant is some predicate (condition) that holds for every iteration of the loop. For example, let’s look at a simple for loop that looks like this: In this example it is true (for every iteration) that i + j == 9. A weaker invariant that is also true is that i >= 0 && … Read more
What is an idempotent operation?
In computing, an idempotent operation is one that has no additional effect if it is called more than once with the same input parameters. For example, removing an item from a set can be considered an idempotent operation on the set. In mathematics, an idempotent operation is one where f(f(x)) = f(x). For example, the … Read more