From here, a static call is 4 to 5 times faster than constructing an instance every time you call an instance method. However, we’re still only talking about tens of nanoseconds per call, so you’re unlikely to notice any benefit unless you have really tight loops calling a method millions of times, and you could … Read more
Assuming that you can not optimize the LIKE operation itself, you should try to optimize the base query without them minimizing number of rows that should be checked. Some things that might be useful for that: rows column in EXPLAIN SELECT … result. Then, mysql> set profiling=1; mysql> select sql_no_cache * from mytable; … mysql> … Read more
I investigated accelerate and accelerate-cuda and put some debug code to measure a time both under ghci and in a compiled, optimised version. Results are below, you can see stack trace and execution times. ghci run $ ghc -O2 -dynamic -c -threaded Main.hs && ghci GHCi, version 7.8.3: http://www.haskell.org/ghc/ 😕 for help … Loading package … Read more
Here is the answer from the forum post: Hi. Sorry for the delayed response, but I want to say that these are great questions and will probably be useful to others. There shouldn’t be a need for more than one DataCacheFactory per thread unless you are requiring different configurations. For example, if you programmatically configure … Read more
I’ve got interesting performance testing results and I’ve found a culprit. I have not seen any information like this in any EF source I’ve ever read. It turns out to be Equals overridden in a base class. The base class supposed to contain Id property shared between all types of concrete entities. This approach recommended … Read more
First of all, I’d like to note that a package is available to make a StatelessWidget from a function: functional_widget The gain is performance is not necessarily true. It depends on how you use your widgets, mostly how you use them to manage your state. By default, classes may degrade performances when opposed to functions … Read more
The query planner has to do a linear search of the constraint information for every partition of tables used in the query, to figure out which are actually involved–the ones that can have rows needed for the data requested. The number of query plans the planner considers grows exponentially as you join more tables. So … Read more
I tried to setup a microbenchmark using the excellent Scala-Benchmark-Template. It is very difficult to write a meaningful (non optimized away by the JIT) benchmark which tests just the implicit conversions, so I had to add a bit of overhead. Here is the code: class FunkyBench extends SimpleScalaBenchmark { val N = 10000 def timeDirect( … Read more
Note that foldl’ forces the accumulator to weak head normal form. Since the accumulator is a tuple it does not force the evaluation of the two elements of the tuple. If you explicitly force the two elements you get a constant-space function: f (a, b) c = a `seq` b `seq` (if c < a … Read more