Book Image

Learning Concurrency in Kotlin

By : Miguel Angel Castiblanco Torres
Book Image

Learning Concurrency in Kotlin

By: Miguel Angel Castiblanco Torres

Overview of this book

Kotlin is a modern and statically typed programming language with support for concurrency. Complete with detailed explanations of essential concepts, practical examples and self-assessment questions, Learning Concurrency in Kotlin addresses the unique challenges in design and implementation of concurrent code. This practical guide will help you to build distributed and scalable applications using Kotlin. Beginning with an introduction to Kotlin's coroutines, you’ll learn how to write concurrent code and understand the fundamental concepts needed to write multithreaded software in Kotlin. You'll explore how to communicate between and synchronize your threads and coroutines to write collaborative asynchronous applications. You'll also learn how to handle errors and exceptions, as well as how to work with a multicore processor to run several programs in parallel. In addition to this, you’ll delve into how coroutines work with each other. Finally, you’ll be able to build an Android application such as an RSS reader by putting your knowledge into practice. By the end of this book, you’ll have learned techniques and skills to write optimized code and multithread applications.
Table of Contents (11 chapters)

Summary

This chapter covered a lot of topics; they were an interesting display of how suspending computations can be used in a more creative way. Furthermore, we were able to see how this can impact application development by allowing us to write simpler code that is still concurrent. Let's summarize this chapter's lessons:

  • We talked about a different type of suspending function that are suspended when they are not needed.
  • Some characteristics of a sequence are: it's stateless, so it resets itself after each invocation; it allows us to retrieve information by index; and it allows us to take a group of values at once.
  • Some characteristics of an iterator are: it has a state; it can only be read in one direction, so previous elements cannot be retrieved; and it doesn't allow us to retrieve elements by index.
  • Both sequences and iterators can suspend after yielding...