Fibers are an abstraction over sequential computation, similar to threads but at a higher level. There are two ways to think about this model: by example, and abstractly from first principles. We'll start with the example.
(credit here is very much due to Fabio Labella, who's incredible Scala World talk describes these ideas far better than I can)
Consider the following three functions
| # Install homebrew, if is not already installed: | |
| /usr/bin/ruby -e "$(curl -fsSL https://raw.githubusercontent.com/Homebrew/install/master/install)" | |
| # Update and upgrade homebrew, if needed: | |
| brew update && brew upgrade | |
| # Install XCode (it is a long download, it is an Octave dependency) | |
| # Go to Apple Store and install. | |
| # Install Aquaterm |
All these are already installed on epyc.
kafkacat (conda install -c conda-forge kafkacat)
kt (grab it from https://github.com/fgeller/kt/releases)
kafka-* (come with kafka, if you yum install if from Confluent's repo, or via Docker if you're so inclined). Warning -- JVM based and dreadfully slow.
jq (conda install -c conda-forge jq or use your favorite package manager)
Copyright © 2016-2018 Fantasyland Institute of Learning. All rights reserved.
A function is a mapping from one set, called a domain, to another set, called the codomain. A function associates every element in the domain with exactly one element in the codomain. In Scala, both domain and codomain are types.
val square : Int => Int = x => x * x
| import scala.collection.mutable.ListBuffer | |
| import org.scalacheck._, Arbitrary._, Prop._ | |
| // a specs2 example showing that it works | |
| def e1 = | |
| forAll(distinctListOf[Int]) { ls => | |
| ls.distinct === ls | |
| }.set(minTestsOk = 10000, maxSize = 1000) | |
| // distinct list of elements from a given arbitrary |
A primer/refresher on the category theory concepts that most commonly crop up in conversations about Scala or FP. (Because it's embarassing when I forget this stuff!)
I'll be assuming Scalaz imports in code samples, and some of the code may be pseudo-Scala.
A functor is something that supports map.
