To get elements which are in temp1 but not in temp2 : In [5]: list(set(temp1) – set(temp2)) Out[5]: [‘Four’, ‘Three’] Beware that it is asymmetric : In [5]: set([1, 2]) – set([2, 3]) Out[5]: set([1]) where you might expect/want it to equal set([1, 3]). If you do want set([1, 3]) as your answer, you can use set([1, … Read more
7 in a Clearest and fastest way to do it. You can also consider using a set, but constructing that set from your list may take more time than faster membership testing will save. The only way to be certain is to benchmark well. (this also depends on what operations you require)
With a clustered index the rows are stored physically on the disk in the same order as the index. Therefore, there can be only one clustered index. With a non clustered index there is a second list that has pointers to the physical rows. You can have many non clustered indices, although each new index … Read more
The three most influential factors for Eclipse speed are: Using the latest version of Eclipse (2020-06 as on 26 June 2020) Note that David Balažic’s comment (July 2014) contradicts that criteria which was working six years ago: The “same” workspace in Indigo (3.7.2) SR2 loads in 4 seconds, in Kepler SR2 (4.3.2) in 7 seconds … Read more
\d checks all Unicode digits, while [0-9] is limited to these 10 characters. For example, Persian digits, ۱۲۳۴۵۶۷۸۹, are an example of Unicode digits which are matched with \d, but not [0-9]. You can generate a list of all such characters using the following code: var sb = new StringBuilder(); for(UInt16 i = 0; i … Read more
To answer your first question… .format just seems more sophisticated in many ways. An annoying thing about % is also how it can either take a variable or a tuple. You’d think the following would always work: “Hello %s” % name yet, if name happens to be (1, 2, 3), it will throw a TypeError. … Read more
Python includes a profiler called cProfile. It not only gives the total running time, but also times each function separately, and tells you how many times each function was called, making it easy to determine where you should make optimizations. You can call it from within your code, or from the interpreter, like this: import … Read more
Welcome to the world of denormalized floating-point! They can wreak havoc on performance!!! Denormal (or subnormal) numbers are kind of a hack to get some extra values very close to zero out of the floating point representation. Operations on denormalized floating-point can be tens to hundreds of times slower than on normalized floating-point. This is … Read more
No, it will not be faster on most architectures. You didn’t specify, but on x86, all of the integral comparisons will be typically implemented in two machine instructions: A test or cmp instruction, which sets EFLAGS And a Jcc (jump) instruction, depending on the comparison type (and code layout): jne – Jump if not equal … Read more