Now with support for async comparators with the new HeapAsync class! Includes JavaScript methods, Python's heapq module methods, and Java's PriorityQueue methods. Easy to use, known interfaces, tested ...

ForkJoinPool is a powerful Java class used for processing computationally intensive tasks. It works by breaking down tasks into smaller subtasks and then executing them in parallel. This thread pool ...

We propose a method called Node Replication (NR) to implement any concurrent data structure. The method takes a single-threaded implementation of a data structure and automatically transforms it into ...

I propose to add a new package, "container/queue", to the standard library to support an in-memory, unbounded, general purpose queue implementation. Queues in computer science is a very old, well ...

A priority queue assigns a priority to each element. Knowing how to build them is important in solving many coding problems. A priority queue is a data structure that holds information that has some ...

In this article I explain how the Linux kernel manages multicast traffic and how it is possible to interact with it by simply patching some kernel code. Although this is a rather specific topic, it ...