Learn · CERN

Talk1 h 9 min

Introduction to concurrent throughput-oriented programming with ReactiveX

Kirk Shoop · CERN

Watch At CERN

About

C++ collections, like std::vector, contain values distributed in space. However, other values; mouse events, hardware measurements and network packets are examples of values distributed in time. Many algorithms are implemented using the Iterator and Range concepts for values distributed in space. ReactiveX defines the concepts and algorithms for values distributed in time. The ReactiveX concepts and algorithms are implemented in the rxcpp library. The result is safe and clear async code with no visible std::thread or std::mutex. .

0:00:00 Slide 1

0:04:47 Slide 2

0:04:51 Slide 3

0:04:55 Slide 4

0:05:35 Slide 5

0:05:39 Slide 6

0:05:43 Slide 7

0:05:47 Slide 8

0:08:43 Slide 9

0:08:47 Slide 10

0:08:51 Slide 11

The talk

  1. Introduction to concurrent throughput-oriented programming with ReactiveX 2017-03-09 · 1 h 9 min · CERN's player

Credits and licence

Institution
CERN
Department
CERN Computing Seminar
Speaker
Kirk Shoop
Year
2017
Language
English
Subjects
Computer science
Source
CERN
Licence
CERN, as CERN states it. CERN's terms
Attribution
© CERN. CERN provides its audiovisual media free of charge for educational and informational use, credited to CERN; this lecture is shown in CERN's own player.
Who can watch
CERN gives no rating. Invisible Network shows it to Tweens profiles and older, judged from what the source says about it. How courses are placed