【独家发布】CoffeeScript in Action

是 否 +2 论坛币

k人 参与回答

经管之家送您一份

应届毕业生专属福利!

求职就业群

赵安豆老师微信：zhaoandou666

经管之家联合CDA

送您一个全额奖学金名额~ !

立即领取

感谢您参与论坛问题回答

经管之家送您两个论坛币！

+2 论坛币

CoffeeScript in Action

1. Author: Patrick Lee
   
2. 
   
3. ISBN-10 书号: 1617290629
   
4. 
   
5. ISBN-13 书号: 9781617290626
   
6. 
   
7. Edition: 1
   
8. 
   
9. Release 出版日期: May 22, 2014
   
10. 
    
11. pages 页数: (432)
    
12. 
    
13. 
    
14. 44.99
复制代码

下载地址：



本帖隐藏的内容

http://pan.baidu.com/s/1bpFOkTx 密码: jmac

扫码加我 拉你入群

请注明：姓名-公司-职位

以便审核进群资格，未注明则拒绝

https://en.wikipedia.org/wiki/CoffeeScript

1. Interval test[edit]
   
2. To compute the body mass index, one may do (here in JavaScript):
   
3. 
   
4. var mass = 72
   
5. var height = 1.78
   
6. var BMI = mass / (height * height)
   
7. if (18.5 < BMI && BMI < 25) alert('You are healthy!')
   
8. With CoffeeScript the interval is directly described:
   
9. 
   
10. mass = 72
    
11. height = 1.78
    
12. BMI = mass / height**2
    
13. alert 'You are healthy!' if 18.5 < BMI < 25

复制代码

1. Loops and comprehensions[edit]
   
2. To compute the greatest common divisor of two integers with the euclidean algorithm, in JavaScript one usually needs a while loop:
   
3. 
   
4. function gcd(x, y) {
   
5.   var z
   
6.   do {
   
7.     z = x % y
   
8.     x = y
   
9.     y = z
   
10.   } while (y != 0)
    
11.   return x
    
12. }
    
13. Whereas in CoffeeScript one can use until and pattern-matching instead:
    
14. 
    
15. gcd = (x, y) ->
    
16.   [x, y] = [y, x%y] until y is 0

复制代码