The Z shell (zsh) is a Unix shell [...]. Zsh can be thought of as an extended Bourne shell with a large number of improvements, including some features of bash, ksh, and tcsh.
Read more about ZSH at An Introduction to the Z Shell.
Choose one of the following options.
| 原帖地址: http://topic.csdn.net/u/20110113/19/b0d5d506-4307-428b-a61d-7974aa66a2da.html | |
| 首先要说明的是：这里介绍的方法都是大部分是本人“悟”出来的，所以网上难有流传！ | |
| 好方法不能自己私藏，否则就白忙乎这几天了，分享给有需要的朋友们。如果有转载，敬请注明来自*CSDN老邓*作品。 | |
| 呵呵，给自己打广告，实在是无耻之极，权当无聊之时打字之用。 | |
| 欢迎流传，为最优秀的分布式版本管理系统Git做宣传！！ | |
| 步骤： | |
| 1. 下载：http://loaden.googlecode.com/files/gitconfig.7z | |
| 2. 解压到：<MsysGit安装目录>/cmd/，例如：D:\Program Files\Git\cmd |
| ; :shrug: ¯\_(ツ)_/¯ | |
| :B0:`:shrug:: | |
| if (A_EndChar == ":") { | |
| SendInput, {BS 7}¯\_(ツ)_/¯ | |
| } | |
| return | |
| ; :whatever: ◔_◔ | |
| :B0:`:whatever:: |
| alias gh="open \`git remote -v | grep [email protected] | grep fetch | head -1 | cut -f2 | cut -d' ' -f1 | sed -e's/:/\//' -e 's/git@/http:\/\//'\`" |
This is an adaptation of https://twitter.com/jasonneylon script.
In the terminal window, you can open your current repo (at the current branch) in your default browser.
My adaptation was adding options to view the commits, branches, pull requests or issues for the repo using one of the additional options (added support for wiki, settings, pulse, graphs, network):
[h] => View help
[c] => View commits
[c {SHA}] => View specific commit from commit SHA
[b] => View branches
| object Solution { | |
| def main(args: Array[String]) { | |
| val sc = new java.util.Scanner (System.in); | |
| var n = sc.nextInt(); | |
| var arr = new Array[Int](n); | |
| for(arr_i <- 0 to n-1) { | |
| arr(arr_i) = sc.nextInt(); | |
| } | |
| object Solution { | |
| def main(args: Array[String]) { | |
| val sc = new java.util.Scanner(System.in); | |
| var n = sc.nextInt(); | |
| var a = Array.ofDim[Int](n, n); | |
| for (a_i <- 0 to n - 1) { | |
| for (a_j <- 0 to n - 1) { | |
| a(a_i)(a_j) = sc.nextInt(); | |
| } |
| object Solution { | |
| def main(args: Array[String]) { | |
| val sc = new java.util.Scanner(System.in); | |
| var n = sc.nextInt(); | |
| var arr = new Array[Int](n); | |
| for (arr_i <- 0 to n - 1) { | |
| arr(arr_i) = sc.nextInt(); | |
| } | |
| println(arr.map(_.toLong).sum) |
| /** | |
| * <b>Fixed Point Combinator is:</b> | |
| * Y = λf.(λx.f (x x)) (λx.f (x x)) | |
| * | |
| * <b>Proof of correctness:</b> | |
| * Y g = (λf . (λx . f (x x)) (λx . f (x x))) g (by definition of Y) | |
| * = (λx . g (x x)) (λx . g (x x)) (β-reduction of λf: applied main function to g) | |
| * = (λy . g (y y)) (λx . g (x x)) (α-conversion: renamed bound variable) | |
| * = g ((λx . g (x x)) (λx . g (x x))) (β-reduction of λy: applied left function to right function) | |
| * = g (Y g) (by second equality) [1] |
| val rnd = Math.random() | |
| val n = Math.abs(rnd) | |
| assert(n > 0) |