Do you have an application that is running too slow and you profiled it to find that a line like this snippet is causing it to be slow? Bottlenecks occur at unexpected places. The current snippet traverses the string 5 times, doing one thing each time. You are suggesting traversing it once, probably doing doing … Read more
If the point Niklas’ makes in his answer doesn’t hold, I would use a string argument. There are Python modules in the standard library that use similar arguments. For example csv.reader(). sim_func(a, b, c, sim_type=”solar”) Remember to give a reasonable error inside the function, that helps people out if they type in the wrong thing. … Read more
As mentioned in people’s comments, Go encourages composition over inheritance. To address your question about reducing code duplication, you would want to use embedding. Using the example from Effective Go linked above, you start with very narrow interfaces that only do a few things: type Reader interface { Read(p []byte) (n int, err error) } … Read more
This create a macro named EPOLLIN whose replacement text is also EPOLLIN. This is most likely a way for the preprocessor to check which event codes are available and conditionally compile code as necessary. If we go to the git repo for glibc and look at the output of git blame we see the following … Read more
Javascript now supports a null-coalescing operator: ??. It may not be production-ready (consult the support table), but it’s certainly safe to use with Node or a transpiler (TypeScript, Babel, etc.). Per MDN, The nullish coalescing operator (??) is a logical operator that returns its right-hand side operand when its left-hand side operand is null or … Read more
In the special case where your values never contain spaces, this read trick can be a simple solution: get_vars () { #… echo “value1” “value2” } read var1 var2 < <(get_vars) echo “var1=’$var1′, var2=’$var2′” But of course, it breaks as soon as there is a space in one of the values. You could modify IFS … Read more
This will exit after the first element that is out of order. It should thus perform well, but I haven’t tested that. It’s also a lot more elegant in my opinion. 🙂 def sorted(l:List[Int]) = l.view.zip(l.tail).forall(x => x._1 <= x._2)
I pondered about these same questions and I hope this will be helpful to you. 1. I don’t believe that appending Interface at the end of every interface is idiomatic. It is much better to have a descriptive name instead. Consider the example provided in the GraphQL Specification relating to Interfaces. They don’t append Interface … Read more
I’ll expand out my comment to an answer. In the case that all cases return, these are indeed equivalent. What becomes important in choosing between them is then what is more readable. Your latter example uses the elif structure to explicitly state that the cases are mutually exclusive, rather than relying on the fact they … Read more
Keep in mind that what looks poor asymptotics might actually not be, because you are working in a lazy language. In a strict language, appending to the end of a linked list in this way would always be O(n). In a lazy language, it’s O(n) only if you actually traverse to the end of the … Read more