In my previous blog post I’ve presented the implementations of three string search algorithms: Knuth-Morris-Pratt, Shifting Bit Mask (known in the industry as Bitap / Shift-or / Shift-and / Baeza-Yates–Gonnet) and Aho-Corasic. Before running any benchmarks, I was expecting Aho-Corasic to be the fastest one, but I was wrong: it…

Software engineering can be full of surprises, especially when it comes to performance. For example, what happens if we try to run this innocent looking Java code? // String.repeat requires JDK 11 or above: final var needle = "A".repeat(500000) + "B"; final var haystack = "A".repeat(1000000) + "B"; System.out.println(haystack.indexOf(needle)); We…

A new release of Scala programming language, 2.13, has been announced recently. It is time to look at what improvements it has brought to us. In this post I will focus on the changes in the standard library, so this can be considered a follow up to my previous post…

In my previous blog post, we delved under the hood of Scala for-comprehension. This time, we’ll take a similar approach and will become familiar with another great feature of this powerful programming language — pattern matching. …

Us, humanity, have for centuries believed that we are the smartest thing on Earth. No other creature or mechanism could even approach our intellectual abilities. Recently, however, things started to change: first, there was a defeat in 1997 of world chess champion Garry Kasparov by Deep Blue chess program board…