Skip to main content

Posts

Showing posts with the label scala-3

Process text file concurrently

 Process the same input file concurrently Let's say we have a text file that contains 2 different types of lines.  For the sake of example, one group starts with "i:" (for Integer) and the other group starts with "s:" (for String), something like the following file: s:New york s:Apple i:387548 s:Amsterdam i:4556 i:39874 s:Orange i:56787 s:Banana i:4657567 s:Turkey i:45679456 s:Iran i:4356456 i:23423 i:456 s:Ukraine i:453645 i:5456 We want to process these input lines separately but concurrently. And the process can be anything, for this example, we just print them to the console. But what matters is that we open the file only for READ so 2 different processes (or routines) can read the file at the same time. The Cats Effect answer to open files (or in general any resources) in a safe and efficient way, is  Resource class. So we need a function to take the path to the file and give us a Resource of some type that allows us to read the file line by line. One o...

Process text file concurrently

 Process the same input file concurrently Let's say we have a text file that contains 2 different types of lines.  For the sake of example, one group starts with "i:" (for Integer) and the other group starts with "s:" (for String), something like the following file: s:New york s:Apple i:387548 s:Amsterdam i:4556 i:39874 s:Orange i:56787 s:Banana i:4657567 s:Turkey i:45679456 s:Iran i:4356456 i:23423 i:456 s:Ukraine i:453645 i:5456 We want to process these input lines separately but concurrently. And the process can be anything, for this example, we just print them to the console. But what matters is that we open the file only for READ so 2 different processes (or routines) can read the file at the same time. The Cats Effect answer to open files (or in general any resources) in a safe and efficient way, is  Resource class. So we need a function to take the path to the file and give us a Resource of some type that allows us to read the file line by line. One o...

Find a pair in an array for the given sum

Algorithm: Find a pair in an array of numbers for a given sum Given an Array (or List) and a sum, we want to find a pair of numbers whose sum will be equal to the given sum.  For example for the [1,4,7] and 5 the outcome should be pair of 1 and 4. Or for [5, 7, 2, 8, 3] and 15 the outcome should be pair of 7 and 8.  Both pairs of 1 and 5, and 2 and 4 are correct for the input of [2, 4, 1, 5] and 6. The function signature looks like this: def findPairForSum(list: List[Int], sum: Int): Option[(Int, Int)] = ??? The return type is  Option[(Int, Int)] because there might be no pair at all. There are two approaches to solving this problem: The brute force approach which is the simplest and most naive one The first sort approach which is more efficient and a bit more complex Naive approach We can check the given sum against all possible pair combinations. In imperative programming, it would be the famous i and j for loops. But in functional programming, we can implement this us...

HTTP Client function as IO of String

