Sylvain TisetBloom Filters 101: The Power of Probabilistic Data StructuresSimply, Bloom filters are a probabilistic data structure that checks for presence of an element in a set.5d ago5d ago
Sylvain TisetThe secret of smart pointers in C++The variable that stores the address of another variable is what in C++ is called a pointer. Pointers are a very powerful feature of C++…Sep 25Sep 25
Sylvain TisetTop 10 Microservices Design Patterns you should knowEarlier I presented one useful design pattern to migrate to a monolithic application to microservices. This pattern is the Strangler Fig…Sep 185Sep 185
Sylvain TisetMove to move constructor (C++)C++11 introduced some new features, including move constructors. Let’s review how it works, the differences with the copy constructor, and…Sep 11Sep 11
Sylvain TisetDemystifying Garbage Collection AlgorithmsA lot of programming languages are using a Garbage Collector (GC) to manage memory. In this article, we’ll see what is a GC, and the GC…Sep 4Sep 4
Sylvain TisetChar vs Varchar vs NVarchar vs TextIn SQL, to handle string storage, you can choose between char, nchar, varchar and nvarchar. What are the main differences between these…Aug 21Aug 21
Sylvain TisetUnlock SQL LocksIn SQL, a lock is a mechanism used by the database management system (DBMS) to control concurrent access to data. The primary purpose of…Aug 7Aug 7
Sylvain TisetRefactoring techniques — From legacy to clean codeIn this article, we go from how to refactor, to refactor legacy code, through common refactoring techniques.Jul 30Jul 30
Sylvain TisetHow to solve the Gilded Rose Kata with duplication?The Gilded Rose Kata from Emily Bache is one of the famous refactoring Kata. Let’s see how we can solve it in C# by adding more…Jul 10Jul 10