The Boost C++ libraries include an implementation of Fibonacci heaps in boost/pending/fibonacci_heap.hpp. This file has apparently been in pending/ for years and by my projections will never be accepted. Also, there have been bugs in that implementation, which were fixed by my acquaintance and all-around cool guy Aaron Windsor. Unfortunately, most of the versions of … Read more
Imp. TIP : Whenever you have heavyweight initialization that should be done once for many RDD elements rather than once per RDD element, and if this initialization, such as creation of objects from a third-party library, cannot be serialized (so that Spark can transmit it across the cluster to the worker nodes), use mapPartitions() instead … Read more
There’s a great deal of research on this. Here’s a quick summary. Response Times: The 3 Important Limits by Jakob Nielsen on January 1, 1993 Summary: There are 3 main time limits (which are determined by human perceptual abilities) to keep in mind when optimizing web and application performance. Excerpt from Chapter 5 in my … Read more
The most fundamental thing here probably is that you don’t want to transmit static images but only changes to the images, which essentially is analogous to video stream. My best guess is some very efficient (and heavily specialized and optimized) motion compensation algorithm, because most of the actual change in generic desktop usage is linear … Read more
This is taken from the scala mailing list and gives implementation details of lazy in terms of Java code (rather than bytecode): class LazyTest { lazy val msg = “Lazy” } is compiled to something equivalent to the following Java code: class LazyTest { public int bitmap$0; private String msg; public String msg() { if … Read more
Order of magnitude: zero. In other words, you won’t see your throughput cut in half, or anything like it, when you add TLS. Answers to the “duplicate” question focus heavily on application performance, and how that compares to SSL overhead. This question specifically excludes application processing, and seeks to compare non-SSL to SSL only. While … Read more
Dmitriy is right that you’ll want the Sieve of Atkin to generate the prime list but I don’t believe that takes care of the whole issue. Now that you have a list of primes you’ll need to see how many of those primes act as a divisor (and how often). Here’s some python for the … Read more
Patience, technical skill and endurance. First point is that a DX Demo is primarily a teaching aid so it’s done for clarity not speed of execution. It’s a pretty big subject to condense but games development is primarily about understanding your data and your execution paths to an almost pathological degree. Your code is designed … Read more
Depends on what you need, in general I think that: You should not care too much about performances. Redis is faster per core with small values, but memcached is able to use multiple cores with a single executable and TCP port without help from the client. Also memcached is faster with big values in the … Read more