In this super short post, I am showing you how to write a very naive HTTP client ( GET ) to return the content of the response as a plain String . The whole point here is not to use a proper Scala library and wrap the side effect (an HTTP request is a side effect) in an IO object. object HttpService { def getRequest(uri: String): IO[String] = { try { IO { val url = new URL(uri) val con = url.openConnection.asInstanceOf[HttpURLConnection] con.setRequestMethod("GET") val streamReader = getTheStreamReader(con) val bufferedReader = new BufferedReader(streamReader) def loop(reader: BufferedReader, stringBuilder: StringBuilder): StringBuilder = { val line = reader.readLine() line match case null => stringBuilder case line => loop(reader, stringBuilder.append(line)) } loop(bufferedReader, new StringBuilder()).toString() } } catch { case t:...

Functional algorithm to find how many times a sub-string occurs in a string

Another String search problem that we like to solve in a functional way. This problem is very similar to the previous one,  Functional algorithm to find the position of a sub-string in a string , but it is a bit easier in the sense that we can always return an Int , so we do not have to return an Option of Int , because the number of the occurrences of a String in another String is always a non-negative number. So the signature of the function that we want to write looks like this: def countSubstring(str: String, subString: String): Int = ??? ⚠️ Be careful about overthinking the problems and always remain within the scope, in this case, it is very easy to overthink this problem by mixing up the terms sub-string and word . We only care about sub-strings and our algorithm does not know about words, meaning that our function should return the number 3 ( and not 2 )  if we pass it the following parameter: "This book is the best book among my books", "book" As we saw...

Functional algorithm to find the position of a sub-string in a string

Let's practice some functional problem-solving!  Consider the classic problem of finding the index of a sub-string in a larger string. So we want to write a function that if we pass it the following strings it returns 0 . "hello world", "hello" If we pass it the following strings it returns 6 "hello world", "world" If we pass it the following strings it returns None , because "apple" can not be found inside "hello world. "hello world", "apple" So our function signature should look like this: def findFirstSubString(str: String, subStr: String): Option[Int] = ??? If we want to implement it in an imperative way, and yes Scala allows imperative programming, we can implement the function as follows, but we don't want imperative programming, do we? def findFirstSubString_bad(str: String, subStr: String): Option[Int] = { var j = 0; var temp = "" for (i So let's find the functional algorith...

IO class exercises (part 2)

In this post, I try to show you some more examples of fundamental tasks on an IO object. We have seen 3 of these examples in the part one of IO class exercises . Exercise 4:  Writing a function that takes an IO object and converts it to another data type: def convert[A, B](ioa: IO[A], value: B): IO[B] = ??? Of course, we want to wrap the value in an IO but also we want to make sure the receiving IO of A has been completed. We can use the famous map method that a monad has. def convert[A, B](ioa: IO[A], value: B): IO[B] = ioa.map(_ => value) This map operation on IO is so popular that there is method for that on IO class, so we can write the second version of this function like: def convert[A, B](ioa: IO[A], value: B): IO[B] = ioa.as(value)

Functional way of finding the max element in an array

 Finding the maximum element of an array is a relatively easy problem. An imperative solution would be to choose the first element as the max and then go through the rest of the array and assign the current element to the max if the current element is larger than the current max. In the end, the max variable will contain the max value of the array.  But we are here to learn about Scala and functional programming  so mutating a variable is not what we want to do. Also, we do not want to go through the array using a loop because a loop counter is also variable, in functional programming we usually implement loops or in general iterations using recursion . So let's see how we would implement a function with the following signature for finding the max value of a given array (or List): def maxValue(elements: List[Int]): Int = ??? For implementing recursion we can define a nested function inside our maxValue function which takes 2 parameters, one int which is the current max va...

IO class excercises

 In the last post, we used the IO class (of cats-effects library ) to do side effects or simply effects in a pure function .  In this post, we will practice IO class a bit more. We write some functions that do some very useful and popular stuff on one or more IO objects. Exercise 1: Sequencing two IO objects and returning the second one. Meaning that we want to write a function that takes two IO objects of type A and B and returns an IO of type B, but only after making sure the IO of A is completed. The method signature should look like this: def sequenceTakeLast[A, B](ioa: IO[A], iob: IO[B]): IO[B] = ??? For writing this function we should remember that the IO class is a monad and it has all the methods that a monad has. Including the flatMap method. There are 2 sub-tasks: We want to return the IO of B We want to make sure the IO of A is completed first def sequenceTakeLast[A, B](ioa: IO[A], iob: IO[B]): IO[B] = { ioa.flatMap(_ => iob.map(b => b)) } As you mig...

Using IO class to perform side-effects in a pure functional way

  Cats-effects ' IO class is the answer of the library to performing side effects (or simply effects) in a functional way. Functional programming is focused on pure functions and a pure function is a function that does not perform any side effects but only produces an output based on the receiving inputs. Real-world programs are far from this mathematical abstract definition. A program with no side effects is doing nothing as most of the useful things are side effects, such as writing to a database, writing to a file, reading from a file, printing on the screen, and ... An IO class is actually a description of a computation, rather than the execution of that computation. That's why it will not make a function an impure function. Example: Printing on the screen (which is a side effect), as some sort of logging. If we want to print on the screen using inside the body of a function the side effect happens but if we return the effect as an IO object wrapping the calculation result...