Explore what immutable data structures are and how they can be used for fast concurrent programming
In this series of blog posts I would like to explore the world of immutable persistent data structures, their pros and cons compared to mutable data structures, cover in which scenarios we would want to use them and provide some theoretical background.
First of all, let’s define what immutable data structure is. According to wikipedia:
In computing, a persistent data structure is a data structure that always preserves the previous version of itself when it is modified. Such data structures are effectively immutable, as their operations do not (visibly) update the structure in-place, but instead always yield a new updated structure.
We can immediately see several benefits compared to mutable counterparts:
Golang Web Development is the new trend globally. Get all the details about the Golang development here. Hire Golang Developers.
Learning to code is a path full of struggles, and learning Ruby isn't the exception. But you'll agree with me, that practice is the best way to learn and develop your skills.
A deep dive into benchmarking in Golang. Go lets us developers benchmark using the testing package. In this article, I want to dive deeper into benchmarks in Golang, but I’ll start from scratch.
Golang array is a fixed-size collection of items of the same type. The items of an array are stored sequentially and can be accessed using their index.
Our journey begins by installing GoLang. We create a development environment with the GoLang IDE, along with some associated tools and packages. Next, we list 19 “free” resources and 5 “not-free” books for learning the GoLang language. Finally, we benchmark the Python sklearn kmeans to GoLang kmeans implementation. Together, we will determine if the GoLang kmeans implementation works and if it is faster than the Python sklearn kmeans.