An alternative way that overwrites a function when executed so it will be executed only once. function useThisFunctionOnce(){ // overwrite this function, so it will be executed only once useThisFunctionOnce = Function(“”); // real code below alert(“Hi!”); } // displays “Hi!” useThisFunctionOnce(); // does nothing useThisFunctionOnce(); ‘Useful’ example: var preferences = {}; function read_preferences(){ // … Read more
A branch instruction is not inherently slower than any other instruction. However, the reason you heard that branches should avoided is because modern CPUs follow a pipeline architecture. This means that there are multiple sequential instructions being executed simultaneously. But the pipeline can only be fully utilised if it’s able to read the next instruction … Read more
which XSLT engine are you using? If you are using the .NET engine and Visual Studio you could use the XSLT profiler integrated into Visual Studio which is a very useful. Other excellent profiling tools are Altova’s XML Spy and Oxygen. If you would post your XSLT it would be easier to tell you where … Read more
I think the comparison with true shows a lack of understanding by your partner. Bools should be named things to avoid this (such as isAvailable: if (isAvailable) {…}).
Actually this depends on the shader language one uses. In HLSL and Cg a ternary operator will never lead to branching. Instead both possible results are always evaluated and the not used one is being discarded. To quote the HLSL documentation: Unlike short-circuit evaluation of &&, ||, and ?: in C, HLSL expressions never short-circuit … Read more
I think you’ve answered your own question pretty clearly. For production, we do – as well as most companies I’ve worked with option 3. Here are advantages of solution 3, and why I think you should use it: It utilizes the most caching, all common functionality is loaded once. Taking the least traffic and generating … Read more
The simple way is don’t test Object vs Object collisions, populate an array with the center point of each ball. Then, from each center scan a a square of size 4*radius centered on that point (you can optimize this a bit by not using a square, at the expense of making the code more complex). … Read more
One important thing most people forget when talking about Big-O, thus I feel the need to mention that: You cannot use Big-O to compare the speed of two algorithms. Big-O only says how much slower an algorithm will get (approximately) if you double the number of items processed, or how much faster it will get … Read more
As of Rust 1.28, you can use std::num::NonZeroU8 (and friends). This acts as a wrapper that tells the compiler the contents of a number will never contain a literal zero. It’s also why Option<Box<T>> is pointer-sized. Here’s an example showing how to create an Age and read its payload. use std::num::NonZeroU8; struct Age(NonZeroU8); impl Age … Read more
Cache coherence. When you scan horizontally, your data will be closer together in memory, so you will have less cache misses and thus performance will be faster. For a small enough rectangle, this won’t matter.