#Haskell基础
- 语法、语义
- 常用函数实现
- 函数参考
- 语法拾遗
- Codeforces
- 99 Problem
- Euler
- Queue
#Haskell基础
| /* | |
| * robotMaze.js | |
| * | |
| * The blue key is inside a labyrinth, and extracting | |
| * it will not be easy. | |
| * | |
| * It's a good thing that you're a AI expert, or | |
| * we would have to leave empty-handed. | |
| */ |
| /*************** | |
| * pointers.js * | |
| *************** | |
| * | |
| * You! How are you still alive? | |
| * | |
| * Well, no matter. Good luck getting through this | |
| * maze of rooms - you'll never see me or the Algorithm again! | |
| */ |
| /********************** | |
| * superDrEvalBros.js * | |
| ********************** | |
| * | |
| * You're still here?! Well, Dr. Eval, let's see | |
| * how well you can operate with one less dimension. | |
| * | |
| * Give up now. Unless you have a magic mushroom | |
| * up your sleeve, it's all over. | |
| */ |
| /***************** | |
| * bossFight.js * | |
| ***************** | |
| * | |
| * NO FARTHER, DR. EVAL!!!! | |
| * YOU WILL NOT GET OUT OF HERE ALIVE!!!! | |
| * IT'S TIME YOU SEE MY TRUE FORM!!!! | |
| * FACE MY ROBOT WRATH!!!!! | |
| */ |
| function spdiagm{T<:Integer}(B, d::Array{T, 1}, m::Integer, n::Integer) | |
| ndiags = length(d) | |
| ncoeffs = 0 | |
| for vec in B | |
| ncoeffs += length(vec) | |
| end | |
| I = Array(T, ncoeffs) | |
| J = Array(T, ncoeffs) | |
| V = Array(Float64, ncoeffs) | |
| id = 0 |
##Javascript
###预习
关于 JS 环境的配置请参考 https://plus.google.com/117239089659078825668/posts/jDkwn5mWdWJ
需要一个可以执行JS的环境(REPL)才能继续下面的学习。
###Hello, world
As compiled by Kevin Wright a.k.a @thecoda
(executive producer of the movie, and I didn't even know it... clever huh?)
please, please, please - If you know of any slides/code/whatever not on here, then ping me on twitter or comment this Gist!
This gist will be updated as and when I find new information. So it's probably best not to fork it, or you'll miss the updates!
Monday June 16th