Rust London and C++ London are proud to announce our first joint meetup The Rust && C++ LDN Talks. This is the first in a series of collaborative events between our two communities which have been compared and contrasted for several years.

The purpose of these events is to begin an exchange of ideas and experiences between our user groups.
The Rust London User Group will open up the LDN Talks platform to the C++ London community. We will have speakers from C++ London who will share their perspectives, opinions and learning experiences with the Rust Programming language.

There will also be a special giveaway of various prizes from our community partners; Ferrous Systems, The ODSC and RustLab.

https://ferrous-systems.com/training/

https://odsc.com/

https://www.rustlab.it/

This event will be Live-Streamed due to the Corona-Virus Pandemic

Agenda:

• Welcome

• News, Announcements & Special Giveaways

• Speaker: Hendrik Niemeyer

• Speaker: Payas Rajan

-----
A Friendly Introduction to Rust for C++ Developers
https://github.com/hniemeyer

Rust's design philosophy aims for a language which helps the developer as much as possible with memory safety, freedom from data races, great error messages and package management. But also no sacrifices shall be made in terms of performance and low-level control over memory.

In this talk, I will introduce Rust and its core principles from the perspective of a C++ developer. Similarities and differences between C++ and Rust will be discussed by comparing the example code in both languages.

-----
Are Graphs Hard in Rust?
https://github.com/PayasR

"Graphs are hard in Rust due to the strict borrow checking rules." In this talk, I argue otherwise. I use examples from popular libraries including Boost Graph, OSRM and petgraph to show that implementing graphs and graph libraries in C++ and Rust, in fact, have very similar levels of difficulty. Moreover, Rust's traits-based type system makes certain operations simpler and can save programmers a lot of time and cryptic error messages.

Payas is a PhD Candidate at the University of California - Riverside where he studies route planning algorithms in transportation networks and other geospatial problems.

-----