| case class Config(name: String="none") | |
| def methodNeedingAConfig(implicit config: Config = Config()) = config.name | |
| // by default there is no config | |
| methodNeedingAConfig === "none" | |
| // just add one in the current scope | |
| implicit val myConfig = Config("some") |
| # First verify the version of Java being used is not SunJSK. | |
| java -version | |
| # Get the latest Sun Java SDK from Oracle http://www.oracle.com/technetwork/java/javase/downloads/jdk-7u1-download-513651.html | |
| wget http://download.oracle.com/otn-pub/java/jdk/7u1-b08/jdk-7u1-linux-i586.rpm | |
| # Rename the file downloaded, just to be nice | |
| mv jdk-7u1-linux-i586.rpm\?e\=1320265424\&h\=916f87354faed15fe652d9f76d64c844 jdk-7u1-linux-i586.rpm | |
| # Install Java |
Demo: http://jsfiddle.net/clayzermk1/QD8Hs/
I needed a simple plugin to build a two-tier collapsible list with checkboxes. I wanted it to fit well with Twitter's Bootstrap. I couldn't find one that was simple enough. I hope you enjoy =) Feel free to send feedback.
| object RichF { | |
| implicit class RichF1[A, Z](val f: A => Z) extends AnyVal { | |
| def map[Y](g: Z => Y): A => Y = | |
| (a: A) => g(f(a)) | |
| def flatMap[Y](g: Z => A => Y): A => Y = | |
| (a: A) => g(f(a))(a) | |
| } | |
| implicit class RichF2[A, B, Z](val f: (A, B) => Z) extends AnyVal { | |
| def map[Y](g: Z => Y): (A, B) => Y = |
| import scalaz.stream.{Process1, Process, io, process1} | |
| import Process._ | |
| import java.security._ | |
| import scalaz._ | |
| import scala.collection.mutable | |
| import java.math.BigInteger | |
| val P = Process |
Prerequisites: OS X with the latest Xcode and command line tools installed (or just the command line tools)
(If you haven't got a machine with OS X, please pair up with a participant who has got a Mac at the workshop.)
Install the Haskell Platform (2013.2.0.0, 64 bit): http://www.haskell.org/platform/mac.html (Note the special installation instructions for using the Haskell Platform with Xcode 5.)
Now, that you have got a Haskell system, install language-c-inline, the library implementing inline C code for Haskell.
| import java.util.concurrent.atomic._ | |
| import collection.mutable.ArrayBuffer | |
| /** | |
| * Buffer type with purely functional API, using mutable | |
| * `ArrayBuffer` and cheap copy-on-write scheme. | |
| * Idea described by Bryan O'Sullivan in http://www.serpentine.com/blog/2014/05/31/attoparsec/ | |
| */ | |
| class Buffer[A](id: AtomicLong, stamp: Long, values: ArrayBuffer[A], size: Int) { | |
Every application ever written can be viewed as some sort of transformation on data. Data can come from different sources, such as a network or a file or user input or the Large Hadron Collider. It can come from many sources all at once to be merged and aggregated in interesting ways, and it can be produced into many different output sinks, such as a network or files or graphical user interfaces. You might produce your output all at once, as a big data dump at the end of the world (right before your program shuts down), or you might produce it more incrementally. Every application fits into this model.
The scalaz-stream project is an attempt to make it easy to construct, test and scale programs that fit within this model (which is to say, everything). It does this by providing an abstraction around a "stream" of data, which is really just this notion of some number of data being sequentially pulled out of some unspecified data source. On top of this abstraction, sca
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.
