2014-06-30 08:41:13 +04:00
|
|
|
|
---
|
2019-12-25 10:00:42 +03:00
|
|
|
|
language: Rust
|
2014-06-30 08:41:13 +04:00
|
|
|
|
contributors:
|
|
|
|
|
- ["P1start", "http://p1start.github.io/"]
|
|
|
|
|
filename: learnrust.rs
|
|
|
|
|
---
|
|
|
|
|
|
2015-06-22 23:03:24 +03:00
|
|
|
|
Rust is a programming language developed by Mozilla Research.
|
2015-10-08 06:11:24 +03:00
|
|
|
|
Rust combines low-level control over performance with high-level convenience and
|
|
|
|
|
safety guarantees.
|
2015-05-16 01:12:45 +03:00
|
|
|
|
|
2015-10-08 06:11:24 +03:00
|
|
|
|
It achieves these goals without requiring a garbage collector or runtime, making
|
2015-05-16 01:12:45 +03:00
|
|
|
|
it possible to use Rust libraries as a "drop-in replacement" for C.
|
|
|
|
|
|
2015-10-08 06:11:24 +03:00
|
|
|
|
Rust’s first release, 0.1, occurred in January 2012, and for 3 years development
|
2015-05-16 01:12:45 +03:00
|
|
|
|
moved so quickly that until recently the use of stable releases was discouraged
|
2015-10-08 06:11:24 +03:00
|
|
|
|
and instead the general advice was to use nightly builds.
|
2015-05-16 01:12:45 +03:00
|
|
|
|
|
2015-10-08 06:11:24 +03:00
|
|
|
|
On May 15th 2015, Rust 1.0 was released with a complete guarantee of backward
|
2015-05-16 01:12:45 +03:00
|
|
|
|
compatibility. Improvements to compile times and other aspects of the compiler are
|
|
|
|
|
currently available in the nightly builds. Rust has adopted a train-based release
|
2015-10-08 06:11:24 +03:00
|
|
|
|
model with regular releases every six weeks. Rust 1.1 beta was made available at
|
2015-05-16 01:12:45 +03:00
|
|
|
|
the same time of the release of Rust 1.0.
|
2014-06-30 08:41:13 +04:00
|
|
|
|
|
2020-02-09 01:29:46 +03:00
|
|
|
|
Although Rust is a relatively low-level language, it has some functional
|
2014-06-30 08:41:13 +04:00
|
|
|
|
concepts that are generally found in higher-level languages. This makes
|
|
|
|
|
Rust not only fast, but also easy and efficient to code in.
|
|
|
|
|
|
|
|
|
|
```rust
|
2016-06-26 22:46:16 +03:00
|
|
|
|
// This is a comment. Line comments look like this...
|
|
|
|
|
// and extend multiple lines like this.
|
|
|
|
|
|
2023-09-08 08:32:43 +03:00
|
|
|
|
/* Block comments
|
|
|
|
|
/* can be nested. */ */
|
|
|
|
|
|
2016-06-26 22:46:16 +03:00
|
|
|
|
/// Documentation comments look like this and support markdown notation.
|
|
|
|
|
/// # Examples
|
|
|
|
|
///
|
|
|
|
|
/// ```
|
|
|
|
|
/// let five = 5
|
|
|
|
|
/// ```
|
2014-06-30 08:41:13 +04:00
|
|
|
|
|
|
|
|
|
///////////////
|
|
|
|
|
// 1. Basics //
|
|
|
|
|
///////////////
|
|
|
|
|
|
2018-09-20 10:19:39 +03:00
|
|
|
|
#[allow(dead_code)]
|
2014-06-30 08:41:13 +04:00
|
|
|
|
// Functions
|
2015-01-15 05:14:19 +03:00
|
|
|
|
// `i32` is the type for 32-bit signed integers
|
|
|
|
|
fn add2(x: i32, y: i32) -> i32 {
|
2014-06-30 08:41:13 +04:00
|
|
|
|
// Implicit return (no semicolon)
|
|
|
|
|
x + y
|
|
|
|
|
}
|
|
|
|
|
|
2018-09-20 10:19:39 +03:00
|
|
|
|
#[allow(unused_variables)]
|
|
|
|
|
#[allow(unused_assignments)]
|
|
|
|
|
#[allow(dead_code)]
|
2014-06-30 08:41:13 +04:00
|
|
|
|
// Main function
|
|
|
|
|
fn main() {
|
|
|
|
|
// Numbers //
|
|
|
|
|
|
|
|
|
|
// Immutable bindings
|
2015-01-15 05:14:19 +03:00
|
|
|
|
let x: i32 = 1;
|
2014-06-30 08:41:13 +04:00
|
|
|
|
|
|
|
|
|
// Integer/float suffixes
|
2015-01-15 05:14:19 +03:00
|
|
|
|
let y: i32 = 13i32;
|
2014-06-30 08:41:13 +04:00
|
|
|
|
let f: f64 = 1.3f64;
|
|
|
|
|
|
|
|
|
|
// Type inference
|
2015-01-15 05:14:19 +03:00
|
|
|
|
// Most of the time, the Rust compiler can infer what type a variable is, so
|
|
|
|
|
// you don’t have to write an explicit type annotation.
|
|
|
|
|
// Throughout this tutorial, types are explicitly annotated in many places,
|
|
|
|
|
// but only for demonstrative purposes. Type inference can handle this for
|
|
|
|
|
// you most of the time.
|
|
|
|
|
let implicit_x = 1;
|
|
|
|
|
let implicit_f = 1.3;
|
2014-06-30 08:41:13 +04:00
|
|
|
|
|
2015-01-15 05:14:19 +03:00
|
|
|
|
// Arithmetic
|
|
|
|
|
let sum = x + y + 13;
|
2014-06-30 08:41:13 +04:00
|
|
|
|
|
|
|
|
|
// Mutable variable
|
|
|
|
|
let mut mutable = 1;
|
2015-01-15 05:14:19 +03:00
|
|
|
|
mutable = 4;
|
2014-06-30 08:41:13 +04:00
|
|
|
|
mutable += 2;
|
|
|
|
|
|
|
|
|
|
// Strings //
|
2015-01-15 05:14:19 +03:00
|
|
|
|
|
2014-06-30 08:41:13 +04:00
|
|
|
|
// String literals
|
2015-01-15 05:14:19 +03:00
|
|
|
|
let x: &str = "hello world!";
|
2014-06-30 08:41:13 +04:00
|
|
|
|
|
|
|
|
|
// Printing
|
|
|
|
|
println!("{} {}", f, x); // 1.3 hello world
|
|
|
|
|
|
2015-01-15 05:14:19 +03:00
|
|
|
|
// A `String` – a heap-allocated string
|
2024-07-21 22:14:17 +03:00
|
|
|
|
// Stored as a `Vec<u8>` and always holds a valid UTF-8 sequence,
|
2022-01-03 20:16:59 +03:00
|
|
|
|
// which is not null terminated.
|
2014-06-30 08:41:13 +04:00
|
|
|
|
let s: String = "hello world".to_string();
|
|
|
|
|
|
2015-01-15 05:14:19 +03:00
|
|
|
|
// A string slice – an immutable view into another string
|
2024-07-21 22:14:17 +03:00
|
|
|
|
// This is basically an immutable pointer and length of a string – it
|
|
|
|
|
// doesn’t actually contain the contents of a string, just a pointer to
|
|
|
|
|
// the beginning and a length of a string buffer,
|
2022-01-03 20:16:59 +03:00
|
|
|
|
// statically allocated or contained in another object (in this case, `s`).
|
|
|
|
|
// The string slice is like a view `&[u8]` into `Vec<T>`.
|
2015-06-18 02:35:32 +03:00
|
|
|
|
let s_slice: &str = &s;
|
2014-06-30 08:41:13 +04:00
|
|
|
|
|
2014-07-01 07:24:08 +04:00
|
|
|
|
println!("{} {}", s, s_slice); // hello world hello world
|
|
|
|
|
|
|
|
|
|
// Vectors/arrays //
|
|
|
|
|
|
|
|
|
|
// A fixed-size array
|
2015-01-15 05:14:19 +03:00
|
|
|
|
let four_ints: [i32; 4] = [1, 2, 3, 4];
|
2014-07-01 07:24:08 +04:00
|
|
|
|
|
2015-01-15 05:14:19 +03:00
|
|
|
|
// A dynamic array (vector)
|
|
|
|
|
let mut vector: Vec<i32> = vec![1, 2, 3, 4];
|
2014-07-01 07:24:08 +04:00
|
|
|
|
vector.push(5);
|
|
|
|
|
|
2015-01-15 05:14:19 +03:00
|
|
|
|
// A slice – an immutable view into a vector or array
|
2014-07-01 07:24:08 +04:00
|
|
|
|
// This is much like a string slice, but for vectors
|
2015-06-18 02:35:32 +03:00
|
|
|
|
let slice: &[i32] = &vector;
|
2015-01-15 05:14:19 +03:00
|
|
|
|
|
|
|
|
|
// Use `{:?}` to print something debug-style
|
|
|
|
|
println!("{:?} {:?}", vector, slice); // [1, 2, 3, 4, 5] [1, 2, 3, 4, 5]
|
|
|
|
|
|
|
|
|
|
// Tuples //
|
2014-07-01 07:24:08 +04:00
|
|
|
|
|
2015-01-15 05:14:19 +03:00
|
|
|
|
// A tuple is a fixed-size set of values of possibly different types
|
|
|
|
|
let x: (i32, &str, f64) = (1, "hello", 3.4);
|
|
|
|
|
|
|
|
|
|
// Destructuring `let`
|
|
|
|
|
let (a, b, c) = x;
|
|
|
|
|
println!("{} {} {}", a, b, c); // 1 hello 3.4
|
|
|
|
|
|
|
|
|
|
// Indexing
|
|
|
|
|
println!("{}", x.1); // hello
|
2014-07-01 07:24:08 +04:00
|
|
|
|
|
2014-06-30 08:41:13 +04:00
|
|
|
|
//////////////
|
|
|
|
|
// 2. Types //
|
|
|
|
|
//////////////
|
2015-01-15 05:14:19 +03:00
|
|
|
|
|
2014-06-30 08:41:13 +04:00
|
|
|
|
// Struct
|
|
|
|
|
struct Point {
|
2015-01-15 05:14:19 +03:00
|
|
|
|
x: i32,
|
|
|
|
|
y: i32,
|
2014-06-30 08:41:13 +04:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
let origin: Point = Point { x: 0, y: 0 };
|
|
|
|
|
|
2015-01-15 05:14:19 +03:00
|
|
|
|
// A struct with unnamed fields, called a ‘tuple struct’
|
|
|
|
|
struct Point2(i32, i32);
|
2014-06-30 08:41:13 +04:00
|
|
|
|
|
|
|
|
|
let origin2 = Point2(0, 0);
|
|
|
|
|
|
|
|
|
|
// Basic C-like enum
|
|
|
|
|
enum Direction {
|
|
|
|
|
Left,
|
|
|
|
|
Right,
|
|
|
|
|
Up,
|
|
|
|
|
Down,
|
|
|
|
|
}
|
|
|
|
|
|
2015-01-15 05:14:19 +03:00
|
|
|
|
let up = Direction::Up;
|
2014-06-30 08:41:13 +04:00
|
|
|
|
|
|
|
|
|
// Enum with fields
|
2024-07-21 22:14:17 +03:00
|
|
|
|
// If you want to make something optional, the standard
|
|
|
|
|
// library has `Option`
|
2015-01-15 05:14:19 +03:00
|
|
|
|
enum OptionalI32 {
|
|
|
|
|
AnI32(i32),
|
2014-06-30 08:41:13 +04:00
|
|
|
|
Nothing,
|
|
|
|
|
}
|
|
|
|
|
|
2015-01-15 05:14:19 +03:00
|
|
|
|
let two: OptionalI32 = OptionalI32::AnI32(2);
|
|
|
|
|
let nothing = OptionalI32::Nothing;
|
2014-06-30 08:41:13 +04:00
|
|
|
|
|
|
|
|
|
// Generics //
|
|
|
|
|
|
|
|
|
|
struct Foo<T> { bar: T }
|
|
|
|
|
|
|
|
|
|
// This is defined in the standard library as `Option`
|
2024-07-21 22:14:17 +03:00
|
|
|
|
// `Option` is used in place of where a null pointer
|
|
|
|
|
// would normally be used.
|
2014-06-30 08:41:13 +04:00
|
|
|
|
enum Optional<T> {
|
|
|
|
|
SomeVal(T),
|
|
|
|
|
NoVal,
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
// Methods //
|
|
|
|
|
|
|
|
|
|
impl<T> Foo<T> {
|
|
|
|
|
// Methods take an explicit `self` parameter
|
2020-02-12 23:18:41 +03:00
|
|
|
|
fn bar(&self) -> &T { // self is borrowed
|
|
|
|
|
&self.bar
|
|
|
|
|
}
|
|
|
|
|
fn bar_mut(&mut self) -> &mut T { // self is mutably borrowed
|
|
|
|
|
&mut self.bar
|
|
|
|
|
}
|
|
|
|
|
fn into_bar(self) -> T { // here self is consumed
|
2014-06-30 08:41:13 +04:00
|
|
|
|
self.bar
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2015-01-15 05:14:19 +03:00
|
|
|
|
let a_foo = Foo { bar: 1 };
|
2020-02-12 23:25:39 +03:00
|
|
|
|
println!("{}", a_foo.bar()); // 1
|
2014-06-30 08:41:13 +04:00
|
|
|
|
|
2015-01-15 05:14:19 +03:00
|
|
|
|
// Traits (known as interfaces or typeclasses in other languages) //
|
2014-06-30 08:41:13 +04:00
|
|
|
|
|
|
|
|
|
trait Frobnicate<T> {
|
|
|
|
|
fn frobnicate(self) -> Option<T>;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
impl<T> Frobnicate<T> for Foo<T> {
|
|
|
|
|
fn frobnicate(self) -> Option<T> {
|
|
|
|
|
Some(self.bar)
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2015-01-15 05:14:19 +03:00
|
|
|
|
let another_foo = Foo { bar: 1 };
|
|
|
|
|
println!("{:?}", another_foo.frobnicate()); // Some(1)
|
2014-06-30 08:41:13 +04:00
|
|
|
|
|
2022-01-03 20:16:59 +03:00
|
|
|
|
// Function pointer types //
|
|
|
|
|
|
|
|
|
|
fn fibonacci(n: u32) -> u32 {
|
|
|
|
|
match n {
|
|
|
|
|
0 => 1,
|
|
|
|
|
1 => 1,
|
|
|
|
|
_ => fibonacci(n - 1) + fibonacci(n - 2),
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
type FunctionPointer = fn(u32) -> u32;
|
|
|
|
|
|
|
|
|
|
let fib : FunctionPointer = fibonacci;
|
2023-03-25 09:21:11 +03:00
|
|
|
|
println!("Fib: {}", fib(4)); // 5
|
2022-01-03 20:16:59 +03:00
|
|
|
|
|
2014-06-30 08:41:13 +04:00
|
|
|
|
/////////////////////////
|
|
|
|
|
// 3. Pattern matching //
|
|
|
|
|
/////////////////////////
|
2015-01-15 05:14:19 +03:00
|
|
|
|
|
|
|
|
|
let foo = OptionalI32::AnI32(1);
|
2014-06-30 08:41:13 +04:00
|
|
|
|
match foo {
|
2015-01-15 05:14:19 +03:00
|
|
|
|
OptionalI32::AnI32(n) => println!("it’s an i32: {}", n),
|
|
|
|
|
OptionalI32::Nothing => println!("it’s nothing!"),
|
2014-06-30 08:41:13 +04:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
// Advanced pattern matching
|
2015-01-15 05:14:19 +03:00
|
|
|
|
struct FooBar { x: i32, y: OptionalI32 }
|
|
|
|
|
let bar = FooBar { x: 15, y: OptionalI32::AnI32(32) };
|
2014-06-30 08:41:13 +04:00
|
|
|
|
|
|
|
|
|
match bar {
|
2015-01-15 05:14:19 +03:00
|
|
|
|
FooBar { x: 0, y: OptionalI32::AnI32(0) } =>
|
2014-06-30 08:41:13 +04:00
|
|
|
|
println!("The numbers are zero!"),
|
2015-01-15 05:14:19 +03:00
|
|
|
|
FooBar { x: n, y: OptionalI32::AnI32(m) } if n == m =>
|
2014-06-30 08:41:13 +04:00
|
|
|
|
println!("The numbers are the same"),
|
2015-01-15 05:14:19 +03:00
|
|
|
|
FooBar { x: n, y: OptionalI32::AnI32(m) } =>
|
2014-06-30 08:41:13 +04:00
|
|
|
|
println!("Different numbers: {} {}", n, m),
|
2015-01-15 05:14:19 +03:00
|
|
|
|
FooBar { x: _, y: OptionalI32::Nothing } =>
|
2014-06-30 08:41:13 +04:00
|
|
|
|
println!("The second number is Nothing!"),
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/////////////////////
|
|
|
|
|
// 4. Control flow //
|
|
|
|
|
/////////////////////
|
|
|
|
|
|
|
|
|
|
// `for` loops/iteration
|
2015-01-15 05:14:19 +03:00
|
|
|
|
let array = [1, 2, 3];
|
2021-11-02 00:27:42 +03:00
|
|
|
|
for i in array {
|
2014-06-30 08:41:13 +04:00
|
|
|
|
println!("{}", i);
|
|
|
|
|
}
|
|
|
|
|
|
2015-01-15 05:14:19 +03:00
|
|
|
|
// Ranges
|
|
|
|
|
for i in 0u32..10 {
|
2014-06-30 08:41:13 +04:00
|
|
|
|
print!("{} ", i);
|
|
|
|
|
}
|
|
|
|
|
println!("");
|
|
|
|
|
// prints `0 1 2 3 4 5 6 7 8 9 `
|
|
|
|
|
|
|
|
|
|
// `if`
|
2015-01-15 05:14:19 +03:00
|
|
|
|
if 1 == 1 {
|
2014-06-30 08:41:13 +04:00
|
|
|
|
println!("Maths is working!");
|
|
|
|
|
} else {
|
|
|
|
|
println!("Oh no...");
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
// `if` as expression
|
|
|
|
|
let value = if true {
|
|
|
|
|
"good"
|
2014-07-01 07:24:08 +04:00
|
|
|
|
} else {
|
2014-06-30 08:41:13 +04:00
|
|
|
|
"bad"
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
// `while` loop
|
2015-01-15 05:14:19 +03:00
|
|
|
|
while 1 == 1 {
|
2014-06-30 08:41:13 +04:00
|
|
|
|
println!("The universe is operating normally.");
|
2018-09-20 14:04:31 +03:00
|
|
|
|
// break statement gets out of the while loop.
|
|
|
|
|
// It avoids useless iterations.
|
|
|
|
|
break
|
2014-06-30 08:41:13 +04:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
// Infinite loop
|
|
|
|
|
loop {
|
|
|
|
|
println!("Hello!");
|
2018-09-20 14:04:31 +03:00
|
|
|
|
// break statement gets out of the loop
|
|
|
|
|
break
|
2014-06-30 08:41:13 +04:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/////////////////////////////////
|
|
|
|
|
// 5. Memory safety & pointers //
|
|
|
|
|
/////////////////////////////////
|
2015-01-15 05:14:19 +03:00
|
|
|
|
|
|
|
|
|
// Owned pointer – only one thing can ‘own’ this pointer at a time
|
2024-07-21 22:14:17 +03:00
|
|
|
|
// This means that when the `Box` leaves its scope, it will be automatically deallocated safely.
|
2015-01-15 05:14:19 +03:00
|
|
|
|
let mut mine: Box<i32> = Box::new(3);
|
2014-06-30 08:41:13 +04:00
|
|
|
|
*mine = 5; // dereference
|
2015-01-15 05:14:19 +03:00
|
|
|
|
// Here, `now_its_mine` takes ownership of `mine`. In other words, `mine` is moved.
|
2014-06-30 08:41:13 +04:00
|
|
|
|
let mut now_its_mine = mine;
|
|
|
|
|
*now_its_mine += 2;
|
2015-01-15 05:14:19 +03:00
|
|
|
|
|
2014-06-30 08:41:13 +04:00
|
|
|
|
println!("{}", now_its_mine); // 7
|
2015-01-15 05:14:19 +03:00
|
|
|
|
// println!("{}", mine); // this would not compile because `now_its_mine` now owns the pointer
|
2014-06-30 08:41:13 +04:00
|
|
|
|
|
2015-01-15 05:14:19 +03:00
|
|
|
|
// Reference – an immutable pointer that refers to other data
|
|
|
|
|
// When a reference is taken to a value, we say that the value has been ‘borrowed’.
|
|
|
|
|
// While a value is borrowed immutably, it cannot be mutated or moved.
|
2019-09-01 12:54:40 +03:00
|
|
|
|
// A borrow is active until the last use of the borrowing variable.
|
2015-01-15 05:14:19 +03:00
|
|
|
|
let mut var = 4;
|
2014-06-30 08:41:13 +04:00
|
|
|
|
var = 3;
|
2015-01-15 05:14:19 +03:00
|
|
|
|
let ref_var: &i32 = &var;
|
|
|
|
|
|
2016-09-27 17:42:40 +03:00
|
|
|
|
println!("{}", var); // Unlike `mine`, `var` can still be used
|
2014-06-30 08:41:13 +04:00
|
|
|
|
println!("{}", *ref_var);
|
2015-01-15 05:14:19 +03:00
|
|
|
|
// var = 5; // this would not compile because `var` is borrowed
|
2016-06-26 16:21:27 +03:00
|
|
|
|
// *ref_var = 6; // this would not either, because `ref_var` is an immutable reference
|
2019-09-01 12:54:40 +03:00
|
|
|
|
ref_var; // no-op, but counts as a use and keeps the borrow active
|
|
|
|
|
var = 2; // ref_var is no longer used after the line above, so the borrow has ended
|
2014-06-30 08:41:13 +04:00
|
|
|
|
|
|
|
|
|
// Mutable reference
|
2015-01-15 05:14:19 +03:00
|
|
|
|
// While a value is mutably borrowed, it cannot be accessed at all.
|
|
|
|
|
let mut var2 = 4;
|
|
|
|
|
let ref_var2: &mut i32 = &mut var2;
|
2015-10-11 07:09:39 +03:00
|
|
|
|
*ref_var2 += 2; // '*' is used to point to the mutably borrowed var2
|
2015-01-15 05:14:19 +03:00
|
|
|
|
|
2016-06-26 16:21:27 +03:00
|
|
|
|
println!("{}", *ref_var2); // 6 , // var2 would not compile.
|
|
|
|
|
// ref_var2 is of type &mut i32, so stores a reference to an i32, not the value.
|
|
|
|
|
// var2 = 2; // this would not compile because `var2` is borrowed.
|
2019-09-01 12:54:40 +03:00
|
|
|
|
ref_var2; // no-op, but counts as a use and keeps the borrow active until here
|
2014-06-30 08:41:13 +04:00
|
|
|
|
}
|
|
|
|
|
```
|
|
|
|
|
|
|
|
|
|
## Further reading
|
|
|
|
|
|
2024-05-13 11:19:04 +03:00
|
|
|
|
For a deeper-yet-still-fast explanation into Rust and its symbols/keywords, the
|
|
|
|
|
[half-hour to learn Rust](https://fasterthanli.me/articles/a-half-hour-to-learn-rust)
|
|
|
|
|
article by Fasterthanlime explains (almost) everything in a clear and concise way!
|
|
|
|
|
|
2015-01-15 05:14:19 +03:00
|
|
|
|
There’s a lot more to Rust—this is just the basics of Rust so you can understand
|
|
|
|
|
the most important things. To learn more about Rust, read [The Rust Programming
|
|
|
|
|
Language](http://doc.rust-lang.org/book/index.html) and check out the
|
|
|
|
|
[/r/rust](http://reddit.com/r/rust) subreddit. The folks on the #rust channel on
|
|
|
|
|
irc.mozilla.org are also always keen to help newcomers.
|
2014-06-30 08:41:13 +04:00
|
|
|
|
|
|
|
|
|
You can also try out features of Rust with an online compiler at the official
|
2024-04-27 06:47:13 +03:00
|
|
|
|
[Rust Playground](https://play.rust-lang.org) or on the main
|
2014-06-30 08:41:13 +04:00
|
|
|
|
[Rust website](http://rust-lang.org).
|