| package io.nary.automata | |
| // Models a transition, tied to a specific StateMachine sub-type. The guard condition is not required. | |
| class Transition[S, M <: StateMachine[S, M]](start: S, end :S, guard: Option[M => Boolean]) { | |
| val startState = start | |
| val endState = end | |
| // Given a state machine and whether a guard is expected, should we follow this transition? | |
| def willFollow(stateMachine: M, withGuard : Boolean) = | |
| if (!withGuard && guard == None) true; |
| trait QId; trait QSection; trait QProjectType; trait QName | |
| trait QFriendlyName; trait QDescription; trait QCode; trait QAnswers | |
| case class Answer(text: String) | |
| object QuestionTypes { | |
| type FormQuestionId = Long @@ QId | |
| type Section = String @@ QSection | |
| type ProjectType = String @@ QProjectType | |
| type Name = String @@ QName |
| object BinaryAddition { | |
| def binaryAddition(a: Array[Int], b: Array[Int]): Array[Int] = | |
| ((Array.empty[Int] -> 0) /: (a zip b)) { case ((c, carry), (ai, bi)) => | |
| (((ai + bi + carry) % 2) +: c) -> (ai + bi + carry) / 2 | |
| }._1 | |
| } |
| object BinaryAddition { | |
| def binaryAddition(a: Array[Int], b: Array[Int]): Array[Int] = | |
| ((Array.empty[Int] -> 0) /: (a zip b)) { case ((c, carry), (ai, bi)) => | |
| ((sum:Int) => ((sum % 2) +: c) -> (sum / 2))(ai + bi + carry) | |
| }._1 | |
| } |
Copyright © 2017 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
I hereby claim:
To claim this, I am signing this object:
| # remap prefix from 'C-b' to 'C-a' | |
| unbind C-b | |
| set-option -g prefix C-a | |
| bind-key C-a send-prefix | |
| # split panes using | and - | |
| bind | split-window -h | |
| bind - split-window -v | |
| unbind '"' | |
| unbind % |