PhyrexTsai

How to play cloud mining via Hashnest

Create a BitCoin Wallet

• https://www.bitoex.com/
• Topup from "Family Mart"

Create Hashnest account

• https://www.hashnest.com/

PhyrexTsai

Zshell

Install zshell

install zshell

brew install zsh

install auto complete

PhyrexTsai

Git

3-way-merge

這邊需要透過在 merge 階段整合部分資訊

--

Fast forward

自己先把所有的改動用 rebase 方式把資料都堆疊上去

PhyrexTsai

Swagger

Swagger is the world's most popular framework for APIs.
[Swagger] (http://swagger.io/)

Intellij plugin install

Install plugin on Intellij.
Under Intellij Preferences->Plugin->Browse repositories...
Search keyword : Swagger Install it and restart Intellij.

PhyrexTsai

##Checkstyle

Introduce

It is a Intellij plugin, helps you to check your code, import, javadoc etc.
[Checkstyle Intellij plugin] (https://github.com/jshiell/checkstyle-idea)

• Community Edition (14.1.5)
• Community Edition (15.0.6)
• Community Edition (2016.1)

PhyrexTsai

Simple Recursive functions

Implement the well-known power function in two different new ways. The power function takes two arguments n and k and computes nk. Your implementation only has to work for non-negative integer k. The following is a straightforward implementation of this function:

  power :: Int -> Int -> Int
  power n k | k < 0 = error "power: negative argument"
  power n 0 = 1
  power n k = n * power n (k-1)

You will implement two more ways in this part.

PhyrexTsai

String editing distance

Motivation: compute the minimal number of changes needed to transform one string into another. Goal: find “cheapest” sequence of editing steps using operations

• Change a character
• Copy a character without change
• Delete a character
• Insert a character
• Kill rest of string (delete to end)

PhyrexTsai

Proposition normalization

The following datatype represents propositions, as in propositional logic. (e.g., P &Q, Not P, …)

data Proposition = Var String
		  	| F
		  	| T
		  	| Not Proposition
		  	| Proposition :|: Proposition --or

PhyrexTsai

BFS on Trees

Implement bread-first-search, bfs, on trees of type a

data Tree a = Empty | Node a (Tree a) (Tree a) 
							 deriving Show
bfs :: Tree a -> [a]
bfs x = traverse [x]
traverse :: [Tree a] -> [a]  
traverse [] = []

PhyrexTsai

Int expressions

Define the “evaluate (eval)” function for the following data types of Int expressions.

Type Name = String
data Expr =  Var Name | Lit Int  --constant
					  | Expr :+: Expr
		              | Expr :*: Expr
	                  deriving (Eq, Show)