Download as PDF, PPTX
![function getEvens() {
var x = 1;
var result = [];
while (x < 10) {
if (x % 2 == 0) {
result.push(x * 2);
}
}
return result;
}](https://image.slidesharecdn.com/journeytorfp-150419130433-conversion-gate02/85/A-Journey-to-Reactive-Function-Programming-34-320.jpg)
![scala> Stream.from(1)
.takeWhile(x => x < 10)
.filter(x => x % 2 == 0)
.map(x => x * 2)
.toList
res2: List[Int] = List(4, 8, 12, 16)](https://image.slidesharecdn.com/journeytorfp-150419130433-conversion-gate02/85/A-Journey-to-Reactive-Function-Programming-35-320.jpg)
![function getEvens() {
var x = 1;
var result = [];
while (x < 10) {
if (x % 2 == 0) {
result.push(x * 2);
}
}
return result;
}](https://image.slidesharecdn.com/journeytorfp-150419130433-conversion-gate02/75/A-Journey-to-Reactive-Function-Programming-34-2048.jpg)
![scala> Stream.from(1)
.takeWhile(x => x < 10)
.filter(x => x % 2 == 0)
.map(x => x * 2)
.toList
res2: List[Int] = List(4, 8, 12, 16)](https://image.slidesharecdn.com/journeytorfp-150419130433-conversion-gate02/75/A-Journey-to-Reactive-Function-Programming-35-2048.jpg)
Uploaded byAhmed Soliman
A Journey to Reactive Function Programming
The document discusses reactive programming, emphasizing its importance for managing complexity in responsive, asynchronous, and scalable applications. It outlines key principles such as responsiveness, resilience, and elasticity, while contrasting reactive programming with traditional programming concepts. Additionally, it touches on functional programming principles, highlighting the use of functions and the avoidance of mutable state.
More Related Content
Similar to A Journey to Reactive Function Programming
![UiPath Automation Suite Installation (Hands-On) [2/3]](https://cdn.slidesharecdn.com/ss_thumbnails/automationsuitecommunitysession2-251015095633-a6d862f1-thumbnail.jpg?width=600ounds&width=560&fit=bounds)
A Journey to Reactive Function Programming
- 1. A JOURNEY INTOREACTIVE FUNCTIONAL PROGRAMMING Ahmed Soliman انميسلدحمأ
- 2. • CAT ReloadedCo-founder • Life-long architect, software, and systems engineer. • Focusing on systems reliability, scalability, and clean code. Conictus
- 3. WHAT IS REACTIVEPROGRAMMING?
- 6.
- 7. THE INTERNET IN2005
- 8.
- 9. • The Internethad 1 billion users. • Facebook had 5.5 million users. • YouTube was a new born. • Netflix had yet to introduce video streaming (2007) https://medium.com/reactive-programming/what-is-reactive-programming-bc9fa7f4a7fc
- 10. THE INTERNET IN2015
- 11. • The internethas 2.95 billion users. • Facebook has 1.393 billion monthly active users. • YouTube has 1 billion users with 6 billions of hours of video/ month. • Twitter has 270 million users. • Netflix has 57.4 million digital subscriber with 1 billion hours of video/month
- 12.
- 13. WHAT REALLY ISREACTIVE PROGRAMMING?
- 14. • A setof ideas and principles to manage complexity in the world of highly responsive, asynchronous, scalable applications. • The goal of reactive programming is to build responsive, flexible, and highly scalable applications without managing the complexity
- 15.
- 16. • The systemresponds in a timely manner if at all possible. • Responsive systems focus on providing rapid and consistent response times, establishing reliable upper bounds so they deliver a consistent quality of service. Responsive Responsiveness is the cornerstone of usability and utility, but more than that, responsiveness means that problems may be detected quickly and dealt with effectively.
- 17.
- 18. CIRCUIT BREAKER Circuit BreakerBackend ServiceClient X
- 19. BOUNDED QUEUES Queue BackendServiceClient Average Latency = Queue Size x Duration Per Op
- 20. Failure is FirstClass Resilient
- 21. Responsive in theface of failure! This applies not only to highly-available, mission critical systems — any system that is not resilient will be unresponsive after a failure. Resilient
- 22.
- 23. • Recovery ofeach component is delegated to another (external) component and high-availability is ensured by replication where necessary.
- 24. Response in theface of Changing load Elastic
- 25. PARTITIONING/SHARDING Consistent Hashing Router Bucket 1 Bucket 2 Bucket100 Bucket 101 Machine 1 Machine (N) msg
- 26. SHARE NOTHING • Message-drivenarchitectures are share-nothing by design. • No shared mutable state between components. • Avoid single-point-of-failures by partitioning+replication.
- 27. SCALE UP/DOWN ANDOUT/IN Process 1 Process 2 Machine Process 3 Process 4 … Process 1 Process 2 Server 1 Process 1 Process 2 Server 1 Process 1 Server 1
- 28. LOCATIONTRANSPARENCY AuthService x =getAuthService(/* local or remote*/) x.sendMessage(new Login("asoliman", "password")) • Abstraction over location of components enables you to scale out and up in the same way. • The underlying message-passing system should handle all the plumbing and the optimization for the message delivery
- 29. • Foundation ofscalable, resilient, and ultimately responsive systems. • Immutable by design • Loose Coupling • LocationTransparency • Concurrency Control • Everything is a stream of messages Message-driven
- 30.
- 31. • A programminglanguage • A framework/library/tool • The only way to achieve concurrency and interactive applications
- 32. WHAT IS FUNCTIONALAND WHY?
- 33. • Programming withfunctions where functions and data are treated the same way. • A program is an evaluation of mathematical functions. • Avoids mutable-data and changing-state.
- 34. function getEvens() { varx = 1; var result = []; while (x < 10) { if (x % 2 == 0) { result.push(x * 2); } } return result; }
- 35. scala> Stream.from(1) .takeWhile(x =>x < 10) .filter(x => x % 2 == 0) .map(x => x * 2) .toList res2: List[Int] = List(4, 8, 12, 16)
- 36. LET’S ADDTIME The Worldis a set of Observable<T>
- 37. takeWhile filter map dropWhilemap filter Observable Reduce
- 38. LET’S SEE SOMECODE
- 39.
- 40.
- 41.
- 42.