-
Binary search trees, or BTSs for short, are data structures designed to perform fast lookups on large datasets. The subject of this post is AVL trees, .
Read more -
If you're unfamiliar with using keyword - this is refinement - a relatively new feature in Ruby (since 2.0). It's kind of monkey-patch, but with strict.
Read more -
When I first heard about materialized views, my mind was kind of blown. “So, I can write a SQL query and the results can be stored as its own table (an.
Read more -
The Sequel ORM offers a powerful API for building SQL expressions in Ruby. In this article I'll explain how it works and show how it can improve the re.
Read more -
No one likes to manually produce documentation. It takes too much time. It’s hard to use the right forms. And it’s just plain boring.And yet, it’s crit.
Read more