Asynchronous loop breaking

This post has been created more than 3 months ago. It might contain inaccurate or stale (or both!) information. Use with caution!

Suppose you want to iterate over an array. On each element, you want to call a function that takes some callback, and if the callback executes some test successfully, then don’t execute the remaining iterations.

Read More

Briefly, what's SageMaker?

This post has been created more than 3 months ago. It might contain inaccurate or stale (or both!) information. Use with caution!

Today I decided to start a new series of short posts that give a high-level basic understanding of some piece of technology. The first post is about AWS SageMaker!

Read More

I implemented a Red-Black tree (part 1)

This post has been created more than 3 months ago. It might contain inaccurate or stale (or both!) information. Use with caution!

A Red-Black tree is a binary search tree (BST) that takes some action to try and keep itself balanced. We know that BSTs are great at storing nodes identified by some key for which an order relationship exists (e.g., integers). They have the property that the values in the left sub-tree of each node n have keys smaller-than n‘s key n.k, and those in the right sub-tree have keys greater-than n.k1.

Read More

Designing Data-Intensive Applications, by Martin Kleppmann (5/10)

This post has been created more than 3 months ago. It might contain inaccurate or stale (or both!) information. Use with caution!

This book is a survey of the staggering amount of pieces of technology that can be used to build data-intensive applications, defined (in my rough interpretation) as user-facing systems that treat significant amounts of data and are expected to do it quickly. Contains reflections on trade-offs to take into account when choosing one solution over the other.

Read More