What is eventual consistency and why would we bother with it? Let’s first start by taking a look at the CAP theorem.
What is a theorem? For that we could search in on-line (just for speed) dictionaries and come up with some of the acceptable definitions. Please note that the most words have different definitions depending on how they are applied. The word “theorem” falls into such category. I am going to use the set of definitions from Dictionary.com. The word is a noun. It has different meanings in mathematics, logic, as a rule or law, and as an idea, belief, method, or statement generally accepted as true without a proof. Continue reading “Eventual Consistency”
This post deals with an API for binary trees in Linux. The API consists of the following functions:
||Deletes an item from a tree.
||Deletes the entire tree.
||Finds an item and if not found returns NULL.
||Search a binary tree for an item.
||Performs a depth-first, left to right tree traversal.
In the past I have used and implemented, using different programming languages, several classes, methods and functions to deal with binary trees. Binary trees are used to keep data in sorted order. This allows for quicker search times. This particular implementation comes with the Linux operating system. You can read more about it by typing on a Linux console: man twalk Continue reading “Managing Binary Trees – Linux”