Introduction to Rust
•
4 likes•1,067 views
This document provides an introduction to the Rust programming language. It describes that Rust was developed by Mozilla Research beginning in 2009 to combine the type safety of Haskell, concurrency of Erlang, and speed of C++. Rust reached version 1.0 in 2015 and is a generic, multiparadigm systems programming language that runs on platforms including ARM, Apple, Linux, Windows and embedded devices. It emphasizes security, performance and fine-grained memory safety without garbage collection.
Report
Share
Introduction to Rust
- 1. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Introduction To Rust “The type safety of Haskell, the concurrency of Erlang, and the speed of C++”
- 3. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Rust Generic multiparadigm system’s programming language.
- 4. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Rust Generic multiparadigm system’s programming language. Version 1.0 in May of 2015, 1.10 currently.
- 5. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Rust Generic multiparadigm system’s programming language. Version 1.0 in May of 2015, 1.10 currently. Platforms: ▶ ARM ▶ Apple ▶ MIPS ▶ PC ▶ Raspberry PI ▶ TIVA ▶ Tessel 2 ▶ Others
- 6. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Who Built? Mozilla Research team (2009) ▶ Graydon Hoare https://github.com/graydon ▶ Brian Anderson https://github.com/brson ▶ Patrick Walton https://github.com/pcwalton ▶ Alex Crichton https://github.com/alexcrichton
- 7. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Built for Patrick Walton: Rust should focus on the same domain as C++ does. ▶ Browser Engines ▶ Games ▶ IOT ▶ OS’s
- 8. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Who Uses? ▶ Servo: Browser engine ▶ Dropbox ▶ Coursera ▶ Skylight: New relic for rails ▶ Redox: Unix based OS ▶ Tikv: Distributed database ▶ Many more
- 9. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . In the wild Figure 1:who uses
- 11. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Strengths ▶ Security ▶ Performance ▶ Fine grained control
- 12. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Weaknesses ▶ Fight the borrow checker ▶ Huge syntax ▶ Relatively new
- 13. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Rust vs the world
- 14. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Go ▶ fast compilation ▶ simplicity ▶ imperative foundations ▶ higher level (Haskell,OCaml,C#,F#)
- 15. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Rust ▶ slow compilation ▶ long list of features ▶ functional foundations ▶ lower level (C++,C,D)
- 17. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Figure 4:Performance
- 18. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . rustc ▶ Written in Rust ▶ Uses LLVM ▶ MIR ▶ Zero cost abstractions
- 20. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . fn fib(n: u64) -> u64 { match n { 0 | 1 => n, n => fib(n - 1) + fib(n - 2) } }
- 21. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . fn gcd(mut n: u64, mut m: u64) -> u64 { assert!(n != 0 && m != 0); while m != 0 { if m < n { let t = m; m=n; n=t; } m = m % n; } n }
- 23. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Structs struct Point3d { x: i32, y: i32, z: i32, } let mut point = Point3d { x: 0, y: 0, z: 0 };
- 24. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Traits struct Circle { x: f64, y: f64, radius: f64, } trait HasArea { fn area(&self) -> f64; } impl HasArea for Circle { fn area(&self) -> f64 { std::f64::consts::PI * (self.radius * self.radius) } }
- 25. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Generics enum Option<T> { Some(T), None, } enum Result<T, E> { Ok(T), Err(E), }
- 26. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Generics enum Option<T> { Some(T), None, } enum Result<T, E> { Ok(T), Err(E), } let foo: Option<f64> = Some(5.0f64); let foo: Option<u8> = None; let foo: Result<u8> = Ok(8); let foo: Result<i16> = Err(9);
- 27. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Generic Functions fn min<T: Ord>(a: T, b: T) -> T { if a <= b { a } else { b } }
- 28. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Generic Functions fn min<T: Ord>(a: T, b: T) -> T { if a <= b { a } else { b } } Inline specialization min(10i8, 20) == 10; //T is i8 min(10, 20u32) == 10; //T is u32 min("abc", "xyz") == "abc"; //strings are Ord
- 29. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Composite types dependency use std::fmt::Debug; fn foo<T: Clone + Debug>(x: T) { x.clone(); println!("{:?}", x); }
- 30. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Refined implementation filter impl<R: Num, C: Num> Add<Matrix<R, C>> for Matrix<R, C> { ... }
- 31. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Lazy evaluation (1..) .filter(|&x| x % 2 == 0) .find(|x| *x > 42) .take(5) .collect::<Vec<i32>>();
- 32. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Imperative let mut file = match File::open(file_path) { Ok(file) => file, Err(err) => return Err(err.to_string()), }; let mut contents = String::new(); if let Err(err) = file.read_to_string(&mut contents) { return Err(err.to_string()); } let n: i32 = match contents.trim().parse() { Ok(n) => n, Err(err) => return Err(err.to_string()), }; Ok(2 * n)
- 33. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Functional File::open(file_path) .map_err(|err| err.to_string()) .and_then(|mut file| { let mut contents = String::new(); file.read_to_string(&mut contents) .map_err(|err| err.to_string()) .map(|_| contents) }) .and_then(|contents| { contents.trim().parse::<i32>() .map_err(|err| err.to_string()) }) .map(|n| 2 * n)
- 35. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Rust way ▶ No null pointer deferences. ▶ No dangling pointers ▶ No buffer overruns
- 36. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Garbage collector ▶ Non deterministic ▶ Runtime checking ▶ Lack of control
- 37. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Garbage collector ▶ Non deterministic ▶ Runtime checking ▶ Lack of control Out of scope deallocation
- 38. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Ownership let v = vec![1, 2, 3]; let v2 = v; println!("v[0] is: {}", v[0]);
- 39. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Ownership let v = vec![1, 2, 3]; let v2 = v; println!("v[0] is: {}", v[0]); error: use of moved value: `v` println!("v[0] is: {}", v[0]);
- 40. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Ownership let v = vec![1, 2, 3]; let v2 = v; println!("v[0] is: {}", v[0]); error: use of moved value: `v` println!("v[0] is: {}", v[0]); let v2 = &v;
- 41. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Borrowing let v = vec![]; foo(&v); fn foo(v: &Vec<i32>) { println!("{}", v); //works v.push(5); //fails }
- 42. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Borrowing let v = vec![]; foo(&v); fn foo(v: &Vec<i32>) { println!("{}", v); //works v.push(5); //fails } error: cannot borrow immutable borrowed content `*v` as mutable v.push(5);
- 43. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Borrowing Mutable let mut x = 5; { let y = &mut x; *y += 1; } println!("{}", x);
- 44. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Borrowing Rules ▶ a borrowed value can’t have greater lifetime ▶ one or more immutable references (&T) to a resource, ▶ exactly one mutable reference (&mut T).
- 45. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Lifetimes fn firsts<'a 'b> (x: &'a Vec<i32> y: &'b Vec<i32>) -> (&'a i32, &'b i32) { return (&x[0], &y[0]); }
- 46. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Concurrency Shared mutable state (root of all evil)
- 47. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Concurrency Shared mutable state (root of all evil) 4 feet tall
- 48. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Concurrency Shared mutable state (root of all evil) 4 feet tall Other languages tries to solve the mutable.
- 49. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Concurrency Shared mutable state (root of all evil) 4 feet tall Other languages tries to solve the mutable. Rust solves the shared
- 50. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Default thread let thread1 = std::thread::spawn(|| { println!("foo"); return 999; }); let thread2 = std::thread::spawn(|| { println!("bar"); return 666; }); assert_eq!(try!(thread.join()), 999); assert_eq!(try!(thread.join()), 666);
- 51. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Shared thread fn main() { let mut x = 1; let thread1 = std::thread::scoped(|| {x + 8}); let thread2 = std::thread::scoped(|| {x + 27}); assert_eq!(thread1.join() + thread2.join(), 37); }
- 52. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Shared mutable thread //arc = safe reference count //mutex = mutable data with locking let data = Arc::new(Mutex::new(vec![1,2,3])); for i in 0..3 { let data = data.clone(); thread::spawn(move || { let mut data = data.lock().unwrap(); data[0] += i; }); } thread::sleep(Duration::from_millis(50));
- 53. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Tests fn prime_factors(mut num: i64) -> Vec<i64> { let mut result = vec![]; let mut i = 2; while num > 1 { while num % i == 0 { result.push(i); num /= i; } i +=1; } result }
- 54. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . #[test] fn prime_factors_of_48() { assert_eq!(prime_factors(48), [2, 2, 2, 2, 3]); }
- 55. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Tests #[test] #[should_panic(expected = "assertion failed")] fn it_works() { assert_eq!("Hello", "world"); }
- 56. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Tests as Documentation //! ``` //! assert_eq!(4, adder::add_two(2)); //! ```
- 57. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Macros let x: Vec<u32> = vec![1, 2, 3];
- 58. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Macros let x: Vec<u32> = vec![1, 2, 3]; let x: Vec<u32> = { let mut temp_vec = Vec::new(); temp_vec.push(1); temp_vec.push(2); temp_vec.push(3); temp_vec };
- 59. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Implementation macro_rules! vec { ( $( $x:expr ),* ) => { { let mut temp_vec = Vec::new(); $( temp_vec.push($x); )* temp_vec } }; }
- 61. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Libs ▶ rustup - croscompilling toolset ▶ clap - parse command line args ▶ iron - Web framework ▶ helix - ruby classes in Rust ▶ racer - auto-complete-er
- 62. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Beyond ▶ Module system ▶ FFI Foreign functions interfaces ▶ Unsafe ▶ Much more!
- 63. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Cool Resources ▶ Blog: https://blog.rust-lang.org/ ▶ Rust by Example: http://rustbyexample.com/ ▶ Rust Book: https://doc.rust-lang.org ▶ This week in Rust https://this-week-in-rust.org ▶ Writing an OS in Rust: http://os.phil-opp.com/
- 64. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . References ▶ Platforms: https://hacks.Mozilla.org/2015/05/diving-into-rust-for-the-first-time/ ▶ Comparison: https://www.rust-lang.org/faq.html#other-languages ▶ Rust Programming Language: http://www.slideshare.net/jaejukim9/rust-programming-language ▶ State of Rust: https://blog.rust-lang.org/2016/06/30/State-of-Rust-Survey-2016.html ▶ Why Rust: ▶ Which programs are fastest: http://benchmarksgame.alioth.debian.org/u64q/which-programs-are- fastest.html http://www.oreilly.com/programming/free/files/why-rust.pdf