Downloaded 10 times
![You should see:
Erlang R16B (erts-5.10.1) [source] [64-bit]
[smp:2:2] [async-threads:10] [hipe] [kernel-
poll:false] [dtrace]
Eshell V5.10.1 (abort with ^G)
1](https://image.slidesharecdn.com/erlangbetabeers-130322045906-phpapp01/75/1-hour-dive-into-erlang-71-2048.jpg)
![[List]](https://image.slidesharecdn.com/erlangbetabeers-130322045906-phpapp01/75/1-hour-dive-into-erlang-95-2048.jpg)
![[1,2,3,4,5,6]](https://image.slidesharecdn.com/erlangbetabeers-130322045906-phpapp01/75/1-hour-dive-into-erlang-96-2048.jpg)
![1 MyList = [1,2,3,4].
[1,2,3,4]
2 [Head|Tail] = MyList.
[1,2,3,4]
3 Head.
1
4 Tail.
[2,3,4]](https://image.slidesharecdn.com/erlangbetabeers-130322045906-phpapp01/75/1-hour-dive-into-erlang-99-2048.jpg)
![1 MyList = [1,2,3,4].
[1,2,3,4]
2 [Head|Tail] = MyList.
[1,2,3,4]
3 Head.
1
4 Tail.
[2,3,4]](https://image.slidesharecdn.com/erlangbetabeers-130322045906-phpapp01/75/1-hour-dive-into-erlang-100-2048.jpg)
![1 MyList = [1,2,3,4].
[1,2,3,4]
2 [Head|Tail] = MyList.
[1,2,3,4]
3 Head.
1
4 Tail.
[2,3,4]](https://image.slidesharecdn.com/erlangbetabeers-130322045906-phpapp01/75/1-hour-dive-into-erlang-101-2048.jpg)
![1 MyList = [1, 2, 3, 4].
[1,2,3,4]
2 [X + 2 || X - MyList, X 2].
[5,6]](https://image.slidesharecdn.com/erlangbetabeers-130322045906-phpapp01/75/1-hour-dive-into-erlang-103-2048.jpg)
![[Strings]](https://image.slidesharecdn.com/erlangbetabeers-130322045906-phpapp01/75/1-hour-dive-into-erlang-104-2048.jpg)
![1 MyString = Erlang is not Ruby.
Erlang is not Ruby
2 [Head2|Tail2] = MyString.
Erlang is not Ruby
3 Head2.
69 ASC](https://image.slidesharecdn.com/erlangbetabeers-130322045906-phpapp01/75/1-hour-dive-into-erlang-108-2048.jpg)
Uploaded byJoan Valduvieco
1 hour dive into erlang
The document provides an overview of Erlang and its features for building scalable and fault-tolerant systems. It discusses how Erlang addresses issues like high concurrency, distribution, hot code upgrading and supervision through its use of lightweight processes, message passing, immutable data and functional programming.
![Fafl notes [2010] (sjbit)](https://cdn.slidesharecdn.com/ss_thumbnails/faflnotes2010sjbit-131208034715-phpapp02-thumbnail.jpg?width=640&height=640&fit=bounds)
1 hour dive into erlang
- 1. 1 hour diveinto Erlang/OTP @jvalduvieco @jordillonch
- 2.
- 3.
- 4.
- 5.
- 6.
- 7. Lots of criticalconcurrent transactions
- 8. Lots of criticalconcurrent transactions
- 9. Hardware or software breaks
- 10. Hardware or software breaks
- 11. Lots of codechanges
- 12. Lots of codechanges
- 13. Unscalable Unmaintainable } code
- 14. Unscalable Unmaintainable } code
- 15. Maintenance/Debug in production system
- 16. Maintenance/Debug in production system
- 17. Does it soundto you?
- 18.
- 19.
- 20. Minimize defensive programming
- 21.
- 22.
- 23. t-shirt function size If
- 24.
- 25.
- 26.
- 27.
- 28.
- 29.
- 30.
- 31.
- 32.
- 33.
- 34.
- 35.
- 36. Single responsibility principle
- 37. No shared state betweenentities
- 38.
- 39.
- 40.
- 41. Light threads hundreds of thousands of threads in one machine with a good cpu scheduler
- 42. Light threads hundreds of thousands of threads in one machine with a good cpu scheduler Lt Lt Lt
- 43. Message passing Lt Lt Lt
- 44. Message passing A shared nothing architecture that communicates through message passing Lt Lt Lt
- 45. Message passing A shared nothing architecture that communicates through message passing Lt Lt Lt
- 46. Process Mailbox Lt Lt Lt
- 47. Process Mailbox Every process has a mailbox with incoming messages, process take on convenience Lt Lt Lt
- 48. No shared state Lt S Lt S Lt S
- 49. No shared state Every process its own internal state stored in a variable avoiding lock contention Lt S Lt S Lt S
- 50.
- 51. Soft realtime You haveno strict guarantees on latency but language is designed to have low latency
- 52.
- 53. High availability Highavailability
- 54. Supervised processes Pa Pb
- 55. Supervised processes processes can be monitored by other processes, handling its termination Pa Pb
- 56. Fail early Pa Pb S
- 57. Fail early Failas soon as possible and let someone handle bad data, someone will restart you Pa Pb S
- 58. Fail early Failas soon as possible and let someone handle bad data, someone will restart you Pa Pb2 S
- 59. Hot code update Pb Pa v1 S Pc
- 60. Hot code update processes code and data can be replaced without loosing service Pb Pa v1 S Pc
- 61. Hot code update processes code and data can be replaced without loosing service Pb Pa v1 v2 S Pc
- 62. Distribution Node Node P P P P P P P P P P P P
- 63. Distribution Processes run onnodes and can be located wherever they are Node Node P P P P P P P P P P P P
- 64. How does itlook like?
- 66. Show me thecode!
- 67.
- 68.
- 69.
- 70. Type on yourconsole: erl
- 71. You should see: ErlangR16B (erts-5.10.1) [source] [64-bit] [smp:2:2] [async-threads:10] [hipe] [kernel- poll:false] [dtrace] Eshell V5.10.1 (abort with ^G) 1
- 72.
- 73.
- 74.
- 75. Can contain anytype
- 76. You can dothings like...
- 77. 1 Foo =1. 1 2 Foo = 2. ** exception error: no match of right hand side value 2
- 78.
- 79.
- 80.
- 81.
- 82. 1 1 Foo =1. 1 2 Foo = 2. ** exception error: no match of right hand side value 2
- 83.
- 84.
- 85.
- 86.
- 87. 1 1 Foo =1. 1 Foo
- 88.
- 89.
- 90. ? 2 Foo =2. ** exception error: no match of right hand side value 2
- 91. 1 Foo =1. 1 2 Bar = 2. 2 3 Foo = Bar. ** exception error: no match of right hand side value 2
- 92.
- 93. Now you haveyour basic error checking system implemented
- 94.
- 95.
- 96.
- 97. You can dothings like...
- 98.
- 99. 1 MyList =[1,2,3,4]. [1,2,3,4] 2 [Head|Tail] = MyList. [1,2,3,4] 3 Head. 1 4 Tail. [2,3,4]
- 100. 1 MyList =[1,2,3,4]. [1,2,3,4] 2 [Head|Tail] = MyList. [1,2,3,4] 3 Head. 1 4 Tail. [2,3,4]
- 101. 1 MyList =[1,2,3,4]. [1,2,3,4] 2 [Head|Tail] = MyList. [1,2,3,4] 3 Head. 1 4 Tail. [2,3,4]
- 102. Do something toall or some items on a list (list comprehensions)
- 103. 1 MyList =[1, 2, 3, 4]. [1,2,3,4] 2 [X + 2 || X - MyList, X 2]. [5,6]
- 104.
- 105.
- 106. You can dothings like...
- 107. 1 MyString =Erlang is not Ruby. Erlang is not Ruby
- 108. 1 MyString =Erlang is not Ruby. Erlang is not Ruby 2 [Head2|Tail2] = MyString. Erlang is not Ruby 3 Head2. 69 ASC
- 109.
- 110. “E” 4 Tail2. rlang isnot Ruby
- 111.
- 112.
- 113.
- 114.
- 115.
- 116. You can dothings like...
- 117. 1 Mytuple ={1,2,3,4}. {1,2,3,4} 2 A = 1. 1 3 B = 2. 2 4 {A,B,C,D} = {1,2,3,4}. {1,2,3,4} 5 C. 3 6 D. 4
- 118. 1 Mytuple ={1,2,3,4}. {1,2,3,4} 2 A = 1. 1 A
- 119.
- 120.
- 121. are 3 B =2. bounded
- 122. variables 2 4 {A,B,C,D} ={1,2,3,4}. {1,2,3,4} 5 C. 3 6 D. 4
- 123. 1 Mytuple ={1,2,3,4}. {1,2,3,4} 2 A = 1. 1 A
- 124.
- 125.
- 126. are 3 B =2. bounded
- 127. variables 2 4 {A,B,C,D} ={1,2,3,4}. {1,2,3,4} 5 C. pattern
- 128. matching 3 A==1? 6 D. B==2? 4
- 129. 1 Mytuple ={1,2,3,4}. {1,2,3,4} 2 A = 1. 1 A
- 130.
- 131.
- 132. are 3 B =2. bounded
- 133. variables 2 4 {A,B,C,D} ={1,2,3,4}. C
- 134.
- 135.
- 136.
- 137. {1,2,3,4} unbounded
- 138.
- 139. matching variables 3 A==1? 6 D. B==2? 4
- 140.
- 141.
- 142.
- 143. You can dothings like...
- 144. foo_bar_func(Foo, Bar) - Result = Foo + Bar, Result.
- 145.
- 146.
- 147.
- 148.
- 149.
- 150.
- 151.
- 152. parameters) foo_bar_func(Foo, Bar) - Result = Foo + Bar, Result.
- 153.
- 154.
- 155.
- 156.
- 157.
- 158.
- 159.
- 160. parameters) foo_bar_func(Foo, Bar) - Result = Foo + Bar, Result. means
- 161.
- 162.
- 163.
- 164.
- 165.
- 166.
- 167.
- 168.
- 169.
- 170.
- 171.
- 172.
- 173.
- 174. parameters) foo_bar_func(Foo, Bar) - Result = Foo + Bar, Result. means
- 175.
- 176.
- 177.
- 178.
- 179.
- 180. come means
- 181.
- 182.
- 183.
- 184.
- 185.
- 186.
- 187.
- 188.
- 189.
- 190.
- 191.
- 192.
- 193. parameters) foo_bar_func(Foo, Bar) - Result = Foo + Bar, Result. means
- 194.
- 195.
- 196.
- 197.
- 198.
- 199.
- 200.
- 201.
- 202. Result means
- 203.
- 204.
- 205.
- 206.
- 207.
- 208. 1 FooBar =fun(Foo, Bar) - 1 Foo + Bar 1 end. #Funerl_eval.12.82930912 2 Result = FooBar(1, 2). 3
- 209.
- 210. A constant withname
- 211.
- 212. You can dothings like...
- 213. 1 ok. ok 2 ko. ko 3ok =:= ko. false 4 ok =:= ok. true
- 214. 1 MyFuncOK =fun() - {ok, 33} end. #Funerl_eval.20.82930912 2 MyFuncFail = fun() - {error, bad_arg} end. #Funerl_eval.20.82930912 3 {ok, Result} = MyFuncOK(). {ok,33} 4 {ok, Result2} = MyFuncFail(). ** exception error: no match of right hand side value {error,bad_arg}
- 215. atoms 1 MyFuncOK =fun() - {ok, 33} end. #Funerl_eval.20.82930912 2 MyFuncFail = fun() - {error, bad_arg} end. #Funerl_eval.20.82930912 3 {ok, Result} = MyFuncOK(). {ok,33} 4 {ok, Result2} = MyFuncFail(). ** exception error: no match of right hand side value {error,bad_arg}
- 216. atoms 1 MyFuncOK =fun() - {ok, 33} end. #Funerl_eval.20.82930912 2 MyFuncFail = fun() - {error, bad_arg} end. #Funerl_eval.20.82930912 } 3 {ok, Result} = MyFuncOK(). {ok,33} error 4 {ok, Result2} = MyFuncFail(). checking ** exception error: no match of right hand side value {error,bad_arg}
- 217. atoms 1 MyFuncOK =fun() - {ok, 33} end. #Funerl_eval.20.82930912 2 MyFuncFail = fun() - {error, bad_arg} end. #Funerl_eval.20.82930912 } 3 {ok, Result} = MyFuncOK(). {ok,33} error 4 {ok, Result2} = MyFuncFail(). checking ** exception error: no match of right hand side value {error,bad_arg} do
- 218.
- 219.
- 220.
- 221.
- 222.
- 223. You can dothings like...
- 224. On your ${EDITOR}create cool_func.erl -module(cool_func). -export([foo_bar_func/2]). foo_bar_func (Foo, Bar) - Result = Foo + Bar, {ok, Result}.
- 225. On erlang shelltype: 1 c(cool_module). {ok,cool_module} 2 {ok, Result3} = cool_module:sum(33, 44). {ok,77} 3 Result3. 77
- 226. Too easy? Let’sadd some pattern matching on parameters!
- 227. area({square, Side}) - {ok,Side * Side}; area({circle, Radius}) - % almost :-) {ok, 3 * Radius * Radius}; area({triangle, A, B, C}) - S = (A + B + C)/2, {ok, math:sqrt(S*(S-A)*(S-B)*(S-C))}; area(Other) - {error, invalid_object}.
- 228. area({square, Side}) - {ok,Side * Side}; means
- 229.
- 230.
- 231.
- 232. area({circle, Radius}) - another
- 233.
- 234. %almost :-) posibility {ok, 3 * Radius * Radius}; area({triangle, A, B, C}) - S = (A + B + C)/2, {ok, math:sqrt(S*(S-A)*(S-B)*(S-C))}; area(Other) - {error, invalid_object}.
- 235. area({square, Side}) - {ok,Side * Side}; means
- 236.
- 237.
- 238.
- 239. area({circle, Radius}) - another
- 240.
- 241. %almost :-) posibility {ok, 3 * Radius * Radius}; area({triangle, A, B, C}) - S = (A + B + C)/2, {ok, math:sqrt(S*(S-A)*(S-B)*(S-C))}; area(Other) - {error, invalid_object}. mymodule:area({square, 10}). mymodule:area({circle, 10}). mymodule:area({triangle, 2, 2, 3.5}).
- 242. Want more? Let’s addsome recursion!
- 243. Want more? Let’s addsome recursion! Erlang does not use loops
- 244. factorial(0) - 1; factorial(N)- N * factorial(N-1).
- 245.
- 246. Oh, This isPerfect!
- 247. OTP is aset of rock solid architecture patterns, practices and tools
- 248. Improves the design, fault tolerance and deployment of your app
- 249. Erlang is justa language, OTP makes it great for the real world
- 251. Basic architecture patterns
- 252. Supervisor S P P P S P P
- 253. Supervisor S P P P S P P
- 254. Supervisor spawns processes and handles its death
- 255. gen_server P P gs P
- 256. gen_server P P gs P
- 257. Generic single threadedserver
- 258. gen_fsm P P gf{S} P
- 259. gen_fsm P P gf{S} P
- 260. Generic Finite StateMachine
- 261. gen_event P P P em P P P
- 262. gen_event P P P em P P P
- 263. Event handler, youcan subscribe to events
- 264. More on OTP... •File hierarchy • Applications • Releases • Basic abstraction libraries (logging, system...)
- 265. Let’s see agen_server in action!
- 266.
- 267. A server thatis able to store {Key, Value} and retrieve them by Key
- 268.
- 269. skvs diagram S P gs ets
- 270. skvs diagram S P gs ets
- 271. Starting skvs Go toskvs source directory Compile ./rebar compile Start the Erlang node erl -pa ebin Start the app application:start(skvs).
- 272. Some commands Set avalue skvs_server:set(“Key”,”Value”). skvs_server:set(“Key2”,”Value2”). Get a value skvs_server:get(“Key2”).
- 273. Code on client:skvs_server.erl start_link() - gen_server:start_link({local, skvs}, skvs_server, [], []). get(Key) - gen_server:call(skvs, {get, Key}). set(Key,Value) - gen_server:call(skvs, {set, Key, Value}). set_fire_and_forget(Key,Value) - gen_server:cast(skvs, {set, Key, Value}).
- 274. Code on client:skvs_server.erl start
- 275. gen_server start_link() - gen_server:start_link({local, skvs}, skvs_server, [], []). get(Key) - gen_server:call(skvs, {get, Key}). set(Key,Value) - gen_server:call(skvs, {set, Key, Value}). set_fire_and_forget(Key,Value) - gen_server:cast(skvs, {set, Key, Value}).
- 276. Code on client:skvs_server.erl start
- 277. gen_server start_link() - gen_server:start_link({local, skvs}, skvs_server, [], []). get(Key) - gen_server:call(skvs, {get, Key}). sync
- 278.
- 279.
- 280. server set(Key,Value) - (waits
- 281.
- 282. reply) gen_server:call(skvs, {set, Key, Value}). set_fire_and_forget(Key,Value) - gen_server:cast(skvs, {set, Key, Value}).
- 283. Code on client:skvs_server.erl start
- 284. gen_server start_link() - gen_server:start_link({local, skvs}, skvs_server, [], []). get(Key) - gen_server:call(skvs, {get, Key}). sync
- 285.
- 286.
- 287. server set(Key,Value) - (waits
- 288.
- 289. reply) gen_server:call(skvs, {set, Key, Value}). set_fire_and_forget(Key,Value) - gen_server:cast(skvs, {set, Key, Value}). async
- 290.
- 291.
- 292. server (fire
- 293.
- 294.
- 295. Callback code: skvs_server.erl %%Client Callbacks on server %% Sync calls, expects response handle_call({set, Key, Value}, _From,State) - {reply, set_value(Key,Value), State}; handle_call({get, Key}, _From, State) - {reply, get_value(Key), State}. %% Async calls, do not expect response handle_cast({set, Key, Value}, State) - set_value(Key,Value), {noreply, State}.
- 296. Callback code: skvs_server.erl %%Client Callbacks on server %% Sync calls, expects response handle_call({set, Key, Value}, _From,State) - {reply, set_value(Key,Value), State}; handle_call({get, Key}, _From, State) - {reply, get_value(Key), State}. %% Async calls, do not expect response handle_cast({set, Key, Value}, State) - set_value(Key,Value), {noreply, State}. return
- 297.
- 298. Callback code: skvs_server.erl %%Client Callbacks on server %% Sync calls, expects response handle_call({set, Key, Value}, _From,State) - {reply, set_value(Key,Value), State}; handle_call({get, Key}, _From, State) - {reply, get_value(Key), State}. %% Async calls, do not expect response handle_cast({set, Key, Value}, State) - set_value(Key,Value), {noreply, State}. Survives
- 299.
- 300.
- 301. value requests
- 302. Actual work...: skvs_server.erl %%Private functions set_value(Key, Value) - % Insert Key, Value into ETS. % Fail early {ok,Result}=case ets:insert(data_store,{Key,Value}) of true - {ok, {Key,Value}}; {error, Reason} - {error, Reason} end, Result.
- 303. Actual work...: skvs_server.erl %%Private functions set_value(Key, Value) - % Insert Key, Value into ETS. % Fail early {ok,Result}=case ets:insert(data_store,{Key,Value}) of true - {ok, {Key,Value}}; {error, Reason} - {error, Reason} end, ETS
- 304.
- 305.
- 306.
- 307.
- 308.
- 309.
- 310.
- 311.
- 312.
- 313.
- 314.
- 315.
- 316.
- 317.
- 318.
- 319.
- 320.
- 321.
- 322.
- 323. Every highly interactive website? ;)
- 324. Pay Hello Ouch! Every highly interactive website? ;) Would you... Hey NO! ! Hi Buf
- 325.
- 326.
- 327.
- 328. Use a greatIDE • IntelliJ + Erlang (plugin) • Sublime Text + SublimErl • Emacs
- 329.
- 330.
- 331. Join mailing lists •Official Erlang mailing list • http://erlang.org/mailman/listinfo/erlang- questions • Join Barcelona Erlang user group on google groups
- 332. Find know-how • Checkhttp://www.erlang-factory.com/ videos • Search for Erlang conferences on slideshare • Pray for an http://erlangcamp.com/ near your city
- 333.
- 334. This is theresult of 6 months of fun learning Erlang/OTP
- 335. We are lookingfor awesome projects http://es.linkedin.com/in/jvalduvieco http://es.linkedin.com/in/jllonch
- 336.
- 337. Thank you! https://github.com/jvalduvieco/betabeers_201303 we
- 338.
- 339.
- 340.
- 341.
- 342.
- 343. :) (we
- 344.
- 345.
- 346.