\n"
"Key points:"
msgstr ""
"
\n"
"ํค ํฌ์ธํธ:"
#: src/basic-syntax/references.md:24
msgid ""
"* Be sure to note the difference between `let mut ref_x: &i32` and `let ref_x:\n"
" &mut i32`. The first one represents a mutable reference which can be bound to\n"
" different values, while the second represents a reference to a mutable value."
msgstr "* `let mut ref_x: &i32`์ `let ref_x: &mut i32`์ ์ฐจ์ด์ ์ ์ฃผ์ ํ์๊ธฐ ๋ฐ๋๋๋ค. ์ฒซ๋ฒ์งธ ๊ฐ์ ๋ค๋ฅธ ๊ฐ์ ๋ฐ์ธ๋ฉ ๋ ์ ์๋ ๊ฐ๋ณ ์ฐธ์กฐ์ด๊ณ , ๋๋ฒ์งธ ๊ฐ์ ๊ฐ๋ณ ๊ฐ์ ๋ํ ์ฐธ์กฐ์
๋๋ค."
#: src/basic-syntax/references-dangling.md:1
msgid "# Dangling References"
msgstr "# ํ์(dangling) ์ฐธ์กฐ"
#: src/basic-syntax/references-dangling.md:3
msgid "Rust will statically forbid dangling references:"
msgstr "๋ฌ์คํธ๋ ํ์(dangling) ์ฐธ์กฐ๋ฅผ ์ปดํ์ผ๋ฌ ๋จ๊ณ์์ ์ฐพ์๋ด๊ณ ๊ธ์งํฉ๋๋ค:"
#: src/basic-syntax/references-dangling.md:5
msgid ""
"```rust,editable,compile_fail\n"
"fn main() {\n"
" let ref_x: &i32;\n"
" {\n"
" let x: i32 = 10;\n"
" ref_x = &x;\n"
" }\n"
" println!(\"ref_x: {ref_x}\");\n"
"}\n"
"```"
msgstr ""
#: src/basic-syntax/references-dangling.md:16
msgid ""
"* A reference is said to \"borrow\" the value it refers to.\n"
"* Rust is tracking the lifetimes of all references to ensure they live long\n"
" enough.\n"
"* We will talk more about borrowing when we get to ownership."
msgstr ""
"* ์ฐธ์กฐ๋ ์ด๋ค ๊ฐ์ \"๋น๋ฆฌ๋\" ๊ฒ์
๋๋ค.\n"
"* ๋ฌ์คํธ๋ ์ฐธ์กฐ ๋์์ ๊ฐ์ด, ๊ทธ ๊ฐ์ ๋ํ ๋ชจ๋ ์ฐธ์กฐ๋ค๋ณด๋ค ๋ ์ค๋ ์ด์์์์ ์ถ์ ํฉ๋๋ค.\n"
"* ์์ ๊ถ์ ๋ํ ์ฃผ์ ๋ฅผ ๋ค๋ฃฐ ๋ ์ด ๋น๋ฆผ์ ๋ํด ๋ ์์ธํ ์ด์ผ๊ธฐ ํ๊ฒ ์ต๋๋ค."
#: src/basic-syntax/slices.md:1
msgid "# Slices"
msgstr "# ์ฌ๋ผ์ด์ค"
#: src/basic-syntax/slices.md:3
msgid "A slice gives you a view into a larger collection:"
msgstr "์ฌ๋ผ์ด์ค๋ ํฐ ์ปฌ๋์
์ ์ผ๋ถ(ํน์ ์ ์ฒด)๋ฅผ ๋ณด์ฌ์ฃผ๋ ๋ทฐ(view)์
๋๋ค:"
#: src/basic-syntax/slices.md:5
msgid ""
"```rust,editable\n"
"fn main() {\n"
" let a: [i32; 6] = [10, 20, 30, 40, 50, 60];\n"
" println!(\"a: {a:?}\");\n"
"\n"
" let s: &[i32] = &a[2..4];\n"
" println!(\"s: {s:?}\");\n"
"}\n"
"```"
msgstr ""
"```rust,editable\n"
"fn main() {\n"
" let a: [i32; 6] = [10, 20, 30, 40, 50, 60];\n"
" println!(\"a: {a:?}\");\n"
"\n"
" let s: &[i32] = &a[2..4];\n"
" println!(\"s: {s:?}\");\n"
"}\n"
"```"
#: src/basic-syntax/slices.md:15
msgid ""
"* Slices borrow data from the sliced type.\n"
"* Question: What happens if you modify `a[3]`?"
msgstr ""
"* ์ฌ๋ผ์ด์ค๋ ๋ค๋ฅธ(์ฌ๋ผ์ด์ค ๋) ํ์
์ผ๋ก๋ถํฐ ๋ฐ์ดํฐ๋ฅผ '๋น๋ ค'์ต๋๋ค.\n"
"* ์ง๋ฌธ: `a[3]`์ ์์ ํ๋ฉด ๋ฌด์จ ์ผ์ด ์์ด๋ ๊น์?"
#: src/basic-syntax/slices.md:20
msgid ""
"* We create a slice by borrowing `a` and specifying the starting and ending indexes in brackets.\n"
"\n"
"* If the slice starts at index 0, Rustโs range syntax allows us to drop the starting index, meaning that `&a[0..a.len()]` and `&a[..a.len()]` are identical.\n"
" \n"
"* The same is true for the last index, so `&a[2..a.len()]` and `&a[2..]` are identical.\n"
"\n"
"* To easily create a slice of the full array, we can therefore use `&a[..]`.\n"
"\n"
"* `s` is a reference to a slice of `i32`s. Notice that the type of `s` (`&[i32]`) no longer mentions the array length. This allows us to perform computation on slices of different sizes.\n"
" \n"
"* Slices always borrow from another object. In this example, `a` has to remain 'alive' (in scope) for at least as long as our slice. \n"
" \n"
"* The question about modifying `a[3]` can spark an interesting discussion, but the answer is that for memory safety reasons\n"
" you cannot do it through `a` after you created a slice, but you can read the data from both `a` and `s` safely. \n"
" More details will be explained in the borrow checker section."
msgstr ""
"* ์ฌ๋ผ์ด์ค๋ ์ฐ์ `a`๋ฅผ ๋น๋ฆฐ๋ค์, ์์๊ณผ ๋ ์ธ๋ฑ์ค๋ฅผ ๋ธ๋ํท(`[]`)์์ ์ง์ ํด์ ๋ง๋ญ๋๋ค.\n"
"\n"
"* ์ฌ๋ผ์ด์ค๊ฐ ์ธ๋ฑ์ค 0๋ถํฐ ์์ํ๋ค๋ฉด ์์ ์ธ๋ฑ์ค๋ ์๋ต ๊ฐ๋ฅํฉ๋๋ค. ์ฆ `&a[0..a.len()]`์ `&a[..a.len()]` ๋ ๋์ผํฉ๋๋ค.\n"
"\n"
"* ๋ง์ง๋ง ์ธ๋ฑ์ค๋ ์๋ต ๊ฐ๋ฅํฉ๋๋ค. ๊ทธ๋์ `&a[2..a.len()]` ์ `&a[2..]`๋ ๋์ผํฉ๋๋ค.\n"
"\n"
"* ๋ฐ๋ผ์ ์ ์ฒด ๋ฐฐ์ด์ ๋ํ ์ฌ๋ผ์ด์ค๋ `&a[..]`๊ฐ ๋ฉ๋๋ค.\n"
"\n"
"* `s`๋ `i32`๋ค๋ก ์ด๋ฃจ์ด์ง ์ฌ๋ผ์ด์ค์ ๋ํ ์ฐธ์กฐ์
๋๋ค. `s`์ ํ์
(`&[i32]`)์ ๋ฐฐ์ด์ ํฌ๊ธฐ๊ฐ ๋น ์ ธ์์์ ์ฃผ๋ชฉํ์๊ธฐ ๋ฐ๋๋๋ค. ์ฆ, ์ฌ๋ผ์ด์ค๋ฅผ ์ด์ฉํ๋ฉด ๋ค์ํ ๊ธธ์ด์ ๋ฐ์ดํฐ๋ฅผ ๋ค๋ฃฐ ์ ์์ต๋๋ค.\n"
"\n"
"* ์ฌ๋ผ์ด์ค๋ ํญ์ ๋ค๋ฅธ ๊ฐ์ฒด๋ก๋ถํฐ '๋น๋ ค' ์ต๋๋ค. ์ด ์์์์ ๊ฐ์ฒด `a`๋ ์ฌ๋ผ์ด์ค `s`๋ณด๋ค ๋ ์ค๋ ์ด์ ์์ด์ผ๋ง ํฉ๋๋ค.\n"
"\n"
"* `a[3]`์ ๊ฐ์ ๋ฐ๊ฟ ์ ์๋๋ ์ง๋ฌธ์ ์ข์ ์ง๋ฌธ์
๋๋ค. ์ฌ๊ธฐ์ ๋ํ ๋ต์ `a`์ `s`๋ฅผ ํตํด ๋ฐ์ดํฐ๋ฅผ ์ฝ์ ์๋ ์์ง๋ง ์์ ํ ์๋ ์์ผ๋ฉฐ, ์ด๋ ๋ฉ๋ชจ๋ฆฌ ์์ ์ ์ํด์๋ผ๋ ๊ฒ์
๋๋ค. ์ ๊ทธ๋ฐ์ง์ ๋ํ ์ข๋ ๊ตฌ์ฒด์ ์ธ ๋ต์ ๋น๋ฆผ ๊ฒ์ฌ ๋ถ๋ถ์์ ์์ธํ ์ค๋ช
ํฉ๋๋ค."
#: src/basic-syntax/string-slices.md:1
msgid "# `String` vs `str`"
msgstr "# `String`๊ณผ `str`"
#: src/basic-syntax/string-slices.md:3
msgid "We can now understand the two string types in Rust:"
msgstr "์ด์ ๋ฌ์คํธ์ ๋ ๊ฐ์ง ๋ฌธ์์ด ํ์
์ ๋ํด์ ์ดํดํด ๋ณด๊ฒ ์ต๋๋ค:"
#: src/basic-syntax/string-slices.md:5
msgid ""
"```rust,editable\n"
"fn main() {\n"
" let s1: &str = \"World\";\n"
" println!(\"s1: {s1}\");\n"
"\n"
" let mut s2: String = String::from(\"Hello \");\n"
" println!(\"s2: {s2}\");\n"
" s2.push_str(s1);\n"
" println!(\"s2: {s2}\");\n"
" \n"
" let s3: &str = &s2[6..];\n"
" println!(\"s3: {s3}\");\n"
"}\n"
"```"
msgstr ""
#: src/basic-syntax/string-slices.md:20
msgid "Rust terminology:"
msgstr "๋ฌ์คํธ ์ฉ์ด:"
#: src/basic-syntax/string-slices.md:22
msgid ""
"* `&str` an immutable reference to a string slice.\n"
"* `String` a mutable string buffer."
msgstr ""
"* `&str`์ ๋ฌธ์์ด ์ฌ๋ผ์ด์ค์ ๋ํ (๋ถ๋ณ) ์ฐธ์กฐ์
๋๋ค.\n"
"* `String`์ ๋ฌธ์์ด์ ๋ด์ ์ ์๋ ๋ฒํผ์
๋๋ค."
#: src/basic-syntax/string-slices.md:27
msgid ""
"* `&str` introduces a string slice, which is an immutable reference to UTF-8 encoded string data \n"
" stored in a block of memory. String literals (`โHelloโ`), are stored in the programโs binary.\n"
"\n"
"* Rustโs `String` type is a wrapper around a vector of bytes. As with a `Vec`, it is owned.\n"
" \n"
"* As with many other types `String::from()` creates a string from a string literal; `String::new()` \n"
" creates a new empty string, to which string data can be added using the `push()` and `push_str()` methods.\n"
"\n"
"* The `format!()` macro is a convenient way to generate an owned string from dynamic values. It \n"
" accepts the same format specification as `println!()`.\n"
" \n"
"* You can borrow `&str` slices from `String` via `&` and optionally range selection.\n"
" \n"
"* For C++ programmers: think of `&str` as `const char*` from C++, but the one that always points \n"
" to a valid string in memory. Rust `String` is a rough equivalent of `std::string` from C++ \n"
" (main difference: it can only contain UTF-8 encoded bytes and will never use a small-string optimization).\n"
" "
msgstr ""
"* `&str`์ ๋ฌธ์์ด ์ฌ๋ผ์ด์ค์ ๋ถ๋ณ ์ฐธ์กฐ์
๋๋ค. ๋ฌ์คํธ์์ ๋ฌธ์์ด์ UTF-8๋ก ์ธ์ฝ๋ฉ๋ ๋ฐ์ดํฐ๋ฅผ ์๋ฏธํฉ๋๋ค. ๋ฌธ์์ด ๋ฆฌํฐ๋ด(`\"Hello\"`)์ ํ๋ก๊ทธ๋จ ๋ฐ์ด๋๋ฆฌ์ ์ ์ฅ๋ฉ๋๋ค.\n"
"\n"
"* ๋ฌ์คํธ์ `String`ํ์
์ ์ค์ ๋ก๋ ๋ฌธ์์ด์ ์ด๋ฃจ๋ ๋ฐ์ดํธ์ ๋ํ ๋ฐฑํฐ(`Vec`)์
๋๋ค. `Vec`๊ฐ `T`๋ฅผ ์์ ํ๊ณ ์๋ฏ์ด, `String`์ด ๊ฐ๋ฆฌํค๊ณ ์๋ ๋ฌธ์์ด์ `String`์ ์์ ์
๋๋ค.\n"
"\n"
"* ๋ค๋ฅธ ๋ง์ ํ์
๋ค์ฒ๋ผ `String::from`๋ ๋ฌธ์์ด ๋ฆฌํฐ๋ด๋ก๋ถํฐ ๋ฌธ์์ด์ ์์ฑํฉ๋๋ค. `String::new()`๋ ์๋ก์ด ๋น ๋ฌธ์์ด์ ์์ฑํฉ๋๋ค. `push()`์ `push_str()`๋ฉ์๋๋ฅผ ์ฌ์ฉํ์ฌ ๋ฌธ์์ด ๋ฐ์ดํฐ๋ฅผ ์ถ๊ฐ ํ ์ ์์ต๋๋ค.\n"
"\n"
"* `format!()` ๋งคํฌ๋ก๋ ๋ณ์์ ๊ฐ์ ๋ฌธ์์ด๋ก ๋ณํํ๋ ํธ๋ฆฌํ ๋ฐฉ๋ฒ์
๋๋ค. ์ด ๋งคํฌ๋ก๋ `println!()` ๋งคํฌ๋ก์ ๋์ผํ ํฌ๋งทํ
ํ์์ ์ง์ํฉ๋๋ค.\n"
"\n"
"* `&`์ ๋ฒ์ ์ฐ์ฐ์๋ฅผ ์ด์ฉํ์ฌ `String`์์ `&str`์ฌ๋ผ์ด์ค๋ฅผ ๋น๋ ค์ฌ ์ ์์ต๋๋ค.\n"
"\n"
"* ๋น์ ์ด C++ ํ๋ก๊ทธ๋๋จธ ๋ผ๋ฉด: `&str`๋ C++์ `const char*`์ ์ ์ฌํ์ง๋ง ํญ์ ์ ํจํ ๋ฌธ์์ด์ ๊ฐ๋ฆฌํจ๋ค๋ ์ ์ด ๋ค๋ฆ
๋๋ค. ๋ฌ์คํธ์ `String`์ C++์ `std::string` ๊ณผ ๋๋ต ๊ฑฐ์ ๋์ผํฉ๋๋ค. (์ฃผ์ ์ฐจ์ด์ : ๋ฌ์คํธ์ `String`์ UTF-8 ์ธ์ฝ๋ฉ ๋ฐ์ดํธ๋ง ํฌํจํ ์ ์์ผ๋ฉฐ ์์ ๋ฌธ์์ด ์ต์ ํ(small-string optimization)๋ ์ฌ์ฉํ์ง ์์ต๋๋ค."
#: src/basic-syntax/functions.md:1
msgid "# Functions"
msgstr "# ํจ์"
#: src/basic-syntax/functions.md:3
msgid "A Rust version of the famous [FizzBuzz](https://en.wikipedia.org/wiki/Fizz_buzz) interview question:"
msgstr "๋ฌ์คํธ ๋ฒ์ ์ [FizzBuzz](https://en.wikipedia.org/wiki/Fizz_buzz) ํจ์์
๋๋ค:"
#: src/basic-syntax/functions.md:5
msgid ""
"```rust,editable\n"
"fn main() {\n"
" fizzbuzz_to(20); // Defined below, no forward declaration needed\n"
"}\n"
"\n"
"fn is_divisible_by(lhs: u32, rhs: u32) -> bool {\n"
" if rhs == 0 {\n"
" return false; // Corner case, early return\n"
" }\n"
" lhs % rhs == 0 // The last expression in a block is the return value\n"
"}\n"
"\n"
"fn fizzbuzz(n: u32) -> () { // No return value means returning the unit type `()`\n"
" match (is_divisible_by(n, 3), is_divisible_by(n, 5)) {\n"
" (true, true) => println!(\"fizzbuzz\"),\n"
" (true, false) => println!(\"fizz\"),\n"
" (false, true) => println!(\"buzz\"),\n"
" (false, false) => println!(\"{n}\"),\n"
" }\n"
"}\n"
"\n"
"fn fizzbuzz_to(n: u32) { // `-> ()` is normally omitted\n"
" for i in 1..=n {\n"
" fizzbuzz(i);\n"
" }\n"
"}\n"
"```"
msgstr ""
"```rust,editable\n"
"fn main() {\n"
" fizzbuzz_to(20); // C/C++ ์ ๋ฌ๋ฆฌ ํธ์ถ๋ถ ํ๋จ์ ์ ์ํด๋ ๋ฌธ์ ์์ต๋๋ค.\n"
"}\n"
"\n"
"fn is_divisible_by(lhs: u32, rhs: u32) -> bool {\n"
" if rhs == 0 {\n"
" return false; // Corner case์ด๋ฏ๋ก ๋ฐํํฉ๋๋ค.\n"
" }\n"
" lhs % rhs == 0 // ๋ง์ง๋ง ํํ์์ ๋ฐํ ๊ฐ์
๋๋ค.(;์์์ ์ฃผ๋ชฉ)\n"
"}\n"
"\n"
"fn fizzbuzz(n: u32) -> () { // `()`๋ ๋ฐํ๊ฐ์ด ์๋ค๋ ๊ฒ์ ์๋ฏธํฉ๋๋ค.\n"
" match (is_divisible_by(n, 3), is_divisible_by(n, 5)) {\n"
" (true, true) => println!(\"fizzbuzz\"),\n"
" (true, false) => println!(\"fizz\"),\n"
" (false, true) => println!(\"buzz\"),\n"
" (false, false) => println!(\"{n}\"),\n"
" }\n"
"}\n"
"\n"
"fn fizzbuzz_to(n: u32) { // `-> ()` ๋ ์ผ๋ฐ์ ์ผ๋ก ์๋ตํฉ๋๋ค.\n"
" for i in 1..=n {\n"
" fizzbuzz(i);\n"
" }\n"
"}\n"
"```"
#: src/basic-syntax/functions.md:35
msgid ""
"* We refer in `main` to a function written below. Neither forward declarations nor headers are necessary. \n"
"* Declaration parameters are followed by a type (the reverse of some programming languages), then a return type.\n"
"* The last expression in a function body (or any block) becomes the return value. Simply omit the `;` at the end of the expression.\n"
"* Some functions have no return value, and return the 'unit type', `()`. The compiler will infer this if the `-> ()` return type is omitted.\n"
"* The range expression in the `for` loop in `fizzbuzz_to()` contains `=n`, which causes it to include the upper bound.\n"
"* The `match` expression in `fizzbuzz()` is doing a lot of work. It is expanded below to show what is happening.\n"
"\n"
" (Type annotations added for clarity, but they can be elided.)\n"
"\n"
" ```rust,ignore\n"
" let by_3: bool = is_divisible_by(n, 3);\n"
" let by_5: bool = is_divisible_by(n, 5);\n"
" let by_35: (bool, bool) = (by_3, by_5);\n"
" match by_35 {\n"
" // ...\n"
" ```\n"
"\n"
" "
msgstr ""
"* `main` ํจ์์์ ๊ทธ ๋ค์์ ์ค๋ ํจ์๋ค์ ์ฌ์ฉํ ์ ์์ต๋๋ค. ์๋จ์ ์ ์ธ์ด๋ ํค๋ ๊ฐ์๊ฑด ํ์ ์์ต๋๋ค.\n"
"* ๋งค๊ฐ๋ณ์๋ฅผ ์ ์ธํ ๋์๋ ์ด๋ฆ์ ๋จผ์ ์ฐ๊ณ , ํ์
์ ๋์ค์ ์๋๋ค. ์ด๋ฆ๊ณผ ํ์
์ `:` ๋ก ๊ตฌ๋ถํฉ๋๋ค. ์ด๋ ์ผ๋ถ ์ธ์ด(์๋ฅผ ๋ค์ด C)์ ๋ฐ๋์์ ์ ์ํ์๊ธฐ ๋ฐ๋๋๋ค. ๋ง์ฐฌ๊ฐ์ง๋ก, ๋ฆฌํด ํ์
๋ ํจ์์ ์์์ด ์๋ ๊ฐ์ฅ ๋ท๋ถ๋ถ์ ์ ์ธํฉ๋๋ค.\n"
"* ํจ์ ๋ณธ๋ฌธ์ ๋ง์ง๋ง ํํ์์ ๋ฐํ ๊ฐ์ด ๋ฉ๋๋ค. ๊ฐ๋จํ, ์ ๋์ ์๋ `;`๋ฅผ ์๋ตํ๋ฉด ๋ฉ๋๋ค.\n"
"* ๋ฐํ๊ฐ์ด ์๋ ํจ์์ ๊ฒฝ์ฐ, ์ ๋ ํ์
`()`์ ๋ฐํํฉ๋๋ค. `-> ()`๊ฐ ์๋ต๋ ๊ฒฝ์ฐ ์ปดํ์ผ๋ฌ๋ ์ด๋ฅผ ์ถ๋ก ํฉ๋๋ค.\n"
"* `fizzbuzz_to()`ํจ์ ๋ด `for` ๋ฐ๋ชฉ๋ฌธ์ ๋ฒ์ ํํ์ ์ค `=n`์ n๊น์ง ํฌํจํ๋ค๋ ์๋ฏธ์
๋๋ค.\n"
"* `fizzbuzz()`ํจ์์ `match` ํํ์์ ๋ง์ ์ผ์ ํฉ๋๋ค. ๋ฌด์จ ์ผ์ด ์ผ์ด๋๋์ง ์กฐ๊ธ ๋ ์ดํดํ๊ธฐ ์ฝ๋๋ก ์๋ ์ฝ๋๋ฅผ ํ์ธํ์๊ธฐ ๋ฐ๋๋๋ค.\n"
"\n"
" (๋ช
ํํ ์ค๋ช
์ ์ํด ํ์
์ด ๋ช
์์ ์ผ๋ก ์ ์ธ ๋์์ง๋ง ์๋ต ๊ฐ๋ฅํฉ๋๋ค.)\n"
"\n"
" ```rust,ignore\n"
" let by_3: bool = is_divisible_by(n, 3);\n"
" let by_5: bool = is_divisible_by(n, 5);\n"
" let by_35: (bool, bool) = (by_3, by_5);\n"
" match by_35 {\n"
" // ...\n"
" ```\n"
"\n"
" "
#: src/basic-syntax/methods.md:1 src/methods.md:1
msgid "# Methods"
msgstr "# ๋ฉ์๋"
#: src/basic-syntax/methods.md:3
msgid ""
"Rust has methods, they are simply functions that are associated with a particular type. The\n"
"first argument of a method is an instance of the type it is associated with:"
msgstr "๋ฌ์คํธ์ ๋ฉ์๋๋ ํน์ ํ์
๊ณผ ์ฐ๊ฒฐ๋ ํจ์์
๋๋ค. ๋ฉ์๋์ ์ฒซ๋ฒ์งธ ์ธ์์ ํ์
์ด ๋ฐ๋ก ๊ทธ ๋ฉ์๋๊ฐ ์ฐ๊ฒฐ๋ ํ์
์
๋๋ค:"
#: src/basic-syntax/methods.md:6
msgid ""
"```rust,editable\n"
"struct Rectangle {\n"
" width: u32,\n"
" height: u32,\n"
"}\n"
"\n"
"impl Rectangle {\n"
" fn area(&self) -> u32 {\n"
" self.width * self.height\n"
" }\n"
"\n"
" fn inc_width(&mut self, delta: u32) {\n"
" self.width += delta;\n"
" }\n"
"}\n"
"\n"
"fn main() {\n"
" let mut rect = Rectangle { width: 10, height: 5 };\n"
" println!(\"old area: {}\", rect.area());\n"
" rect.inc_width(5);\n"
" println!(\"new area: {}\", rect.area());\n"
"}\n"
"```"
msgstr ""
#: src/basic-syntax/methods.md:30
msgid "* We will look much more at methods in today's exercise and in tomorrow's class."
msgstr "* ์ค๋๊ณผ ๋ด์ผ ๊ฐ์์์ ๋ ๋ง์ ๋ฉ์๋ ์ฌ์ฉ๋ฒ์ ๋ค๋ฃฐ ๊ฒ์
๋๋ค."
#: src/basic-syntax/functions-interlude.md:1
msgid "# Function Overloading"
msgstr "# (ํจ์) ์ค๋ฒ๋ก๋ฉ"
#: src/basic-syntax/functions-interlude.md:3
msgid "Overloading is not supported:"
msgstr "์ค๋ฒ๋ก๋ฉ์ ์ง์๋์ง ์์ต๋๋ค:"
#: src/basic-syntax/functions-interlude.md:5
msgid ""
"* Each function has a single implementation:\n"
" * Always takes a fixed number of parameters.\n"
" * Always takes a single set of parameter types.\n"
"* Default values are not supported:\n"
" * All call sites have the same number of arguments.\n"
" * Macros are sometimes used as an alternative."
msgstr ""
"* ๊ฐ๋ณํจ์๋ ๋จ์ผ ๊ตฌํ๋ง ๊ฐ์ต๋๋ค.\n"
" * ํญ์ ๊ณ ์ ๋ ์์ ํ๋ผ๋งคํฐ๋ง ๊ฐ์ต๋๋ค.\n"
" * ํ๋ผ๋งคํฐ๋ค์ ํ์
์ ํญ์ ๊ณ ์ ๋์ด ์์ต๋๋ค.\n"
"* ํ๋ผ๋งคํฐ์ ๊ธฐ๋ณธ ๊ฐ์ ์ง์๋์ง ์์ต๋๋ค.\n"
" * ๋ชจ๋ ํธ์ถ๋ถ์์๋ ๋์ผํ ์์ ์ธ์๋ฅผ ์ค์ ํด์ผํฉ๋๋ค. \n"
" * ์ด๋ฐ ์ฌํญ๋ค์ด ์ ์ฝ์ด ๋ ๊ฒฝ์ฐ, ๋์์ผ๋ก ๋งคํฌ๋ก๋ฅผ ์ฌ์ฉํ๊ธฐ๋ ํฉ๋๋ค."
#: src/basic-syntax/functions-interlude.md:12
msgid "However, function parameters can be generic:"
msgstr "ํ์ง๋ง, ํจ์์ ๋งค๊ฐ๋ณ์๋ ์ ๋ค๋ฆญ์ ์ ์ฉํ ์ ์์ต๋๋ค:"
#: src/basic-syntax/functions-interlude.md:14
msgid ""
"```rust,editable\n"
"fn pick_one(a: T, b: T) -> T {\n"
" if std::process::id() % 2 == 0 { a } else { b }\n"
"}\n"
"\n"
"fn main() {\n"
" println!(\"coin toss: {}\", pick_one(\"heads\", \"tails\"));\n"
" println!(\"cash prize: {}\", pick_one(500, 1000));\n"
"}\n"
"```"
msgstr ""
#: src/basic-syntax/functions-interlude.md:27
msgid ""
"* When using generics, the standard library's `Into` can provide a kind of limited\n"
" polymorphism on argument types. We will see more details in a later section."
msgstr "* ์ ๋ค๋ฆญ์ ์ฌ์ฉํ ๋ ํ์ค ๋ผ์ด๋ธ๋ฌ๋ฆฌ์ `Into`์ ํ์
์ ๋ํ ๋คํ์ฑ์ ์ ๊ณตํ ์ ์์ต๋๋ค. ๋์ค์ ์์ธํ ์ค๋ช
ํ๊ฒ ์ต๋๋ค."
#: src/basic-syntax/functions-interlude.md:30
msgid ""
msgstr ""
#: src/exercises/day-1/morning.md:1
msgid "# Day 1: Morning Exercises"
msgstr "# 1์ผ์ฐจ ์ค์ ์ฐ์ต๋ฌธ์ "
#: src/exercises/day-1/morning.md:3
msgid "In these exercises, we will explore two parts of Rust:"
msgstr "์ด๋ฒ ์ฐ์ต๋ฌธ์ ๋ ๋ฌ์คํธ์ ๋ ๋ถ๋ถ์ ์์๋ณผ ๊ฒ์
๋๋ค:"
#: src/exercises/day-1/morning.md:5
msgid ""
"* Implicit conversions between types.\n"
"\n"
"* Arrays and `for` loops."
msgstr ""
"* ํ์
์ ๋ฌต์์ ๋ณํ.\n"
"\n"
"* ๋ฐฐ์ด๊ณผ `for` ๋ฐ๋ณต๋ฌธ."
#: src/exercises/day-1/morning.md:11
msgid "A few things to consider while solving the exercises:"
msgstr "์ฐ์ต๋ฌธ์ ๋ฅผ ํด๊ฒฐํ๋๋ฐ ๊ณ ๋ คํด์ผ ํ ์ฌํญ๋ค:"
#: src/exercises/day-1/morning.md:13
msgid ""
"* Use a local Rust installation, if possible. This way you can get\n"
" auto-completion in your editor. See the page about [Using Cargo] for details\n"
" on installing Rust.\n"
"\n"
"* Alternatively, use the Rust Playground."
msgstr ""
"* ๊ฐ๋ฅํ๋ค๋ฉด ๋ฌ์คํธ๊ฐ ์ค์น๋ ๋ก์ปฌ ํ๊ฒฝ์์ ์งํํ์ธ์. ๊ทธ๋ฌ๋ ํธ์ด ํ
์คํธ ์๋ํฐ์ ์๋์์ฑ ๊ธฐ๋ฅ์ ๋์์ ๋ฐ์ ์ ์์ด์ ์ข์ต๋๋ค. [์นด๊ณ ์ฌ์ฉํ๊ธฐ][Using Cargo] ์ ์ฐธ์กฐํ์๊ธฐ ๋ฐ๋๋๋ค.\n"
"\n"
"* ํน์ ๋ฌ์คํธ ํ๋ ์ด๊ทธ๋ผ์ด๋๋ฅผ ์ด์ฉํ ์ ์์ต๋๋ค."
#: src/exercises/day-1/morning.md:19
msgid ""
"The code snippets are not editable on purpose: the inline code snippets lose\n"
"their state if you navigate away from the page."
msgstr "ํ์ด์ง ๋ฐ์ผ๋ก ์ด๋ํ ๊ฒฝ์ฐ ์์ฑํ ๋ด์ฉ์ด ์์ค๋๊ธฐ ๋๋ฌธ์ ์ ๊ณต๋๋ ์ฝ๋ ์ค๋ํซ์ ์๋์ ์ผ๋ก ํธ์งํ ์ ์์ต๋๋ค."
#: src/exercises/day-1/morning.md:22 src/exercises/day-1/afternoon.md:11
#: src/exercises/day-2/morning.md:11 src/exercises/day-2/afternoon.md:7
#: src/exercises/day-3/morning.md:7 src/exercises/day-4/morning.md:12
msgid "After looking at the exercises, you can look at the [solutions] provided."
msgstr "์ฐ์ต๋ฌธ์ ๋ฅผ ์ดํด ๋ณธ ํ, ์ ๊ณต๋ [ํด๋ต][solutions]์ ์ดํด๋ณผ ์ ์์ต๋๋ค."
#: src/exercises/day-1/implicit-conversions.md:1
msgid "# Implicit Conversions"
msgstr "# ๋ฌต์์ ํ๋ณํ"
#: src/exercises/day-1/implicit-conversions.md:3
msgid ""
"Rust will not automatically apply _implicit conversions_ between types ([unlike\n"
"C++][3]). You can see this in a program like this:"
msgstr "๋ฌ์คํธ๋ [C++ ์ ๋ค๋ฅด๊ฒ][3] ํ์
๊ฐ *๋ฌต์์ ๋ณํ*์ ์๋์ผ๋ก ์ ์ฉํ์ง ์์ต๋๋ค. ์๋ ์์๋ฅผ ํ์ธํด ๋ณด์ธ์:"
#: src/exercises/day-1/implicit-conversions.md:6
msgid ""
"```rust,editable,compile_fail\n"
"fn multiply(x: i16, y: i16) -> i16 {\n"
" x * y\n"
"}\n"
"\n"
"fn main() {\n"
" let x: i8 = 15;\n"
" let y: i16 = 1000;\n"
"\n"
" println!(\"{x} * {y} = {}\", multiply(x, y));\n"
"}\n"
"```"
msgstr ""
#: src/exercises/day-1/implicit-conversions.md:19
msgid ""
"The Rust integer types all implement the [`From`][1] and [`Into`][2]\n"
"traits to let us convert between them. The `From` trait has a single `from()`\n"
"method and similarly, the `Into` trait has a single `into()` method.\n"
"Implementing these traits is how a type expresses that it can be converted into\n"
"another type."
msgstr "๋ฌ์คํธ์ ์ ์ํ ํ์
์ ๋ชจ๋ [`From`][1] ์ [`Into`][2] ํธ๋ ์์ ๊ตฌํํ๊ณ ์์ผ๋ฉฐ, ์ด๋ฅผ ํตํด ํ์
๋ณํ์ด ์ด๋ฃจ์ด ์ง๋๋ค. `From` ํธ๋ ์์ `from()` ๋ฉ์๋๋ฅผ ๊ฐ์ง๊ณ ์๊ณ , `Into`ํธ๋ ์์ `into()` ๋ฉ์๋๋ฅผ ๊ฐ์ง๊ณ ์์ต๋๋ค. ๋ฌ์คํธ์์๋ `From`๊ณผ `Into` ํธ๋ ์์ ๊ตฌํํจ์ผ๋ก์จ, ํ์
๊ฐ ๋ณํ์ด ๊ฐ๋ฅํ๋ค๋ ๊ฒ์ ํํํฉ๋๋ค."
#: src/exercises/day-1/implicit-conversions.md:25
msgid ""
"The standard library has an implementation of `From for i16`, which means\n"
"that we can convert a variable `x` of type `i8` to an `i16` by calling \n"
"`i16::from(x)`. Or, simpler, with `x.into()`, because `From for i16`\n"
"implementation automatically create an implementation of `Into for i8`."
msgstr "ํ์ค ๋ผ์ด๋ธ๋ฌ๋ฆฌ์๋ `From for i16`๊ฐ ๊ตฌํ๋์ด ์๋๋ฐ ์ด๊ฒ์ `i8` ํ์
์ ๋ณ์ `x`๋ฅผ `i16::from(x)`๋ฅผ ํธ์ถํ์ฌ `i16`ํ์
์ผ๋ก ๋ณํํ ์ ์๋ค๋ ์๋ฏธ์
๋๋ค. ํน์ ๋ ๊ฐ๋จํ๊ฒ `x.into()`๋ฅผ ์ฌ์ฉํ ์๋ ์์ต๋๋ค. ์ด๊ฒ์ด ๊ฐ๋ฅํ ์ด์ ๋ `From for i16` ๊ตฌํ์ ๊ฐ์ง๊ณ ์์ผ๋ฉด `Into for i8` ๊ตฌํ์ด ์๋์ผ๋ก ์์ฑ๋๊ธฐ ๋๋ฌธ์
๋๋ค."
#: src/exercises/day-1/implicit-conversions.md:30
msgid ""
"The same applies for your own `From` implementations for your own types, so it is\n"
"sufficient to only implement `From` to get a respective `Into` implementation automatically."
msgstr "์ด๋ ์ฌ์ฉ์ ์ ์ ํ์
์๋ ๋์ผํ๊ฒ ์ ์ฉ๋๋ ๊ท์น์
๋๋ค. ๋ฐ๋ผ์ `From`๋ง์ ๊ตฌํํด๋ `Into`๊น์ง ์๋์ผ๋ก ๊ตฌํ์ด ๋ฉ๋๋ค."
#: src/exercises/day-1/implicit-conversions.md:33
msgid ""
"1. Execute the above program and look at the compiler error.\n"
"\n"
"2. Update the code above to use `into()` to do the conversion.\n"
"\n"
"3. Change the types of `x` and `y` to other things (such as `f32`, `bool`,\n"
" `i128`) to see which types you can convert to which other types. Try\n"
" converting small types to big types and the other way around. Check the\n"
" [standard library documentation][1] to see if `From` is implemented for\n"
" the pairs you check."
msgstr ""
"1. ์ ์์ ์ฝ๋๋ฅผ ์คํํ๊ณ ์ด๋ค ์ปดํ์ผ ์๋ฌ๊ฐ ๋ฐ์ํ๋์ง ํ์ธํด ๋ณด์ธ์.\n"
"\n"
"2. `into()`๋ฅผ ์ฌ์ฉํ์ฌ ์ฝ๋๋ฅผ ์์ ํ์ธ์.\n"
"\n"
"3. `x`์ `y`๋ฅผ `f32`์ด๋ `bool`, `i128` ๋ฑ์ผ๋ก ๋ฐ๊ฟ์ ํด๋น ํ์
๋ค๋ก ๋ณํ์ด ๋๋์ง ํ์ธํด๋ณด์ธ์. ์์ ์ฌ์ด์ฆ ํ์
์์ ํฐ ์ฌ์ด์ฆ๋ก ๋ณ๊ฒฝํด๋ณด์๊ณ ๊ทธ ๋ฐ๋๋ก๋ ํด๋ณด์ธ์. [ํ์ค ๋ผ์ด๋ธ๋ฌ๋ฆฌ ๋ฌธ์][1]์์ ์๋ํด ๋ณธ ์ผ์ด์ค๊ฐ ๊ตฌํ๋์ด ์๋์ง ํ์ธํด ๋ณด์ธ์."
#: src/exercises/day-1/for-loops.md:1
msgid "# Arrays and `for` Loops"
msgstr "# ๋ฐฐ์ด๊ณผ `for`๋ฐ๋ณต๋ฌธ"
#: src/exercises/day-1/for-loops.md:3
msgid "We saw that an array can be declared like this:"
msgstr "๋ฐฐ์ด์ ์๋์ ๊ฐ์ด ์ ์ธ ํ ์ ์์์ ๋ฐฐ์ ์ต๋๋ค:"
#: src/exercises/day-1/for-loops.md:5
msgid ""
"```rust\n"
"let array = [10, 20, 30];\n"
"```"
msgstr ""
#: src/exercises/day-1/for-loops.md:9
msgid "You can print such an array by asking for its debug representation with `{:?}`:"
msgstr "๋ฐฐ์ด์ ์ถ๋ ฅํ๋ ค๋ฉด `{:?}`๋ฅผ ์๋๋ค:"
#: src/exercises/day-1/for-loops.md:11
msgid ""
"```rust,editable\n"
"fn main() {\n"
" let array = [10, 20, 30];\n"
" println!(\"array: {array:?}\");\n"
"}\n"
"```"
msgstr ""
#: src/exercises/day-1/for-loops.md:18
msgid ""
"Rust lets you iterate over things like arrays and ranges using the `for`\n"
"keyword:"
msgstr "๋ฌ์คํธ์์๋ `for` ํค์๋๋ฅผ ์ฌ์ฉํด ๋ฐฐ์ด์ด๋ ๋ฒ์๋ฅผ ๋ฐ๋ณตํ ์ ์์ต๋๋ค:"
#: src/exercises/day-1/for-loops.md:21
msgid ""
"```rust,editable\n"
"fn main() {\n"
" let array = [10, 20, 30];\n"
" print!(\"Iterating over array:\");\n"
" for n in array {\n"
" print!(\" {n}\");\n"
" }\n"
" println!();\n"
"\n"
" print!(\"Iterating over range:\");\n"
" for i in 0..3 {\n"
" print!(\" {}\", array[i]);\n"
" }\n"
" println!();\n"
"}\n"
"```"
msgstr ""
#: src/exercises/day-1/for-loops.md:38
msgid ""
"Use the above to write a function `pretty_print` which pretty-print a matrix and\n"
"a function `transpose` which will transpose a matrix (turn rows into columns):"
msgstr "์ ์ฝ๋๋ฅผ ์ด์ฉํด์, ํ๋ ฌ์ ์์๊ฒ ์ถ๋ ฅํ๋ `pretty_print`ํจ์์, ํ๋ ฌ์ ์ ์น(ํ๊ณผ ์ด์ ์๋ก ๋ฐ๊พธ๋)์ํค๋ `transpose`ํจ์๋ฅผ ์์ฑํด ๋ณด์๊ธฐ ๋ฐ๋๋๋ค:"
#: src/exercises/day-1/for-loops.md:41
msgid ""
"```bob\n"
" โโก1 2 3โคโ โก1 4 7โค\n"
"\"transpose\"โโข4 5 6โฅโ \"==\"โข2 5 8โฅ\n"
" โโฃ7 8 9โฆโ โฃ3 6 9โฆ\n"
"```"
msgstr ""
#: src/exercises/day-1/for-loops.md:47
msgid "Hard-code both functions to operate on 3 ร 3 matrices."
msgstr "๋ ํจ์ ๋ชจ๋ ํ๋ ฌ์ ํฌ๊ธฐ๋ 3 x 3 ์ผ๋ก ํ๋์ฝ๋ฉ ํฉ๋๋ค."
#: src/exercises/day-1/for-loops.md:49
msgid ""
"Copy the code below to >();\n"
" println!(\"vv: {vv:?}\");\n"
"}\n"
"```"
msgstr ""
#: src/basic-syntax/type-inference.md:46
msgid "[`collect`](https://doc.rust-lang.org/stable/std/iter/trait.Iterator.html#method.collect) relies on `FromIterator`, which [`HashSet`](https://doc.rust-lang.org/std/iter/trait.FromIterator.html) implements."
msgstr "[`collect`](https://doc.rust-lang.org/stable/std/iter/trait.Iterator.html#method.collect)๋ [`HashSet`](https://doc.rust-lang.org/std/iter/trait.FromIterator.html)์ ๊ตฌํํ `FromIterator`์ ์์กดํฉ๋๋ค."
#: src/basic-syntax/static-and-const.md:1
msgid "# Static and Constant Variables"
msgstr "# ์ ์ ๋ณ์(static)๊ณผ ์์(const)"
#: src/basic-syntax/static-and-const.md:3
msgid "Global state is managed with static and constant variables."
msgstr "ํ๋ก๊ทธ๋จ์ ๊ธ๋ก๋ฒ ์ํ๋ ๊ฒฐ๊ตญ ์ ์ ๋ณ์์ ์์๋ก ํํ๋ฉ๋๋ค."
#: src/basic-syntax/static-and-const.md:5
msgid "## `const`"
msgstr "## ์์(`const`)"
#: src/basic-syntax/static-and-const.md:7
msgid "You can declare compile-time constants:"
msgstr "์ปดํ์ผ ์ ๊ฐ์ด ์ ํด์ง๋ ์์๋ฅผ ์ ์ธํ ์ ์์ต๋๋ค:"
#: src/basic-syntax/static-and-const.md:9
msgid ""
"```rust,editable\n"
"const DIGEST_SIZE: usize = 3;\n"
"const ZERO: Option = Some(42);\n"
"\n"
"fn compute_digest(text: &str) -> [u8; DIGEST_SIZE] {\n"
" let mut digest = [ZERO.unwrap_or(0); DIGEST_SIZE];\n"
" for (idx, &b) in text.as_bytes().iter().enumerate() {\n"
" digest[idx % DIGEST_SIZE] = digest[idx % DIGEST_SIZE].wrapping_add(b);\n"
" }\n"
" digest\n"
"}\n"
"\n"
"fn main() {\n"
" let digest = compute_digest(\"Hello\");\n"
" println!(\"Digest: {digest:?}\");\n"
"}\n"
"```"
msgstr ""
#: src/basic-syntax/static-and-const.md:27
msgid "According the the [Rust RFC Book][1] these are inlined upon use."
msgstr "[Rust RFC Book][1]์ ๋ฐ๋ฅด๋ฉด ์์๋, ๊ทธ ์์๊ฐ ์ฌ์ฉ๋๋ ๊ณณ์ ์ธ๋ผ์ธ ๋ฉ๋๋ค."
#: src/basic-syntax/static-and-const.md:29
msgid "## `static`"
msgstr "## ์ ์ ๋ณ์(`static`)"
#: src/basic-syntax/static-and-const.md:31
msgid "You can also declare static variables:"
msgstr "๋ง์ฐฌ๊ฐ์ง๋ก ์ ์ ๋ณ์๋ ์ ์ธํ ์ ์์ต๋๋ค:"
#: src/basic-syntax/static-and-const.md:33
msgid ""
"```rust,editable\n"
"static BANNER: &str = \"Welcome to RustOS 3.14\";\n"
"\n"
"fn main() {\n"
" println!(\"{BANNER}\");\n"
"}\n"
"```"
msgstr ""
"```rust,editable\n"
"static BANNER: &str = \"Welcome to RustOS 3.14\";\n"
"\n"
"fn main() {\n"
" println!(\"{BANNER}\");\n"
"}\n"
"```"
#: src/basic-syntax/static-and-const.md:41
msgid "As noted in the [Rust RFC Book][1], these are not inlined upon use and have an actual associated memory location. This is useful for unsafe and embedded code, and the variable lives through the entirety of the program execution."
msgstr "[Rust RFC Book][1]์์ ์ธ๊ธํ ๋ฐ์ ๊ฐ์ด, ์ ์ ๋ณ์๋ ๋ณ๋์ ๋ฉ๋ชจ๋ฆฌ ๊ณต๊ฐ์ ๊ฐ์ง๋ฉฐ, ์ธ๋ผ์ธ ๋์ง ์์ต๋๋ค. ์ ์ ๋ณ์๋ ์์ ํ์ง ์์(unsafe) ๋ฌ์คํธ์ ์๋ฒ ๋๋ ์์คํ
์ฉ ์ฝ๋์์ ์ ์ฉํฉ๋๋ค. ์ด๋ค์ ์๋ช
์ ํ๋ก๊ทธ๋จ์ด ์ํ๋๋ ์ ์ฒด ์๊ฐ๊ณผ ๋์ผํฉ๋๋ค."
#: src/basic-syntax/static-and-const.md:44
msgid "We will look at mutating static data in the [chapter on Unsafe Rust](../unsafe.md)."
msgstr "๊ฐ๋ณ ์ ์ ๋ฐ์ดํฐ์ ๋ํด์๋ [์์ ํ์ง ์์ ๋ฌ์คํธ](../unsafe.md)์์ ์ดํด๋ด
๋๋ค."
#: src/basic-syntax/static-and-const.md:48
msgid ""
"* Mention that `const` behaves semantically similar to C++'s `constexpr`.\n"
"* `static`, on the other hand, is much more similar to a `const` or mutable global variable in C++.\n"
"* It isn't super common that one would need a runtime evaluated constant, but it is helpful and safer than using a static."
msgstr ""
"* `const`๋ C++์ `constexpr`๊ณผ ๋งค์ฐ ๋น์ทํฉ๋๋ค.\n"
"* ๋ฐ๋ฉด์ `static`์ C++์ `const`๋ ๊ฐ๋ณ ์ ์ ๋ณ์์ ํจ์ฌ ๋ ์ ์ฌํฉ๋๋ค.\n"
"* ํ๋ก๊ทธ๋จ ์ํ์ ๊ทธ ๊ฐ์ด ์ ํด์ง๋ ์์๊ฐ ํ์ํ ๊ฒฝ์ฐ๋ ๋๋ญ
๋๋ค. ๊ทธ๋ฌ๋ ๊ทธ๋ ๋ค๊ณ ํด๋, ์ ์ ๋ณ์๋ฅผ ์ฌ์ฉํ๋ ๊ฒ ๋ณด๋ค๋ ๋ ์ ์ฉํ๊ณ ์์ ํฉ๋๋ค."
#: src/basic-syntax/scopes-shadowing.md:1
msgid "# Scopes and Shadowing"
msgstr "# ๋ฒ์(Scope)์ ์๋์(Shadowing)"
#: src/basic-syntax/scopes-shadowing.md:3
msgid ""
"You can shadow variables, both those from outer scopes and variables from the\n"
"same scope:"
msgstr "ํ์ฌ ๋ฒ์์ ์๋ ๋ณ์์, ๋ฐ๊นฅ ๋ฒ์์ ์๋ ๋ณ์ ๋ชจ๋ ๊ฐ๋ฆด(์๋์)์ ์์ต๋๋ค:"
#: src/basic-syntax/scopes-shadowing.md:6
msgid ""
"```rust,editable\n"
"fn main() {\n"
" let a = 10;\n"
" println!(\"before: {a}\");\n"
"\n"
" {\n"
" let a = \"hello\";\n"
" println!(\"inner scope: {a}\");\n"
"\n"
" let a = true;\n"
" println!(\"shadowed in inner scope: {a}\");\n"
" }\n"
"\n"
" println!(\"after: {a}\");\n"
"}\n"
"```"
msgstr ""
#: src/basic-syntax/scopes-shadowing.md:25
msgid ""
"* Definition: Shadowing is different from mutation, because after shadowing both variable's memory locations exist at the same time. Both are available under the same name, depending where you use it in the code. \n"
"* A shadowing variable can have a different type. \n"
"* Shadowing looks obscure at first, but is convenient for holding on to values after `.unwrap()`.\n"
"* The following code demonstrates why the compiler can't simply reuse memory locations when shadowing an immutable variable in a scope, even if the type does not change."
msgstr ""
"* ์๋์์ ๊ธฐ์กด ๋ณ์์ ์๋ก์ด ๊ฐ์ ํ ๋นํ๋ ๊ฒ์ด ์๋๋๋ค. ์๋์์ ํ๋ฉด ์๋ก์ด ๋ณ์๊ฐ ์๊ธฐ๋ฉฐ, ์ด์ ๋ณ์์ ์ ๋ณ์๋ ๋ฉ๋ชจ๋ฆฌ์ ์๋ก ๋ค๋ฅธ ์์น์ ์กด์ฌํฉ๋๋ค. ๊ทธ ๋ ๋ณ์๋ ๋จ์ง ์ด๋ฆ์ด ๊ฐ์ ๋ฟ์ด๋ฉฐ, ์ฝ๋ ์ค ์ด๋์์ ๊ทธ ์ด๋ฆ์ด ์ฌ์ฉ๋์๋๋์ ๋ฐ๋ผ ์ด๋ค ๋ณ์๋ฅผ ์ง์นญํ๋ ์ง๊ฐ ๊ฒฐ์ ๋ฉ๋๋ค.\n"
"* ์๋์ ์ ํ์
์ ๋ฐ๊ฟ ์ ์์ต๋๋ค.\n"
"* ์ฒ์์ ์๋์์ ๋ณด๋ฉด ์ฝ๋๋ฅผ ๋ ๋ชจํธํ๊ฒ ๋ง๋ ๋ค๊ณ ์๊ฐํ ์ ๋ ์์ต๋๋ค. ๊ทธ๋ฌ๋ ์ค์ ๋ก ์๋์์ ์ด์ฉํ๋ฉด, ์ด๋ค ๋ณ์์์ `.unwrap()` ๋ ๊ฐ์ ์๋ก์ด ๋ณ์์ ๋ด์ ๊ฒฝ์ฐ ์๋ก์ด ์ด๋ฆ์ ์ง์ ํ์ ์์ด ๊ธฐ์กด ์ด๋ฆ์ ์ ์งํ ์ ์์ด์ ํธ๋ฆฌํฉ๋๋ค.\n"
"* ์๋ ์ฝ๋๋ ๋ถ๋ณ ๋ณ์๋ฅผ ์๋์ํ ๋ ํ์
์ด ๋์ผํ๋๋ผ๋ ์ ๋ณ์๊ฐ ์๋ ๋ณ์์ ๋ฉ๋ชจ๋ฆฌ ์์น๋ฅผ ์ฌ์ฌ์ฉ ํ ์ ์๋์ง ๊ทธ ์ด์ ๋ฅผ ๋ณด์ฌ์ค๋๋ค."
#: src/basic-syntax/scopes-shadowing.md:30
msgid ""
"```rust,editable\n"
"fn main() {\n"
" let a = 1;\n"
" let b = &a;\n"
" let a = a + 1;\n"
" println!(\"{a} {b}\");\n"
"}\n"
"```"
msgstr ""
#: src/memory-management.md:1
msgid "# Memory Management"
msgstr "# ๋ฉ๋ชจ๋ฆฌ ๊ด๋ฆฌ"
#: src/memory-management.md:3
msgid "Traditionally, languages have fallen into two broad categories:"
msgstr "์ ํต์ ์ผ๋ก, ๋ ์ข
๋ฅ์ ํ๋ก๊ทธ๋๋ฐ ์ธ์ด๊ฐ ์์ต๋๋ค:"
#: src/memory-management.md:5
msgid ""
"* Full control via manual memory management: C, C++, Pascal, ...\n"
"* Full safety via automatic memory management at runtime: Java, Python, Go, Haskell, ..."
msgstr ""
"* ๋ฉ๋ชจ๋ฆฌ ๊ด๋ฆฌ๊ฐ ํ๋ก๊ทธ๋๋จธ์ ์์ ํ ํต์ ํ์ ์์ง๋ง ์๋(๊ทธ๋์ ์์ ํ์ง ์์ ์ ์๋)์ธ ์ธ์ด: C, C++, Pascal, ...\n"
"* ๋ฉ๋ชจ๋ฆฌ ๊ด๋ฆฌ๊ฐ ๋ฐํ์์ ์ํด ๋๋ฏ๋ก ์์ ํ์ง๋ง ์๋(๊ทธ๋์ ํ๋ก๊ทธ๋๋จธ๊ฐ ๊ฐ์
ํ ์ฌ์ง๊ฐ ์ ๊ฑฐ๋ ์๋)์ธ ์ธ์ด: Java, Python, Go, Haskell, ..."
#: src/memory-management.md:8
msgid "Rust offers a new mix:"
msgstr "๋ฌ์คํธ๋ ์ด ๋์ ํผํฉํ ์๋ก์ด ํํ์ ๋ฉ๋ชจ๋ฆฌ ๊ด๋ฆฌ ๊ธฐ๋ฒ์ ์ ๊ณตํฉ๋๋ค:"
#: src/memory-management.md:10
msgid ""
"> Full control *and* safety via compile time enforcement of correct memory\n"
"> management."
msgstr "> ์ปดํ์ผ ์ ์ฌ๋ฐ๋ฅธ ๋ฉ๋ชจ๋ฆฌ ๊ด๋ฆฌ๋ฅผ ๊ฐ์ ํจ์ผ๋ก์จ ์์ ํ ํต์ ์ ์์ ์ฑ ๋ชจ๋ ์ ๊ณต"
#: src/memory-management.md:13
msgid "It does this with an explicit ownership concept."
msgstr "์ด๋ฅผ ๊ฐ๋ฅํ๊ฒ ํ๋ ๋ฌ์คํธ์ ์ปจ์
์ ๋ช
์์ ์ธ ์์ ๊ถ์
๋๋ค."
#: src/memory-management.md:15
msgid "First, let's refresh how memory management works."
msgstr "์ฐ์ ๋ฉ๋ชจ๋ฆฌ ๊ด๋ฆฌ๊ฐ ์ด๋ค์ง๋ ๋ฐฉ์์ ๋ค์ ์ดํด ๋ณด๊ฒ ์ต๋๋ค."
#: src/memory-management/stack-vs-heap.md:1
msgid "# The Stack vs The Heap"
msgstr "# ์คํ(Stack)๊ณผ ํ(Heap)"
#: src/memory-management/stack-vs-heap.md:3
msgid ""
"* Stack: Continuous area of memory for local variables.\n"
" * Values have fixed sizes known at compile time.\n"
" * Extremely fast: just move a stack pointer.\n"
" * Easy to manage: follows function calls.\n"
" * Great memory locality.\n"
"\n"
"* Heap: Storage of values outside of function calls.\n"
" * Values have dynamic sizes determined at runtime.\n"
" * Slightly slower than the stack: some book-keeping needed.\n"
" * No guarantee of memory locality."
msgstr ""
"* ์คํ: ์ง์ญ ๋ณ์๋ฅผ ์ํ ์ฐ์์ ์ธ ๋ฉ๋ชจ๋ฆฌ ์์ญ\n"
" * ์ฌ๊ธฐ ์ ์ฅ๋๋ ๊ฐ์ ์ปดํ์ผ ์ ๊ฒฐ์ ๋๋ ๊ณ ์ ํฌ๊ธฐ๋ฅผ ๊ฐ์ต๋๋ค. \n"
" * ๋งค์ฐ ๋น ๋ฆ: ๋ฉ๋ชจ๋ฆฌ ํ ๋น/๋ฐํ์ด ๋จ์ง ์คํ ํฌ์ธํฐ์ ์ด๋๋ง์ผ๋ก ๊ตฌํ๋ฉ๋๋ค.\n"
" * ๊ด๋ฆฌ๊ฐ ์ฌ์: ํจ์๊ฐ ํธ์ถ๋๋ฉด ํ ๋น๋๊ณ , ๋ฆฌํดํ๋ฉด ๋ฐํ๋ฉ๋๋ค.\n"
" * ์คํ์ ์๋ ๊ฐ๋ค์ ๋งค์ฐ ๋์ ๋ฉ๋ชจ๋ฆฌ ์ธ์ ์ฑ์ ๊ฐ์ง๋๋ค(_์ญ์ฃผ_: ๊ทธ๋์ ์บ์๋ฅผ ํจ๊ณผ์ ์ผ๋ก ํ์ฉํ ์ ์์ต๋๋ค)\n"
"\n"
"* ํ: ํจ์ ํธ์ถ/๋ฆฌํด๊ณผ ์๊ด ์์ด ์ ์ง๋๋ ๊ฐ์ด ์ ์ฅ๋๋ ๊ณณ\n"
" * ์ฌ๊ธฐ ์ ์ฅ๋๋ ๊ฐ์ ํ๋ก๊ทธ๋จ ์ํ์ ๊ทธ ํฌ๊ธฐ๊ฐ ๊ฒฐ์ ๋ฉ๋๋ค.\n"
" * ์คํ ๋ณด๋ค๋ ๋๋ฆผ: ๋ฉ๋ชจ๋ฆฌ ํ ๋น/๋ฐํ์ ํด์ผ ํ ์ผ์ด ์ข ๋ ์์ต๋๋ค.\n"
" * ๋ฉ๋ชจ๋ฆฌ ์ธ์ ์ฑ์ ๋ณด์ฅํ์ง ์์ต๋๋ค."
#: src/memory-management/stack.md:1
msgid "# Stack Memory"
msgstr "# ์คํ ๋ฉ๋ชจ๋ฆฌ"
#: src/memory-management/stack.md:3
msgid ""
"Creating a `String` puts fixed-sized data on the stack and dynamically sized\n"
"data on the heap:"
msgstr "`String` ํ์
์ ๊ณ ์ ํฌ๊ธฐ ๋ฐ์ดํฐ(_์ญ์ฃผ_: ๋ฌธ์์ด์ ๊ธธ์ด, ๋ฌธ์์ด์ด ์ ์ฅ๋ ๋ฒํผ์ ์ฃผ์ ๋ฑ)๋ ์คํ์ ์ ์ฅํ๊ณ , ๊ฐ๋ณ ํฌ๊ธฐ ๋ฐ์ดํฐ(_์ญ์ฃผ_: ๋ฌธ์์ด ๋ฒํผ)๋ ํ์ ์ ์ฅํฉ๋๋ค:"
#: src/memory-management/stack.md:6
msgid ""
"```rust,editable\n"
"fn main() {\n"
" let s1 = String::from(\"Hello\");\n"
"}\n"
"```"
msgstr ""
#: src/memory-management/stack.md:12
msgid ""
"```bob\n"
" Stack Heap\n"
".- - - - - - - - - - - - - -. .- - - - - - - - - - - - - - - -.\n"
": : : :\n"
": s1 : : :\n"
": +-----------+-------+ : : +----+----+----+----+----+ :\n"
": | ptr | o---+---+-----+-->| H | e | l | l | o | :\n"
": | len | 5 | : : +----+----+----+----+----+ :\n"
": | capacity | 5 | : : :\n"
": +-----------+-------+ : : :\n"
": : `- - - - - - - - - - - - - - - -'\n"
"`- - - - - - - - - - - - - -'\n"
"```"
msgstr ""
#: src/memory-management/stack.md:28
msgid ""
"* Mention that a `String` is backed by a `Vec`, so it has a capacity and length and can grow if mutable via reallocation on the heap.\n"
"\n"
"* If students ask about it, you can mention that the underlying memory is heap allocated using the [System Allocator] and custom allocators can be implemented using the [Allocator API]\n"
"\n"
"* We can inspect the memory layout with `unsafe` code. However, you should point out that this is rightfully unsafe!\n"
"\n"
" ```rust,editable\n"
" fn main() {\n"
" let mut s1 = String::from(\"Hello\");\n"
" s1.push(' ');\n"
" s1.push_str(\"world\");\n"
" // DON'T DO THIS AT HOME! For educational purposes only.\n"
" // String provides no guarantees about its layout, so this could lead to\n"
" // undefined behavior.\n"
" unsafe {\n"
" let (capacity, ptr, len): (usize, usize, usize) = std::mem::transmute(s1);\n"
" println!(\"ptr = {ptr:#x}, len = {len}, capacity = {capacity}\");\n"
" }\n"
" }\n"
" ```"
msgstr ""
"* ๋ฌธ์์ด(`String`)์ ์ค์ ๋ก๋ `Vec`์
๋๋ค. ํฌ๊ธฐ(capacity)์ ํ์ฌ ๊ธธ์ด(length) ์ ๋ณด๋ฅผ ๊ฐ์ง๋ฉฐ, ๋ ํฐ ํฌ๊ธฐ๊ฐ ํ์ํ ๊ฒฝ์ฐ ํ์์ ์ฌ ํ ๋น์ ํฉ๋๋ค.\n"
"\n"
"* ํ์ ๊ธฐ๋ณธ์ ์ผ๋ก [System Allocator]๋ฅผ ํตํด ํ ๋น๋ฉ๋๋ค. ๊ทธ๋ฆฌ๊ณ [Allocator API]๋ฅผ ์ด์ฉํด์ ์ปค์คํ
๋ฉ๋ชจ๋ฆฌ ํ ๋น์๋ฅผ ๋ง๋ค ์๋ ์์ต๋๋ค.\n"
"\n"
"* `unsafe` ์ฝ๋๋ก ๋ฉ๋ชจ๋ฆฌ ๋ ์ด์์์ ์ดํด๋ณผ ์ ์์ต๋๋ค. ๋ฌผ๋ก ์ด ์ฝ๋๊ฐ ์์ ํ์ง ์๋ค๋ ์ ์ ์๋ ค์ฃผ์ธ์!\n"
"\n"
" ```rust,editable\n"
" fn main() {\n"
" let mut s1 = String::from(\"Hello\");\n"
" s1.push(' ');\n"
" s1.push_str(\"world\");\n"
" // DON'T DO THIS AT HOME! For educational purposes only.\n"
" // String provides no guarantees about its layout, so this could lead to\n"
" // undefined behavior.\n"
" unsafe {\n"
" let (capacity, ptr, len): (usize, usize, usize) = std::mem::transmute(s1);\n"
" println!(\"ptr = {ptr:#x}, len = {len}, capacity = {capacity}\");\n"
" }\n"
" }\n"
" ```"
#: src/memory-management/manual.md:1
msgid "# Manual Memory Management"
msgstr "# ์๋ ๋ฉ๋ชจ๋ฆฌ ๊ด๋ฆฌ"
#: src/memory-management/manual.md:3
msgid "You allocate and deallocate heap memory yourself."
msgstr "์ฌ์ฉ์๊ฐ ์ง์ ๋ฉ๋ชจ๋ฆฌ๋ฅผ ํ ๋น, ํด์ ํฉ๋๋ค."
#: src/memory-management/manual.md:5
msgid "If not done with care, this can lead to crashes, bugs, security vulnerabilities, and memory leaks."
msgstr "์กฐ์ฌํ์ง ์์ผ๋ฉด, ์ถฉ๋(crash), ๋ฒ๊ทธ, ๋ณด์์ทจ์ฝ์ฑ ๋ฐ ๋ฉ๋ชจ๋ฆฌ ๋์ถ์ด ๋ฐ์ํ ์ ์์ต๋๋ค."
#: src/memory-management/manual.md:7
msgid "## C Example"
msgstr "## C ์ธ์ด ์์ "
#: src/memory-management/manual.md:9
msgid "You must call `free` on every pointer you allocate with `malloc`:"
msgstr "`malloc`์ผ๋ก ํ ๋นํ๋ ํฌ์ธํฐ๋ง๋ค `free`๋ฅผ ํธ์ถํด์ผ ํฉ๋๋ค:"
#: src/memory-management/manual.md:11
msgid ""
"```c\n"
"void foo(size_t n) {\n"
" int* int_array = (int*)malloc(n * sizeof(int));\n"
" //\n"
" // ... lots of code\n"
" //\n"
" free(int_array);\n"
"}\n"
"```"
msgstr ""
#: src/memory-management/manual.md:21
msgid ""
"Memory is leaked if the function returns early between `malloc` and `free`: the\n"
"pointer is lost and we cannot deallocate the memory."
msgstr "๋ง์ฝ `malloc` ๊ณผ `free` ์ฌ์ด์์ ํจ์๊ฐ ์ผ์ฐ ๋ฐํ๋๋ฉด ๋ฉ๋ชจ๋ฆฌ ๋์ถ์ด ์ผ์ด๋ฉ๋๋ค: ํฌ์ธํฐ๋ฅผ ์์ด๋ฒ๋ฆฌ๊ฒ ๋์ด ๋ฉ๋ชจ๋ฆฌ๋ฅผ ๋ฐํํ ์ ์๊ฒ ๋ฉ๋๋ค."
#: src/memory-management/scope-based.md:1
msgid "# Scope-Based Memory Management"
msgstr "# ๋ฒ์๊ธฐ๋ฐ ๋ฉ๋ชจ๋ฆฌ ๊ด๋ฆฌ"
#: src/memory-management/scope-based.md:3
msgid "Constructors and destructors let you hook into the lifetime of an object."
msgstr "์์ฑ์์ ์๋ฉธ์๋ฅผ ์ฌ์ฉํ์ฌ ๊ฐ์ฒด์ ์๋ช
์ฃผ๊ธฐ์ ๋ฐ๋ผ ๋ฉ๋ชจ๋ฆฌ ํ ๋น/ํด์ ๊ฐ ์ผ์ด๋๋๋ก ํ ์ ์์ต๋๋ค."
#: src/memory-management/scope-based.md:5
msgid ""
"By wrapping a pointer in an object, you can free memory when the object is\n"
"destroyed. The compiler guarantees that this happens, even if an exception is\n"
"raised."
msgstr "ํฌ์ธํฐ๋ฅผ ๊ฐ์ฒด๋ก ๊ฐ์ธ๋๋ก ํ๋ฉด, ๊ทธ ๊ฐ์ฒด๊ฐ ์๋ฉธ๋ ๋ ๊ทธ ํฌ์ธํฐ๊ฐ ๊ฐ๋ฆฌํค๋ ๋ฉ๋ชจ๋ฆฌ๊ฐ ํด์ ๋๋๋ก ํ ์ ์์ต๋๋ค. ์ปดํ์ผ๋ฌ๋ ๊ฐ์ฒด๊ฐ ์๋ฉธ๋ ๋ ๋ฐ๋์ ์๋ฉธ์๊ฐ ํธ์ถ๋๋ ๊ฒ์ ๋ณด์ฅํฉ๋๋ค. ์ฌ์ง์ด๋ ์์ธ(exception)๊ฐ ๋ฐ์(_์ญ์ฃผ_: ํจ์์ ๋ฆฌํด์ด๋ ์ค์ฝํ์ ์ข
๋ฃ ๋ฟ๋ง์ด ์๋๋ผ) ํ๋๋ผ๋์."
#: src/memory-management/scope-based.md:9
msgid ""
"This is often called _resource acquisition is initialization_ (RAII) and gives\n"
"you smart pointers."
msgstr "์ด๋ฅผ ์ข
์ข
RAII (Resource Acquisition Is Initialization)๋ผ๊ณ ํ๋ฉฐ, ์ด๋ฐ ๊ฐ์ฒด๋ ์ผ์ข
์ ์ค๋งํธ ํฌ์ธํฐ ์ญํ ์ ํฉ๋๋ค."
#: src/memory-management/scope-based.md:12
msgid "## C++ Example"
msgstr "## C++ ์์ "
#: src/memory-management/scope-based.md:14
msgid ""
"```c++\n"
"void say_hello(std::unique_ptr person) {\n"
" std::cout << \"Hello \" << person->name << std::endl;\n"
"}\n"
"```"
msgstr ""
#: src/memory-management/scope-based.md:20
msgid ""
"* The `std::unique_ptr` object is allocated on the stack, and points to\n"
" memory allocated on the heap.\n"
"* At the end of `say_hello`, the `std::unique_ptr` destructor will run.\n"
"* The destructor frees the `Person` object it points to."
msgstr ""
"* `std::unique_ptr`๊ฐ์ฒด๋ ์คํ์ ํ ๋น๋๋ฉฐ, ํ์ ํ ๋น๋ ๋ฉ๋ชจ๋ฆฌ๋ฅผ ๊ฐ๋ฆฌํต๋๋ค.\n"
"* `say_hello`ํจ์๊ฐ ๋๋๋ฉด `std::unique_ptr`์ ์๋ฉธ์๊ฐ ์คํ๋ฉ๋๋ค.\n"
"* ์๋ฉธ์๋ `Person` ๊ฐ์ฒด๊ฐ ๊ฐ๋ฆฌํค๋ ๋ฉ๋ชจ๋ฆฌ๋ฅผ ํด์ ํฉ๋๋ค."
#: src/memory-management/scope-based.md:25
msgid "Special move constructors are used when passing ownership to a function:"
msgstr "์ด๋ ์์ฑ์๋ ํจ์ ํธ์ถ ์ ์์ ๊ถ์ ์ ๋ฌํ ๋ ์ฌ์ฉ๋ฉ๋๋ค:"
#: src/memory-management/scope-based.md:27
msgid ""
"```c++\n"
"std::unique_ptr person = find_person(\"Carla\");\n"
"say_hello(std::move(person));\n"
"```"
msgstr ""
#: src/memory-management/garbage-collection.md:1
msgid "# Automatic Memory Management"
msgstr "# ์๋ ๋ฉ๋ชจ๋ฆฌ ๊ด๋ฆฌ"
#: src/memory-management/garbage-collection.md:3
msgid ""
"An alternative to manual and scope-based memory management is automatic memory\n"
"management:"
msgstr "์๋, ์ค์ฝํ๊ธฐ๋ฐ ๋ฉ๋ชจ๋ฆฌ ๊ด๋ฆฌ์ ๋์์ผ๋ก ์๋ ๋ฉ๋ชจ๋ฆฌ ๊ด๋ฆฌ ๋ฐฉ์์ด ์์ต๋๋ค:"
#: src/memory-management/garbage-collection.md:6
msgid ""
"* The programmer never allocates or deallocates memory explicitly.\n"
"* A garbage collector finds unused memory and deallocates it for the programmer."
msgstr ""
"* ๊ฐ๋ฐ์๋ ๋ฉ๋ชจ๋ฆฌ๋ฅผ ๋ช
์์ ์ผ๋ก ํ ๋น/ํด์ ํ์ง ์์ต๋๋ค.\n"
"* ๊ฐ๋น์ง ์ปฌ๋ ํฐ(GC)๋ ์ฌ์ฉ๋์ง ์๋ ๋ฉ๋ชจ๋ฆฌ๋ฅผ ์ฐพ์ ํด์ ํฉ๋๋ค."
#: src/memory-management/garbage-collection.md:9
msgid "## Java Example"
msgstr "## Jave ์์ "
#: src/memory-management/garbage-collection.md:11
msgid "The `person` object is not deallocated after `sayHello` returns:"
msgstr "`person`๊ฐ์ฒด๋ `sayHello`ํจ์ ๋ฐํ ํ์๋ ํด์ ๋์ง ์์ต๋๋ค. (_์ญ์ฃผ_: GC๊ฐ ๋์ค์ ์์์ ํด์ ํฉ๋๋ค.)"
#: src/memory-management/garbage-collection.md:13
msgid ""
"```java\n"
"void sayHello(Person person) {\n"
" System.out.println(\"Hello \" + person.getName());\n"
"}\n"
"```"
msgstr ""
#: src/memory-management/rust.md:1
msgid "# Memory Management in Rust"
msgstr "# ๋ฌ์คํธ์์์ ๋ฉ๋ชจ๋ฆฌ ๊ด๋ฆฌ"
#: src/memory-management/rust.md:3
msgid "Memory management in Rust is a mix:"
msgstr "๋ฌ์คํธ์ ๋ฉ๋ชจ๋ฆฌ ๊ด๋ฆฌ๋ ์ง๊ธ๊น์ง ์ค๋ช
ํ ๋ฐฉ์๋ค์ ํผํฉํด์ ์ฌ์ฉํฉ๋๋ค:"
#: src/memory-management/rust.md:5
msgid ""
"* Safe and correct like Java, but without a garbage collector.\n"
"* Depending on which abstraction (or combination of abstractions) you choose, can be a single unique pointer, reference counted, or atomically reference counted.\n"
"* Scope-based like C++, but the compiler enforces full adherence.\n"
"* A Rust user can choose the right abstraction for the situation, some even have no cost at runtime like C."
msgstr ""
"* ์๋ฐ์ฒ๋ผ ์์ ํ๊ณ ์ ํํฉ๋๋ค. ํ์ง๋ง GC๋ ์์ต๋๋ค.\n"
"* ๋ค์ํ ์ถ์ํ๋ฅผ ์ ๊ณตํฉ๋๋ค: ๋จ์ผ ํฌ์ธํฐ, ์ฐธ์กฐ ์นด์ดํธ, ์ํ ๋ฏน(atomic) ์ฐธ์กฐ ์นด์ดํธ.\n"
"* C++ ์ฒ๋ผ ๋ฒ์(์ค์ฝํ) ๊ธฐ๋ฐ์
๋๋ค. ํ์ง๋ง ์ปดํ์ผ๋ฌ๊ฐ ํจ์ฌ ๋ ์๊ฒฉํฉ๋๋ค.\n"
"* ์ฌ์ฉ์๋ ์ํฉ์ ๋ฐ๋ผ ์ ํฉํ ์ถ์ํ๋ฅผ ์ ํํ ์ ์์ต๋๋ค. ๊ทธ ์ค์๋ C ์ธ์ด ์ฒ๋ผ ๋ฐํ์ ์ค๋ฒํค๋๊ฐ ์๋ ๊ฒ๋ ์์ต๋๋ค."
#: src/memory-management/rust.md:10
msgid "It achieves this by modeling _ownership_ explicitly."
msgstr "๋ฌ์คํธ๋ *์์ ๊ถ*์ ์ธ์ด ์ฐจ์์์ ๋ช
์์ ์ผ๋ก ๋ชจ๋ธ๋ง ํจ์ผ๋ก์จ ์ด๋ฅผ ์ด๋ฃน๋๋ค."
#: src/memory-management/rust.md:14
msgid ""
"* If asked how at this point, you can mention that in Rust this is usually handled by RAII wrapper types such as [Box], [Vec], [Rc], or [Arc]. These encapsulate ownership and memory allocation via various means, and prevent the potential errors in C.\n"
"\n"
"* You may be asked about destructors here, the [Drop] trait is the Rust equivalent."
msgstr ""
"* ์ด ์์ ์์ ๊ทธ๊ฒ ์ด๋ป๊ฒ ๊ฐ๋ฅํ๋๋ ์ง๋ฌธ์ด ์์ผ๋ฉด, ๋ฌ์คํธ์์ ์ด ์์
์ ์ผ๋ฐ์ ์ผ๋ก [Box], [Vec], [Rc] ๋๋ [Arc]์ ๊ฐ์ RAII ํ์
์ ์ํด ์ฒ๋ฆฌ๋๋ค๊ณ ๋ต๋ณํ ์ ์์ต๋๋ค. ์ด๋ค์ ๋ค์ํ ๋ฐฉ๋ฒ์ ํตํด ์์ ๊ถ๊ณผ ๋ฉ๋ชจ๋ฆฌ ํ ๋น์ ๋ํ ๊ตฌ์ฒด์ ์ธ ๋ด์ฉ์์ ์บก์ํํ์ฌ, C ์ธ์ด์๋ค๋ฉด ๋ฐ์ํ ์ ์์์ ๋ค์ํ ์๋ฌ๋ฅผ ๋ง์ต๋๋ค.\n"
"\n"
"* ์๋ฉธ์์ ๋ํ ์ง๋ฌธ๋ ์์ ์ ์์ต๋๋ค. [Drop] ํธ๋ ์์ด ๋ต์
๋๋ค."
#: src/memory-management/comparison.md:1
msgid "# Comparison"
msgstr "# ๋น๊ต"
#: src/memory-management/comparison.md:3
msgid "Here is a rough comparison of the memory management techniques."
msgstr "๋ฉ๋ชจ๋ฆฌ ๊ด๋ฆฌ ๊ธฐ์ ์ ๋๋ต์ ์ธ ๋น๊ต์
๋๋ค."
#: src/memory-management/comparison.md:5
msgid "## Pros of Different Memory Management Techniques"
msgstr "## ๋ฉ๋ชจ๋ฆฌ ๊ด๋ฆฌ ๋ฐฉ๋ฒ ๋ณ ์ฅ์ "
#: src/memory-management/comparison.md:7
msgid ""
"* Manual like C:\n"
" * No runtime overhead.\n"
"* Automatic like Java:\n"
" * Fully automatic.\n"
" * Safe and correct.\n"
"* Scope-based like C++:\n"
" * Partially automatic.\n"
" * No runtime overhead.\n"
"* Compiler-enforced scope-based like Rust:\n"
" * Enforced by compiler.\n"
" * No runtime overhead.\n"
" * Safe and correct."
msgstr ""
"* C์ ๊ฐ์ ์๋ ๊ด๋ฆฌ: \n"
" * ๋ฐํ์ ์ค๋ฒํค๋๊ฐ ์์. \n"
"* JAVA์ ๊ฐ์ ์๋ํ ๊ด๋ฆฌ: \n"
" * ์์ ํ ์๋ํ.\n"
" * ์์ ํ๊ณ ์ ํํจ.\n"
"* C++ ์ ๊ฐ์ ๋ฒ์ ๊ธฐ๋ฐ ๊ด๋ฆฌ: \n"
" * ๋ถ๋ถ ์๋ํ\n"
" * ๋ฐํ์ ์ค๋ฒํค๋๊ฐ ์์.\n"
"* ๋ฌ์คํธ์ ๊ฐ์ ์ปดํ์ผ๋ฌ ์ํ ๋ฒ์ ๊ธฐ๋ฐ ๊ด๋ฆฌ: \n"
" * ์ปดํ์ผ๋ฌ์ ์ํด ์ํ๋ฉ๋๋ค.\n"
" * ๋ฐํ์ ์ค๋ฒํค๋๊ฐ ์์ต๋๋ค. \n"
" * ์์ ํ๊ณ ์ ํํฉ๋๋ค."
#: src/memory-management/comparison.md:20
msgid "## Cons of Different Memory Management Techniques"
msgstr "## ๋ฉ๋ชจ๋ฆฌ ๊ด๋ฆฌ ๋ฐฉ๋ฒ ๋ณ ๋จ์ "
#: src/memory-management/comparison.md:22
msgid ""
"* Manual like C:\n"
" * Use-after-free.\n"
" * Double-frees.\n"
" * Memory leaks.\n"
"* Automatic like Java:\n"
" * Garbage collection pauses.\n"
" * Destructor delays.\n"
"* Scope-based like C++:\n"
" * Complex, opt-in by programmer.\n"
" * Potential for use-after-free.\n"
"* Compiler-enforced and scope-based like Rust:\n"
" * Some upfront complexity.\n"
" * Can reject valid programs."
msgstr ""
"* C์ ๊ฐ์ ์๋ ๊ด๋ฆฌ:\n"
" * ์ฌ์ฉ ํ ํด์ ๋ฌธ์ .\n"
" * ์ด์ค ํด์ ๋ฌธ์ .\n"
" * ๋ฉ๋ชจ๋ฆฌ ๋์ถ ๋ฌธ์ .\n"
"* JAVA์ ๊ฐ์ ์๋ํ ๊ด๋ฆฌ:\n"
" * GC๋์์ผ๋ก ์ธํ ๋ฉ์ถค.\n"
" * ์๋ฉธ์ ์ง์ฐ (_์ญ์ฃผ_: ํน์ ๋ฉ๋ชจ๋ฆฌ๋ฅผ ๋์ด์ ์ฌ์ฉํ์ง ์๋๋ผ๋ ๊ณง๋ฐ๋ก ํด์ ๋์ง ์๊ณ GC๊ฐ ๋์ํ ๋ ๊น์ง ๊ธฐ๋ค๋ ค์ผ ํ๋ค๋ ์ )\n"
"* C++ ์ ๊ฐ์ ๋ฒ์ ๊ธฐ๋ฐ ๊ด๋ฆฌ:\n"
" * ๋ณต์กํ๋ฉฐ, ๊ฐ๋ฐ์์ ์ ํ์ฌํญ์.\n"
" * ์ฌ์ฉ ํ ํด์ ๋ฌธ์ ๊ฐ๋ฅ์ฑ ์์.\n"
"* ๋ฌ์คํธ์ ๊ฐ์ ์ปดํ์ผ๋ฌ๊ฐ ๊ฐ์ ํ๋ ์ํ ๋ฒ์ ๊ธฐ๋ฐ ๊ด๋ฆฌ:\n"
" * ์ฝ๊ฐ์ ์ด๊ธฐ ๋ณต์ก์ฑ.\n"
" * ์ฌ๋ฐ๋ฅธ ํ๋ก๊ทธ๋จ์ด์ง๋ง ์ปดํ์ผ๋ฌ๊ฐ ๊ฑฐ๋ถํ ์ ์์."
#: src/ownership.md:1
msgid "# Ownership"
msgstr "# ์์ ๊ถ"
#: src/ownership.md:3
msgid ""
"All variable bindings have a _scope_ where they are valid and it is an error to\n"
"use a variable outside its scope:"
msgstr "๋ชจ๋ ๋ณ์ ๋ฐ์ธ๋ฉ์ ์ ํจํ \"๋ฒ์(์ค์ฝํ)\"๋ฅผ ๊ฐ์ง๋ฉฐ, ๋ฒ์ ๋ฐ์์ ๋ณ์ ์ฌ์ฉํ๋ฉด ์๋ฌ๊ฐ ๋ฐ์ํฉ๋๋ค:"
#: src/ownership.md:6
msgid ""
"```rust,editable,compile_fail\n"
"struct Point(i32, i32);\n"
"\n"
"fn main() {\n"
" {\n"
" let p = Point(3, 4);\n"
" println!(\"x: {}\", p.0);\n"
" }\n"
" println!(\"y: {}\", p.1);\n"
"}\n"
"```"
msgstr ""
"```rust,editable,compile_fail\n"
"struct Point(i32, i32);\n"
"\n"
"fn main() {\n"
" {\n"
" let p = Point(3, 4);\n"
" println!(\"x: {}\", p.0);\n"
" }\n"
" println!(\"y: {}\", p.1);\n"
"}\n"
"```"
#: src/ownership.md:18
msgid ""
"* At the end of the scope, the variable is _dropped_ and the data is freed.\n"
"* A destructor can run here to free up resources.\n"
"* We say that the variable _owns_ the value."
msgstr ""
"* ์ค์ฝํ๊ฐ ์ข
๋ฃ๋๋ฉด ๋ณ์๋ \"์ญ์ (drop)\"๋์๋ค๊ณ ํ๋ฉฐ ๊ทธ ๋ณ์์ ๋ฐ์ดํฐ๋ ๋ฉ๋ชจ๋ฆฌ์์ ํด์ ๋ฉ๋๋ค.\n"
"* ์ค์ฝํ๊ฐ ์ข
๋ฃ๋ ๋ ๋ค๋ฅธ ๋ฆฌ์์ค๋ฅผ ํด์ ํ๊ธฐ ์ํด ์๋ฉธ์๊ฐ ํธ์ถ๋๋๋ก ํ ์ ์์ต๋๋ค.\n"
"* ์ด๊ฒ์ ๋๊ณ ๋ณ์๊ฐ ๊ฐ์ \"์์ \"ํ๋ค๊ณ ํํํฉ๋๋ค."
#: src/ownership/move-semantics.md:1
msgid "# Move Semantics"
msgstr "# Move ๋ฌธ๋ฒ(Move Semantics)"
#: src/ownership/move-semantics.md:3
msgid "An assignment will transfer ownership between variables:"
msgstr "(๋ณ์์) ํ ๋น์ ์์ ๊ถ์ ๋ณ์ ๊ฐ์ ์ด๋์ํต๋๋ค:"
#: src/ownership/move-semantics.md:5
msgid ""
"```rust,editable\n"
"fn main() {\n"
" let s1: String = String::from(\"Hello!\");\n"
" let s2: String = s1;\n"
" println!(\"s2: {s2}\");\n"
" // println!(\"s1: {s1}\");\n"
"}\n"
"```"
msgstr ""
#: src/ownership/move-semantics.md:14
msgid ""
"* The assignment of `s1` to `s2` transfers ownership.\n"
"* The data was _moved_ from `s1` and `s1` is no longer accessible.\n"
"* When `s1` goes out of scope, nothing happens: it has no ownership.\n"
"* When `s2` goes out of scope, the string data is freed.\n"
"* There is always _exactly_ one variable binding which owns a value."
msgstr ""
"* `s1`์ `s2`์ ํ ๋นํ์ฌ ์์ ๊ถ์ ์ด์ ์ํต๋๋ค.\n"
"* ๋ฐ์ดํฐ๋ `s1`์์ _์ด๋_๋ฉ๋๋ค. ๋ฐ๋ผ์ ํ๋ก๊ทธ๋๋จธ๋ `s1`์ ๋ ์ด์ ์ ๊ทผ ํ ์ ์์ต๋๋ค.\n"
"* `s1`์ ์ค์ฝํ๊ฐ ์ข
๋ฃ๋๋ฉด ์๋ฌด ์ผ๋ ์์ต๋๋ค: ์๋ํ๋ฉด `s1`์ ์๋ฌด๋ฐ ์์ ๊ถ์ด ์๊ธฐ ๋๋ฌธ์
๋๋ค.\n"
"* `s2`์ ์ค์ฝํ๊ฐ ์ข
๋ฃ๋๋ฉด ๋ฌธ์์ด ๋ฐ์ดํฐ๋ ํด์ ๋ฉ๋๋ค.\n"
"* ๊ฐ(๋ฐ์ดํฐ)์ ์์ ๊ถ์ ๊ฐ๋ ๋ณ์๋ ํญ์ *๋จ* ํ๋ ์
๋๋ค."
#: src/ownership/move-semantics.md:22
msgid ""
"* Mention that this is the opposite of the defaults in C++, which copies by value unless you use `std::move` (and the move constructor is defined!).\n"
"\n"
"* In Rust, clones are explicit (by using `clone`)."
msgstr ""
"* ์ด๋ C++๊ณผ ์ ๋ฐ๋ ์์ ์ค๋ช
ํ์ธ์. C++์์๋ ๋ณต์ฌ๊ฐ ๊ธฐ๋ณธ์ด๊ณ , `std::move` ๋ฅผ ์ด์ฉํด์ผ๋ง (๊ทธ๋ฆฌ๊ณ ์ด๋ ์์ฑ์๊ฐ ์ ์๋์ด ์์ด์ผ๋ง!) ์์ ๊ถ ์ด์ ์ด ๋ฉ๋๋ค.\n"
"\n"
"* ๋ฌ์คํธ์์๋ ๋ณต์ฌํ ๋์๋ ๋ช
์์ ์ผ๋ก `clone`์ ์ฌ์ฉํฉ๋๋ค."
#: src/ownership/moved-strings-rust.md:1
msgid "# Moved Strings in Rust"
msgstr "# ๋ฌ์คํธ์์์ ๋ฌธ์์ด ์ด๋(Move)"
#: src/ownership/moved-strings-rust.md:3
msgid ""
"```rust,editable\n"
"fn main() {\n"
" let s1: String = String::from(\"Rust\");\n"
" let s2: String = s1;\n"
"}\n"
"```"
msgstr ""
#: src/ownership/moved-strings-rust.md:10
msgid ""
"* The heap data from `s1` is reused for `s2`.\n"
"* When `s1` goes out of scope, nothing happens (it has been moved from)."
msgstr ""
"* `s1`์ ํ ๋ฐ์ดํฐ๋ `s2`์์ ์ฌ์ฌ์ฉ ๋ฉ๋๋ค.\n"
"* `s1`์ ์ค์ฝํ๊ฐ ์ข
๋ฃ๋๋ฉด ์๋ฌด์ผ๋ ์ผ์ด๋์ง ์์ต๋๋ค.(์ด๋ฏธ ์ด๋๋์์ต๋๋ค.)"
#: src/ownership/moved-strings-rust.md:13
msgid "Before move to `s2`:"
msgstr "`s2`๋ก ์ด๋ ์ ๋ฉ๋ชจ๋ฆฌ:"
#: src/ownership/moved-strings-rust.md:15
msgid ""
"```bob\n"
" Stack Heap\n"
".- - - - - - - - - - - - - -. .- - - - - - - - - - - - - -.\n"
": : : :\n"
": s1 : : :\n"
": +-----------+-------+ : : +----+----+----+----+ :\n"
": | ptr | o---+---+-----+-->| R | u | s | t | :\n"
": | len | 4 | : : +----+----+----+----+ :\n"
": | capacity | 4 | : : :\n"
": +-----------+-------+ : : :\n"
": : `- - - - - - - - - - - - - -'\n"
": :\n"
"`- - - - - - - - - - - - - -'\n"
"```"
msgstr ""
#: src/ownership/moved-strings-rust.md:30
msgid "After move to `s2`:"
msgstr "`s2`๋ก ์ด๋ ํ ๋ฉ๋ชจ๋ฆฌ:"
#: src/ownership/moved-strings-rust.md:32
msgid ""
"```bob\n"
" Stack Heap\n"
".- - - - - - - - - - - - - -. .- - - - - - - - - - - - - -.\n"
": : : :\n"
": s1 \"(inaccessible)\" : : :\n"
": +-----------+-------+ : : +----+----+----+----+ :\n"
": | ptr | o---+---+--+--+-->| R | u | s | t | :\n"
": | len | 4 | : | : +----+----+----+----+ :\n"
": | capacity | 4 | : | : :\n"
": +-----------+-------+ : | : :\n"
": : | `- - - - - - - - - - - - - -'\n"
": s2 : |\n"
": +-----------+-------+ : |\n"
": | ptr | o---+---+--'\n"
": | len | 4 | :\n"
": | capacity | 4 | :\n"
": +-----------+-------+ :\n"
": :\n"
"`- - - - - - - - - - - - - -'\n"
"```"
msgstr ""
#: src/ownership/double-free-modern-cpp.md:1
msgid "# Double Frees in Modern C++"
msgstr "# Modern C++์์ ์ด์คํด์ ๋ฌธ์ "
#: src/ownership/double-free-modern-cpp.md:3
msgid "Modern C++ solves this differently:"
msgstr "Modern C++์ ์ด ๋ฌธ์ ๋ฅผ ๋ค๋ฅด๊ฒ ํด๊ฒฐํฉ๋๋ค:"
#: src/ownership/double-free-modern-cpp.md:5
msgid ""
"```c++\n"
"std::string s1 = \"Cpp\";\n"
"std::string s2 = s1; // Duplicate the data in s1.\n"
"```"
msgstr ""
#: src/ownership/double-free-modern-cpp.md:10
msgid ""
"* The heap data from `s1` is duplicated and `s2` gets its own independent copy.\n"
"* When `s1` and `s2` go out of scope, they each free their own memory."
msgstr ""
"* `s1`์ ํ ๋ฐ์ดํฐ๋ ๋ณต์ ๋๊ณ , `s2`๋ ๋
๋ฆฝ์ ์ธ ๋ณต์ฌ๋ณธ์ ์ป์ต๋๋ค.\n"
"* `s1` ์ `s2`์ ์ค์ฝํ๊ฐ ์ข
๋ฃ๋๋ฉด ๊ฐ๊ฐ์ ๋ฉ๋ชจ๋ฆฌ๊ฐ ํด์ ๋ฉ๋๋ค."
#: src/ownership/double-free-modern-cpp.md:13
msgid "Before copy-assignment:"
msgstr "๋ณต์ฌ ์ :"
#: src/ownership/double-free-modern-cpp.md:16
msgid ""
"```bob\n"
" Stack Heap\n"
".- - - - - - - - - - - - - -. .- - - - - - - - - - - -.\n"
": : : :\n"
": s1 : : :\n"
": +-----------+-------+ : : +----+----+----+ :\n"
": | ptr | o---+---+--+--+-->| C | p | p | :\n"
": | len | 3 | : : +----+----+----+ :\n"
": | capacity | 3 | : : :\n"
": +-----------+-------+ : : :\n"
": : `- - - - - - - - - - - -'\n"
"`- - - - - - - - - - - - - -'\n"
"```"
msgstr ""
#: src/ownership/double-free-modern-cpp.md:30
msgid "After copy-assignment:"
msgstr "๋ณต์ฌ ํ:"
#: src/ownership/double-free-modern-cpp.md:32
msgid ""
"```bob\n"
" Stack Heap\n"
".- - - - - - - - - - - - - -. .- - - - - - - - - - - -.\n"
": : : :\n"
": s1 : : :\n"
": +-----------+-------+ : : +----+----+----+ :\n"
": | ptr | o---+---+--+--+-->| C | p | p | :\n"
": | len | 3 | : : +----+----+----+ :\n"
": | capacity | 3 | : : :\n"
": +-----------+-------+ : : :\n"
": : : :\n"
": s2 : : :\n"
": +-----------+-------+ : : +----+----+----+ :\n"
": | ptr | o---+---+-----+-->| C | p | p | :\n"
": | len | 3 | : : +----+----+----+ :\n"
": | capacity | 3 | : : :\n"
": +-----------+-------+ : : :\n"
": : `- - - - - - - - - - - -'\n"
"`- - - - - - - - - - - - - -'\n"
"```"
msgstr ""
#: src/ownership/moves-function-calls.md:1
msgid "# Moves in Function Calls"
msgstr "# ํจ์ ํธ์ถ์์์ ์ด๋(Move)"
#: src/ownership/moves-function-calls.md:3
msgid ""
"When you pass a value to a function, the value is assigned to the function\n"
"parameter. This transfers ownership:"
msgstr "๊ฐ์ ํจ์์ ์ ๋ฌํ ๋, ๊ทธ ๊ฐ์ ๋งค๊ฐ๋ณ์์ ํ ๋น๋ฉ๋๋ค. ์ด๋ ์์ ๊ถ์ ์ด๋์ด ์ผ์ด๋ฉ๋๋ค:"
#: src/ownership/moves-function-calls.md:6
msgid ""
"```rust,editable\n"
"fn say_hello(name: String) {\n"
" println!(\"Hello {name}\")\n"
"}\n"
"\n"
"fn main() {\n"
" let name = String::from(\"Alice\");\n"
" say_hello(name);\n"
" // say_hello(name);\n"
"}\n"
"```"
msgstr ""
#: src/ownership/moves-function-calls.md:20
msgid ""
"* With the first call to `say_hello`, `main` gives up ownership of `name`. Afterwards, `name` cannot be used anymore within `main`.\n"
"* The heap memory allocated for `name` will be freed at the end of the `say_hello` function.\n"
"* `main` can retain ownership if it passes `name` as a reference (`&name`) and if `say_hello` accepts a reference as a parameter.\n"
"* Alternatively, `main` can pass a clone of `name` in the first call (`name.clone()`).\n"
"* Rust makes it harder than C++ to inadvertently create copies by making move semantics the default, and by forcing programmers to make clones explicit."
msgstr ""
"* `say_hello`ํจ์์ ์ฒซ๋ฒ์งธ ํธ์ถ์ `main`ํจ์๋ ์์ ์ด ๊ฐ์ง `name`์ ๋ํ ์์ ๊ถ์ ํฌ๊ธฐํ๋ฏ๋ก, ์ดํ `main`ํจ์์์๋ `name`์ ์ฌ์ฉํ ์ ์์ต๋๋ค.\n"
"* `name`์ ํ ๋น๋์๋ ํ ๋ฉ๋ชจ๋ฆฌ๋ `say_hello`ํจ์์ ๋์์ ํด์ ๋ฉ๋๋ค.\n"
"* `main`ํจ์์์ `name`์ ์ฐธ์กฐ๋ก ์ ๋ฌ(๋น๋ฆผ)ํ๊ณ (`&name`), `say_hello`์์ ๋งค๊ฐ๋ณ์๋ฅผ ์ฐธ์กฐํ์ผ๋ก ์์ ํ๋ค๋ฉด `main`ํจ์๋ `name`์ ์์ ๊ถ์ ์ ์งํ ์ ์์ต๋๋ค.\n"
"* ๋๋ ์ฒซ๋ฒ์งธ ํธ์ถ ์ `main`ํจ์์์ `name`์ ๋ณต์ ํ์ฌ ์ ๋ฌํ ์๋ ์์ต๋๋ค.(`name.clone()`)\n"
"* ๋ฌ์คํธ๋ ์ด๋์ ๊ธฐ๋ณธ์ผ๋ก ํ๊ณ ๋ณต์ ๋ฅผ ๋ช
์์ ์ผ๋ก ์ ์ธํ๋๋ก ๋ง๋ฌ์ผ๋ก, ์๋์น ์๊ฒ ๋ณต์ฌ๋ณธ์ ๋ง๋๋ ๊ฒ์ด C++์์๋ณด๋ค ์ด๋ ต์ต๋๋ค."
#: src/ownership/copy-clone.md:1
msgid "# Copying and Cloning"
msgstr "# ๋ณต์ฌ(copy)์ ๋ณต์ (clone)"
#: src/ownership/copy-clone.md:3
msgid "While move semantics are the default, certain types are copied by default:"
msgstr "์ด๋์ด ๊ธฐ๋ณธ ์ค์ ์ด์ง๋ง, ํน์ ํ์
์ ๋ณต์ฌ๋ฉ๋๋ค:"
#: src/ownership/copy-clone.md:5
msgid ""
"```rust,editable\n"
"fn main() {\n"
" let x = 42;\n"
" let y = x;\n"
" println!(\"x: {x}\");\n"
" println!(\"y: {y}\");\n"
"}\n"
"```"
msgstr ""
#: src/ownership/copy-clone.md:14
msgid "These types implement the `Copy` trait."
msgstr "์ด๋ฌํ ํ์
๋ค์ `Copy` ํธ๋ ์์ ๊ตฌํํฉ๋๋ค."
#: src/ownership/copy-clone.md:16
msgid "You can opt-in your own types to use copy semantics:"
msgstr "์ง์ ๋ง๋ ํ์
๋ค๋ `Copy`ํธ๋ ์์ ๊ตฌํํ์ฌ ๋ณต์ฌ๋ฅผ ํ ์ ์์ต๋๋ค:"
#: src/ownership/copy-clone.md:18
msgid ""
"```rust,editable\n"
"#[derive(Copy, Clone, Debug)]\n"
"struct Point(i32, i32);\n"
"\n"
"fn main() {\n"
" let p1 = Point(3, 4);\n"
" let p2 = p1;\n"
" println!(\"p1: {p1:?}\");\n"
" println!(\"p2: {p2:?}\");\n"
"}\n"
"```"
msgstr ""
"```rust,editable\n"
"#[derive(Copy, Clone, Debug)]\n"
"struct Point(i32, i32);\n"
"\n"
"fn main() {\n"
" let p1 = Point(3, 4);\n"
" let p2 = p1;\n"
" println!(\"p1: {p1:?}\");\n"
" println!(\"p2: {p2:?}\");\n"
"}\n"
"```"
#: src/ownership/copy-clone.md:30
msgid ""
"* After the assignment, both `p1` and `p2` own their own data.\n"
"* We can also use `p1.clone()` to explicitly copy the data."
msgstr ""
"* ํ ๋น ํ, `p1`์ `p2`๋ ์์ ์ ๋ฐ์ดํฐ๋ฅผ ์์ ํฉ๋๋ค.\n"
"* ๋ช
์์ ์ผ๋ก `p1.clone()`๋ฅผ ์ฌ์ฉํ์ฌ ๋ฐ์ดํฐ๋ฅผ ๋ณต์ฌํ ์ ์์ต๋๋ค."
#: src/ownership/copy-clone.md:35
msgid "Copying and cloning are not the same thing:"
msgstr "๋ณต์ฌ(copy)์ ๋ณต์ (clone)๋ ๊ฐ์ง ์์ต๋๋ค:"
#: src/ownership/copy-clone.md:37
msgid ""
"* Copying refers to bitwise copies of memory regions and does not work on arbitrary objects.\n"
"* Copying does not allow for custom logic (unlike copy constructors in C++).\n"
"* Cloning is a more general operation and also allows for custom behavior by implementing the `Clone` trait.\n"
"* Copying does not work on types that implement the `Drop` trait."
msgstr ""
"* ๋ณต์ฌ๋ ๋ฉ๋ชจ๋ฆฌ์ ๋ด์ฉ์ ๊ทธ๋๋ก ํ ๋ฒ ๋ ๋ง๋๋ ๊ฒ์ ์๋ฏธํ๋ฉฐ, ์๋ฌด ๊ฐ์ฒด์์๋ ๋ค ์ง์ํ์ง๋ ์์ต๋๋ค.\n"
"* ๋ณต์ฌ๋ ์ปค์คํฐ๋ง์ด์ฆ ํ ์ ์์ต๋๋ค. (C++์์ ๋ณต์ฌ ์์ฑ์๋ฅผ ํตํด ๋ณต์ฌ ๋์์ ์์๋ก ๊ตฌํํ ์ ์๋ ๊ฒ๊ณผ ๋น๊ต๊ฐ ๋ฉ๋๋ค.)\n"
"* ๋ณต์ ๋ ๋ณด๋ค ์ผ๋ฐ์ ์ธ ์์
์ด๋ฉฐ, `Clone`ํธ๋ ์์ ๊ตฌํํ์ฌ ๋ณต์ ์ ๋์์ ์ปค์คํฐ๋ง์ด์ฆ ํ ์ ์์ต๋๋ค.\n"
"* `Drop` ํธ๋ ์์ ๊ตฌํํ ํ์
์ ๋ณต์ฌ๋์ง ์์ต๋๋ค."
#: src/ownership/copy-clone.md:42 src/ownership/lifetimes-function-calls.md:29
msgid "In the above example, try the following:"
msgstr "์์ ์์์์ ๋ค์์ ์๋ํด ๋ณด์๊ธฐ ๋ฐ๋๋๋ค:"
#: src/ownership/copy-clone.md:44
msgid ""
"* Add a `String` field to `struct Point`. It will not compile because `String` is not a `Copy` type.\n"
"* Remove `Copy` from the `derive` attribute. The compiler error is now in the `println!` for `p1`.\n"
"* Show that it works if you clone `p1` instead."
msgstr ""
"* `Point`๊ตฌ์กฐ์ฒด์ `String`ํ๋๋ฅผ ์ถ๊ฐํ์ธ์. ์ปดํ์ผ ๋์ง ์์ ๊ฒ์
๋๋ค. ์๋ํ๋ฉด `String`์ `Copy`ํธ๋ ์์ ๊ตฌํํ๊ณ ์์ง ์๊ธฐ ๋๋ฌธ์
๋๋ค.\n"
"* `derive` ์์ฑ์์ `Copy`๋ฅผ ์ ๊ฑฐํด ๋ณด์ธ์. `p1`์ `println!` ํ ๋ ์ปดํ์ผ ์๋ฌ๊ฐ ๋ฐ์ํ ๊ฒ์
๋๋ค.\n"
"* `p1`์ ๋ณต์ ํ๋ฉด ์ ๋์ํจ์ ํ์ธํด ๋ณด์ธ์."
#: src/ownership/copy-clone.md:48
msgid ""
"If students ask about `derive`, it is sufficient to say that this is a way to generate code in Rust\n"
"at compile time. In this case the default implementations of `Copy` and `Clone` traits are generated."
msgstr "๋ง์ฝ ํ์๋ค์ด `derive`์ ๋ํด ๋ฌป๋๋ค๋ฉด, ์ปดํ์ผ ์ ๋ฌ์คํธ์์ ์ฝ๋๋ฅผ ์์ฑํ๋๋ฐฉ๋ฒ์ด๋ผ๊ณ ๋งํ๋ ๊ฒ์ผ๋ก ์ถฉ๋ถํฉ๋๋ค. ์ ๊ฒฝ์ฐ `Copy`์ `Clone` ํธ๋ ์์ ๋ํ ๊ธฐ๋ณธ ๊ตฌํ์ด ์์ฑ๋ฉ๋๋ค."
#: src/ownership/borrowing.md:1
msgid "# Borrowing"
msgstr "# ๋น๋ฆผ(Borrowing)"
#: src/ownership/borrowing.md:3
msgid ""
"Instead of transferring ownership when calling a function, you can let a\n"
"function _borrow_ the value:"
msgstr "ํจ์ ํธ์ถ์ ๊ฐ์ ์์ ๊ถ์ ์ด๋ํ๋ ๋์ ์ ํจ์๊ฐ ๊ฐ์ *๋น๋ ค์ฌ ์* ์์ต๋๋ค:"
#: src/ownership/borrowing.md:6
msgid ""
"```rust,editable\n"
"#[derive(Debug)]\n"
"struct Point(i32, i32);\n"
"\n"
"fn add(p1: &Point, p2: &Point) -> Point {\n"
" Point(p1.0 + p2.0, p1.1 + p2.1)\n"
"}\n"
"\n"
"fn main() {\n"
" let p1 = Point(3, 4);\n"
" let p2 = Point(10, 20);\n"
" let p3 = add(&p1, &p2);\n"
" println!(\"{p1:?} + {p2:?} = {p3:?}\");\n"
"}\n"
"```"
msgstr ""
#: src/ownership/borrowing.md:22
msgid ""
"* The `add` function _borrows_ two points and returns a new point.\n"
"* The caller retains ownership of the inputs."
msgstr ""
"* `add` ํจ์๋ ๋ `Point` ๊ฐ์ฒด ๊ฐ์ _๋น๋ ค_์์ ์๋ก์ด `Point` ๊ฐ์ฒด๋ฅผ ๋ฐํํฉ๋๋ค.\n"
"* `p1`๊ณผ `p2`์ ์์ ๊ถ์ ์ฌ์ ํ ํธ์ถ์(`main`ํจ์)์ ์์ต๋๋ค."
#: src/ownership/borrowing.md:27
msgid "Notes on stack returns:"
msgstr "์คํ์ ํ ๋น๋ ๊ฐ์ ๋ฆฌํดํ๋ ๊ฒ์ ๋ํ ์ฐธ๊ณ :"
#: src/ownership/borrowing.md:28
msgid ""
"* Demonstrate that the return from `add` is cheap because the compiler can eliminate the copy operation. Change the above code to print stack addresses and run it on the [Playground]. In the \"DEBUG\" optimization level, the addresses should change, while they stay the same when changing to the \"RELEASE\" setting:\n"
"\n"
" ```rust,editable\n"
" #[derive(Debug)]\n"
" struct Point(i32, i32);\n"
"\n"
" fn add(p1: &Point, p2: &Point) -> Point {\n"
" let p = Point(p1.0 + p2.0, p1.1 + p2.1);\n"
" println!(\"&p.0: {:p}\", &p.0);\n"
" p\n"
" }\n"
"\n"
" fn main() {\n"
" let p1 = Point(3, 4);\n"
" let p2 = Point(10, 20);\n"
" let p3 = add(&p1, &p2);\n"
" println!(\"&p3.0: {:p}\", &p3.0);\n"
" println!(\"{p1:?} + {p2:?} = {p3:?}\");\n"
" }\n"
" ```\n"
"* The Rust compiler can do return value optimization (RVO).\n"
"* In C++, copy elision has to be defined in the language specification because constructors can have side effects. In Rust, this is not an issue at all. If RVO did not happen, Rust will always performs a simple and efficient `memcpy` copy."
msgstr ""
"* `add`์์ ๊ฐ์ ๋ฐํํ๋ ๊ฒ์ ๋งค์ฐ ๊ฐ์ด ์ธ๋ค๋ ๊ฒ์ ์ค๋ช
ํ์ธ์. ์๋ํ๋ฉด, ์ปดํ์ผ๋ฌ๊ฐ ๋ณต์ฌ ๊ณผ์ ์ ์๋ตํ ์ ์๊ธฐ ๋๋ฌธ์
๋๋ค. ์ ์ฝ๋๋ฅผ ์คํ ์ฃผ์๋ฅผ ์ถ๋ ฅํ๋๋ก ์์ ํ๊ณ [Playground]์์ ์ํํด ๋ณด์ธ์. \\\"๋๋ฒ๊ทธ\\\" ์ต์ ํ ๋ ๋ฒจ์์๋ ์ฃผ์๊ฐ ๋ฐ๋์ง๋ง, \\\"๋ฆด๋ฆฌ์ฆ\\\" ๋ ๋ฒจ์์๋ ๋ฐ๋์ง ์์ต๋๋ค:\n"
"\n"
" ```rust,editable\n"
" #[derive(Debug)]\n"
" struct Point(i32, i32);\n"
"\n"
" fn add(p1: &Point, p2: &Point) -> Point {\n"
" let p = Point(p1.0 + p2.0, p1.1 + p2.1);\n"
" println!(\"&p.0: {:p}\", &p.0);\n"
" p\n"
" }\n"
"\n"
" fn main() {\n"
" let p1 = Point(3, 4);\n"
" let p2 = Point(10, 20);\n"
" let p3 = add(&p1, &p2);\n"
" println!(\"&p3.0: {:p}\", &p3.0);\n"
" println!(\"{p1:?} + {p2:?} = {p3:?}\");\n"
" }\n"
" ```\n"
"* ๋ฌ์คํธ ์ปดํ์ผ๋ฌ๋ ๋ฐํ๊ฐ ์ต์ ํ(RVO)๋ฅผ ์ํํ ์ ์์ต๋๋ค.\n"
"* C++์์ copy elision์ ์์ฑ์์ ๋ถ์ํจ๊ณผ ๊ฐ๋ฅ์ฑ์ด ์์ด ์ธ์ด๋ ๋ฒจ์ ์ ์๊ฐ ํ์ํ์ง๋ง ๋ฌ์คํธ์์๋ ๋ฌธ์ ๊ฐ ๋์ง ์์ต๋๋ค. ๋ง์ฝ RVO๊ฐ ๋ฐ์ํ์ง ์์ผ๋ฉด ๋ฌ์คํธ๋ ํญ์ ๊ฐ๋จํ๊ณ ํจ์จ์ ์ธ `memcpy`๋ณต์ฌ๋ฅผ ์ํํ ๊ฒ์
๋๋ค."
#: src/ownership/shared-unique-borrows.md:1
msgid "# Shared and Unique Borrows"
msgstr "# ๊ณต์ ์ ๊ณ ์ ๋น๋ฆผ"
#: src/ownership/shared-unique-borrows.md:3
msgid "Rust puts constraints on the ways you can borrow values:"
msgstr "๋ฌ์คํธ์์๋ ๊ฐ์ ๋น๋ฆด ๋ ๋ค์๊ณผ ๊ฐ์ ์ ์ฝ์กฐ๊ฑด์ด ์์ต๋๋ค:"
#: src/ownership/shared-unique-borrows.md:5
msgid ""
"* You can have one or more `&T` values at any given time, _or_\n"
"* You can have exactly one `&mut T` value."
msgstr ""
"* ํ๋ฒ์ ํ๋ ์ด์์ `&T` ๊ฐ์ ๊ฐ์ง๊ฑฐ๋, _๋๋_\n"
"* ์ ํํ ํ๋์ `&mut T` ๊ฐ๋ง์ ๊ฐ์ง ์ ์์ต๋๋ค."
#: src/ownership/shared-unique-borrows.md:8
msgid ""
"```rust,editable,compile_fail\n"
"fn main() {\n"
" let mut a: i32 = 10;\n"
" let b: &i32 = &a;\n"
"\n"
" {\n"
" let c: &mut i32 = &mut a;\n"
" *c = 20;\n"
" }\n"
"\n"
" println!(\"a: {a}\");\n"
" println!(\"b: {b}\");\n"
"}\n"
"```"
msgstr ""
"```rust,editable,compile_fail\n"
"fn main() {\n"
" let mut a: i32 = 10;\n"
" let b: &i32 = &a;\n"
"\n"
" {\n"
" let c: &mut i32 = &mut a;\n"
" *c = 20;\n"
" }\n"
"\n"
" println!(\"a: {a}\");\n"
" println!(\"b: {b}\");\n"
"}\n"
"```"
#: src/ownership/shared-unique-borrows.md:25
msgid ""
"* The above code does not compile because `a` is borrowed as mutable (through `c`) and as immutable (through `b`) at the same time.\n"
"* Move the `println!` statement for `b` before the scope that introduces `c` to make the code compile.\n"
"* After that change, the compiler realizes that `b` is only ever used before the new mutable borrow of `a` through `c`. This is a feature of the borrow checker called \"non-lexical lifetimes\"."
msgstr ""
"* ์ ์ฝ๋ ์ปดํ์ผ ๋์ง ์์ต๋๋ค. ์๋ํ๋ฉด `c`๋ `a`๋ฅผ ๊ฐ๋ณ ๋ณ์๋ก ๋น๋ ธ๊ณ , ์ด์ ๋์์ `b`๋ `a`๋ฅผ ๋ถ๋ณ ๋ณ์๋ก ๋น๋ ธ๊ธฐ ๋๋ฌธ์
๋๋ค.\n"
"* `b`์ ๋ํ `println!` ๊ตฌ๋ถ์ `c`๊ฐ ์๋ ์ค์ฝํ ์์ผ๋ก ์ด๋ํ๋ฉด ์ปดํ์ผ์ด ๋ฉ๋๋ค.\n"
"* ์ด๋ ๊ฒ ๋ฐ๊พธ๋ฉด, ์ปดํ์ผ๋ฌ๋ `c`๊ฐ `a`๋ฅผ ๊ฐ๋ณ ๋ณ์๋ก ๋น๋ฆฌ๊ธฐ ์ ์๋ง `b`๊ฐ ์ฌ์ฉ๋๋ค๋ ๊ฒ์ ํ์ธํ ์ ์์ต๋๋ค. ๋น๋ฆผ ๊ฒ์ฌ๊ธฐ์ ์ด๋ฌํ ๊ธฐ๋ฅ์ \"non-lexical lifetime\" ์ด๋ผ๊ณ ํฉ๋๋ค.\n"
" * ๋จ์ํ ์ค์ฝํ๋ง ๋ณด๋ฉด `b`์ ์๋ช
์ `main`ํจ์์ ์ ์ฒด๋ผ๊ณ ์๊ฐํ ์ ์์ต๋๋ค. ๋๋ฌธ์ `c`์ ๋ธ๋ก ์์์๋ `a`์ ๋ํ ๊ฐ๋ณ ๋น๋ฆผ๊ณผ ๋ถ๋ณ ๋น๋ฆผ์ด ๋์์ ์กด์ฌํ๋ ๊ฒ ์ฒ๋ผ ๋ณด์ด๋ฉฐ, ์ด๋ ์ ์ ์ฝ ์กฐ๊ฑด์ ์๋ฐํ๋ ๊ฒ์ผ๋ก ์๊ฐํ ์ ์์ต๋๋ค. ๊ทธ๋ฌ๋ ์ปดํ์ผ๋ฌ๋ `b`๊ฐ `c`๋ธ๋ก์ด ์์๋๊ธฐ ์ ์๋ง ์ฌ์ฉ๋๋ค๋ ์ ์ ์ ๊ทน ํ์ฉํด์ `b`์ ์๋ช
์ `c`๋ธ๋ก์ ์์ ์ ๊น์ง๋ก ์ค์
๋๋ค. ๊ทธ๋ฌ๋ฉด `b`์ `c`์ ์๋ช
์ ๊ฒน์น์ง ์๊ณ , ๋ฐ๋ผ์ ์ ์ฝ ์กฐ๊ฑด์ ์๋ฐํ์ง ์์ต๋๋ค."
#: src/ownership/lifetimes.md:1
msgid "# Lifetimes"
msgstr "# ์๋ช
"
#: src/ownership/lifetimes.md:3
msgid "A borrowed value has a _lifetime_:"
msgstr "๋น๋ ค์จ ๊ฐ์ *์๋ช
*์ ๊ฐ์ต๋๋ค:"
#: src/ownership/lifetimes.md:5
msgid ""
"* The lifetime can be elided: `add(p1: &Point, p2: &Point) -> Point`.\n"
"* Lifetimes can also be explicit: `&'a Point`, `&'document str`.\n"
"* Read `&'a Point` as \"a borrowed `Point` which is valid for at least the\n"
" lifetime `a`\".\n"
"* Lifetimes are always inferred by the compiler: you cannot assign a lifetime\n"
" yourself.\n"
" * Lifetime annotations create constraints; the compiler verifies that there is\n"
" a valid solution."
msgstr ""
"* ์๋ช
์ ์๋ตํ ์ ์์ต๋๋ค: `add(p1: &Point, p2: &Point) -> Point`.\n"
"* ๋ฌผ๋ก ๋ช
์ํ ์๋ ์์ต๋๋ค: `&'a Point`, `&'document str`.\n"
"* `&'a Point` ๋ `Point`์ ์๋ช
์ด ์ต์ํ `'a`๋ผ๋ ์๋ช
๋ณด๋ค๋ ๊ฐ๊ฑฐ๋ ๋ ๊ธธ๋ค๋ ๊ฒ์ ์๋ฏธํฉ๋๋ค.\n"
"* ์๋ช
์ ํญ์ ์ปดํ์ผ๋ฌ๊ฐ ์๋์ผ๋ก ์ถ๋ก ํฉ๋๋ค. ์ง์ ์๋ช
์ ์ง์ ํ ์๋ ์์ต๋๋ค.\n"
" * ์๋ช
ํ๊ธฐ(`'`)์ ์๋ช
์ถ๋ก ์ ์ ์ฝ์กฐ๊ฑด์ด ๋ฉ๋๋ค. ์ปดํ์ผ๋ฌ๋ ์ด ์ ์ฝ์กฐ๊ฑด์ ๋ง์กฑ์ํค๋ ์ ์ํ ์๋ช
์ ์ถ๋ก ํ ์ ์๋์ง ๊ฒ์ฌ๋ฅผ ํฉ๋๋ค."
#: src/ownership/lifetimes-function-calls.md:1
msgid "# Lifetimes in Function Calls"
msgstr "# ํจ์ ํธ์ถ์์์ ์๋ช
"
#: src/ownership/lifetimes-function-calls.md:3
msgid "In addition to borrowing its arguments, a function can return a borrowed value:"
msgstr "ํจ์๋ ์ธ์๋ฅผ ๋น๋ฆฌ๋ ๊ฒ ์ธ์๋ ๋น๋ฆฐ ๊ฐ์ ๋ฐํํ ์ ์์ต๋๋ค:"
#: src/ownership/lifetimes-function-calls.md:5
msgid ""
"```rust,editable\n"
"#[derive(Debug)]\n"
"struct Point(i32, i32);\n"
"\n"
"fn left_most<'a>(p1: &'a Point, p2: &'a Point) -> &'a Point {\n"
" if p1.0 < p2.0 { p1 } else { p2 }\n"
"}\n"
"\n"
"fn main() {\n"
" let p1: Point = Point(10, 10);\n"
" let p2: Point = Point(20, 20);\n"
" let p3: &Point = left_most(&p1, &p2);\n"
" println!(\"left-most point: {:?}\", p3);\n"
"}\n"
"```"
msgstr ""
#: src/ownership/lifetimes-function-calls.md:21
msgid ""
"* `'a` is a generic parameter, it is inferred by the compiler.\n"
"* Lifetimes start with `'` and `'a` is a typical default name.\n"
"* Read `&'a Point` as \"a borrowed `Point` which is valid for at least the\n"
" lifetime `a`\".\n"
" * The _at least_ part is important when parameters are in different scopes."
msgstr ""
"* `'a`๋ ์ ๋ค๋ฆญ ๋งค๊ฐ๋ณ์๋ก ์ปดํ์ผ๋ฌ๋ก์ ์ํด ์ถ๋ก ๋ฉ๋๋ค.\n"
"* ์๋ช
์ ์ด๋ฆ์ `'` ๋ก ์์ํ๋ฉฐ ๋ณดํต `'a`๋ฅผ ๋ง์ด ์๋๋ค.\n"
"* `&'a Point` ๋ `Point`์ ์๋ช
์ด `'a` ์๋ช
๊ณผ ์ต์ํ ๊ฐ๊ฑฐ๋ ๋ ๊ธธ๋ค๋ ๊ฒ์ ์๋ฏธํฉ๋๋ค.\n"
" * ๋งค๊ฐ๋ณ์๋ค์ด ์๋ก ๋ค๋ฅธ ์ค์ฝํ์ ์์ ๊ฒฝ์ฐ \"์ต์ํ\"์ด๋ผ๋ ์กฐ๊ฑด์ด ์ค์ํฉ๋๋ค."
#: src/ownership/lifetimes-function-calls.md:31
msgid ""
"* Move the declaration of `p2` and `p3` into a a new scope (`{ ... }`), resulting in the following code:\n"
" ```rust,ignore\n"
" #[derive(Debug)]\n"
" struct Point(i32, i32);\n"
"\n"
" fn left_most<'a>(p1: &'a Point, p2: &'a Point) -> &'a Point {\n"
" if p1.0 < p2.0 { p1 } else { p2 }\n"
" }\n"
"\n"
" fn main() {\n"
" let p1: Point = Point(10, 10);\n"
" let p3: &Point;\n"
" {\n"
" let p2: Point = Point(20, 20);\n"
" p3 = left_most(&p1, &p2);\n"
" }\n"
" println!(\"left-most point: {:?}\", p3);\n"
" }\n"
" ```\n"
" Note how this does not compile since `p3` outlives `p2`.\n"
"\n"
"* Reset the workspace and change the function signature to `fn left_most<'a, 'b>(p1: &'a Point, p2: &'a Point) -> &'b Point`. This will not compile because the relationship between the lifetimes `'a` and `'b` is unclear.\n"
"* Another way to explain it:\n"
" * Two references to two values are borrowed by a function and the function returns\n"
" another reference.\n"
" * It must have come from one of those two inputs (or from a global variable).\n"
" * Which one is it? The compiler needs to to know, so at the call site the returned reference is not used\n"
" for longer than a variable from where the reference came from."
msgstr ""
"* `p2`์ `p3`๋ฅผ ์๋ก์ด ๋ฒ์(`{...}`)๋ก ์๋ ์ฝ๋์ ๊ฐ์ด ์ด๋ํด ๋ด
๋๋ค:\n"
" ```rust,ignore\n"
" #[derive(Debug)]\n"
" struct Point(i32, i32);\n"
"\n"
" fn left_most<'a>(p1: &'a Point, p2: &'a Point) -> &'a Point {\n"
" if p1.0 < p2.0 { p1 } else { p2 }\n"
" }\n"
"\n"
" fn main() {\n"
" let p1: Point = Point(10, 10);\n"
" let p3: &Point;\n"
" {\n"
" let p2: Point = Point(20, 20);\n"
" p3 = left_most(&p1, &p2);\n"
" }\n"
" println!(\"left-most point: {:?}\", p3);\n"
" }\n"
" ```\n"
" `p3`์ ์๋ช
์ด `p2` ๋ณด๋ค ๊ธธ๊ธฐ ๋๋ฌธ์ ์ด ์์ ๋ ์ปดํ์ผ๋์ง ์์์ ํ์ธํ์๊ธฐ ๋ฐ๋๋๋ค.\n"
"\n"
"* ์์
๊ณต๊ฐ์ ์ด๊ธฐํ ํ ํ ํจ์ ์๊ทธ๋์ฒ๋ฅผ `fn left_most<'a, 'b>(p1: &'a Point, p2: &'a Point) -> &'b Point`๋ก ๋ณ๊ฒฝํด ๋ด
๋๋ค. ์ด ๊ฒฝ์ฐ `'a`์ `'b`์ฌ์ด์ ๊ด๊ณ๊ฐ ๋ถ๋ถ๋ช
ํ๊ธฐ ๋๋ฌธ์ ์ปดํ์ผ ๋์ง ์์ต๋๋ค.\n"
"* ์ด ์๋ฌ๋ฅผ ์ค๋ช
ํ๋ ๋ ๋ค๋ฅธ ๋ฐฉ๋ฒ์ ๋ค์๊ณผ ๊ฐ์ต๋๋ค:\n"
" * ์ด ํจ์๋ ๋ ๊ฐ์ ๋น๋ ค์, ์๋ก์ด ์ฐธ์กฐ๋ฅผ ๋ฐํํฉ๋๋ค.\n"
" * ์ด ๋ฐํ๋ ์ฐธ์กฐ๋ ๋ ์
๋ ฅ ์ค ํ๋๋ก ๋ถํฐ ์์ผ ํฉ๋๋ค. (์๋๋ฉด ์ ์ญ ๋ณ์๋ก ๋ถํฐ)\n"
" * ๋ ์
๋ ฅ ์ค ์ด๋ค ๊ฒ์ผ๊น์? ์ปดํ์ผ๋ฌ๋ ์ด๋ฅผ ์์์ผ ํฉ๋๋ค. ๊ทธ๋์ผ๋ง ํจ์ ํธ์ถ๋ถ์์ ๋ดค์ ๋, ๋ฐํ๋ ์ฐธ์กฐ์ ์๋ช
์ด ์๋ ๊ฐ์ ์๋ช
๋ณด๋ค ๊ธธ์ง ์์์ ํ์ธํ ์ ์๊ธฐ ๋๋ฌธ์
๋๋ค."
#: src/ownership/lifetimes-data-structures.md:1
msgid "# Lifetimes in Data Structures"
msgstr "# ๊ตฌ์กฐ์ฒด์์์ ์๋ช
"
#: src/ownership/lifetimes-data-structures.md:3
msgid "If a data type stores borrowed data, it must be annotated with a lifetime:"
msgstr "์ด๋ค ํ์
์ด ๋น๋ ค์จ ๋ฐ์ดํฐ๋ฅผ ์ ์ฅํ๊ณ ์๋ค๋ฉด, ๋ฐ๋์ ์๋ช
์ ํ์ํด์ผ ํฉ๋๋ค:"
#: src/ownership/lifetimes-data-structures.md:5
msgid ""
"```rust,editable\n"
"#[derive(Debug)]\n"
"struct Highlight<'doc>(&'doc str);\n"
"\n"
"fn erase(text: String) {\n"
" println!(\"Bye {text}!\");\n"
"}\n"
"\n"
"fn main() {\n"
" let text = String::from(\"The quick brown fox jumps over the lazy dog.\");\n"
" let fox = Highlight(&text[4..19]);\n"
" let dog = Highlight(&text[35..43]);\n"
" // erase(text);\n"
" println!(\"{fox:?}\");\n"
" println!(\"{dog:?}\");\n"
"}\n"
"```"
msgstr ""
#: src/ownership/lifetimes-data-structures.md:25
msgid ""
"* In the above example, the annotation on `Highlight` enforces that the data underlying the contained `&str` lives at least as long as any instance of `Highlight` that uses that data.\n"
"* If `text` is consumed before the end of the lifetime of `fox` (or `dog`), the borrow checker throws an error.\n"
"* Types with borrowed data force users to hold on to the original data. This can be useful for creating lightweight views, but it generally makes them somewhat harder to use.\n"
"* When possible, make data structures own their data directly.\n"
"* Some structs with multiple references inside can have more than one lifetime annotation. This can be necessary if there is a need to describe lifetime relationships between the references themselves, in addition to the lifetime of the struct itself. Those are very advanced use cases."
msgstr ""
"* ์์ ์์ ์์ `Highlight`์ ์ด๋
ธํ
์ด์
(`<'doc>`)์ ์ ์ด๋ `Highlight` ์ธ์คํด์ค๊ฐ ์ด์์๋ ๋์์๋ ๊ทธ ๋ด๋ถ์ `&str`๊ฐ ๊ฐ๋ฆฌํค๋ ๋ฐ์ดํฐ ์ญ์ ์ด์์์ด์ผ ํ๋ค๋ ๊ฒ์ ์๋ฏธํฉ๋๋ค.\n"
"* ๋ง์ฝ `text`๊ฐ `fox` (ํน์ `dog`)์ ์๋ช
์ด ๋คํ๊ธฐ ์ ์ `erase`ํจ์ ํธ์ถ ๋ฑ์ผ๋ก ์ฌ๋ผ์ง๊ฒ ๋๋ค๋ฉด ๋น๋ฆผ ๊ฒ์ฌ๊ธฐ๊ฐ ์๋ฌ๋ฅผ ๋ฐ์ํฉ๋๋ค.\n"
"* ๋น๋ฆฐ ๋ฐ์ดํฐ๋ฅผ ๊ฐ์ง๊ณ ์๋ ํ์
์ ์ฌ์ฉ์๋ก ํ์ฌ๊ธ ์๋ณธ ๋ฐ์ดํฐ๋ฅผ ์ ์งํ๋๋ก ๊ฐ์ ํฉ๋๋ค. ์ด๋ฐ ํ์
์ ๊ฒฝ๋ ๋ทฐ(lightweight view)๋ฅผ ๋ง๋๋๋ฐ ์ ์ฉํ์ง๋ง, ์ด ์ ์ฝ ์กฐ๊ฑด ๋๋ฌธ์ ์ด๋ฐ ํ์
์ ์ฌ์ฉํ๋ ๊ฒ์ด ์ฝ์ง๋ง์ ์์ต๋๋ค.\n"
"* ๋ฐ๋ผ์, ๊ฐ๋ฅํ๋ค๋ฉด, ๊ตฌ์กฐ์ฒด๊ฐ ์์ ์ ๋ฐ์ดํฐ๋ฅผ ์ง์ ์์ ํ๋๋ก ํ๋ ๊ฒ์ด ์ข์ต๋๋ค.\n"
"* ํ ๊ตฌ์กฐ์ฒด์์ ์ฌ๋ฌ ์ฐธ์กฐ๊ฐ ์์ผ๋ฉด์, ์ด ์ฐธ์กฐ๋ค์ ์๋ช
์ด ์๋ก ๋ค๋ฅด๊ฒ ์ง์ ๋๋ ๊ฒฝ์ฐ๋ ์์ต๋๋ค. ์ด๋ ์ฐธ์กฐ์ ๊ทธ ๊ตฌ์กฐ์ฒด ๊ฐ์ ๊ด๊ณ ๋ฟ๋ง์ด ์๋๋ผ, ๊ทธ ์ฐธ์กฐ๋ค ์ฌ์ด์ ์๋ช
๊ด๊ณ๋ฅผ ์ค๋ช
ํด์ผ ํ ๊ฒฝ์ฐ์ ํ์ํฉ๋๋ค. ๋งค์ฐ ๊ณ ๊ธ ๊ธฐ์ ์
๋๋ค."
#: src/exercises/day-1/afternoon.md:1
msgid "# Day 1: Afternoon Exercises"
msgstr "# 1์ผ์ฐจ ์คํ ์ฐ์ต๋ฌธ์ "
#: src/exercises/day-1/afternoon.md:3
msgid "We will look at two things:"
msgstr "์ด๋ฒ ์ฐ์ต๋ฌธ์ ๋ ์๋ ๋๊ฐ์ง์
๋๋ค:"
#: src/exercises/day-1/afternoon.md:5
msgid ""
"* A small book library,\n"
"\n"
"* Iterators and ownership (hard)."
msgstr ""
"* ์์ ๋์๊ด\n"
"\n"
"* ๋ฐ๋ณต์์ ์์ ๊ถ (์ด๋ ค์)"
#: src/exercises/day-1/book-library.md:1
msgid "# Designing a Library"
msgstr "# ๋์๊ด ์ค๊ณ"
#: src/exercises/day-1/book-library.md:3
msgid ""
"We will learn much more about structs and the `Vec` type tomorrow. For now,\n"
"you just need to know part of its API:"
msgstr "์ฐ๋ฆฌ๋ ๋ด์ผ ๊ตฌ์กฐ์ฒด์ `Vec`์ ๋ํด ๋ ๋ง์ ๊ฒ์ ๋ฐฐ์ธ ๊ฒ์
๋๋ค. ์ผ๋จ ์ค๋์ API์ ์ผ๋ถ๋ง ์๋ฉด ๋ฉ๋๋ค:"
#: src/exercises/day-1/book-library.md:6
msgid ""
"```rust,editable\n"
"fn main() {\n"
" let mut vec = vec![10, 20];\n"
" vec.push(30);\n"
" println!(\"middle value: {}\", vec[vec.len() / 2]);\n"
" for item in vec.iter() {\n"
" println!(\"item: {item}\");\n"
" }\n"
"}\n"
"```"
msgstr ""
#: src/exercises/day-1/book-library.md:17
msgid ""
"Use this to create a library application. Copy the code below to\n"
",\n"
"}\n"
"\n"
"struct Book {\n"
" title: String,\n"
" year: u16,\n"
"}\n"
"\n"
"impl Book {\n"
" // This is a constructor, used below.\n"
" fn new(title: &str, year: u16) -> Book {\n"
" Book {\n"
" title: String::from(title),\n"
" year,\n"
" }\n"
" }\n"
"}\n"
"\n"
"// This makes it possible to print Book values with {}.\n"
"impl std::fmt::Display for Book {\n"
" fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {\n"
" write!(f, \"{} ({})\", self.title, self.year)\n"
" }\n"
"}\n"
"\n"
"impl Library {\n"
" fn new() -> Library {\n"
" unimplemented!()\n"
" }\n"
"\n"
" //fn len(self) -> usize {\n"
" // unimplemented!()\n"
" //}\n"
"\n"
" //fn is_empty(self) -> bool {\n"
" // unimplemented!()\n"
" //}\n"
"\n"
" //fn add_book(self, book: Book) {\n"
" // unimplemented!()\n"
" //}\n"
"\n"
" //fn print_books(self) {\n"
" // unimplemented!()\n"
" //}\n"
"\n"
" //fn oldest_book(self) -> Option<&Book> {\n"
" // unimplemented!()\n"
" //}\n"
"}\n"
"\n"
"// This shows the desired behavior. Uncomment the code below and\n"
"// implement the missing methods. You will need to update the\n"
"// method signatures, including the \"self\" parameter! You may\n"
"// also need to update the variable bindings within main.\n"
"fn main() {\n"
" let library = Library::new();\n"
"\n"
" //println!(\"Our library is empty: {}\", library.is_empty());\n"
"\n"
" let favorite_book = Book::new(\"Lord of the Rings\", 1954);\n"
" println!(\"Our favorite book {favorite_book} should go in the library\");\n"
" //library.add_book(favorite_book);\n"
" //library.add_book(Book::new(\"Alice's Adventures in Wonderland\", 1865));\n"
" //\n"
" //library.print_books();\n"
" //\n"
" //match library.oldest_book() {\n"
" // Some(book) => println!(\"My oldest book is {book}\"),\n"
" // None => println!(\"My library is empty!\"),\n"
" //}\n"
" //\n"
" //println!(\"Our library has {} books\", library.len());\n"
" for book in library.books {\n"
" println!(\"{book}\");\n"
" }\n"
"}\n"
"```"
msgstr ""
#: src/exercises/day-1/book-library.md:104
msgid "[Solution](solutions-afternoon.md#designing-a-library)"
msgstr "[ํด๋ต](solutions-afternoon.md#designing-a-library)"
#: src/exercises/day-1/iterators-and-ownership.md:1
msgid "# Iterators and Ownership"
msgstr "# ๋ฐ๋ณต์์ ์์ ๊ถ"
#: src/exercises/day-1/iterators-and-ownership.md:3
msgid ""
"The ownership model of Rust affects many APIs. An example of this is the\n"
"[`Iterator`](https://doc.rust-lang.org/std/iter/trait.Iterator.html) and\n"
"[`IntoIterator`](https://doc.rust-lang.org/std/iter/trait.IntoIterator.html)\n"
"traits."
msgstr "๋ฌ์คํธ์ ์์ ๊ถ ๋ชจ๋ธ์ ๋ง์ API์ ๋ฐ์์ด ๋์ด ์์ต๋๋ค. ์๋ฅผ๋ค์ด [`Iterator`](https://doc.rust-lang.org/std/iter/trait.Iterator.html) ์ [`IntoIterator`](https://doc.rust-lang.org/std/iter/trait.IntoIterator.html) ๊ฐ์ ํธ๋ ์์ด ์์ต๋๋ค."
#: src/exercises/day-1/iterators-and-ownership.md:8
msgid "## `Iterator`"
msgstr "## `Iterator`"
#: src/exercises/day-1/iterators-and-ownership.md:10
msgid ""
"Traits are like interfaces: they describe behavior (methods) for a type. The\n"
"`Iterator` trait simply says that you can call `next` until you get `None` back:"
msgstr "ํธ๋ ์์ ํ์
์ ๋ํ ํ๋(๋ฉ์๋)๋ฅผ ์ค๋ช
ํ๋ค๋ ์ ์์ ์ธํฐํ์ด์ค์ ์ ์ฌํฉ๋๋ค. `Iterator`๋ ๋จ์ํ `None`์ด ๋์ฌ๋๊น์ง `next`๋ฅผ ํธ์ถํ๋ ๊ฒ์ด ๊ฐ๋ฅํ๋ค๋ ๊ฒ์ ๋ํ๋ด๋ ํธ๋ ์์
๋๋ค:"
#: src/exercises/day-1/iterators-and-ownership.md:13
msgid ""
"```rust\n"
"pub trait Iterator {\n"
" type Item;\n"
" fn next(&mut self) -> Option;\n"
"}\n"
"```"
msgstr ""
#: src/exercises/day-1/iterators-and-ownership.md:20
msgid "You use this trait like this:"
msgstr "`Iterator` ํธ๋ ์์ ์ด๋ ๊ฒ ์ฌ์ฉํฉ๋๋ค:"
#: src/exercises/day-1/iterators-and-ownership.md:22
msgid ""
"```rust,editable\n"
"fn main() {\n"
" let v: Vec = vec![10, 20, 30];\n"
" let mut iter = v.iter();\n"
"\n"
" println!(\"v[0]: {:?}\", iter.next());\n"
" println!(\"v[1]: {:?}\", iter.next());\n"
" println!(\"v[2]: {:?}\", iter.next());\n"
" println!(\"No more items: {:?}\", iter.next());\n"
"}\n"
"```"
msgstr ""
#: src/exercises/day-1/iterators-and-ownership.md:34
msgid "What is the type returned by the iterator? Test your answer here:"
msgstr "๋ฐ๋ณต์๊ฐ ๋ฐํํ๋ ๊ฐ๋ค์ ํ์
์ด ๋ญ๊น์? ์ฌ๊ธฐ์ ๋ต์ ํ
์คํธ ํด ๋ณด์ธ์:"
#: src/exercises/day-1/iterators-and-ownership.md:36
msgid ""
"```rust,editable,compile_fail\n"
"fn main() {\n"
" let v: Vec = vec![10, 20, 30];\n"
" let mut iter = v.iter();\n"
"\n"
" let v0: Option<..> = iter.next();\n"
" println!(\"v0: {v0:?}\");\n"
"}\n"
"```"
msgstr ""
"```rust,editable,compile_fail\n"
"fn main() {\n"
" let v: Vec = vec![10, 20, 30];\n"
" let mut iter = v.iter();\n"
"\n"
" let v0: Option<..> = iter.next();\n"
" println!(\"v0: {v0:?}\");\n"
"}\n"
"```"
#: src/exercises/day-1/iterators-and-ownership.md:46
msgid "Why is this type used?"
msgstr "์ ์ด๋ฐ ํ์
์ด ์ฌ์ฉ๋๋ ๊ฒ์ผ๊น์?"
#: src/exercises/day-1/iterators-and-ownership.md:48
msgid "## `IntoIterator`"
msgstr "## `IntoIterator`"
#: src/exercises/day-1/iterators-and-ownership.md:50
msgid ""
"The `Iterator` trait tells you how to _iterate_ once you have created an\n"
"iterator. The related trait `IntoIterator` tells you how to create the iterator:"
msgstr "`Iterator` ํธ๋ ์์ ์์ฑ๋ ๋ฐ๋ณต์๋ฅผ *์ฌ์ฉ*ํ๋ ๋ฐฉ๋ฒ์ ์๋ ค์ค๋๋ค. ๋ฐ๋ฉด `IntoIterator` ํธ๋ ์์ ๋ฐ๋ณต์๋ฅผ *์์ฑ*ํ๋ ๋ฐฉ๋ฒ์ ์๋ ค์ค๋๋ค:"
#: src/exercises/day-1/iterators-and-ownership.md:53
msgid ""
"```rust\n"
"pub trait IntoIterator {\n"
" type Item;\n"
" type IntoIter: Iterator- ;\n"
"\n"
" fn into_iter(self) -> Self::IntoIter;\n"
"}\n"
"```"
msgstr ""
#: src/exercises/day-1/iterators-and-ownership.md:62
msgid ""
"The syntax here means that every implementation of `IntoIterator` must\n"
"declare two types:"
msgstr "`IntoIterator`์ ๋ชจ๋ ๊ตฌํ์ ๋ฐ๋์ ๋ค์์ ๋ ํ์
์ ์ ์ธํด์ผํฉ๋๋ค:"
#: src/exercises/day-1/iterators-and-ownership.md:65
msgid ""
"* `Item`: the type we iterate over, such as `i8`,\n"
"* `IntoIter`: the `Iterator` type returned by the `into_iter` method."
msgstr ""
"* `Item`: `i8`๊ณผ ๊ฐ์ด ๋ฐ๋ณต๋๋ ๊ฐ์ ํ์
\n"
"* `IntoIter`: `into_iter` ๋ฉ์๋์์ ๋ฐํ๋๋ `Iterator`ํ์
."
#: src/exercises/day-1/iterators-and-ownership.md:68
msgid ""
"Note that `IntoIter` and `Item` are linked: the iterator must have the same\n"
"`Item` type, which means that it returns `Option
- `"
msgstr "`IntoIter`์๋ `Item`์ด ์ฐ๊ฒฐ๋์ด ์์์ ์ฃผ๋ชฉํ์ธ์. `IntoIter` ๋ฐ๋ณต์๋ `Item` ํ์
์ ๋ฐ์ดํฐ๋ฅผ ๊ฐ๋ฆฌ์ผ์ผ ํฉ๋๋ค. ์ฆ, ๋ฐ๋ณต์๋ `Option
- `์ ๋ฆฌํดํฉ๋๋ค."
#: src/exercises/day-1/iterators-and-ownership.md:71
msgid "Like before, what is the type returned by the iterator?"
msgstr "์ด์ ๊ณผ ๋ง์ฐฌ๊ฐ์ง๋ก, ๋ฐ๋ณต์๊ฐ ๋ฐํํ๋ ํ์
์ ๋ฌด์์
๋๊น?"
#: src/exercises/day-1/iterators-and-ownership.md:73
msgid ""
"```rust,editable,compile_fail\n"
"fn main() {\n"
" let v: Vec
= vec![String::from(\"foo\"), String::from(\"bar\")];\n"
" let mut iter = v.into_iter();\n"
"\n"
" let v0: Option<..> = iter.next();\n"
" println!(\"v0: {v0:?}\");\n"
"}\n"
"```"
msgstr ""
#: src/exercises/day-1/iterators-and-ownership.md:83
msgid "## `for` Loops"
msgstr "## ๋ฐฐ์ด๊ณผ `for` ๋ฐ๋ณต๋ฌธ"
#: src/exercises/day-1/iterators-and-ownership.md:85
msgid ""
"Now that we know both `Iterator` and `IntoIterator`, we can build `for` loops.\n"
"They call `into_iter()` on an expression and iterates over the resulting\n"
"iterator:"
msgstr "์, ์ด์ ์ฐ๋ฆฌ๋ `Iterator`์ `IntoIterator`๋ฅผ ์์์ผ๋ฏ๋ก `for` ๋ฃจํ๋ฅผ ๋ง๋ค ์ ์์ต๋๋ค. `for` ๋ฃจํ๋ `into_iter()`๋ฅผ ํธ์ถํ์ฌ ๋ฐ๋ณต์๋ฅผ ๋ง๋ ๋ค์ ๊ทธ ๋ฐ๋ณต์๋ฅผ ์ด์ฉํ์ฌ ์์๋ค์ ๋ฐ๋ณตํด์ ์ ๊ทผํฉ๋๋ค:"
#: src/exercises/day-1/iterators-and-ownership.md:89
msgid ""
"```rust,editable\n"
"fn main() {\n"
" let v: Vec = vec![String::from(\"foo\"), String::from(\"bar\")];\n"
"\n"
" for word in &v {\n"
" println!(\"word: {word}\");\n"
" }\n"
"\n"
" for word in v {\n"
" println!(\"word: {word}\");\n"
" }\n"
"}\n"
"```"
msgstr ""
#: src/exercises/day-1/iterators-and-ownership.md:103
msgid "What is the type of `word` in each loop?"
msgstr "๋งค ๋ฃจํ์์ `word`์ ํ์
์ ๋ฌด์์
๋๊น?"
#: src/exercises/day-1/iterators-and-ownership.md:105
msgid ""
"Experiment with the code above and then consult the documentation for [`impl\n"
"IntoIterator for\n"
"&Vec`](https://doc.rust-lang.org/std/vec/struct.Vec.html#impl-IntoIterator-for-%26%27a%20Vec%3CT%2C%20A%3E)\n"
"and [`impl IntoIterator for\n"
"Vec`](https://doc.rust-lang.org/std/vec/struct.Vec.html#impl-IntoIterator-for-Vec%3CT%2C%20A%3E)\n"
"to check your answers."
msgstr "์ ์ฝ๋์์ ์คํ ํด ๋ณธ ํ ๋ค์ ๋ฌธ์๋ฅผ ์ฐธ์กฐํด์ ๋ต๋ณ์ ํ์ธํ์๊ธฐ ๋ฐ๋๋๋ค: [`impl IntoIterator for &Vec`](https://doc.rust-lang.org/std/vec/struct.Vec.html#impl-IntoIterator-for-%26%27a%20Vec%3CT%2C%20A%3E), [`impl IntoIterator for Vec`](https://doc.rust-lang.org/std/vec/struct.Vec.html#impl-IntoIterator-for-Vec%3CT%2C%20A%3E)"
#: src/welcome-day-2.md:1
msgid "# Welcome to Day 2"
msgstr "# 2์ผ์ฐจ ๊ฐ์"
#: src/welcome-day-2.md:3
msgid "Now that we have seen a fair amount of Rust, we will continue with:"
msgstr "์๋นํ ๋ถ๋์ ๋ฌ์คํธ์ ๋ํด ๋ณด์๊ณ , ์ด์ด์ ์ค๋ ๊ฐ์๋ฅผ ์งํํ๊ฒ ์ต๋๋ค:"
#: src/welcome-day-2.md:5
msgid ""
"* Structs, enums, methods.\n"
"\n"
"* Pattern matching: destructuring enums, structs, and arrays.\n"
"\n"
"* Control flow constructs: `if`, `if let`, `while`, `while let`, `break`, and\n"
" `continue`.\n"
"\n"
"* The Standard Library: `String`, `Option` and `Result`, `Vec`, `HashMap`, `Rc`\n"
" and `Arc`.\n"
"\n"
"* Modules: visibility, paths, and filesystem hierarchy."
msgstr ""
"* ๊ตฌ์กฐ์ฒด, ์ด๊ฑฐํ, ๋ฉ์๋.\n"
"\n"
"* ํจํด ๋งค์นญ: ์ด๊ฑฐํ, ๊ตฌ์กฐ์ฒด ๊ทธ๋ฆฌ๊ณ ๋ฐฐ์ด ๋ถํด.\n"
"\n"
"* ํ๋ฆ ์ ์ด: `if`, `if let`, `while`, `while let`, `break`, ๊ทธ๋ฆฌ๊ณ `continue`.\n"
"\n"
"* ํ์ค ๋ผ์ด๋ธ๋ฌ๋ฆฌ: `String`, `Option` ๊ณผ `Result`, `Vec`, `HashMap`, `Rc` ๊ทธ๋ฆฌ๊ณ `Arc`.\n"
"\n"
"* ๋ชจ๋: ๊ฐ์์ฑ, ๊ฒฝ๋ก ๋ฐ ํ์ผ ์์คํ
๊ณ์ธต."
#: src/structs.md:1
msgid "# Structs"
msgstr "# ๊ตฌ์กฐ์ฒด"
#: src/structs.md:3
msgid "Like C and C++, Rust has support for custom structs:"
msgstr "C/C++ ์ ๋ง์ฐฌ๊ฐ์ง๋ก ๋ฌ์คํธ๋ ์ปค์คํ
๊ตฌ์กฐ์ฒด๋ฅผ ์ง์ํฉ๋๋ค:"
#: src/structs.md:5
msgid ""
"```rust,editable\n"
"struct Person {\n"
" name: String,\n"
" age: u8,\n"
"}\n"
"\n"
"fn main() {\n"
" let mut peter = Person {\n"
" name: String::from(\"Peter\"),\n"
" age: 27,\n"
" };\n"
" println!(\"{} is {} years old\", peter.name, peter.age);\n"
" \n"
" peter.age = 28;\n"
" println!(\"{} is {} years old\", peter.name, peter.age);\n"
" \n"
" let jackie = Person {\n"
" name: String::from(\"Jackie\"),\n"
" ..peter\n"
" };\n"
" println!(\"{} is {} years old\", jackie.name, jackie.age);\n"
"}\n"
"```"
msgstr ""
#: src/structs.md:29
msgid ""
"
\n"
"Key Points: "
msgstr ""
"
\n"
"ํค ํฌ์ธํธ: "
#: src/structs.md:32
msgid ""
"* Structs work like in C or C++.\n"
" * Like in C++, and unlike in C, no typedef is needed to define a type.\n"
" * Unlike in C++, there is no inheritance between structs.\n"
"* Methods are defined in an `impl` block, which we will see in following slides.\n"
"* This may be a good time to let people know there are different types of structs. \n"
" * Zero-sized structs `e.g., struct Foo;` might be used when implementing a trait on some type but donโt have any data that you want to store in the value itself. \n"
" * The next slide will introduce Tuple structs, used when the field names are not important.\n"
"* The syntax `..peter` allows us to copy the majority of the fields from the old struct without having to explicitly type it all out. It must always be the last element."
msgstr ""
"* ๊ตฌ์กฐ์ฒด๋ C/C++ ์ ์ ์ฌํฉ๋๋ค.\n"
" * C++ ์ ๊ฐ์ง๋ง C์๋ ๋ฌ๋ฆฌ ํ์
์ ์ ์ํ๊ธฐ ์ํด 'typedef'๊ฐ ํ์ํ์ง ์์ต๋๋ค.\n"
" * C++ ์ ๋ฌ๋ฆฌ ๊ตฌ์กฐ์ฒด ๊ฐ ์์์ ์์ต๋๋ค.\n"
"* ๋ฉ์๋๋ `impl`๋ธ๋ก์ ์ ์ ํฉ๋๋ค. ๋ค์ ์ฌ๋ผ์ด๋์์ ํ์ธ ํ ์ ์์ต๋๋ค.\n"
"* ์ฌ๋๋ค์๊ฒ ๋ค๋ฅธ ์ข
๋ฅ์ ๊ตฌ์กฐ์ฒด๊ฐ ์์์ ์๊ฒ ํ๊ธฐ์ ์ข์ ์๊ฐ์ผ ๊ฒ์
๋๋ค.\n"
" * 0 ํฌ๊ธฐ ๊ตฌ์กฐ์ฒด(์: `struct Foo;`)๋ ๋ฐ์ดํฐ๋ฅผ ๊ฐ์ง๊ณ ์์ง ์์ง๋ง ํน์ ํ์
์ ํธ๋ ์์ ๊ตฌํํ ๋ ์ ์ฉํฉ๋๋ค.\n"
" * ๋ค์ ์ฌ๋ผ์ด๋์์๋ ํ๋ ์ด๋ฆ์ด ๋ ์ค์ํ ๋ ์ฌ์ฉํ ์ ์๋ ํํ ๊ตฌ์กฐ์ฒด๋ฅผ ์๊ฐํฉ๋๋ค.\n"
"* `..peter` ๋ฌธ๋ฒ์ ํ ๊ตฌ์กฐ์ฒด์์ ๋ค๋ฅธ ๊ตฌ์กฐ์ฒด๋ก ๋๋ถ๋ถ์ ๊ฐ์ ๋ณต์ฌํ๋ ค๊ณ ํ๋ ๊ฒฝ์ฐ์ ํ๋ํ๋ ํ์ดํํ๋ ์๊ณ ๋ฅผ ๋์ด์ค๋๋ค. ๋ฐ๋์ ๋งจ ๋ง์ง๋ง์ ์์ผ ํฉ๋๋ค."
#: src/structs/tuple-structs.md:1
msgid "# Tuple Structs"
msgstr "# ํํ"
#: src/structs/tuple-structs.md:3
msgid "If the field names are unimportant, you can use a tuple struct:"
msgstr "๊ฐ ํ๋ ์ด๋ฆ์ด ์ค์ํ์ง ์๋ค๋ฉด ํํ ๊ตฌ์กฐ์ฒด๋ฅผ ์ฌ์ฉํ ์ ์์ต๋๋ค:"
#: src/structs/tuple-structs.md:5
msgid ""
"```rust,editable\n"
"struct Point(i32, i32);\n"
"\n"
"fn main() {\n"
" let p = Point(17, 23);\n"
" println!(\"({}, {})\", p.0, p.1);\n"
"}\n"
"```"
msgstr ""
"```rust,editable\n"
"struct Point(i32, i32);\n"
"\n"
"fn main() {\n"
" let p = Point(17, 23);\n"
" println!(\"({}, {})\", p.0, p.1);\n"
"}\n"
"```"
#: src/structs/tuple-structs.md:14
msgid "This is often used for single-field wrappers (called newtypes):"
msgstr "ํํ ๊ตฌ์กฐ์ฒด๋ ์ข
์ข
๋จ์ผ ํ๋์ ๋ํผ(wrapper, ๋ฌ์คํธ์์ ๋ดํ์
(newtype)์ด๋ผ๊ณ ๋ถ๋ฆ)๋ก ์ฌ์ฉ๋ฉ๋๋ค:"
#: src/structs/tuple-structs.md:16
msgid ""
"```rust,editable,compile_fail\n"
"struct PoundOfForce(f64);\n"
"struct Newtons(f64);\n"
"\n"
"fn compute_thruster_force() -> PoundOfForce {\n"
" todo!(\"Ask a rocket scientist at NASA\")\n"
"}\n"
"\n"
"fn set_thruster_force(force: Newtons) {\n"
" // ...\n"
"}\n"
"\n"
"fn main() {\n"
" let force = compute_thruster_force();\n"
" set_thruster_force(force);\n"
"}\n"
"\n"
"```"
msgstr ""
#: src/structs/tuple-structs.md:37
msgid ""
"* Newtypes are a great way to encode additional information about the value in a primitive type, for example:\n"
" * The number is measured in some units: `Newtons` in the example above.\n"
" * The value passed some validation when it was created, so you no longer have to validate it again at every use: 'PhoneNumber(String)` or `OddNumber(u32)`.\n"
"* Demonstrate how to add a `f64` value to a `Newtons` type by accessing the single field in the newtype.\n"
" * Rust generally doesnโt like inexplicit things, like automatic unwrapping or for instance using booleans as integers.\n"
" * Operator overloading is discussed on Day 3 (generics). "
msgstr ""
"* ๋ดํ์
์ ๋ค์๊ณผ ๊ฐ์ ์์ํ์
๊ฐ์ ํน๋ณํ ์๋ฏธ๋ฅผ ๋ถ์ฌํ๋ ๋ฐ ์ ์ฉํฉ๋๋ค.\n"
" * ๋จ์ ํ์๋ฅผ ์ํ ์ซ์: ์ ์์ ์์๋ ๋ดํด ๋จ์ ํ๊ธฐ๋ฅผ ์ํด ์ฌ์ฉํฉ๋๋ค.\n"
" * ๊ฐ์ด ์์ฑ๋ ๋ ์ด๋ฏธ ์ ํจ์ฑ ๊ฒ์ฌ๋ฅผ ํต๊ณผ ํ์ผ๋ฏ๋ก ์ถ๊ฐ์ ์ธ ๊ฒ์ฌ๊ฐ ํ์์๋ ๊ฒฝ์ฐ: `PhoneNumber(String)`๋๋ `OddNumber(u32)`\n"
"* `Newtons` ํ์
์ ๊ฐ์ `f64` ๊ฐ์ ๋ํ๋ ๋ฐฉ๋ฒ์ ๋ณด์ฌ์ฃผ์ธ์.\n"
" * ๋ฌ์คํธ๋ ๋์ฒด๋ก ๋ถ๋ช
ํ์ง ์์ ๊ฒ์ ์ซ์ดํฉ๋๋ค. ์๋ฅผ ๋ค๋ฉด ์๋์ผ๋ก unwrapํ๊ฑฐ๋ ๋ถ๋ฆฌ์ธ ๊ฐ์ ์ ์ ๊ฐ์ผ๋ก ์ฌ์ฉํ๋ ๊ฒ๋ค์ด ๊ทธ๋ ์ต๋๋ค.\n"
" * ์ฐ์ฐ์ ์ฌ์ ์๋ 3์ผ์ฐจ ์ ๋ค๋ฆญ ๋ถ๋ถ์์ ๋ค๋ฃน๋๋ค."
#: src/structs/field-shorthand.md:1
msgid "# Field Shorthand Syntax"
msgstr "# ํ๋ ํ ๋น ๋จ์ถ ๋ฌธ๋ฒ(Field Shorthand Syntax)"
#: src/structs/field-shorthand.md:3
msgid ""
"If you already have variables with the right names, then you can create the\n"
"struct using a shorthand:"
msgstr "๊ตฌ์กฐ์ฒด ํ๋์ ๋์ผํ ์ด๋ฆ์ ๋ณ์๊ฐ ์๋ค๋ฉด ์๋์ ๊ฐ์ด \"์งง์ ๋ฌธ๋ฒ\"์ผ๋ก ๊ตฌ์กฐ์ฒด๋ฅผ ์์ฑํ ์ ์์ต๋๋ค:"
#: src/structs/field-shorthand.md:6
msgid ""
"```rust,editable\n"
"#[derive(Debug)]\n"
"struct Person {\n"
" name: String,\n"
" age: u8,\n"
"}\n"
"\n"
"impl Person {\n"
" fn new(name: String, age: u8) -> Person {\n"
" Person { name, age }\n"
" }\n"
"}\n"
"\n"
"fn main() {\n"
" let peter = Person::new(String::from(\"Peter\"), 27);\n"
" println!(\"{peter:?}\");\n"
"}\n"
"```"
msgstr ""
#: src/structs/field-shorthand.md:27
msgid ""
"* The `new` function could be written using `Self` as a type, as it is interchangeable with the struct type name\n"
"\n"
" ```rust,editable\n"
" #[derive(Debug)]\n"
" struct Person {\n"
" name: String,\n"
" age: u8,\n"
" }\n"
" impl Person {\n"
" fn new(name: String, age: u8) -> Self {\n"
" Self { name, age }\n"
" }\n"
" }\n"
" ``` \n"
"* Implement the `Default` trait for the struct. Define some fields and use the default values for the other fields.\n"
"\n"
" ```rust,editable\n"
" #[derive(Debug)]\n"
" struct Person {\n"
" name: String,\n"
" age: u8,\n"
" }\n"
" impl Default for Person {\n"
" fn default() -> Person {\n"
" Person {\n"
" name: \"Bot\".to_string(),\n"
" age: 0,\n"
" }\n"
" }\n"
" }\n"
" fn create_default() {\n"
" let tmp = Person {\n"
" ..Default::default()\n"
" };\n"
" let tmp = Person {\n"
" name: \"Sam\".to_string(),\n"
" ..Default::default()\n"
" };\n"
" }\n"
" ```\n"
"\n"
"* Methods are defined in the `impl` block.\n"
"* Use struct update syntax to define a new structure using `peter`. Note that the variable `peter` will no longer be accessible afterwards.\n"
"* Use `{:#?}` when printing structs to request the `Debug` representation."
msgstr ""
"* `new`ํจ์๋ฅผ ๋ค์์ฒ๋ผ ๊ตฌ์กฐ์ฒด ์ด๋ฆ ๋์ `Self`๋ฅผ ์ฌ์ฉํ์ฌ ์์ฑํด๋ ๋ฉ๋๋ค.\n"
"\n"
" ```rust,editable\n"
" #[derive(Debug)]\n"
" struct Person {\n"
" name: String,\n"
" age: u8,\n"
" }\n"
" impl Person {\n"
" fn new(name: String, age: u8) -> Self {\n"
" Self { name, age }\n"
" }\n"
" }\n"
" ``` \n"
"* `Default` ํธ๋ ์์ ๊ตฌํํด๋ณด์ธ์. ํ๋ ๋ช๊ฐ๋ ์ด๊ธฐํํ๊ณ ๋๋จธ์ง ํ๋๋ ๋ํดํธ ๊ฐ์ ์ฌ์ฉํ ์ ์์ต๋๋ค.\n"
"\n"
" ```rust,editable\n"
" #[derive(Debug)]\n"
" struct Person {\n"
" name: String,\n"
" age: u8,\n"
" }\n"
" impl Default for Person {\n"
" fn default() -> Person {\n"
" Person {\n"
" name: \"Bot\".to_string(),\n"
" age: 0,\n"
" }\n"
" }\n"
" }\n"
" fn create_default() {\n"
" let tmp = Person {\n"
" ..Default::default()\n"
" };\n"
" let tmp = Person {\n"
" name: \"Sam\".to_string(),\n"
" ..Default::default()\n"
" };\n"
" }\n"
" ```\n"
"\n"
"* ๋ฉ์๋๋ `impl` ๋ธ๋ก์ ์ ์๋ฉ๋๋ค.\n"
"* `peter`์ ๊ตฌ์กฐ์ฒด ์
๋ฐ์ดํธ ๋ฌธ๋ฒ์ ์ฌ์ฉํ์ฌ ์๋ก์ด ๊ตฌ์กฐ์ฒด ์ธ์คํด์ค๋ฅผ ๋ง๋ค์ด๋ณด์ธ์. ์ด๋, `peter`๋ ๋์ด์ ์ฌ์ฉํ ์ ์๊ฒ ๋ฉ๋๋ค.\n"
"* ๊ตฌ์กฐ์ฒด๋ฅผ `Debug` ํํ๋ก ์ถ๋ ฅํ๋ ค๋ฉด `{:#?}`๋ฅผ ์ฌ์ฉํ์ธ์."
#: src/enums.md:1
msgid "# Enums"
msgstr "# ์ด๊ฑฐํ"
#: src/enums.md:3
msgid ""
"The `enum` keyword allows the creation of a type which has a few\n"
"different variants:"
msgstr "`enum` ํค์๋๋ ๋ช๊ฐ์ง ์ ํ(variant)์ผ๋ก ํํ๋๋ ํ์
์ ์์ฑํฉ๋๋ค:"
#: src/enums.md:6
msgid ""
"```rust,editable\n"
"fn generate_random_number() -> i32 {\n"
" 4 // Chosen by fair dice roll. Guaranteed to be random.\n"
"}\n"
"\n"
"#[derive(Debug)]\n"
"enum CoinFlip {\n"
" Heads,\n"
" Tails,\n"
"}\n"
"\n"
"fn flip_coin() -> CoinFlip {\n"
" let random_number = generate_random_number();\n"
" if random_number % 2 == 0 {\n"
" return CoinFlip::Heads;\n"
" } else {\n"
" return CoinFlip::Tails;\n"
" }\n"
"}\n"
"\n"
"fn main() {\n"
" println!(\"You got: {:?}\", flip_coin());\n"
"}\n"
"```"
msgstr ""
#: src/enums.md:33 src/enums/sizes.md:29 src/methods.md:30
#: src/methods/example.md:46 src/pattern-matching.md:25
#: src/pattern-matching/match-guards.md:22 src/control-flow/blocks.md:42
msgid "Key Points:"
msgstr "ํค ํฌ์ธํธ:"
#: src/enums.md:35
msgid ""
"* Enumerations allow you to collect a set of values under one type\n"
"* This page offers an enum type `CoinFlip` with two variants `Heads` and `Tail`. You might note the namespace when using variants.\n"
"* This might be a good time to compare Structs and Enums:\n"
" * In both, you can have a simple version without fields (unit struct) or one with different types of fields (variant payloads). \n"
" * In both, associated functions are defined within an `impl` block.\n"
" * You could even implement the different variants of an enum with separate structs but then they wouldnโt be the same type as they would if they were all defined in an enum. "
msgstr ""
"* ์ด๊ฑฐํ์ ๊ฐ๋ค์ ์งํฉ์ ํ๋์ ํ์
์ผ๋ก ํํํ ์ ์๊ฒ ํฉ๋๋ค.\n"
"* ์์ `CoinFlip` ์ด๊ฑฐํ ํ์
์ `Heads`์ `Tail` ๋๊ฐ์ง variant๋ฅผ ๊ฐ์ง๋๋ค. ์ด๊ฑฐํ ํ์
์ variant๋ ๋ค์์คํ์ด์ค๋ฅผ ๋ถ์ฌ์ ์ฌ์ฉํฉ๋๋ค.\n"
"* ๊ตฌ์กฐ์ฒด์ ์ด๊ฑฐํ์ ๋น๊ตํด ๋ณผ๊น์?\n"
" * ๊ตฌ์กฐ์ฒด๋ ์ด๊ฑฐํ ๋ชจ๋, ํ๋๊ฐ ํ๋๋ ์๋ ๋จ์ํ ํํ๋ ๊ฐ๋ฅ ํ๊ณ , ์ฌ๋ฌ ํ์
์ ํ๋๋ฅผ ๊ฐ์ง ์๋ ์์ต๋๋ค.\n"
" * ๋ ๋ค ์ฐ๊ดํจ์๋ฅผ `impl`๋ธ๋ก์ผ๋ก ์ ์ ํ ์ ์์ต๋๋ค.\n"
" * ์ด๊ฑฐํ ํ์
์ ๊ฐ variant๋ฅผ ๋ณ๋์ ๊ตฌ์กฐ์ฒด๋ก ์ ์ํ ์๋ ์์ง๋ง, ๊ทธ๋ฌ๋ฉด ์ด๊ฑฐํ์ ์ฌ์ฉํ์ ๋์ฒ๋ผ ํ๋์ ํ์
์ผ๋ก ์ทจ๊ธํ ์ ์์ต๋๋ค."
#: src/enums/variant-payloads.md:1
msgid "# Variant Payloads"
msgstr "# ๋ฐ์ดํฐ๋ฅผ ํฌํจํ๋ ์ด๊ฑฐํ(Variant Payloads)"
#: src/enums/variant-payloads.md:3
msgid ""
"You can define richer enums where the variants carry data. You can then use the\n"
"`match` statement to extract the data from each variant:"
msgstr "์ข๋ ๋ณต์กํ ์ด๊ฑฐํ์ ๊ฒฝ์ฐ variant์ ๋ฐ์ดํฐ(payload)๋ฅผ ํฌํจ์ํค๋ ํฉ๋๋ค. ๊ฐ variant์ ๋ด๊ธด ๋ฐ์ดํฐ๋ `match`๋ฌธ์ ์ด์ฉํด ์ถ์ถํฉ๋๋ค:"
#: src/enums/variant-payloads.md:6
msgid ""
"```rust,editable\n"
"enum WebEvent {\n"
" PageLoad, // Variant without payload\n"
" KeyPress(char), // Tuple struct variant\n"
" Click { x: i64, y: i64 }, // Full struct variant\n"
"}\n"
"\n"
"#[rustfmt::skip]\n"
"fn inspect(event: WebEvent) {\n"
" match event {\n"
" WebEvent::PageLoad => println!(\"page loaded\"),\n"
" WebEvent::KeyPress(c) => println!(\"pressed '{c}'\"),\n"
" WebEvent::Click { x, y } => println!(\"clicked at x={x}, y={y}\"),\n"
" }\n"
"}\n"
"\n"
"fn main() {\n"
" let load = WebEvent::PageLoad;\n"
" let press = WebEvent::KeyPress('x');\n"
" let click = WebEvent::Click { x: 20, y: 80 };\n"
"\n"
" inspect(load);\n"
" inspect(press);\n"
" inspect(click);\n"
"}\n"
"```"
msgstr ""
#: src/enums/variant-payloads.md:35
msgid ""
"* The values in the enum variants can only be accessed after being pattern matched. The pattern binds references to the fields in the \"match arm\" after the `=>`.\n"
" * The expression is matched against the patterns from top to bottom. There is no fall-through like in C or C++.\n"
" * The match expression has a value. The value is the last expression in the match arm which was executed.\n"
" * Starting from the top we look for what pattern matches the value then run the code following the arrow. Once we find a match, we stop. \n"
"* Demonstrate what happens when the search is inexhaustive. Note the advantage the Rust compiler provides by confirming when all cases are handled. \n"
"* `match` inspects a hidden discriminant field in the `enum`.\n"
"* It is possible to retrieve the discriminant by calling `std::mem::discriminant()`\n"
" * This is useful, for example, if implementing `PartialEq` for structs where comparing field values doesn't affect equality.\n"
"* `WebEvent::Click { ... }` is not exactly the same as `WebEvent::Click(Click)` with a top level `struct Click { ... }`. The inlined version cannot implement traits, for example. \n"
" "
msgstr ""
"* ์ด๊ฑฐํ ์์ ๊ฐ์ ํจํด ๋งค์นญ์ด ๋๊ณ ๋ ์ดํ์๋ง ์ ๊ทผ ๊ฐ๋ฅํฉ๋๋ค. ๊ทธ ๊ฐ์ ๋ํ ๋ ํผ๋ฐ์ค๋ `=>` ์ดํ์ ์ฌ์ฉ๊ฐ๋ฅํฉ๋๋ค.\n"
" * ๋งค์น ํจํด๋ค์ ์์์ ์๋๋ก ์์์ ๋ฐ๋ผ ๊ฒ์ฌํฉ๋๋ค. C๋ C++์์์ ๊ฐ์ fall-through๋ ์์ต๋๋ค.\n"
" * ๋งค์น ํํ์ ์์ฒด๋ ๊ฐ์ ๊ฐ์ง๋๋ค. ๊ทธ ๊ฐ์ ๋งค์นญ์ด ๋ ํจํด์์ ๊ฐ์ฅ ๋ง์ง๋ง์ ์ํ๋ ํํ์์ด ๋ฉ๋๋ค.\n"
" * ๊ฐ์ฅ ์์์ ๋ถํฐ ์ด๋ค ํจํด์ด ์ฃผ์ด์ง ๊ฐ๊ณผ ๋งค์นญํ๋์ง ๊ฒ์ฌํ ๋ค์, ๋งค์นญ๋ ๊ฒ์ด ๋ฐ๊ฒฌ๋๋ฉด ํ์ดํ๋ฅผ ๋ฐ๋ผ ์ฝ๋๋ฅผ ์ํํฉ๋๋ค. ํ ๋ฒ ๋งค์นญ์ด ๋๊ณ ์ฝ๋๊ฐ ์ํ์ด ๋๋ฉด, ๋์ด์์ ๋งค์นญ์ ์์ต๋๋ค.\n"
"* ๋งค์นญ ํจํด๋ค์ด ๋ถ์ถฉ๋ถ ํ๋ค๋ฉด ์ด๋ค ์ผ์ด ์ผ์ด๋๋์ง ์ค๋ช
ํ์ธ์. ๋ฌ์คํธ ์ปดํ์ผ๋ฌ๋ ๋ชจ๋ ๊ฐ๋ฅํ ์ผ์ด์ค๋ค์ด ํธ๋ค๋ง ๋๋์ง ์ฒดํฌํ๋ค๋ ์ ์ ์๊ธฐ์ํค์ธ์.\n"
"* `match`๋ ์ฃผ์ด์ง ์ด๊ฑฐํ ๊ฐ์ด ์ค์ ๋ก ์ด๋ค variant์ธ์ง ํ๋จํ๊ธฐ ์ํด, ๊ทธ variant์ ์ข
๋ฅ๊ฐ ๊ธฐ๋ก๋, ์จ๊ฒจ์ง ํ๋(์๋ณ์)์ ๊ฐ์ ๊ฒ์ฌํฉ๋๋ค.\n"
"* `std::mem::discriminant()`๋ฅผ ์ด์ฉํ์ฌ ์๋ณ์๋ฅผ ์ป์ ์๋ ์์ต๋๋ค.\n"
" * ์ด๋ ๊ฐ ํ๋ ๊ฐ์ ๊ตณ์ด ๋น๊ตํ ํ์ ์๋ ๊ตฌ์กฐ์ฒด์ ๋ํด `PartialEq` ํธ๋ ์์ ๊ตฌํํ ๋ ์ ์ฉํฉ๋๋ค.\n"
"* `WebEvent::Click { ... }`์ ์ต์์ ๋ ๋ฒจ ๊ตฌ์กฐ์ฒด `struct Click {...}`๋ฅผ ๋ฐ๋ก ์ ์ํ๊ณ `WebEvent::Click(Click)`์ฒ๋ผ ํํ ํํ๋ก ์ ์ํ ๊ฒ๊ณผ ์ ํํ ๊ฐ์ง ์์ต๋๋ค. ์๋ฅผ ๋ค์ด `WebEvent::Click { ... }` ๋ก ์ ์ํ ๊ฒฝ์ฐ, ๊ตฌ์กฐ์ฒด ํํ์ ์ ์ฌํ์ง๋ง ํธ๋ ์์ ๊ตฌํ ํ ์ ์์ต๋๋ค.\n"
" "
#: src/enums/sizes.md:1
msgid "# Enum Sizes"
msgstr "# ์ด๊ฑฐํ ํ์
์ ํฌ๊ธฐ"
#: src/enums/sizes.md:3
msgid "Rust enums are packed tightly, taking constraints due to alignment into account:"
msgstr "๋ฌ์คํธ์ ์ด๊ฑฐํ์ ์ ๋ ฌ(alignment)๋ก ์ธํ ์ ์ฝ์ ๊ณ ๋ คํ์ฌ ํฌ๊ธฐ๋ฅผ ๋นฝ๋นฝํ๊ฒ ์ก์ต๋๋ค:"
#: src/enums/sizes.md:5
msgid ""
"```rust,editable\n"
"use std::mem::{align_of, size_of};\n"
"\n"
"macro_rules! dbg_size {\n"
" ($t:ty) => {\n"
" println!(\"{}: size {} bytes, align: {} bytes\",\n"
" stringify!($t), size_of::<$t>(), align_of::<$t>());\n"
" };\n"
"}\n"
"\n"
"enum Foo {\n"
" A,\n"
" B,\n"
"}\n"
"\n"
"fn main() {\n"
" dbg_size!(Foo);\n"
"}\n"
"```"
msgstr ""
"```rust,editable\n"
"use std::mem::{align_of, size_of};\n"
"\n"
"macro_rules! dbg_size {\n"
" ($t:ty) => {\n"
" println!(\"{}: size {} bytes, align: {} bytes\",\n"
" stringify!($t), size_of::<$t>(), align_of::<$t>());\n"
" };\n"
"}\n"
"\n"
"enum Foo {\n"
" A,\n"
" B,\n"
"}\n"
"\n"
"fn main() {\n"
" dbg_size!(Foo);\n"
"}\n"
"```"
#: src/enums/sizes.md:25
msgid "* See the [Rust Reference](https://doc.rust-lang.org/reference/type-layout.html)."
msgstr "* ์์ธํ ์ฌํญ์ [๊ณต์๋ฌธ์](https://doc.rust-lang.org/reference/type-layout.html)๋ฅผ ํ์ธํ์ธ์."
#: src/enums/sizes.md:31
msgid ""
" * Internally Rust is using a field (discriminant) to keep track of the enum variant.\n"
"\n"
" * You can control the discriminant if needed (e.g., for compatibility with C):\n"
" \n"
" ```rust,editable\n"
" #[repr(u32)]\n"
" enum Bar {\n"
" A, // 0\n"
" B = 10000,\n"
" C, // 10001\n"
" }\n"
" \n"
" fn main() {\n"
" println!(\"A: {}\", Bar::A as u32);\n"
" println!(\"B: {}\", Bar::B as u32);\n"
" println!(\"C: {}\", Bar::C as u32);\n"
" }\n"
" ```\n"
"\n"
" Without `repr`, the discriminant type takes 2 bytes, because 10001 fits 2\n"
" bytes.\n"
"\n"
"\n"
" * Try out other types such as\n"
" \n"
" * `dbg_size!(bool)`: size 1 bytes, align: 1 bytes,\n"
" * `dbg_size!(Option)`: size 1 bytes, align: 1 bytes (niche optimization, see below),\n"
" * `dbg_size!(&i32)`: size 8 bytes, align: 8 bytes (on a 64-bit machine),\n"
" * `dbg_size!(Option<&i32>)`: size 8 bytes, align: 8 bytes (null pointer optimization, see below).\n"
"\n"
" * Niche optimization: Rust will merge use unused bit patterns for the enum\n"
" discriminant.\n"
"\n"
" * Null pointer optimization: For [some\n"
" types](https://doc.rust-lang.org/std/option/#representation), Rust guarantees\n"
" that `size_of::()` equals `size_of::>()`.\n"
"\n"
" Example code if you want to show how the bitwise representation *may* look like in practice.\n"
" It's important to note that the compiler provides no guarantees regarding this representation, therefore this is totally unsafe.\n"
"\n"
" ```rust,editable\n"
" use std::mem::transmute;\n"
"\n"
" macro_rules! dbg_bits {\n"
" ($e:expr, $bit_type:ty) => {\n"
" println!(\"- {}: {:#x}\", stringify!($e), transmute::<_, $bit_type>($e));\n"
" };\n"
" }\n"
"\n"
" fn main() {\n"
" // TOTALLY UNSAFE. Rust provides no guarantees about the bitwise\n"
" // representation of types.\n"
" unsafe {\n"
" println!(\"Bitwise representation of bool\");\n"
" dbg_bits!(false, u8);\n"
" dbg_bits!(true, u8);\n"
"\n"
" println!(\"Bitwise representation of Option\");\n"
" dbg_bits!(None::, u8);\n"
" dbg_bits!(Some(false), u8);\n"
" dbg_bits!(Some(true), u8);\n"
"\n"
" println!(\"Bitwise representation of Option>\");\n"
" dbg_bits!(Some(Some(false)), u8);\n"
" dbg_bits!(Some(Some(true)), u8);\n"
" dbg_bits!(Some(None::), u8);\n"
" dbg_bits!(None::>, u8);\n"
"\n"
" println!(\"Bitwise representation of Option<&i32>\");\n"
" dbg_bits!(None::<&i32>, usize);\n"
" dbg_bits!(Some(&0i32), usize);\n"
" }\n"
" }\n"
" ```\n"
"\n"
" More complex example if you want to discuss what happens when we chain more than 256 `Option`s together.\n"
"\n"
" ```rust,editable\n"
" #![recursion_limit = \"1000\"]\n"
"\n"
" use std::mem::transmute;\n"
" \n"
" macro_rules! dbg_bits {\n"
" ($e:expr, $bit_type:ty) => {\n"
" println!(\"- {}: {:#x}\", stringify!($e), transmute::<_, $bit_type>($e));\n"
" };\n"
" }\n"
"\n"
" // Macro to wrap a value in 2^n Some() where n is the number of \"@\" signs.\n"
" // Increasing the recursion limit is required to evaluate this macro.\n"
" macro_rules! many_options {\n"
" ($value:expr) => { Some($value) };\n"
" ($value:expr, @) => {\n"
" Some(Some($value))\n"
" };\n"
" ($value:expr, @ $($more:tt)+) => {\n"
" many_options!(many_options!($value, $($more)+), $($more)+)\n"
" };\n"
" }\n"
"\n"
" fn main() {\n"
" // TOTALLY UNSAFE. Rust provides no guarantees about the bitwise\n"
" // representation of types.\n"
" unsafe {\n"
" assert_eq!(many_options!(false), Some(false));\n"
" assert_eq!(many_options!(false, @), Some(Some(false)));\n"
" assert_eq!(many_options!(false, @@), Some(Some(Some(Some(false)))));\n"
"\n"
" println!(\"Bitwise representation of a chain of 128 Option's.\");\n"
" dbg_bits!(many_options!(false, @@@@@@@), u8);\n"
" dbg_bits!(many_options!(true, @@@@@@@), u8);\n"
"\n"
" println!(\"Bitwise representation of a chain of 256 Option's.\");\n"
" dbg_bits!(many_options!(false, @@@@@@@@), u16);\n"
" dbg_bits!(many_options!(true, @@@@@@@@), u16);\n"
"\n"
" println!(\"Bitwise representation of a chain of 257 Option's.\");\n"
" dbg_bits!(many_options!(Some(false), @@@@@@@@), u16);\n"
" dbg_bits!(many_options!(Some(true), @@@@@@@@), u16);\n"
" dbg_bits!(many_options!(None::, @@@@@@@@), u16);\n"
" }\n"
" }\n"
" ```"
msgstr ""
"* ๋ฌ์คํธ๋ ์ด๊ฑฐํ variant๋ฅผ ๊ตฌ๋ถํ๊ธฐ ์ํด ๋ด๋ถ์ ์ผ๋ก ์๋ณ์(discriminant) ํ๋๋ฅผ ์ฌ์ฉํฉ๋๋ค.\n"
"\n"
"* C์์ ์ฐ๋๊ณผ ๊ฐ์ ์ด์ ๋ก ์๋ณ์๋ฅผ ์ง์ ์ง์ ํ ์๋ ์์ต๋๋ค:\n"
" \n"
" ```rust,editable\n"
" #[repr(u32)]\n"
" enum Bar {\n"
" A, // 0\n"
" B = 10000,\n"
" C, // 10001\n"
" }\n"
" \n"
" fn main() {\n"
" println!(\"A: {}\", Bar::A as u32);\n"
" println!(\"B: {}\", Bar::B as u32);\n"
" println!(\"C: {}\", Bar::C as u32);\n"
" }\n"
" ```\n"
"\n"
" `repr` ์์ฑ์ด ์๋ค๋ฉด 10001์ด 2 ๋ฐ์ดํธ๋ก ํํ๊ฐ๋ฅํ๊ธฐ ๋๋ฌธ์ ์๋ณ์์ ํ์
ํฌ๊ธฐ๋ 2 ๋ฐ์ดํธ๊ฐ ๋ฉ๋๋ค.\n"
"\n"
"* ๋ค๋ฅธ ํ์
๋ค๋ ํ์ธํด๋ณด์ธ์.\n"
"\n"
" * `dbg_size!(bool)`: size 1 bytes, align: 1 bytes\n"
" * `dbg_size!(Option)`: size 1 bytes, align: 1 bytes (๋์น ์ต์ ํ, ์๋ ์ค๋ช
์ฐธ์กฐ)\n"
" * `dbg_size!(&i32)`: size 8 bytes, align: 8 bytes (64๋นํธ ๋จธ์ ์ธ ๊ฒฝ์ฐ)\n"
" * `dbg_size!(Option<&i32>)`: size 8 bytes, align: 8 bytes (๋ํฌ์ธํฐ ์ต์ ํ, ์๋ ์ค๋ช
์ฐธ์กฐ)\n"
"\n"
"* ๋์น ์ต์ ํ: ๋ฌ์คํธ๋ ์ด๊ฑฐํ ์๋ณ์๋ฅผ ์ฌ์ฉ๋์ง ์์ ๋นํธ ํจํด๊ณผ ๋ณํฉํฉ๋๋ค."
#: src/methods.md:3
msgid ""
"Rust allows you to associate functions with your new types. You do this with an\n"
"`impl` block:"
msgstr "๋ฌ์คํธ์์ ์ ์ธ๋ ํ์
์ ๋ํด `impl`๋ธ๋ก์ ํจ์๋ฅผ ์ ์ธํ์ฌ ๋ฉ์๋๋ฅผ ์ฐ๊ฒฐ ํ ์ ์์ต๋๋ค:"
#: src/methods.md:6
msgid ""
"```rust,editable\n"
"#[derive(Debug)]\n"
"struct Person {\n"
" name: String,\n"
" age: u8,\n"
"}\n"
"\n"
"impl Person {\n"
" fn say_hello(&self) {\n"
" println!(\"Hello, my name is {}\", self.name);\n"
" }\n"
"}\n"
"\n"
"fn main() {\n"
" let peter = Person {\n"
" name: String::from(\"Peter\"),\n"
" age: 27,\n"
" };\n"
" peter.say_hello();\n"
"}\n"
"```"
msgstr ""
#: src/methods.md:31
msgid ""
"* It can be helpful to introduce methods by comparing them to functions.\n"
" * Methods are called on an instance of a type (such as a struct or enum), the first parameter represents the instance as `self`.\n"
" * Developers may choose to use methods to take advantage of method receiver syntax and to help keep them more organized. By using methods we can keep all the implementation code in one predictable place.\n"
"* Point out the use of the keyword `self`, a method receiver. \n"
" * Show that it is an abbreviated term for `self:&Self` and perhaps show how the struct name could also be used. \n"
" * Explain that `Self` is a type alias for the type the `impl` block is in and can be used elsewhere in the block.\n"
" * Note how `self` is used like other structs and dot notation can be used to refer to individual fields.\n"
" * This might be a good time to demonstrate how the `&self` differs from `self` by modifying the code and trying to run say_hello twice. \n"
"* We describe the distinction between method receivers next.\n"
" "
msgstr ""
"* ๋ฉ์๋๋ฅผ ํจ์์ ๋น๊ตํ์ฌ ์๊ฐํ๋ ๊ฒ๋ ๋์์ด ๋ ์ ์์ต๋๋ค.\n"
" * ๋ฉ์๋๋ ๊ตฌ์กฐ์ฒด๋ ์ด๊ฑฐํ๊ณผ ๊ฐ์ ํ์
์ ์ธ์คํด์ค์์ ํธ์ถ ๋๋ฉฐ, ์ฒซ๋ฒ์งธ ๋งค๊ฐ๋ณ์(ํ๋ผ๋ฉํฐ)๋ ์ธ์คํด์ค๋ฅผ `self`๋ก ํ๊ธฐํฉ๋๋ค.\n"
" * ๋ฉ์๋๋ฅผ ์ด์ฉํ๋ฉด receiver ๋ฌธ๋ฒ์ ์ฌ์ฉํ ์ ์๊ณ ์ฝ๋๋ฅผ ์ข๋ ์ฒด๊ณ์ ์ผ๋ก ์ ๋ฆฌํ ์ ์์ต๋๋ค. ๋ฉ์๋๋ค์ด ์์ธก ๊ฐ๋ฅํ ์์น์ ๋ชจ์ฌ ์์ผ๋ ์ฐพ๊ธฐ ์ฝ์ต๋๋ค.\n"
"* ๋ฉ์๋ receiver์ธ `self` ํค์๋ ์ฌ์ฉ์ ์ธ๊ธํด ์ฃผ์๊ธฐ ๋ฐ๋๋๋ค.\n"
" * ์์ ์ ๊ฒฝ์ฐ `self: &Self`์ ์ค์ธ ๋ฒ์ ์์ ์๋ ค์ฃผ๊ณ , ๊ตฌ์กฐ์ฒด์ ์ด๋ฆ์ ์ง์ ์ฌ์ฉํ๋ฉด ์ด๋ป๊ฒ ๋๋์ง ๋ณด์ฌ์ฃผ๋ ๊ฒ๋ ์ข์ต๋๋ค.\n"
" * `impl` ๋ธ๋ก ๋ด๋ถ์์๋ `Self`๊ฐ ํด๋น ํ์
์ ์ด๋ฆ ๋์ฉ์ผ๋ก ์ฌ์ฉ๋ ์ ์์์ ์๋ ค์ฃผ์ธ์.\n"
" * ๊ตฌ์กฐ์ฒด์ ํ๋๋ฅผ ์ ๊ทผํ ๋ ์ ํ๊ธฐ๋ฅผ ์ฌ์ฉํ๋ฏ์ด `self`์ ์ ํ๊ธฐ๋ฅผ ์ฌ์ฉํ์ฌ ๊ฐ๋ณ ํ๋๋ค์ ์ ๊ทผํ ์ ์์ต๋๋ค.\n"
" * `say_hello` ํจ์๊ฐ ๋ ๋ฒ ํธ์ถ๋๋๋ก ์ฝ๋๋ฅผ ์์ ํ์ฌ `&self`์ `self`๊ฐ ์ด๋ป๊ฒ ๋ค๋ฅธ์ง ๋ณด์ฌ์ฃผ๋ ๊ฒ๋ ์ข์ต๋๋ค.\n"
"* ๋ค์ ์ฌ๋ผ์ด๋์์ receiver์ ๊ตฌ๋ถ์ ์ค๋ช
ํฉ๋๋ค.\n"
" "
#: src/methods/receiver.md:1
msgid "# Method Receiver"
msgstr "# ๋ฉ์๋ ๋ฆฌ์๋ฒ(Receiver)"
#: src/methods/receiver.md:3
msgid ""
"The `&self` above indicates that the method borrows the object immutably. There\n"
"are other possible receivers for a method:"
msgstr "`&self`๋ ๋ฉ์๋๊ฐ ๊ฐ์ฒด๋ฅผ ๋ถ๋ณํ๊ฒ ๋น๋ ค์ด์ ๋ํ๋
๋๋ค. ๋ฉ์๋์ ๋ฆฌ์๋ฒ๋ ๋ค์์ ํํ๋ค์ด ๊ฐ๋ฅํฉ๋๋ค:"
#: src/methods/receiver.md:6
msgid ""
"* `&self`: borrows the object from the caller using a shared and immutable\n"
" reference. The object can be used again afterwards.\n"
"* `&mut self`: borrows the object from the caller using a unique and mutable\n"
" reference. The object can be used again afterwards.\n"
"* `self`: takes ownership of the object and moves it away from the caller. The\n"
" method becomes the owner of the object. The object will be dropped (deallocated)\n"
" when the method returns, unless its ownership is explicitly\n"
" transmitted.\n"
"* `mut self`: same as above, but while the method owns the object, it can\n"
" mutate it too. Complete ownership does not automatically mean mutability.\n"
"* No receiver: this becomes a static method on the struct. Typically used to\n"
" create constructors which are called `new` by convention."
msgstr ""
"* `&self`: ํธ์ถ์๋ก๋ถํฐ ๊ณต์ ๊ฐ๋ฅํ ๋ถ๋ณ ์ฐธ์กฐ ๋ฐฉ์์ผ๋ก ๊ฐ์ฒด๋ฅผ ๋น๋ ค์ด์ ๋ํ๋
๋๋ค. ๊ฐ์ฒด๋ ๋ฉ์๋ ํธ์ถ ๋ค์๋ ์ฌ์ฉ๋ ์ ์์ต๋๋ค.\n"
"* `&mut self`: ํธ์ถ์๋ก๋ถํฐ ์ ์ผํ ๊ฐ๋ณ ์ฐธ์กฐ ๋ฐฉ์์ผ๋ก ๊ฐ์ฒด๋ฅผ ๋น๋ ค์ด์ ๋ํ๋
๋๋ค. ๊ฐ์ฒด๋ ๋ฉ์๋ ํธ์ถ ๋ค์๋ ์ฌ์ฉ๋ ์ ์์ต๋๋ค.\n"
"* `self`: ํธ์ถ์๋ก๋ถํฐ ๊ฐ์ฒด์ ์์ ๊ถ์ ๊ฐ์ ธ์ค๊ณ ๊ฐ์ฒด๋ ํธ์ถ์๋ก๋ถํฐ ๋ฉ์๋๋ก ์ด๋๋ฉ๋๋ค. ๋ฉ์๋๊ฐ ๊ฐ์ฒด๋ฅผ ์์ ํ๊ฒ ๋๋ฉฐ ๋ฐ๋ผ์ ๋ช
์์ ์ผ๋ก ์์ ๊ถ์ ๋ค๋ฅธ ๊ณณ์ผ๋ก ์ ๋ฌํ์ง ์๋๋ค๋ฉด ๋ฉ์๋ ์ข
๋ฃ์ ํจ๊ป ๊ฐ์ฒด๋ drop(ํด์ )๋ฉ๋๋ค.\n"
"* `mut self`: ์์ ๋์ผํ์ง๋ง ๋ฉ์๋๊ฐ ๊ฐ์ฒด์ ์์ ๊ถ์ ๊ฐ์ง๋ฉด์ ๋์์ ๊ฐ์ฒด๋ฅผ ์์ ํ ์๋ ์์ต๋๋ค. ์์ ๊ถ์ ๊ฐ์ง๋ ๊ฒ์ด ์์ ํ ์ ์์์ ์๋ฏธํ๋ ๊ฒ์ ์๋๋๋ค.\n"
"* ๋ฆฌ์๋ฒ ์์: ๊ตฌ์กฐ์ฒด์ ์ ์ ๋ฉ์๋๊ฐ ๋ฉ๋๋ค. ์ฃผ๋ก ์์ฑ์๋ฅผ ๋ง๋ค๋ ์ฌ์ฉํ๊ฒ ๋๋ฉฐ, ์์ฑ์๋ ํํ `new`๋ผ๊ณ ์ด๋ฆ๋ถ์
๋๋ค."
#: src/methods/receiver.md:19
msgid ""
"Beyond variants on `self`, there are also\n"
"[special wrapper types](https://doc.rust-lang.org/reference/special-types-and-traits.html)\n"
"allowed to be receiver types, such as `Box`."
msgstr "`self`๋ฅผ ์ฌ์ฉํ๋ ์ด๊ฐ์ ๋ณํ๋ค ์ธ์๋ `Box`์ ๊ฐ์ด ๋ฆฌ์๋ฒ ํ์
์ผ๋ก ํ์ฉ๋๋ [ํน๋ณํ ๋ํผ ํ์
](https://doc.rust-lang.org/reference/special-types-and-traits.html)์ด ์์ต๋๋ค."
#: src/methods/receiver.md:25
msgid ""
"Consider emphasizing \"shared and immutable\" and \"unique and mutable\". These constraints always come\n"
"together in Rust due to borrow checker rules, and `self` is no exception. It isn't possible to\n"
"reference a struct from multiple locations and call a mutating (`&mut self`) method on it."
msgstr "\"๊ณต์ ๊ฐ๋ฅํ ๋ถ๋ณ\"๊ณผ \"์ ์ผํ ๊ฐ๋ณ\" ๋ถ๋ถ์ ๊ฐ์กฐํ ๋งํฉ๋๋ค. ์ด๋ฌํ ์ ์ฝ์ ๋ฌ์คํธ์ ๋น๋ฆผ ๊ฒ์ฌ๊ธฐ(borrow checker) ๊ท์น์ผ๋ก ๋ ๋ถ์ด๋ค๋๋๋ค. `self`๋ ์์ธ๋ ์๋๋๋ค. ์ฌ๋ฌ ์์น์์ ๊ตฌ์กฐ์ฒด๋ฅผ ์ฐธ์กฐํ๋ฉด์ ๊ฐ์ฒด๋ฅผ ์์ ํ๋(`&mut self`๋ฅผ ๋ฆฌ์๋ฒ๋ก ํ๋) ๋ฉ์๋๋ฅผ ํธ์ถํ๋ ๊ฒ์ ๋ถ๊ฐ๋ฅํฉ๋๋ค."
#: src/methods/example.md:1 src/concurrency/shared_state/example.md:1
msgid "# Example"
msgstr "# ์์ "
#: src/methods/example.md:3
msgid ""
"```rust,editable\n"
"#[derive(Debug)]\n"
"struct Race {\n"
" name: String,\n"
" laps: Vec,\n"
"}\n"
"\n"
"impl Race {\n"
" fn new(name: &str) -> Race { // No receiver, a static method\n"
" Race { name: String::from(name), laps: Vec::new() }\n"
" }\n"
"\n"
" fn add_lap(&mut self, lap: i32) { // Exclusive borrowed read-write access to self\n"
" self.laps.push(lap);\n"
" }\n"
"\n"
" fn print_laps(&self) { // Shared and read-only borrowed access to self\n"
" println!(\"Recorded {} laps for {}:\", self.laps.len(), self.name);\n"
" for (idx, lap) in self.laps.iter().enumerate() {\n"
" println!(\"Lap {idx}: {lap} sec\");\n"
" }\n"
" }\n"
"\n"
" fn finish(self) { // Exclusive ownership of self\n"
" let total = self.laps.iter().sum::();\n"
" println!(\"Race {} is finished, total lap time: {}\", self.name, total);\n"
" }\n"
"}\n"
"\n"
"fn main() {\n"
" let mut race = Race::new(\"Monaco Grand Prix\");\n"
" race.add_lap(70);\n"
" race.add_lap(68);\n"
" race.print_laps();\n"
" race.add_lap(71);\n"
" race.print_laps();\n"
" race.finish();\n"
" // race.add_lap(42);\n"
"}\n"
"```"
msgstr ""
#: src/methods/example.md:47
msgid ""
"* All four methods here use a different method receiver.\n"
" * You can point out how that changes what the function can do with the variable values and if/how it can be used again in `main`.\n"
" * You can showcase the error that appears when trying to call `finish` twice.\n"
"* Note that although the method receivers are different, the non-static functions are called the same way in the main body. Rust enables automatic referencing and dereferencing when calling methods. Rust automatically adds in the `&`, `*`, `muts` so that that object matches the method signature.\n"
"* You might point out that `print_laps` is using a vector that is iterated over. We describe vectors in more detail in the afternoon. "
msgstr ""
"* 4๊ฐ์ง ์ ํ์ ๋ฉ์๋ receiver์ ๋ํด ์ค๋ช
ํฉ๋๋ค.\n"
" * receiver ์ ํ์ ๋ฐ๋ผ ํจ์๊ฐ ํ ์ ์๋ ์ผ์ด ๋ฌ๋ผ์ง๊ณ , ๋ ๋ฉ์๋๋ฅผ ํธ์ถํ ๋ค `main`์์ ํด๋น ๊ฐ์ฒด๋ฅผ ์ฌ์ฉํ ์ ์๋์ง ์ฌ๋ถ๋ ๋ฌ๋ผ์ง๋ค๋ ์ ์ ๊ฐ์กฐํ์ธ์.\n"
" * `finish`๋ฅผ ๋๋ฒ ํธ์ถํ์ฌ ์ค๋ฅ๊ฐ ๋ฐ์ํ๋ ๊ฒ์ ๋ณด์ผ ์ ์์ต๋๋ค.\n"
"* ๋น๋ก ๋ฉ์๋ receiver๋ ๋ค๋ฅด์ง๋ง main ํจ์์์ ๋น ์ ์ ํจ์๋ฅผ ๋ถ๋ฅด๋ ๋ฐฉ๋ฒ์ ๊ฐ์ต๋๋ค. ๋ฌ์คํธ๋ ๋ฉ์๋๋ฅผ ํธ์ถํ ๋ ์๋์ผ๋ก ์ฐธ์กฐ/์ญ์ฐธ์กฐ(๋ฐ๋ผ๊ฐ๊ธฐ)๋ฅผ ์ํํฉ๋๋ค. ๋ฌ์คํธ๋ ๊ฐ์ฒด์ ๋งค์๋ ์๊ทธ๋์ฒ๊ฐ ์๋ก ๋งค์น๋๋๋ก ๊ฐ์ฒด์ `&`, `*`, `muts`๋ฅผ ์๋์ผ๋ก ๋ถ์ฌ์ค๋๋ค.\n"
"* `print_laps`ํจ์์์ ๋ฒกํฐ๋ฅผ ์ด๋ค ์์ผ๋ก ์ฌ์ฉํ๊ณ ์๋์ง ์ธ๊ธํ๋ ๊ฒ๋ ์ข์ต๋๋ค. ๋ฒกํฐ๋ ์คํ ๊ฐ์์์ ๋ ์์ธํ ์ค๋ช
ํ ๊ฒ์
๋๋ค. "
#: src/pattern-matching.md:1
msgid "# Pattern Matching"
msgstr "# ํจํด ๋งค์นญ"
#: src/pattern-matching.md:3
msgid ""
"The `match` keyword let you match a value against one or more _patterns_. The\n"
"comparisons are done from top to bottom and the first match wins."
msgstr "`match`ํค์๋๋ ๊ฐ์ ์ฌ๋ฌ ํํ์ ํจํด๊ณผ ๋งค์น์ํฌ ์ ์์ต๋๋ค. ๋งจ ์ ํจํด๋ถํฐ ํ๋์ฉ ๋งค์น๋๋์ง ๊ฒ์ฌํ๋ฉฐ, ์ฒ์์ผ๋ก ๋งค์น๋๋ ํจํด์ด ์ ํ๋ฉ๋๋ค."
#: src/pattern-matching.md:6
msgid "The patterns can be simple values, similarly to `switch` in C and C++:"
msgstr "C/C++์ `switch`์ ๋น์ทํ๊ฒ ๊ฐ์ ํจํด์ผ๋ก ์ฌ์ฉํ ์๋ ์์ต๋๋ค:"
#: src/pattern-matching.md:8
msgid ""
"```rust,editable\n"
"fn main() {\n"
" let input = 'x';\n"
"\n"
" match input {\n"
" 'q' => println!(\"Quitting\"),\n"
" 'a' | 's' | 'w' | 'd' => println!(\"Moving around\"),\n"
" '0'..='9' => println!(\"Number input\"),\n"
" _ => println!(\"Something else\"),\n"
" }\n"
"}\n"
"```"
msgstr ""
"```rust,editable\n"
"fn main() {\n"
" let input = 'x';\n"
"\n"
" match input {\n"
" 'q' => println!(\"Quitting\"),\n"
" 'a' | 's' | 'w' | 'd' => println!(\"Moving around\"),\n"
" '0'..='9' => println!(\"Number input\"),\n"
" _ => println!(\"Something else\"),\n"
" }\n"
"}\n"
"```"
#: src/pattern-matching.md:21
msgid "The `_` pattern is a wildcard pattern which matches any value."
msgstr "`_`ํจํด์ ์ด๋ค ๊ฐ๊ณผ๋ ๋งค์นญ๋๋ ์์ผ๋์นด๋์
๋๋ค."
#: src/pattern-matching.md:26
msgid ""
"* You might point out how some specific characters are being used when in a pattern\n"
" * `|` as an `or`\n"
" * `..` can expand as much as it needs to be\n"
" * `1..=5` represents an inclusive range\n"
" * `_` is a wild card\n"
"* It can be useful to show how binding works, by for instance replacing a wildcard character with a variable, or removing the quotes around `q`.\n"
"* You can demonstrate matching on a reference.\n"
"* This might be a good time to bring up the concept of irrefutable patterns, as the term can show up in error messages.\n"
" "
msgstr ""
"* ํจํด์์ ์ฌ์ฉ๋๋ ํน์ ๋ฌธ์๋ค์ ์๋ ค์ฃผ์ธ์.\n"
" * `|`: or ๊ธฐํธ์
๋๋ค.\n"
" * `..`: ํ์ํ ๋งํผ ํ์ฅํฉ๋๋ค.\n"
" * `1..=5`: ๋ ๊ฐ(์ฌ๊ธฐ์๋ 5)์ ํฌํจํ๋ ๋ฒ์๋ฅผ ๋ํ๋
๋๋ค.\n"
" * `_`: ์์ผ๋์นด๋์
๋๋ค.\n"
"* ์์ผ๋์นด๋ ๋ฌธ์๋ฅผ ๋ณ์๋ก ๋ฐ๊พธ๊ฑฐ๋ `q`์ ๋ฐ์ดํ๋ฅผ ์ ๊ฑฐํ๋ ์์ผ๋ก ์์ ํ๋ฉด์ ๋ฐ์ธ๋ฉ์ด ์ด๋ป๊ฒ ์๋ํ๋์ง ๋ณด์ฌ์ฃผ๋ ๊ฒ๋ ์ ์ฉํ ์ ์์ต๋๋ค.\n"
"* ์ฐธ์กฐ๋ฅผ ๋งค์นญํ๋ ๊ฒ๋ ์์ฐํ ์ ์์ต๋๋ค.\n"
"* ์๋ฌ ๋ฉ์์ง์ \"๋ฐ๋ฐ ๋ถ๊ฐ๋ฅ ํจํด(irrefutable pattern)\"์ด๋ ์ฉ์ด๊ฐ ๋ฑ์ฅํ๊ธฐ๋ ํฉ๋๋ค. ์ง๊ธ ๊ทธ ์๋ฏธ๋ฅผ ์๊ฐํ๋ ๊ฒ๋ ์ข์ ๊ฒ ๊ฐ์ต๋๋ค.\n"
" "
#: src/pattern-matching/destructuring-enums.md:1
msgid "# Destructuring Enums"
msgstr "# ์ด๊ฑฐํ ๋ถํด(์ญ๊ตฌ์กฐํ)"
#: src/pattern-matching/destructuring-enums.md:3
msgid ""
"Patterns can also be used to bind variables to parts of your values. This is how\n"
"you inspect the structure of your types. Let us start with a simple `enum` type:"
msgstr "๊ตฌ์กฐ์ฒด๋ ์ด๊ฑฐํ ๊ฐ์ ์ผ๋ถ๋ฅผ ํจํด ๋งค์น๋ฅผ ํตํด ๋ณ์์ ๋ฐ์ธ๋ฉํ ์ ์์ต๋๋ค. ๊ฐ๋จํ `enum` ํ์
์ ๋จผ์ ์ดํด๋ณด๊ฒ ์ต๋๋ค:"
#: src/pattern-matching/destructuring-enums.md:6
msgid ""
"```rust,editable\n"
"enum Result {\n"
" Ok(i32),\n"
" Err(String),\n"
"}\n"
"\n"
"fn divide_in_two(n: i32) -> Result {\n"
" if n % 2 == 0 {\n"
" Result::Ok(n / 2)\n"
" } else {\n"
" Result::Err(format!(\"cannot divide {n} into two equal parts\"))\n"
" }\n"
"}\n"
"\n"
"fn main() {\n"
" let n = 100;\n"
" match divide_in_two(n) {\n"
" Result::Ok(half) => println!(\"{n} divided in two is {half}\"),\n"
" Result::Err(msg) => println!(\"sorry, an error happened: {msg}\"),\n"
" }\n"
"}\n"
"```"
msgstr ""
"```rust,editable\n"
"enum Result {\n"
" Ok(i32),\n"
" Err(String),\n"
"}\n"
"\n"
"fn divide_in_two(n: i32) -> Result {\n"
" if n % 2 == 0 {\n"
" Result::Ok(n / 2)\n"
" } else {\n"
" Result::Err(format!(\"cannot divide {n} into two equal parts\"))\n"
" }\n"
"}\n"
"\n"
"fn main() {\n"
" let n = 100;\n"
" match divide_in_two(n) {\n"
" Result::Ok(half) => println!(\"{n} divided in two is {half}\"),\n"
" Result::Err(msg) => println!(\"sorry, an error happened: {msg}\"),\n"
" }\n"
"}\n"
"```"
#: src/pattern-matching/destructuring-enums.md:29
msgid ""
"Here we have used the arms to _destructure_ the `Result` value. In the first\n"
"arm, `half` is bound to the value inside the `Ok` variant. In the second arm,\n"
"`msg` is bound to the error message."
msgstr "`match`๊ตฌ๋ฌธ์์ `divide_in_two`ํจ์์์ ๋ฐํ๋๋ `Result` ๊ฐ์ ๋ ๊ฐ์ ํ(ํน์ ๊ฐ์ง)๋ก _๋ถํด(destructure)_ ํ์์ต๋๋ค. ์ฒซ๋ฒ์งธ ํ์์ `half`๋ `Ok` variant์ ๋ด๊ธด ๊ฐ์ผ๋ก ๋ฐ์ธ๋ฉ๋ฉ๋๋ค. ๋๋ฒ์งธ ํ์์ `msg`๋ ์ค๋ฅ ๋ฉ์์ง ๋ฌธ์์ด์ ๋ฐ์ธ๋ฉ๋ฉ๋๋ค."
#: src/pattern-matching/destructuring-enums.md:36
msgid ""
"* The `if`/`else` expression is returning an enum that is later unpacked with a `match`.\n"
"* You can try adding a third variant to the enum definition and displaying the errors when running the code. Point out the places where your code is now inexhaustive and how the compiler tries to give you hints."
msgstr ""
"* `if`/`else` ํํ์์ ์ด๊ฑฐํ์ ๋ฐํํ๊ณ , ์ด ๊ฐ์ ๋์ค์ `match`๋ก ๋ถํด๋ฉ๋๋ค.\n"
"* ์ด๊ฑฐํ์ ์ธ๋ฒ์งธ variant๋ฅผ ์ถ๊ฐํ๊ณ ์ฝ๋๋ฅผ ์คํํ์ฌ ์ค๋ฅ๋ฅผ ํ์ํด๋ณด์ธ์. ์ฝ๋ ์ด๋ ๋ถ๋ถ์ ๋๋ฝ์ด ์๋์ง, ๊ทธ๋ฆฌ๊ณ ์ปดํ์ผ๋ฌ๊ฐ ์ด๋ค ์์ผ๋ก ํํธ๋ฅผ ์ฃผ๋์ง ๊ฐ์ด ์ดํด๋ณด์ธ์."
#: src/pattern-matching/destructuring-structs.md:1
msgid "# Destructuring Structs"
msgstr "# ๊ตฌ์กฐ์ฒด ๋ถํด(์ญ๊ตฌ์กฐํ)"
#: src/pattern-matching/destructuring-structs.md:3
msgid "You can also destructure `structs`:"
msgstr "`struct` ๊ตฌ์กฐ์ฒด ์ญ์ ๋ถํดํ ์ ์์ต๋๋ค:"
#: src/pattern-matching/destructuring-structs.md:5
msgid ""
"```rust,editable\n"
"struct Foo {\n"
" x: (u32, u32),\n"
" y: u32,\n"
"}\n"
"\n"
"#[rustfmt::skip]\n"
"fn main() {\n"
" let foo = Foo { x: (1, 2), y: 3 };\n"
" match foo {\n"
" Foo { x: (1, b), y } => println!(\"x.0 = 1, b = {b}, y = {y}\"),\n"
" Foo { y: 2, x: i } => println!(\"y = 2, x = {i:?}\"),\n"
" Foo { y, .. } => println!(\"y = {y}, other fields were ignored\"),\n"
" }\n"
"}\n"
"```"
msgstr ""
"```rust,editable\n"
"struct Foo {\n"
" x: (u32, u32),\n"
" y: u32,\n"
"}\n"
"\n"
"#[rustfmt::skip]\n"
"fn main() {\n"
" let foo = Foo { x: (1, 2), y: 3 };\n"
" match foo {\n"
" Foo { x: (1, b), y } => println!(\"x.0 = 1, b = {b}, y = {y}\"),\n"
" Foo { y: 2, x: i } => println!(\"y = 2, x = {i:?}\"),\n"
" Foo { y, .. } => println!(\"y = {y}, other fields were ignored\"),\n"
" }\n"
"}\n"
"```"
#: src/pattern-matching/destructuring-structs.md:23
msgid ""
"* Change the literal values in `foo` to match with the other patterns.\n"
"* Add a new field to `Foo` and make changes to the pattern as needed."
msgstr ""
"* `foo` ์ธ์คํด์ค ์์ฑ์ ์ฌ์ฉ๋ ๋ฆฌํฐ๋ด ๊ฐ์ ๋ณ๊ฒฝํด์ ๋ค๋ฅธ ํจํด์ ๋งค์น๋๋๋ก ํด๋ณด์ธ์.\n"
"* `Foo` ๊ตฌ์กฐ์ฒด์ ์ ํ๋๋ฅผ ์ถ๊ฐํ๊ณ ํจํด๋ ๋ฐ๊ฟ๋ณด์ธ์."
#: src/pattern-matching/destructuring-arrays.md:1
msgid "# Destructuring Arrays"
msgstr "# ๋ฐฐ์ด ๋ถํด(์ญ๊ตฌ์กฐํ)"
#: src/pattern-matching/destructuring-arrays.md:3
msgid "You can destructure arrays, tuples, and slices by matching on their elements:"
msgstr "๋ฐฐ์ด์ด๋ ํํ, ์ฌ๋ผ์ด์ค๋ ๊ทธ ์์๋ค์ ๋ํด ํจํด ๋งค์นญ์ผ๋ก ๋ถํดํ ์ ์์ต๋๋ค:"
#: src/pattern-matching/destructuring-arrays.md:5
msgid ""
"```rust,editable\n"
"#[rustfmt::skip]\n"
"fn main() {\n"
" let triple = [0, -2, 3];\n"
" println!(\"Tell me about {triple:?}\");\n"
" match triple {\n"
" [0, y, z] => println!(\"First is 0, y = {y}, and z = {z}\"),\n"
" [1, ..] => println!(\"First is 1 and the rest were ignored\"),\n"
" _ => println!(\"All elements were ignored\"),\n"
" }\n"
"}\n"
"```"
msgstr ""
"```rust,editable\n"
"#[rustfmt::skip]\n"
"fn main() {\n"
" let triple = [0, -2, 3];\n"
" println!(\"Tell me about {triple:?}\");\n"
" match triple {\n"
" [0, y, z] => println!(\"First is 0, y = {y}, and z = {z}\"),\n"
" [1, ..] => println!(\"First is 1 and the rest were ignored\"),\n"
" _ => println!(\"All elements were ignored\"),\n"
" }\n"
"}\n"
"```"
#: src/pattern-matching/destructuring-arrays.md:21
msgid ""
"* Destructuring of slices of unknown length also works with patterns of fixed length.\n"
"\n"
"\n"
" ```rust,editable\n"
" fn main() {\n"
" inspect(&[0, -2, 3]);\n"
" inspect(&[0, -2, 3, 4]);\n"
" }\n"
"\n"
" #[rustfmt::skip]\n"
" fn inspect(slice: &[i32]) {\n"
" println!(\"Tell me about {slice:?}\");\n"
" match slice {\n"
" &[0, y, z] => println!(\"First is 0, y = {y}, and z = {z}\"),\n"
" &[1, ..] => println!(\"First is 1 and the rest were ignored\"),\n"
" _ => println!(\"All elements were ignored\"),\n"
" }\n"
" }\n"
" ```\n"
" \n"
"* Create a new pattern using `_` to represent an element. \n"
"* Add more values to the array.\n"
"* Point out that how `..` will expand to account for different number of elements.\n"
"* Show matching against the tail with patterns `[.., b]` and `[a@..,b]`"
msgstr ""
"* ๊ธธ์ด๋ฅผ ์ ์ ์๋ ์ฌ๋ผ์ด์ค์ ๋ํด์๋ ๊ณ ์ ๊ธธ์ด ํจํด์ผ๋ก ๋ถํดํ ์ ์์ต๋๋ค.\n"
"\n"
"\n"
" ```rust,editable\n"
" fn main() {\n"
" inspect(&[0, -2, 3]);\n"
" inspect(&[0, -2, 3, 4]);\n"
" }\n"
"\n"
" #[rustfmt::skip]\n"
" fn inspect(slice: &[i32]) {\n"
" println!(\"Tell me about {slice:?}\");\n"
" match slice {\n"
" &[0, y, z] => println!(\"First is 0, y = {y}, and z = {z}\"),\n"
" &[1, ..] => println!(\"First is 1 and the rest were ignored\"),\n"
" _ => println!(\"All elements were ignored\"),\n"
" }\n"
" }\n"
" ```\n"
" \n"
"* `_`๋ฅผ ์ฌ์ฉํ์ฌ ์์๋ฅผ ๋งค์นญํ๋ ํจํด์ ์ถ๊ฐํด๋ณด์ธ์.\n"
"* ๋ฐฐ์ด์ ๊ฐ์ ๋ ์ถ๊ฐํด๋ณด์ธ์.\n"
"* `..`๊ฐ ์์ ๊ฐ์์ ์๊ด์์ด ๋งค์น๋ ์ ์์์ ์๋ ค์ฃผ์ธ์.\n"
"* `[.., b]`๋ `[a@.., b]`์ ๊ฐ์ ํจํด์ผ๋ก ๊ผฌ๋ฆฌ ๋ถ๋ถ์ ๋งค์นญํ๋ ๊ฒ์ ๋ณด์ฌ์ฃผ์ธ์."
#: src/pattern-matching/match-guards.md:1
msgid "# Match Guards"
msgstr "# ๋งค์น ๊ฐ๋"
#: src/pattern-matching/match-guards.md:3
msgid ""
"When matching, you can add a _guard_ to a pattern. This is an arbitrary Boolean\n"
"expression which will be executed if the pattern matches:"
msgstr "ํจํด ๋ค์ ๊ฐ๋(guard, ์กฐ๊ฑด์)๋ฅผ ๋ง๋ถ์ผ ์ ์์ต๋๋ค. ๊ฐ๋๋ ํจํด์ด ๋งค์น๋๋ฉด ์ถ๊ฐ๋ก ๋ฐ์ ธ๋ณด๋ ๋ถ๋ฆฌ์ธ ํํ์์
๋๋ค:"
#: src/pattern-matching/match-guards.md:6
msgid ""
"```rust,editable\n"
"#[rustfmt::skip]\n"
"fn main() {\n"
" let pair = (2, -2);\n"
" println!(\"Tell me about {pair:?}\");\n"
" match pair {\n"
" (x, y) if x == y => println!(\"These are twins\"),\n"
" (x, y) if x + y == 0 => println!(\"Antimatter, kaboom!\"),\n"
" (x, _) if x % 2 == 1 => println!(\"The first one is odd\"),\n"
" _ => println!(\"No correlation...\"),\n"
" }\n"
"}\n"
"```"
msgstr ""
"```rust,editable\n"
"#[rustfmt::skip]\n"
"fn main() {\n"
" let pair = (2, -2);\n"
" println!(\"Tell me about {pair:?}\");\n"
" match pair {\n"
" (x, y) if x == y => println!(\"These are twins\"),\n"
" (x, y) if x + y == 0 => println!(\"Antimatter, kaboom!\"),\n"
" (x, _) if x % 2 == 1 => println!(\"The first one is odd\"),\n"
" _ => println!(\"No correlation...\"),\n"
" }\n"
"}\n"
"```"
#: src/pattern-matching/match-guards.md:23
msgid ""
"* Match guards as a separate syntax feature are important and necessary when we wish to concisely express more complex ideas than patterns alone would allow.\n"
"* They are not the same as separate `if` expression inside of the match arm. An `if` expression inside of the branch block (after `=>`) happens after the match arm is selected. Failing the `if` condition inside of that block won't result in other arms\n"
"of the original `match` expression being considered. \n"
"* You can use the variables defined in the pattern in your if expression.\n"
"* The condition defined in the guard applies to every expression in a pattern with an `|`."
msgstr ""
"* ๋งค์น ๊ฐ๋๋ ๋ณ๋์ ๋ฌธ๋ฒ ์์๋ก์ ํจํด ์์ฒด๋ง์ผ๋ก ํํํ๊ธฐ ์ด๋ ค์ด ๋ณต์กํ ๊ฒฝ์ฐ๋ฅผ ๊ฐ๊ฒฐํ๊ฒ ํํํ๊ณ ์ ํ ๋ ์ ์ฉํฉ๋๋ค.\n"
"* ๋งค์น์ ๊ฐ ํ(ํน์ ๊ฐ์ง) ์์ ๋ฐ๋ก `if`๋ฅผ ์ฌ์ฉํ ๊ฒ๊ณผ ๋ค๋ฆ
๋๋ค. ๋งค์น ๊ฐ์ง์ `=>` ๋ค์ ์ฌ์ฉ๋ `if` ํํ์์ ํด๋น ๊ฐ์ง๊ฐ ์ ํ๋ ๋ค์์ ์คํ๋ฉ๋๋ค. ๋ฐ๋ผ์ ์ฌ๊ธฐ์ `if` ์กฐ๊ฑด์ด ์คํจํ๋๋ผ๋ ์๋ `match`์ ๋ค๋ฅธ ๊ฐ์ง๋ ๊ณ ๋ ค๋์ง ์์ต๋๋ค.\n"
"* ํจํด์ ์ ์๋ ๋ณ์๋ฅผ ๊ฐ๋์ ํํ์์์ ์ฌ์ฉํ ์ ์์ต๋๋ค.\n"
"* ๊ฐ๋์ ์ ์๋ ์กฐ๊ฑด์ `|` ๋ฅผ ํฌํจํ๋ ํจํด์ ๋ชจ๋ ํํ์์ ์ ์ฉ๋ฉ๋๋ค."
#: src/exercises/day-2/morning.md:1
msgid "# Day 2: Morning Exercises"
msgstr "# 2์ผ์ฐจ ์ค์ ์ฐ์ต๋ฌธ์ "
#: src/exercises/day-2/morning.md:3
msgid "We will look at implementing methods in two contexts:"
msgstr "์ด๋ฒ ์ฐ์ต๋ฌธ์ ๋ค์ ๋๊ฐ์ง ๋งฅ๋ฝ์์ ๋ฉ์๋ ๊ตฌํ๋ฐฉ๋ฒ์ ๋ค๋ฃน๋๋ค:"
#: src/exercises/day-2/morning.md:5
msgid ""
"* Simple struct which tracks health statistics.\n"
"\n"
"* Multiple structs and enums for a drawing library."
msgstr ""
"* ๊ฑด๊ฐ ์ํ ํต๊ณ๋ฅผ ์ถ์ ํ๋ ํ๋ก๊ทธ๋จ์ ๊ฐ๋จํ ๊ตฌ์กฐ์ฒด.\n"
"\n"
"* ๋๋ก์ ๋ผ์ด๋ธ๋ฌ๋ฆฌ๋ฅผ ์ํ ๊ตฌ์กฐ์ฒด ๋ฐ ์ด๊ฑฐํ."
#: src/exercises/day-2/health-statistics.md:1
msgid "# Health Statistics"
msgstr "# ๊ฑด๊ฐ์ํ ๋ชจ๋ํฐ๋ง ์์คํ
"
#: src/exercises/day-2/health-statistics.md:3
msgid ""
"You're working on implementing a health-monitoring system. As part of that, you\n"
"need to keep track of users' health statistics."
msgstr "๋น์ ์ ๊ฑด๊ฐ ์ํ๋ฅผ ๋ชจ๋ํฐ๋งํ๋ ์์คํ
์ ๊ตฌํํ๋ ์ผ์ ํ๊ณ ์์ต๋๋ค. ๊ทธ ์ผํ์ผ๋ก ๋น์ ์ ์ฌ์ฉ์์ ๊ฑด๊ฐ ์ํ ํต๊ณ๋ฅผ ์ถ์ ํด์ผํฉ๋๋ค."
#: src/exercises/day-2/health-statistics.md:6
msgid ""
"You'll start with some stubbed functions in an `impl` block as well as a `User`\n"
"struct definition. Your goal is to implement the stubbed out methods on the\n"
"`User` `struct` defined in the `impl` block."
msgstr "๋น์ ์ ๋ชฉํ๋ `User` ๊ตฌ์กฐ์ฒด์ `impl` ๋ธ๋ก์ ๋น ํจ์๋ฅผ ๊ตฌํํ๋ ๊ฒ์
๋๋ค."
#: src/exercises/day-2/health-statistics.md:10
msgid ""
"Copy the code below to >();\n"
" assert_eq!(points, vec![Point::new(12, 13), Point::new(16, 16)]);\n"
" }\n"
"\n"
" #[test]\n"
" fn test_shape_perimeters() {\n"
" let mut poly = Polygon::new();\n"
" poly.add_point(Point::new(12, 13));\n"
" poly.add_point(Point::new(17, 11));\n"
" poly.add_point(Point::new(16, 16));\n"
" let shapes = vec![\n"
" Shape::from(poly),\n"
" Shape::from(Circle::new(Point::new(10, 20), 5)),\n"
" ];\n"
" let perimeters = shapes\n"
" .iter()\n"
" .map(Shape::perimeter)\n"
" .map(round_two_digits)\n"
" .collect::>();\n"
" assert_eq!(perimeters, vec![15.48, 31.42]);\n"
" }\n"
"}\n"
"\n"
"#[allow(dead_code)]\n"
"fn main() {}\n"
"```"
msgstr ""
#: src/exercises/day-2/points-polygons.md:117
msgid ""
"Since the method signatures are missing from the problem statements, the key part\n"
"of the exercise is to specify those correctly. You don't have to modify the tests."
msgstr "๋๋ฝ๋ ๋ฉ์๋ ์๊ทธ๋์ฒ๋ฅผ ์ฌ๋ฐ๋ฅด๊ฒ ์ ์ํ๋ ๊ฒ์ด ๋ฌธ์ ์ ํต์ฌ ๋ถ๋ถ์
๋๋ค. ํ
์คํธ๋ ์์ ํ๋ฉด ์๋ฉ๋๋ค."
#: src/exercises/day-2/points-polygons.md:120
msgid "Other interesting parts of the exercise:"
msgstr "์ฐ์ต๋ฌธ์ ์ ๋ค๋ฅธ ํฅ๋ฏธ๋ก์ด ๋ถ๋ถ:"
#: src/exercises/day-2/points-polygons.md:122
msgid ""
"* Derive a `Copy` trait for some structs, as in tests the methods sometimes don't borrow their arguments.\n"
"* Discover that `Add` trait must be implemented for two objects to be addable via \"+\". Note that we do not discuss generics until Day 3."
msgstr ""
"* ํ
์คํธ ์ฝ๋๋ฅผ ๋ณด๋ฉด ์ด๋ค ๋ฉ์๋๋ค์ ์ธ์๋ฅผ borrowํ๋ ๋์ `Copy` ํธ๋ ์์ ์ฌ์ฉํ๊ธฐ๋ ํฉ๋๋ค. ๊ตฌ์กฐ์ฒด๊ฐ `Copy` ํธ๋ ์์ ์์(derive)ํ๋๋ก ํ๋ฉด ๋ฉ๋๋ค.\n"
"* \"+\"๋ฅผ ์ฌ์ฉํ์ฌ ๋ ๊ฐ์ฒด๋ฅผ ์๋ก ๋ํ๋ ค๋ฉด `Add` ํธ๋ ์์ ๊ตฌํํด์ผ ํฉ๋๋ค. ์ด๋ 3์ผ์ฐจ์ ๋ค๋ฃฐ ๋ด์ฉ์
๋๋ค."
#: src/control-flow.md:1
msgid "# Control Flow"
msgstr "# ํ๋ฆ ์ ์ด"
#: src/control-flow.md:3
msgid ""
"As we have seen, `if` is an expression in Rust. It is used to conditionally\n"
"evaluate one of two blocks, but the blocks can have a value which then becomes\n"
"the value of the `if` expression. Other control flow expressions work similarly\n"
"in Rust."
msgstr "์์์ ์ดํด๋ณธ ๋ฐ์ ๊ฐ์ด ๋ฌ์คํธ์์ `if`๋ ํํ์์
๋๋ค. ์กฐ๊ฑด์ ๋ฐ๋ผ ๋ ๋ธ๋ก ์ค ํ๋๋ฅผ ํ๊ฐํ๋ฉฐ, ๊ทธ ๊ฒฐ๊ณผ๊ฐ์ด `if` ํํ์์ ๊ฐ์ด ๋ฉ๋๋ค. ๋ค๋ฅธ ํ๋ฆ์ ์ด ํํ์๋ ์ ์ฌํ๊ฒ ์๋ํฉ๋๋ค."
#: src/control-flow/blocks.md:1
msgid "# Blocks"
msgstr "# ๋ธ๋ก"
#: src/control-flow/blocks.md:3
msgid ""
"A block in Rust has a value and a type: the value is the last expression of the\n"
"block:"
msgstr "๋ฌ์คํธ์์ ๋ธ๋ก์ ๊ฐ๊ณผ ํ์
์ ๊ฐ์ต๋๋ค. ๋ธ๋ก์ ๋ง์ง๋ง ํํ์์ด ๋ธ๋ก์ ๊ฐ์ด ๋ฉ๋๋ค:"
#: src/control-flow/blocks.md:6
msgid ""
"```rust,editable\n"
"fn main() {\n"
" let x = {\n"
" let y = 10;\n"
" println!(\"y: {y}\");\n"
" let z = {\n"
" let w = {\n"
" 3 + 4\n"
" };\n"
" println!(\"w: {w}\");\n"
" y * w\n"
" };\n"
" println!(\"z: {z}\");\n"
" z - y\n"
" };\n"
" println!(\"x: {x}\");\n"
"}\n"
"```"
msgstr ""
#: src/control-flow/blocks.md:25
msgid ""
"The same rule is used for functions: the value of the function body is the\n"
"return value:"
msgstr "ํจ์์๋ ๋์ผํ ๊ท์น์ด ์ ์ฉ๋ฉ๋๋ค. ํจ์ ๋ฐ๋๋ฅผ ์ด๋ฃจ๋ ๋ธ๋ก์ ๊ฐ์ด ๋ฐํ๊ฐ์ด ๋ฉ๋๋ค:"
#: src/control-flow/blocks.md:28
msgid ""
"```rust,editable\n"
"fn double(x: i32) -> i32 {\n"
" x + x\n"
"}\n"
"\n"
"fn main() {\n"
" println!(\"doubled: {}\", double(7));\n"
"}\n"
"```"
msgstr ""
"```rust,editable\n"
"fn double(x: i32) -> i32 {\n"
" x + x\n"
"}\n"
"\n"
"fn main() {\n"
" println!(\"doubled: {}\", double(7));\n"
"}\n"
"```"
#: src/control-flow/blocks.md:38
msgid "However if the last expression ends with `;`, then the resulting value and type is `()`."
msgstr "์์ `main` ํจ์๋ ๋ง์ง๋ง ํํ์์ด `;`๋ก ๋๋๊ธฐ ๋๋ฌธ์ ๋ฐํ๋๋ ๊ฐ๊ณผ ํ์
์ด `()`์
๋๋ค."
#: src/control-flow/blocks.md:43
msgid ""
"* The point of this slide is to show that blocks have a type and value in Rust. \n"
"* You can show how the value of the block changes by changing the last line in the block. For instance, adding/removing a semicolon or using a `return`.\n"
" "
msgstr ""
"* ๋ฌ์คํธ์์๋ ๋ธ๋ก์ด ํ์
๊ณผ ๊ฐ์ ๊ฐ์ง๋ค๋ ์ ์ด ์ด ์ฌ๋ผ์ด๋์ ํต์ฌ์
๋๋ค.\n"
"* ๋ธ๋ก ๋ง์ง๋ง ์ค์ ์์ ํ๋ฉด์ ๋ธ๋ก์ ๊ฐ์ด ์ด๋ป๊ฒ ๋ฐ๋๋์ง ๋ณด์ฌ์ฃผ์ธ์. ์๋ฅผ ๋ค์ด, ์ธ๋ฏธ์ฝ๋ก ์ ๋ฃ๊ฑฐ๋ ๋บ๋ค๋ ์ง, ์๋๋ฉด `return`์ ์ฌ์ฉํด ๋ณด์ธ์.\n"
" "
#: src/control-flow/if-expressions.md:1
msgid "# `if` expressions"
msgstr "# `if` ํํ์"
#: src/control-flow/if-expressions.md:3
msgid "You use `if` very similarly to how you would in other languages:"
msgstr "`if`๋ ๋ค๋ฅธ ์ธ์ด์ ๋งค์ฐ ์ ์ฌํฉ๋๋ค:"
#: src/control-flow/if-expressions.md:5
msgid ""
"```rust,editable\n"
"fn main() {\n"
" let mut x = 10;\n"
" if x % 2 == 0 {\n"
" x = x / 2;\n"
" } else {\n"
" x = 3 * x + 1;\n"
" }\n"
"}\n"
"```"
msgstr ""
#: src/control-flow/if-expressions.md:16
msgid "In addition, you can use it as an expression. This does the same as above:"
msgstr "๊ฒ๋ค๊ฐ `if`๋ ํํ์์ผ๋ก ์ฌ์ฉํ ์๋ ์์ต๋๋ค. ์๋ ์ฝ๋๋ ์์ ๋์ผํฉ๋๋ค:"
#: src/control-flow/if-expressions.md:18
msgid ""
"```rust,editable\n"
"fn main() {\n"
" let mut x = 10;\n"
" x = if x % 2 == 0 {\n"
" x / 2\n"
" } else {\n"
" 3 * x + 1\n"
" };\n"
"}\n"
"```"
msgstr ""
#: src/control-flow/if-expressions.md:31
msgid "Because `if` is an expression and must have a particular type, both of its branch blocks must have the same type. Consider showing what happens if you add `;` after `x / 2` in the second example."
msgstr "`if`๋ ํํ์์ด๊ณ ํ์
์ ๊ฐ์ ธ์ผ ํ๋ฏ๋ก ๋ถ๊ธฐ ๋ธ๋ก์ ๋ชจ๋ ๊ฐ์ ํ์
์ ๊ฐ์ ธ์ผ ํฉ๋๋ค. ๋๋ฒ์งธ ์์์ `x / 2` ๋ค์ `;`๋ฅผ ์ถ๊ฐํ์ฌ ์ด๋ป๊ฒ ๋๋์ง ํ์ธํด ๋ณด์๊ธฐ ๋ฐ๋๋๋ค."
#: src/control-flow/if-let-expressions.md:1
msgid "# `if let` expressions"
msgstr "# `if let` ํํ์"
#: src/control-flow/if-let-expressions.md:3
msgid "If you want to match a value against a pattern, you can use `if let`:"
msgstr "์ด๋ค ๊ฐ์ด ํจํด์ ๋งค์น๋๋์ง ๊ฒ์ฌํ๋ ค๋ฉด `if let` ํํ์์ ์ฌ์ฉํ๋ฉด ๋ฉ๋๋ค:"
#: src/control-flow/if-let-expressions.md:5
msgid ""
"```rust,editable\n"
"fn main() {\n"
" let arg = std::env::args().next();\n"
" if let Some(value) = arg {\n"
" println!(\"Program name: {value}\");\n"
" } else {\n"
" println!(\"Missing name?\");\n"
" }\n"
"}\n"
"```"
msgstr ""
#: src/control-flow/if-let-expressions.md:16
#: src/control-flow/while-let-expressions.md:21
#: src/control-flow/match-expressions.md:22
msgid ""
"See [pattern matching](../pattern-matching.md) for more details on patterns in\n"
"Rust."
msgstr "ํจํด์ ๊ดํ ์ค๋ช
์ [ํจํด ๋งค์นญ](../pattern-matching.md)์ ์ฐธ์กฐํ์ธ์."
#: src/control-flow/if-let-expressions.md:21
msgid ""
"* `if let` can be more concise than `match`, e.g., when only one case is interesting. In contrast, `match` requires all branches to be covered.\n"
" * For the similar use case consider demonstrating a newly stabilized [`let else`](https://github.com/rust-lang/rust/pull/93628) feature.\n"
"* A common usage is handling `Some` values when working with `Option`.\n"
"* Unlike `match`, `if let` does not support guard clauses for pattern matching."
msgstr ""
"* `if let`์ `match`๋ณด๋ค ๋ ๊ฐ๊ฒฐํ ์ ์์ต๋๋ค. ์๋ฅผ ๋ค์ด ํน์ ํ ๊ฒฝ์ฐ๋ง ๊ณ ๋ คํ๊ณ ์ถ๋๋ผ๋ `match`๋ ๋ชจ๋ ๋ถ๊ธฐ๋ฅผ ํฌํจํด์ผ ํฉ๋๋ค.\n"
" * ๋น์ทํ ์ฌ์ฉ๋ก๋ก ์๋กญ๊ฒ \"stable\" ๋ฆด๋ฆฌ์ฆ ๋ [`let else`](https://github.com/rust-lang/rust/pull/93628) ๊ธฐ๋ฅ์ ์์ฐํ๋ ๊ฒ๋ ๊ณ ๋ คํด ๋ณด์๊ธฐ ๋ฐ๋๋๋ค.\n"
"* ์ผ๋ฐ์ ์ผ๋ก `Option`์ผ๋ก ์์
ํ ๋ `Some` ๊ฐ์ ์ฒ๋ฆฌํ๋ ์์ผ๋ก ์ฌ์ฉ๋ฉ๋๋ค.\n"
"* `match`์ ๋ค๋ฅด๊ฒ `if let` ํจํด ๋งค์นญ์์๋ ๊ฐ๋๋ฅผ ์ง์ํ์ง ์์ต๋๋ค."
#: src/control-flow/while-expressions.md:1
msgid "# `while` expressions"
msgstr "# `while` ํํ์"
#: src/control-flow/while-expressions.md:3
msgid "The `while` keyword works very similar to other languages:"
msgstr "`while` ์ญ์ ๋ค๋ฅธ ์ธ์ด๊ณผ ๋งค์ฐ ๋น์ทํฉ๋๋ค:"
#: src/control-flow/while-expressions.md:5
msgid ""
"```rust,editable\n"
"fn main() {\n"
" let mut x = 10;\n"
" while x != 1 {\n"
" x = if x % 2 == 0 {\n"
" x / 2\n"
" } else {\n"
" 3 * x + 1\n"
" };\n"
" }\n"
" println!(\"Final x: {x}\");\n"
"}\n"
"```"
msgstr ""
#: src/control-flow/while-let-expressions.md:1
msgid "# `while let` expressions"
msgstr "# `while let` ํํ์"
#: src/control-flow/while-let-expressions.md:3
msgid ""
"Like with `if`, there is a `while let` variant which repeatedly tests a value\n"
"against a pattern:"
msgstr "`if`์ ๋์ผํ๊ฒ `while let`๊ตฌ๋ฌธ ์ญ์ ํจํด๋งค์นญ์ ์ฌ์ฉ ํ ์ ์์ต๋๋ค:"
#: src/control-flow/while-let-expressions.md:6
msgid ""
"```rust,editable\n"
"fn main() {\n"
" let v = vec![10, 20, 30];\n"
" let mut iter = v.into_iter();\n"
"\n"
" while let Some(x) = iter.next() {\n"
" println!(\"x: {x}\");\n"
" }\n"
"}\n"
"```"
msgstr ""
"```rust,editable\n"
"fn main() {\n"
" let v = vec![10, 20, 30];\n"
" let mut iter = v.into_iter();\n"
"\n"
" while let Some(x) = iter.next() {\n"
" println!(\"x: {x}\");\n"
" }\n"
"}\n"
"```"
#: src/control-flow/while-let-expressions.md:17
msgid ""
"Here the iterator returned by `v.iter()` will return a `Option` on every\n"
"call to `next()`. It returns `Some(x)` until it is done, after which it will\n"
"return `None`. The `while let` lets us keep iterating through all items."
msgstr "`v.into_iter()`๊ฐ ๋ฐํํ ๋ฐ๋ณต์๋ `next()`๊ฐ ํธ์ถ๋ ๋๋ง๋ค `Option`๋ฅผ ๋ฐํํฉ๋๋ค. ๋ฐ๋ณต์๊ฐ ์๋ฃ๋ ๋๊น์ง๋ `Some(x)`๋ฅผ ๋ฐํํ๊ณ ๋ง์ง๋ง์ `None`์ ๋ฐํํฉ๋๋ค. `while let`์ ํตํด ๋ฐ๋ณต์์ ๋ชจ๋ ์์ดํ
์ ํ์ธํ ์ ์์ต๋๋ค."
#: src/control-flow/while-let-expressions.md:27
msgid ""
"* Point out that the `while let` loop will keep going as long as the value matches the pattern.\n"
"* You could rewrite the `while let` loop as an infinite loop with an if statement that breaks when there is no value to unwrap for `iter.next()`. The `while let` provides syntactic sugar for the above scenario.\n"
" "
msgstr ""
"* `while let`์ ๊ฐ์ด ํจํด์ ๋งค์น๋๋ ๋์ ๊ณ์๋ฉ๋๋ค.\n"
"* `while let` ๋ฃจํ ๋์ ๋ฌดํ ๋ฃจํ๋ฅผ ์ฌ์ฉํ๊ณ `iter.next()`๊ฐ ๋น ๊ฐ์ ๋ฐํํ ๋ ๋ฃจํ๋ฅผ ๋น ์ ธ๋์ค๋๋ก ์์ฑํ ์๋ ์์ต๋๋ค. `while let`์ ๊ทธ๋ฌํ ๊ฒฝ์ฐ๋ฅผ ์ํ ๋ฌธ๋ฒ์ ํธ์๋ฅผ ์ ๊ณตํฉ๋๋ค.\n"
" "
#: src/control-flow/for-expressions.md:1
msgid "# `for` expressions"
msgstr "# `for` ํํ์"
#: src/control-flow/for-expressions.md:3
msgid ""
"The `for` expression is closely related to the `while let` expression. It will\n"
"automatically call `into_iter()` on the expression and then iterate over it:"
msgstr "`for`ํํ์์ `while let` ํํ์๊ณผ ๋งค์ฐ ์ ์ฌํฉ๋๋ค. `for`ํํ์์ ์๋์ผ๋ก `into_iter()`๋ฅผ ํธ์ถํ ๋ค์ ์ด๋ฅผ ๋ฐ๋ณตํฉ๋๋ค:"
#: src/control-flow/for-expressions.md:6
msgid ""
"```rust,editable\n"
"fn main() {\n"
" let v = vec![10, 20, 30];\n"
"\n"
" for x in v {\n"
" println!(\"x: {x}\");\n"
" }\n"
" \n"
" for i in (0..10).step_by(2) {\n"
" println!(\"i: {i}\");\n"
" }\n"
"}\n"
"```"
msgstr ""
"```rust,editable\n"
"fn main() {\n"
" let v = vec![10, 20, 30];\n"
"\n"
" for x in v {\n"
" println!(\"x: {x}\");\n"
" }\n"
" \n"
" for i in (0..10).step_by(2) {\n"
" println!(\"i: {i}\");\n"
" }\n"
"}\n"
"```"
#: src/control-flow/for-expressions.md:20
msgid "You can use `break` and `continue` here as usual."
msgstr "๋ค๋ฅธ ์ธ์ด์ ๋ง์ฐฌ๊ฐ์ง๋ก `break` ์ `continue`๋ฅผ ์ฌ์ฉํ ์ ์์ต๋๋ค."
#: src/control-flow/for-expressions.md:24
msgid ""
"* Index iteration is not a special syntax in Rust for just that case.\n"
"* `(0..10)` is a range that implements an `Iterator` trait. \n"
"* `step_by` is a method that returns another `Iterator` that skips every other element. \n"
"* Modify the elements in the vector and explain the compiler errors. Change vector `v` to be mutable and the for loop to `for x in v.iter_mut()`."
msgstr ""
"* ๋ฌ์คํธ๋ ์ธ๋ฑ์ค ๋ฐ๋ณต์ ์ํด ๋ณ๋์ ๋ฌธ๋ฒ์ ์ฌ์ฉํ์ง ์์ต๋๋ค. \n"
"* `(0..10)`์ `Iterator` ํธ๋ ์์ ๊ตฌํํ๋ ๋ฒ์(range) ๊ฐ์
๋๋ค. \n"
"* `step_by`๋ ๋ฐ๋ณต์์ ์์๋ค์ ๊ฑด๋๋ฐ๋ ๋๋ค๋ฅธ `Iterator`๋ฅผ ๋ฐํํ๋ ๋ฉ์๋์
๋๋ค.\n"
"* ๋ฒกํฐ ์์๋ค์ ์์ ํ๋ ค๊ณ ํ๋ฉด ๋์ค๋ ์ปดํ์ผ๋ฌ ์๋ฌ๋ฅผ ๊ฐ์ด ์ดํด๋ณด์ธ์. `v` ๋ฒกํฐ๋ฅผ ๊ฐ๋ณ ๋ณ์๋ก ๋ณ๊ฒฝํ๊ณ ๋ฃจํ๋ `for x in v.iter_mut()`๋ก ์์ ํ์ธ์."
#: src/control-flow/loop-expressions.md:1
msgid "# `loop` expressions"
msgstr "# `loop` ํํ์"
#: src/control-flow/loop-expressions.md:3
msgid ""
"Finally, there is a `loop` keyword which creates an endless loop. Here you must\n"
"either `break` or `return` to stop the loop:"
msgstr "๋ง์ง๋ง์ผ๋ก `loop`ํค์๋๋ ๋ฌดํ ๋ฃจํ๋ฅผ ์์ฑํฉ๋๋ค. ๋ฐ๋ผ์ ๋ฐ๋์ `break` ๋๋ `return`์ ์ฌ์ฉํด์ ๋ฃจํ๋ฅผ ์ ์งํด์ผ ํฉ๋๋ค:"
#: src/control-flow/loop-expressions.md:6
msgid ""
"```rust,editable\n"
"fn main() {\n"
" let mut x = 10;\n"
" loop {\n"
" x = if x % 2 == 0 {\n"
" x / 2\n"
" } else {\n"
" 3 * x + 1\n"
" };\n"
" if x == 1 {\n"
" break;\n"
" }\n"
" }\n"
" println!(\"Final x: {x}\");\n"
"}\n"
"```"
msgstr ""
#: src/control-flow/loop-expressions.md:25
msgid "* Break the `loop` with a value (e.g. `break 8`) and print it out."
msgstr "* `loop` ๋ธ๋ก์ ๋น ์ ธ๋์ฌ ๋ `break 8`์ฒ๋ผ ๊ฐ์ ์ง์ ํ๊ณ ๊ทธ๊ฑธ ์ถ๋ ฅํด๋ณด์ธ์."
#: src/control-flow/match-expressions.md:1
msgid "# `match` expressions"
msgstr "# `match` ํํ์"
#: src/control-flow/match-expressions.md:3
msgid ""
"The `match` keyword is used to match a value against one or more patterns. In\n"
"that sense, it works like a series of `if let` expressions:"
msgstr "`match`ํค์๋๋ ์ด๋ค ๊ฐ์ ํ๋ ์ด์์ ํจํด์ ๋ํด ๋งค์นํ๋๋ฐ ์ฌ์ฉํฉ๋๋ค. ๊ทธ๋ฐ ๋ฉด์์ `if let` ํํ์์ ์ฌ๋ฌ๊ฐ ์ด์ด ๋์ ๊ฒ๊ณผ ๊ฐ์ต๋๋ค:"
#: src/control-flow/match-expressions.md:6
msgid ""
"```rust,editable\n"
"fn main() {\n"
" match std::env::args().next().as_deref() {\n"
" Some(\"cat\") => println!(\"Will do cat things\"),\n"
" Some(\"ls\") => println!(\"Will ls some files\"),\n"
" Some(\"mv\") => println!(\"Let's move some files\"),\n"
" Some(\"rm\") => println!(\"Uh, dangerous!\"),\n"
" None => println!(\"Hmm, no program name?\"),\n"
" _ => println!(\"Unknown program name!\"),\n"
" }\n"
"}\n"
"```"
msgstr ""
"```rust,editable\n"
"fn main() {\n"
" match std::env::args().next().as_deref() {\n"
" Some(\"cat\") => println!(\"Will do cat things\"),\n"
" Some(\"ls\") => println!(\"Will ls some files\"),\n"
" Some(\"mv\") => println!(\"Let's move some files\"),\n"
" Some(\"rm\") => println!(\"Uh, dangerous!\"),\n"
" None => println!(\"Hmm, no program name?\"),\n"
" _ => println!(\"Unknown program name!\"),\n"
" }\n"
"}\n"
"```"
#: src/control-flow/match-expressions.md:19
msgid ""
"Like `if let`, each match arm must have the same type. The type is the last\n"
"expression of the block, if any. In the example above, the type is `()`."
msgstr "`if let`๊ณผ ๋ง์ฐฌ๊ฐ์ง๋ก ๋งค์น์ ๋ชจ๋ ํ(arm)์ ๊ฐ์ ํ์
์ด์ด์ผ ํฉ๋๋ค. ํ์ด ๋ธ๋ก์ด๋ผ๋ฉด ๋ธ๋ก์ ๋ง์ง๋ง ํํ์์ด ๊ทธ ํ์
์ด ๋ฉ๋๋ค. ์์ ์์ ์์ ๋งค์น ํํ์์ ํ์
์ `()`์
๋๋ค."
#: src/control-flow/match-expressions.md:27
msgid ""
"* Save the match expression to a variable and print it out.\n"
"* Remove `.as_deref()` and explain the error.\n"
" * `std::env::args().next()` returns an `Option`, but we cannot match against `String`.\n"
" * `as_deref()` transforms an `Option` to `Option<&T::Target>`. In our case, this turns `Option` into `Option<&str>`.\n"
" * We can now use pattern matching to match against the `&str` inside `Option`."
msgstr ""
"* `match` ํํ์์ ๋ณ์์ ํ ๋นํ๊ณ ๊ทธ ๊ฐ์ ์ถ๋ ฅํด๋ณด์ธ์.\n"
"* `.as_deref()`๋ฅผ ์ง์๋ณด๊ณ , ์ด ๋ ๋์ค๋ ์๋ฌ๋ฅผ ์ค๋ช
ํด์ฃผ์ธ์.\n"
" * `std::env::args().next()`๋ `Option` ๊ฐ์ ๋ฐํํ๋๋ฐ, `String`์ ์ง์ ๋งค์นํ ์ ์์ต๋๋ค.\n"
" * `as_deref()`๋ `Option`๋ฅผ `Option<&T::Target>`์ผ๋ก ๋ฐ๊ฟ์ค๋๋ค. ์ด ๊ฒฝ์ฐ๋ `Option`์์ `Option<&str>`๋ก ๋ฐ๋๋๋ค.\n"
" * ์ด์ ๋ ํจํด ๋งค์นญ์ผ๋ก `Option` ์์ `&str`์ ๋งค์นํ ์ ์์ต๋๋ค."
#: src/control-flow/break-continue.md:1
msgid "# `break` and `continue`"
msgstr "# `break`์ `continue`"
#: src/control-flow/break-continue.md:3
msgid ""
"If you want to exit a loop early, use `break`, if you want to immediately start\n"
"the next iteration use `continue`. Both `continue` and `break` can optionally\n"
"take a label argument which is used to break out of nested loops:"
msgstr "๋ฃจํ๋ฅผ ๋น ์ ธ๋๊ฐ๋ ค๋ฉด `break`๋ฅผ, ๋ค์ ๋ฐ๋ณต์ผ๋ก ๋์ด๊ฐ๊ธฐ ์ํด์๋ `continue`๋ฅผ ์ฌ์ฉํฉ๋๋ค. ์ค์ฒฉ ๋ฃจํ์์๋ ๋ ์ด๋ธ๊ณผ ํจ๊ป ์ฌ์ฉํ ์ ์์ต๋๋ค:"
#: src/control-flow/break-continue.md:7
msgid ""
"```rust,editable\n"
"fn main() {\n"
" let v = vec![10, 20, 30];\n"
" let mut iter = v.into_iter();\n"
" 'outer: while let Some(x) = iter.next() {\n"
" println!(\"x: {x}\");\n"
" let mut i = 0;\n"
" while i < x {\n"
" println!(\"x: {x}, i: {i}\");\n"
" i += 1;\n"
" if i == 3 {\n"
" break 'outer;\n"
" }\n"
" }\n"
" }\n"
"}\n"
"```"
msgstr ""
"```rust,editable\n"
"fn main() {\n"
" let v = vec![10, 20, 30];\n"
" let mut iter = v.into_iter();\n"
" 'outer: while let Some(x) = iter.next() {\n"
" println!(\"x: {x}\");\n"
" let mut i = 0;\n"
" while i < x {\n"
" println!(\"x: {x}, i: {i}\");\n"
" i += 1;\n"
" if i == 3 {\n"
" break 'outer;\n"
" }\n"
" }\n"
" }\n"
"}\n"
"```"
#: src/control-flow/break-continue.md:25
msgid "In this case we break the outer loop after 3 iterations of the inner loop."
msgstr "์ ์์ ๋ ๋ด๋ถ์ `while` ๋ฃจํ๋ฅผ 3ํ ๋ฐ๋ณตํ ํ ๋ฐ๊นฅ ๋ฃจํ๋ฅผ ๋น ์ ธ๋๊ฐ๋๋ค."
#: src/std.md:1
msgid "# Standard Library"
msgstr "# ํ์ค ๋ผ์ด๋ธ๋ฌ๋ฆฌ"
#: src/std.md:3
msgid ""
"Rust comes with a standard library which helps establish a set of common types\n"
"used by Rust library and programs. This way, two libraries can work together\n"
"smoothly because they both use the same `String` type."
msgstr "๋ฌ์คํธ์์ ์ ๊ณตํ๋ ํ์ค ๋ผ์ด๋ธ๋ฌ๋ฆฌ๋ ๋ฌ์คํธ๋ก ๋ผ์ด๋ธ๋ฌ๋ฆฌ๋ ํ๋ก๊ทธ๋จ์ ์์ฑํ ๋ ๊ณตํต์ ์ผ๋ก ์ฌ์ฉํ ์ ์๋ ์ฌ๋ฌ ํ์
๋ค์ ํฌํจํ๊ณ ์์ต๋๋ค. ์ด๋ฅผ ํตํด ์๋ก ๋ค๋ฅธ ๋ ๋ผ์ด๋ธ๋ฌ๋ฆฌ๋ผ ํ๋๋ผ๋ ํจ๊ป ์ฌ์ฉํ๋๋ฐ ํฐ ์ด๋ ค์์ด ์๊ฒ ๋ฉ๋๋ค. ์๋ฅผ ๋ค๋ฉด ๋ ๋ผ์ด๋ธ๋ฌ๋ฆฌ ๋ชจ๋ ๊ฐ์ `String` ํ์
์ ์ฌ์ฉํ๊ธฐ ๋๋ฌธ์
๋๋ค."
#: src/std.md:7
msgid "The common vocabulary types include:"
msgstr "์ผ๋ฐ์ ์ธ ํ์
์ ์๋์ ๊ฐ์ต๋๋ค:"
#: src/std.md:9
msgid ""
"* [`Option` and `Result`](std/option-result.md) types: used for optional values\n"
" and [error handling](error-handling.md).\n"
"\n"
"* [`String`](std/string.md): the default string type used for owned data.\n"
"\n"
"* [`Vec`](std/vec.md): a standard extensible vector.\n"
"\n"
"* [`HashMap`](std/hashmap.md): a hash map type with a configurable hashing\n"
" algorithm.\n"
"\n"
"* [`Box`](std/box.md): an owned pointer for heap-allocated data.\n"
"\n"
"* [`Rc`](std/rc.md): a shared reference-counted pointer for heap-allocated data."
msgstr ""
"* [`Option`๊ณผ `Result`](std/option-result.md) : ์ด๋ค ๊ฐ์ด ์๊ฑฐ๋ ์๊ฑฐ๋ ํ๋ ๊ฒฝ์ฐ, ๊ทธ๋ฆฌ๊ณ [์ค๋ฅ ์ฒ๋ฆฌ](error-handling.md)์ ์ฌ์ฉํฉ๋๋ค.\n"
"\n"
"* [`String`](std/string.md): ๊ธฐ๋ณธ์ ์ธ ๋ฌธ์์ด ํ์
์ผ๋ก, ๋ฌธ์์ด ๋ฐ์ดํฐ๋ฅผ ์์ ํ๋ ๊ฒฝ์ฐ์ ์ฌ์ฉํฉ๋๋ค.\n"
"\n"
"* [`Vec`](std/vec.md): ๊ฐ๋ณ ํฌ๊ธฐ์ ํ์ค ๋ฒกํฐ ํ์
์
๋๋ค.\n"
"\n"
"* [`HashMap`](std/hashmap.md): ํด์ ์๊ณ ๋ฆฌ์ฆ์ ๋ฐ๋ก ์ง์ ํ ์๋ ์๋ ํด์๋งต ํ์
์
๋๋ค.\n"
"\n"
"* [`Box`](std/box.md): ํ ๋ฐ์ดํฐ์ ๋ํ ์์ ํฌ์ธํฐ์
๋๋ค.\n"
"\n"
"* [`Rc`](std/rc.md): ํ์ ํ ๋น๋ ๋ฐ์ดํฐ์ ๋ํ ์ฐธ์กฐ ์นด์ดํ
๊ณต์ ํฌ์ธํฐ์
๋๋ค."
#: src/std.md:25
msgid ""
" * In fact, Rust contains several layers of the Standard Library: `core`, `alloc` and `std`. \n"
" * `core` includes the most basic types and functions that don't depend on `libc`, allocator or\n"
" even the presence of an operating system. \n"
" * `alloc` includes types which require a global heap allocator, such as `Vec`, `Box` and `Arc`.\n"
" * Embedded Rust applications often only use `core`, and sometimes `alloc`."
msgstr ""
" * ์ฌ์ค, ๋ฌ์คํธ์ ํ์ค ๋ผ์ด๋ธ๋ฌ๋ฆฌ๋ `core`, `alloc`, `std`์ ๊ฐ์ด ๊ณ์ธต(layer)์ผ๋ก ๋๋ ์ง๋๋ค.\n"
" * `core`๋ `libc`๋ ํ ๋น์(allocator), ์ฌ์ง์ด OS์๋ ์์กดํ์ง ์๋ ๊ฐ์ฅ ๊ธฐ๋ณธ์ ์ธ ํจ์์ ํ์
์ ํฌํจํฉ๋๋ค.\n"
" * `alloc`์ `Vec`, `Box`, `Arc`์ ๊ฐ์ด ์ ์ญ ํ ํ ๋น์ด ํ์ํ ํ์
์ ํฌํจํฉ๋๋ค.\n"
" * ์๋ฒ ๋๋ ๋ฌ์คํธ ์์ฉํ๋ก๊ทธ๋จ์ ์ฃผ๋ก `core`๋ง ์ฌ์ฉํ๊ฑฐ๋ ๊ฐ๋ `alloc`์ ํจ๊ป ์ฌ์ฉํฉ๋๋ค."
#: src/std/option-result.md:1
msgid "# `Option` and `Result`"
msgstr "# `Option`๊ณผ `Result`"
#: src/std/option-result.md:3
msgid "The types represent optional data:"
msgstr "์ด ํ์
์ ์ ํ์ ๋ฐ์ดํฐ๋ฅผ ๋ํ๋
๋๋ค:"
#: src/std/option-result.md:5
msgid ""
"```rust,editable\n"
"fn main() {\n"
" let numbers = vec![10, 20, 30];\n"
" let first: Option<&i8> = numbers.first();\n"
" println!(\"first: {first:?}\");\n"
"\n"
" let idx: Result = numbers.binary_search(&10);\n"
" println!(\"idx: {idx:?}\");\n"
"}\n"
"```"
msgstr ""
#: src/std/option-result.md:18
msgid ""
"* `Option` and `Result` are widely used not just in the standard library.\n"
"* `Option<&T>` has zero space overhead compared to `&T`.\n"
"* `Result` is the standard type to implement error handling as we will see on Day 3.\n"
"* `binary_search` returns `Result`.\n"
" * If found, `Result::Ok` holds the index where the element is found.\n"
" * Otherwise, `Result::Err` contains the index where such an element should be inserted."
msgstr ""
"* `Option`๊ณผ `Result`๋ ํ์ค ๋ผ์ด๋ธ๋ฌ๋ฆฌ๋ฟ๋ง์๋๋ผ ๋งค์ฐ ๊ด๋ฒ์ํ๊ฒ ์ฌ์ฉ๋๋ ํ์
์
๋๋ค.\n"
"* `Option<&T>` ๋ `&T`์ ๋นํด ๊ณต๊ฐ ์ค๋ฒํค๋๊ฐ ์์ต๋๋ค.\n"
"* `Result`๋ ์ค๋ฅ ์ฒ๋ฆฌ๋ฅผ ์ํ ํ์ค ํ์
์
๋๋ค. 3์ผ์ฐจ ๊ณผ์ ์์ ์ดํด๋ด
๋๋ค.\n"
"* `binary_search`๋ `Result`๋ฅผ ๋ฐํํฉ๋๋ค.\n"
" * ์์๊ฐ ๋ฐ๊ฒฌ๋๋ค๋ฉด, `Result::Ok`๋ ๋ฐ๊ฒฌ๋ ์์์ ์ธ๋ฑ์ค๋ฅผ ๋ณด์ ํฉ๋๋ค.\n"
" * ์๋๋ฉด, `Result::Err`์๋ ์์๊ฐ ์ฝ์
๋์ผ ํ๋ ์ธ๋ฑ์ค๊ฐ ํฌํจ๋์ด ์์ต๋๋ค."
#: src/std/string.md:1
msgid "# String"
msgstr "# `String` ๋ฌธ์์ด"
#: src/std/string.md:3
msgid "[`String`][1] is the standard heap-allocated growable UTF-8 string buffer:"
msgstr "[`String`][1]์ ํ์ ํ ๋น๋๊ณ ๊ฐ๋ณ ๊ธธ์ด์ ํ์ค UTF-8 ๋ฌธ์์ด ๋ฒํผ์
๋๋ค:"
#: src/std/string.md:5
msgid ""
"```rust,editable\n"
"fn main() {\n"
" let mut s1 = String::new();\n"
" s1.push_str(\"Hello\");\n"
" println!(\"s1: len = {}, capacity = {}\", s1.len(), s1.capacity());\n"
"\n"
" let mut s2 = String::with_capacity(s1.len() + 1);\n"
" s2.push_str(&s1);\n"
" s2.push('!');\n"
" println!(\"s2: len = {}, capacity = {}\", s2.len(), s2.capacity());\n"
"\n"
" let s3 = String::from(\"๐จ๐ญ\");\n"
" println!(\"s3: len = {}, number of chars = {}\", s3.len(),\n"
" s3.chars().count());\n"
"}\n"
"```"
msgstr ""
#: src/std/string.md:22
msgid ""
"`String` implements [`Deref`][2], which means that you can call all\n"
"`str` methods on a `String`."
msgstr "`String`์ [`Deref`][2]์ ๊ตฌํํฉ๋๋ค. ์ด๋ , `String` ๊ฐ์ ๋ํด์๋ `str`์ ๋ชจ๋ ๋ฉ์๋๋ฅผ ํธ์ถ ํ ์ ์๋ค๋ ์๋ฏธ ์
๋๋ค."
#: src/std/string.md:30
msgid ""
"* `String::new` returns a new empty string, use `String::with_capacity` when you know how much data you want to push to the string.\n"
"* `String::len` returns the size of the `String` in bytes (which can be different from its length in characters).\n"
"* `String::chars` returns an iterator over the actual characters. Note that a `char` can be different from what a human will consider a \"character\" due to [grapheme clusters](https://docs.rs/unicode-segmentation/latest/unicode_segmentation/struct.Graphemes.html).\n"
"* When people refer to strings they could either be talking about `&str` or `String`. \n"
"* When a type implements `Deref`, the compiler will let you transparently call methods from `T`.\n"
" * `String` implements `Deref` which transparently gives it access to `str`'s methods.\n"
" * Write and compare `let s3 = s1.deref();` and `let s3 = &*s1`;.\n"
"* `String` is implemented as a wrapper around a vector of bytes, many of the operations you see supported on vectors are also supported on `String`, but with some extra guarantees.\n"
"* Compare the different ways to index a `String` by using `s3[i]` and `s3.chars().nth(i).unwrap()` where `i` is in-bound, out-of-bounds, and \"on\" the flag Unicode character."
msgstr ""
"* `String::new`๋ ์๋ก์ด ๋น ๋ฌธ์์ด์ ๋ฐํํฉ๋๋ค. `String::with_capacity`๋ ์๋ก ๋ง๋ค ๋ฌธ์์ด ๋ฒํผ์ ๋ฃ์ ๋ฐ์ดํฐ ํฌ๊ธฐ๋ฅผ ์๊ณ ์๋ ๊ฒฝ์ฐ์ ์ฌ์ฉํ ์ ์์ต๋๋ค.\n"
"* `String::len`์ `String`์ ๋ฐ์ดํธ ํฌ๊ธฐ๋ฅผ ๋ฐํํฉ๋๋ค. (์ค์ ๋ฌธ์ ๊ฐ์์๋ ๋ค๋ฅผ ์ ์์ต๋๋ค.)\n"
"* `String::chars`๋ ์ค์ ๋ฌธ์(character)๋ค์ ๋ํ ์ดํฐ๋ ์ดํฐ๋ฅผ ๋ฐํํฉ๋๋ค. `char`๋ก ํํ๋๋ ๋ฌธ์๋ ์ฐ๋ฆฌ๊ฐ ์ค์ ๋ก ์ธ์ํ๊ณ ์ฌ์ฉํ๋ ๋ฌธ์์๋ ๋ค๋ฅผ ์ ์์ต๋๋ค. ์์ ๊ฒฐํฉ์ผ๋ก ๋ฌธ์๋ฅผ ํํํ๋ ๊ฒฝ์ฐ๊ฐ ์๊ธฐ ๋๋ฌธ์
๋๋ค. ์ด์ ๋ํด์๋ [Grapheme Cluster](https://docs.rs/unicode-segmentation/latest/unicode_segmentation/struct.Graphemes.html)๋ฅผ ์ฐธ๊ณ ํ์ธ์.\n"
"* ๋ฌธ์์ด์ด๋ผ๊ณ ์ธ๊ธํ๋ ๊ฒฝ์ฐ๋ `&str`์ด๊ฑฐ๋ `String`์ผ ์ ์์ต๋๋ค.\n"
"* ์ด๋ค ํ์
์ด `Deref`๋ฅผ ๊ตฌํํ๊ณ ์์ผ๋ฉด, ์ปดํ์ผ๋ฌ๋ ์ฌ๋ฌ๋ถ์ด `T`์ ๋ฉ์๋๋ค์ ํธ์ถํ ์ ์๊ฒ ๋์์ค๋๋ค.\n"
" * `String`์ `Deref`์ ๊ตฌํํ๊ณ ์๊ธฐ ๋๋ฌธ์ `String`์ ๋ํด์๋ `str` ๋ฉ์๋๋ค์ ํธ์ถํ ์ ์์ต๋๋ค.\n"
" * `let s3 = s1.deref();`์ `let s3 = &*s1;`์ ๋น๊ตํด๋ณด์ธ์.\n"
"* `String`์ ๋ฐ์ดํธ ๋ฒกํฐ์ ๋ํผ๋ก ๊ตฌํ๋์ด ์์ต๋๋ค. ๋ฒกํฐ๊ฐ ์ง์ํ๋ ์ฌ๋ฌ๊ฐ์ง ์ฐ์ฐ๋ค์ `String`๋ ์ง์ํฉ๋๋ค. ๋ค๋ง `String`์ ๋ช๊ฐ์ง ๋ณด์ฅ ๋ด์ฉ์ด ๋ ์์ต๋๋ค.\n"
"* `String`์ ์ธ๋ฑ์ค๋ก ์ ๊ทผํ๋ ๋ฐฉ๋ฒ๋ค์ ๋น๊ตํด๋ณด์ธ์. `s3[i]`์ `s3.chars().nth(i).unwrap()` ๋ฐฉ๋ฒ์ ๋ํด `i`๊ฐ์ด ๋ฒ์๋ฅผ ๋ฒ์ด๋ ๋, ๋ฒ์ด๋์ง ์์ ๋, ํน์ ํ๋๊ทธ ์ ๋์ฝ๋ ๋ฌธ์์ ๋ฑ ๊ฑธ๋ฆฐ ๊ฒฝ์ฐ ๋ฑ์ ๋น๊ต ์ค๋ช
ํด์ฃผ์ธ์."
#: src/std/vec.md:1
msgid "# `Vec`"
msgstr "# `Vec`"
#: src/std/vec.md:3
msgid "[`Vec`][1] is the standard resizable heap-allocated buffer:"
msgstr "[`Vec`][1] ๋ ํ์ ํ ๋น๋ ํ์ค ๊ฐ๋ณ ํฌ๊ธฐ ๋ฒํผ์
๋๋ค:"
#: src/std/vec.md:5
msgid ""
"```rust,editable\n"
"fn main() {\n"
" let mut v1 = Vec::new();\n"
" v1.push(42);\n"
" println!(\"v1: len = {}, capacity = {}\", v1.len(), v1.capacity());\n"
"\n"
" let mut v2 = Vec::with_capacity(v1.len() + 1);\n"
" v2.extend(v1.iter());\n"
" v2.push(9999);\n"
" println!(\"v2: len = {}, capacity = {}\", v2.len(), v2.capacity());\n"
"\n"
" // Canonical macro to initialize a vector with elements.\n"
" let mut v3 = vec![0, 0, 1, 2, 3, 4];\n"
"\n"
" // Retain only the even elements.\n"
" v3.retain(|x| x % 2 == 0);\n"
" println!(\"{v3:?}\");\n"
"\n"
" // Remove consecutive duplicates.\n"
" v3.dedup();\n"
" println!(\"{v3:?}\");\n"
"}\n"
"```"
msgstr ""
#: src/std/vec.md:29
msgid ""
"`Vec` implements [`Deref`][2], which means that you can call slice\n"
"methods on a `Vec`."
msgstr "`Vec`์ [`Deref`][2]๋ฅผ ๊ตฌํํฉ๋๋ค. ์ด๋ `Vec`์์ ์ฌ๋ผ์ด์ค ๋ฉ์๋๋ฅผ ํธ์ถ ํ ์ ์๋ค๋ ์๋ฏธ์
๋๋ค."
#: src/std/vec.md:37
msgid ""
"* `Vec` is a type of collection, along with `String` and `HashMap`. The data it contains is stored\n"
" on the heap. This means the amount of data doesn't need to be known at compile time. It can grow\n"
" or shrink at runtime.\n"
"* Notice how `Vec` is a generic type too, but you don't have to specify `T` explicitly. As always\n"
" with Rust type inference, the `T` was established during the first `push` call.\n"
"* `vec![...]` is a canonical macro to use instead of `Vec::new()` and it supports adding initial\n"
" elements to the vector.\n"
"* To index the vector you use `[` `]`, but they will panic if out of bounds. Alternatively, using\n"
" `get` will return an `Option`. The `pop` function will remove the last element.\n"
"* Show iterating over a vector and mutating the value:\n"
" `for e in &mut v { *e += 50; }`"
msgstr ""
"* `Vec`์ `String`์ด๋ `HashMap`๊ณผ ๊ฐ์ ์ปฌ๋ ์
ํ์
์
๋๋ค. ๋ฒกํฐ๋ ๋ฐ์ดํฐ๋ฅผ ํ์ ์ ์ฅํฉ๋๋ค. ์ด๋ ์ปดํ์ผ ์์ ์ ๋ฐ์ดํฐ ํฌ๊ธฐ๋ฅผ ์ ํ์๊ฐ ์๋ค๋ ์๋ฏธ๊ณ , ๋ฐํ์์ ๋ ์ปค์ง ์๋ ์์์ง ์๋ ์์ต๋๋ค.\n"
"* `Vec`๋ ์ ๋ค๋ฆญ ํ์
์ด๊ธฐ๋ ํฉ๋๋ค. ํ์ง๋ง `T`๋ฅผ ๊ผญ ์ง์ ํด์ค ํ์๋ ์์ต๋๋ค. ์ด ๊ฒฝ์ฐ, ๋ฌ์คํธ ํ์
์ถ๋ก ์ด ๋ฒกํฐ์ ์ฒ์ `push`ํ๋ ๋ฐ์ดํฐ๋ก `T`๋ฅผ ์ ์ ์์์ต๋๋ค.\n"
"* `vec![...]`๋ `Vec::new()` ๋์ ์ธ ์ ์๋ ํ์ค ๋งคํฌ๋ก๋ก์, ์ด๊ธฐ ๋ฐ์ดํฐ๋ฅผ ์ถ๊ฐํ ๋ฒกํฐ๋ฅผ ์์ฑํ ์ ์์ต๋๋ค.\n"
"* ๋ฒกํฐ๋ `[` `]`๋ฅผ ์ฌ์ฉํ์ฌ ์ธ๋ฑ์ค๋ก ์ ๊ทผํ ์ ์์ต๋๋ค. ํ์ง๋ง ๋ฒ์๋ฅผ ๋ฒ์ด๋๋ฉด ํจ๋์ด ๋ฐ์ํฉ๋๋ค. ๋์ `get`์ ์ฌ์ฉํ๋ฉด `Option`์ ๋ฐํํฉ๋๋ค. `pop` ํจ์๋ ๋ง์ง๋ง ์์๋ฅผ ์ ๊ฑฐํฉ๋๋ค.\n"
"* ๋ฒกํฐ๋ฅผ ์ํํ๋ฉด์ ๊ฐ์ ๋ณ๊ฒฝํ ์๋ ์์์ ๋ณด์ฌ์ฃผ์ธ์: `for e in &mut v { *e += 50; }`"
#: src/std/hashmap.md:1
msgid "# `HashMap`"
msgstr "# `HashMap`"
#: src/std/hashmap.md:3
msgid "Standard hash map with protection against HashDoS attacks:"
msgstr "HashDoS ๊ณต๊ฒฉ์ผ๋ก๋ถํฐ ๋ณดํธ๋๋ ํ์ค ํด์ ๋งต์
๋๋ค:"
#: src/std/hashmap.md:5
msgid ""
"```rust,editable\n"
"use std::collections::HashMap;\n"
"\n"
"fn main() {\n"
" let mut page_counts = HashMap::new();\n"
" page_counts.insert(\"Adventures of Huckleberry Finn\".to_string(), 207);\n"
" page_counts.insert(\"Grimms' Fairy Tales\".to_string(), 751);\n"
" page_counts.insert(\"Pride and Prejudice\".to_string(), 303);\n"
"\n"
" if !page_counts.contains_key(\"Les Misรฉrables\") {\n"
" println!(\"We know about {} books, but not Les Misรฉrables.\",\n"
" page_counts.len());\n"
" }\n"
"\n"
" for book in [\"Pride and Prejudice\", \"Alice's Adventure in Wonderland\"] {\n"
" match page_counts.get(book) {\n"
" Some(count) => println!(\"{book}: {count} pages\"),\n"
" None => println!(\"{book} is unknown.\")\n"
" }\n"
" }\n"
"\n"
" // Use the .entry() method to insert a value if nothing is found.\n"
" for book in [\"Pride and Prejudice\", \"Alice's Adventure in Wonderland\"] {\n"
" let page_count: &mut i32 = page_counts.entry(book.to_string()).or_insert(0);\n"
" *page_count += 1;\n"
" }\n"
"\n"
" println!(\"{page_counts:#?}\");\n"
"}\n"
"```"
msgstr ""
#: src/std/hashmap.md:38
msgid ""
"* `HashMap` is not defined in the prelude and needs to be brought into scope.\n"
"* Try the following lines of code. The first line will see if a book is in the hashmap and if not return an alternative value. The second line will insert the alternative value in the hashmap if the book is not found.\n"
"\n"
" ```rust,ignore\n"
" let pc1 = page_counts\n"
" .get(\"Harry Potter and the Sorcerer's Stone \")\n"
" .unwrap_or(&336);\n"
" let pc2 = page_counts\n"
" .entry(\"The Hunger Games\".to_string())\n"
" .or_insert(374);\n"
" ```\n"
"* Unlike `vec!`, there is unfortunately no standard `hashmap!` macro.\n"
" * Although, since Rust 1.56, HashMap implements [`From<[(K, V); N]>`][1], which allows us to easily initialize a hash map from a literal array:\n"
"\n"
" ```rust,ignore\n"
" let page_counts = HashMap::from([\n"
" (\"Harry Potter and the Sorcerer's Stone\".to_string(), 336),\n"
" (\"The Hunger Games\".to_string(), 374),\n"
" ]);\n"
" ```\n"
"\n"
" * Alternatively HashMap can be built from any `Iterator` which yields key-value tuples.\n"
"* We are showing `HashMap`, and avoid using `&str` as key to make examples easier. Using references in collections can, of course, be done,\n"
" but it can lead into complications with the borrow checker.\n"
" * Try removing `to_string()` from the example above and see if it still compiles. Where do you think we might run into issues?"
msgstr ""
"* `HashMap`์ prelude์ ์ ์๋์ด ์์ง ์๊ธฐ ๋๋ฌธ์ ๋ช
์์ ์ผ๋ก ์ถ๊ฐํด์ค์ผ ํฉ๋๋ค.\n"
"* ์๋ ์ฝ๋๋ฅผ ํ
์คํธํด๋ณด์ธ์. ์ฒซ ๋ฌธ์ฅ์์๋ ํด์๋งต์ ์ฑ
์ด ์๋์ง ๊ฒ์ฌํ์ฌ, ์์ผ๋ฉด ๋ํดํธ ๊ฐ์ ๋ฐํํฉ๋๋ค. ๋๋ฒ ์งธ ๋ฌธ์ฅ์์๋ ํด์๋งต์ ํด๋น ์ฑ
์ด ์๋ ๊ฒฝ์ฐ, ์ง์ ํ ๊ฐ์ ํด์๋งต์ ์ถ๊ฐํ ๋ค ๊ทธ ๊ฐ์ ๋ฐํํฉ๋๋ค.\n"
"\n"
" ```rust,ignore\n"
" let pc1 = page_counts\n"
" .get(\"Harry Potter and the Sorcerer's Stone \")\n"
" .unwrap_or(&336);\n"
" let pc2 = page_counts\n"
" .entry(\"The Hunger Games\".to_string())\n"
" .or_insert(374);\n"
" ```\n"
"* ์ํ๊น์ง๋ง `hashmap!`๊ฐ์ ๋งคํฌ๋ก๊ฐ ์์ต๋๋ค.\n"
" * ๋ฌ์คํธ 1.56๋ถํฐ๋ `HashMap`์ด [`From<[(K, V); N]>`][1]์ ๊ตฌํํ๊ธฐ ๋๋ฌธ์ ๋ฐฐ์ด ๋ฆฌํฐ๋ด์ ์ด์ฉํ์ฌ ์ฝ๊ฒ ํด์๋งต์ ์ด๊ธฐํํ ์ ์์ต๋๋ค:\n"
"\n"
" ```rust,ignore\n"
" let page_counts = HashMap::from([\n"
" (\"Harry Potter and the Sorcerer's Stone\".to_string(), 336),\n"
" (\"The Hunger Games\".to_string(), 374),\n"
" ]);\n"
" ```\n"
"\n"
" * ํค-๊ฐ ์์ ๋ํ `Iterator`๋ก ํด์๋งต์ ๋ง๋ค ์๋ ์์ต๋๋ค.\n"
"* ์์ ์ฝ๋์์๋ ํธ์์ ํด์๋งต์ ํค๋ก `&str`๋ฅผ ์ฌ์ฉํ์ง ์์์ต๋๋ค. ๋ฌผ๋ก ์ปฌ๋ ์
์ ์ฐธ์กฐ๋ฅผ ์ฌ์ฉํ ์๋ ์์ต๋๋ค. ๋ค๋ง ์ฐธ์กฐ๋ฅผ ์ฌ์ฉํ๊ฒ ๋๋ฉด ๋น๋ฆผ ๊ฒ์ฌ๊ธฐ ๋๋ฌธ์ ๋ณต์กํด ์ง ์ ์์ต๋๋ค.\n"
" * ์์ ์ฝ๋์์ `to_string()`์ ์์ ๋ ์ปดํ์ผ์ ๋ฌธ์ ๊ฐ ์๋์ง ํ์ธํด๋ณด์ธ์. ์ด๋ค ๋ฌธ์ ์ ๋ถ๋ชํ๊น์?"
#: src/std/box.md:1
msgid "# `Box`"
msgstr "# `Box`"
#: src/std/box.md:3
msgid "[`Box`][1] is an owned pointer to data on the heap:"
msgstr "[`Box`][1]๋ ํ ๋ฐ์ดํฐ์ ๋ํ ์์ ํฌ์ธํฐ์
๋๋ค:"
#: src/std/box.md:5
msgid ""
"```rust,editable\n"
"fn main() {\n"
" let five = Box::new(5);\n"
" println!(\"five: {}\", *five);\n"
"}\n"
"```"
msgstr ""
"```rust,editable\n"
"fn main() {\n"
" let five = Box::new(5);\n"
" println!(\"five: {}\", *five);\n"
"}\n"
"```"
#: src/std/box.md:13
msgid ""
"```bob\n"
" Stack Heap\n"
".- - - - - - -. .- - - - - - -.\n"
": : : :\n"
": five : : :\n"
": +-----+ : : +-----+ :\n"
": | o---|---+-----+-->| 5 | :\n"
": +-----+ : : +-----+ :\n"
": : : :\n"
": : : :\n"
"`- - - - - - -' `- - - - - - -'\n"
"```"
msgstr ""
"```bob\n"
" ์คํ ํ\n"
".- - - - - - -. .- - - - - - -.\n"
": : : :\n"
": five : : :\n"
": +-----+ : : +-----+ :\n"
": | o---|---+-----+-->| 5 | :\n"
": +-----+ : : +-----+ :\n"
": : : :\n"
": : : :\n"
"`- - - - - - -' `- - - - - - -'\n"
"```"
#: src/std/box.md:26
msgid ""
"`Box` implements `Deref`, which means that you can [call methods\n"
"from `T` directly on a `Box`][2]."
msgstr "`Box`์ [`Deref`][2]๋ฅผ ๊ตฌํํฉ๋๋ค. ์ด๋ [`Box`์์ `T` ๋ฉ์๋๋ฅผ ์ง์ ํธ์ถ][2] ํ ์ ์๋ค๋ ์๋ฏธ์
๋๋ค."
#: src/std/box.md:34
msgid ""
"* `Box` is like `std::unique_ptr` in C++, except that it's guaranteed to be not null. \n"
"* In the above example, you can even leave out the `*` in the `println!` statement thanks to `Deref`. \n"
"* A `Box` can be useful when you:\n"
" * have a type whose size that can't be known at compile time, but the Rust compiler wants to know an exact size.\n"
" * want to transfer ownership of a large amount of data. To avoid copying large amounts of data on the stack, instead store the data on the heap in a `Box` so only the pointer is moved."
msgstr ""
"* `Box`๋ C++์ `std::unique_ptr`๊ณผ ๋น์ทํฉ๋๋ค. ์ฐจ์ด๋ผ๋ฉด `Box`๋ ๋์ด ์๋์ ๋ณด์ฅํ๋ค๋ ์ ์
๋๋ค.\n"
"* `Deref` ๋๋ถ์ ์ ์์ ์ `println!`๋ฌธ์ ์ฌ์ฉ๋ `*`๋ฅผ ๋นผ๋ ๋ฌธ์ ๊ฐ ์์ต๋๋ค.\n"
"* `Box`๋ ์๋์ ๊ฒฝ์ฐ์ ์ ์ฉํฉ๋๋ค:\n"
" * ํ์
ํฌ๊ธฐ๋ฅผ ์ปดํ์ผ ์์ ์ ์ ์ ์๋ ๊ฒฝ์ฐ.\n"
" * ์์ฃผ ํฐ ๋ฐ์ดํฐ์ ์์ ๊ถ์ ์ ๋ฌํ๊ณ ์ถ์ ๊ฒฝ์ฐ. ์คํ์ ์๋ ํฐ ๋ฐ์ดํฐ๋ฅผ ๋ณต์ฌํ๋ ๋์ `Box`๋ฅผ ์ด์ฉํ์ฌ ๋ฐ์ดํฐ๋ ํ์ ์ ์ฅํ๊ณ ํฌ์ธํฐ๋ง ์ด๋ํ๋ฉด ๋ฉ๋๋ค."
#: src/std/box-recursive.md:1
msgid "# Box with Recursive Data Structures"
msgstr "# ์ฌ๊ท์๋ฃ ๊ตฌ์กฐ์์์ `Box`"
#: src/std/box-recursive.md:3
msgid "Recursive data types or data types with dynamic sizes need to use a `Box`:"
msgstr "์ฌ๊ท ๋ฐ์ดํฐ๋ ๋์ ํฌ๊ธฐ์ ๋ฐ์ดํฐ ํ์
์ `Box`ํ์
์ ์ฌ์ฉํด์ผ ํฉ๋๋ค:"
#: src/std/box-recursive.md:5 src/std/box-niche.md:3
msgid ""
"```rust,editable\n"
"#[derive(Debug)]\n"
"enum List {\n"
" Cons(T, Box>),\n"
" Nil,\n"
"}\n"
"\n"
"fn main() {\n"
" let list: List = List::Cons(1, Box::new(List::Cons(2, Box::new(List::Nil))));\n"
" println!(\"{list:?}\");\n"
"}\n"
"```"
msgstr ""
#: src/std/box-recursive.md:18
msgid ""
"```bob\n"
" Stack Heap\n"
".- - - - - - - - - - - - -. .- - - - - - - - - - - - - - - - - - - - - - - -.\n"
": : : :\n"
": list : : :\n"
": +------+----+----+ : : +------+----+----+ +------+----+----+ :\n"
": | Cons | 1 | o--+----+-----+--->| Cons | 2 | o--+--->| Nil | // | // | :\n"
": +------+----+----+ : : +------+----+----+ +------+----+----+ :\n"
": : : :\n"
": : : :\n"
"'- - - - - - - - - - - - -' '- - - - - - - - - - - - - - - - - - - - - - - -'\n"
"```"
msgstr ""
"```bob\n"
" ์คํ ํ\n"
".- - - - - - - - - - - - -. .- - - - - - - - - - - - - - - - - - - - - - - -.\n"
": : : :\n"
": list : : :\n"
": +------+----+----+ : : +------+----+----+ +------+----+----+ :\n"
": | Cons | 1 | o--+----+-----+--->| Cons | 2 | o--+--->| Nil | // | // | :\n"
": +------+----+----+ : : +------+----+----+ +------+----+----+ :\n"
": : : :\n"
": : : :\n"
"'- - - - - - - - - - - - -' '- - - - - - - - - - - - - - - - - - - - - - - -'\n"
"```"
#: src/std/box-recursive.md:33
msgid ""
"* If the `Box` was not used here and we attempted to embed a `List` directly into the `List`,\n"
"the compiler would not compute a fixed size of the struct in memory, it would look infinite.\n"
"\n"
"* `Box` solves this problem as it has the same size as a regular pointer and just points at the next\n"
"element of the `List` in the heap.\n"
"\n"
"* Remove the `Box` in the List definition and show the compiler error. \"Recursive with indirection\" is a hint you might want to use a Box or reference of some kind, instead of storing a value directly. \n"
" "
msgstr ""
"* ๋ง์ผ `Box`๋ฅผ ์ฌ์ฉํ์ง ์๊ณ `List`์ ์ง์ `List`๋ฅผ ํฌํจํ๋ ค๊ณ ์๋ํ๋ค๋ฉด, ์ปดํ์ผ๋ฌ๋ ๊ตฌ์กฐ์ฒด์ ๊ณ ์ ํฌ๊ธฐ๋ฅผ ๊ณ์ฐํ ์ ์์ต๋๋ค. ์ปดํ์ผ๋ฌ๊ฐ ๋ณด๊ธฐ์ ๋ฌดํ๋์ ํฌ๊ธฐ๋ก ๋ณด์ผ ๊ฒ์
๋๋ค.\n"
"\n"
"* `Box`๋ ์ผ๋ฐ ํฌ์ธํฐ์ ํฌ๊ธฐ๊ฐ ๊ฐ๊ธฐ ๋๋ฌธ์ ํฌ๊ธฐ๋ฅผ ๊ณ์ฐํ๋ ๋ฐ ๋ฌธ์ ๊ฐ ์์ต๋๋ค. ๋ค๋ง ํ์ ์์นํ `List`์ ๋ค์ ์์๋ฅผ ๊ฐ๋ฆฌํฌ ๋ฟ์
๋๋ค.\n"
"\n"
"* `List` ์ ์์์ `Box`๋ฅผ ์ ๊ฑฐํ๋ฉด ์ด๋ค ์ปดํ์ผ๋ฌ ์๋ฌ๊ฐ ๋์ค๋์ง ๊ฐ์ด ์ดํด๋ณด์ธ์. โRecursive with indirectionโ๋ผ๋ ๋ฉ์์ง๋ฅผ ๋ณด๋ฉด, ๊ฐ์ ์ง์ ์ ์ฅํ๋ ๋์ `Box`๋ ๋น์ทํ ๋ค๋ฅธ ์ข
๋ฅ์ ์ฐธ์กฐ ํ์
์ด ํ์ํ๋ค๋ ํํธ๋ฅผ ์ป์ ์ ์์ต๋๋ค."
#: src/std/box-niche.md:1
msgid "# Niche Optimization"
msgstr "# ํ์ ์ต์ ํ(Niche Optimization)"
#: src/std/box-niche.md:16
msgid ""
"A `Box` cannot be empty, so the pointer is always valid and non-`null`. This\n"
"allows the compiler to optimize the memory layout:"
msgstr "`Box`๋ ๋น์ด์์ ์ ์์ต๋๋ค. ๋ฐ๋ผ์ ํฌ์ธํฐ๋ ํญ์ ์ ํจํ๋ฉฐ `null`์ด ์๋๋๋ค. ์ด๋ ์ปดํ์ผ๋ฌ๊ฐ ๋ฉ๋ชจ๋ฆฌ ๋ ์ด์์์ ์ต์ ํ ํ ์ ์๊ฒ ํด์ค๋๋ค:"
#: src/std/box-niche.md:19
msgid ""
"```bob\n"
" Stack Heap\n"
".- - - - - - - - - - - - -. .- - - - - - - - - - - - - - - - - - - - - - -.\n"
": : : :\n"
": list : : :\n"
": +----+----+ : : +----+----+ +----+------+ :\n"
": | 1 | o--+-----------+-----+--->| 2 | o--+--->| // | null | :\n"
": +----+----+ : : +----+----+ +----+------+ :\n"
": : : :\n"
": : : :\n"
"`- - - - - - - - - - - - -' '- - - - - - - - - - - - - - - - - - - - - - -'\n"
"```"
msgstr ""
"```bob\n"
" ์คํ ํ\n"
".- - - - - - - - - - - - -. .- - - - - - - - - - - - - - - - - - - - - - -.\n"
": : : :\n"
": list : : :\n"
": +----+----+ : : +----+----+ +----+------+ :\n"
": | 1 | o--+-----------+-----+--->| 2 | o--+--->| // | null | :\n"
": +----+----+ : : +----+----+ +----+------+ :\n"
": : : :\n"
": : : :\n"
"`- - - - - - - - - - - - -' '- - - - - - - - - - - - - - - - - - - - - - -'\n"
"```"
#: src/std/rc.md:1
msgid "# `Rc`"
msgstr "# `Rc`"
#: src/std/rc.md:3
msgid ""
"[`Rc`][1] is a reference-counted shared pointer. Use this when you need to refer\n"
"to the same data from multiple places:"
msgstr "[`Rc`][1]๋ ์ฐธ์กฐ ์นด์ดํ
๊ณต์ ํฌ์ธํฐ์
๋๋ค. ์ฌ๋ฌ ์์น์์ ๋์ผํ ๋ฐ์ดํฐ๋ฅผ ์ฐธ์กฐํด์ผํ ๊ฒฝ์ฐ ์ฌ์ฉํฉ๋๋ค:"
#: src/std/rc.md:6
msgid ""
"```rust,editable\n"
"use std::rc::Rc;\n"
"\n"
"fn main() {\n"
" let mut a = Rc::new(10);\n"
" let mut b = a.clone();\n"
"\n"
" println!(\"a: {a}\");\n"
" println!(\"b: {b}\");\n"
"}\n"
"```"
msgstr ""
"```rust,editable\n"
"use std::rc::Rc;\n"
"\n"
"fn main() {\n"
" let mut a = Rc::new(10);\n"
" let mut b = a.clone();\n"
"\n"
" println!(\"a: {a}\");\n"
" println!(\"b: {b}\");\n"
"}\n"
"```"
#: src/std/rc.md:18
msgid ""
"* If you need to mutate the data inside an `Rc`, you will need to wrap the data in\n"
" a type such as [`Cell` or `RefCell`][2].\n"
"* See [`Arc`][3] if you are in a multi-threaded context.\n"
"* You can *downgrade* a shared pointer into a [`Weak`][4] pointer to create cycles\n"
" that will get dropped."
msgstr ""
"* `Rc`๋ด๋ถ์ ๋ฐ์ดํฐ๋ฅผ ๋ณ๊ฒฝํด์ผ ํ๋ ๊ฒฝ์ฐ, ๋ฐ์ดํฐ๋ฅผ [`Cell` ๋๋ `RefCell`][2]๋ก ๋ํํด์ผํฉ๋๋ค.\n"
"* ๋ฉํฐ์ค๋ ๋์ธ ๊ฒฝ์ฐ [`Arc`][3]๋ฅผ ์ฐธ์กฐํ์๊ธฐ ๋ฐ๋๋๋ค.\n"
"* drop ๊ฐ๋ฅํ ์ํ ๊ตฌ์กฐ๋ฅผ ๋ง๋ค๊ธฐ ์ํด ๊ณต์ ํฌ์ธํฐ๋ฅผ [`Weak`][4] ํฌ์ธํฐ๋ก **๋ค์ด๊ทธ๋ ์ด๋**ํ ์๋ ์์ต๋๋ค."
#: src/std/rc.md:31
msgid ""
"* `Rc`'s Count ensures that its contained value is valid for as long as there are references.\n"
"* Like C++'s `std::shared_ptr`.\n"
"* `clone` is cheap: it creates a pointer to the same allocation and increases the reference count. Does not make a deep clone and can generally be ignored when looking for performance issues in code.\n"
"* `make_mut` actually clones the inner value if necessary (\"clone-on-write\") and returns a mutable reference.\n"
"* Use `Rc::strong_count` to check the reference count.\n"
"* Compare the different datatypes mentioned. `Box` enables (im)mutable borrows that are enforced at compile time. `RefCell` enables (im)mutable borrows that are enforced at run time and will panic if it fails at runtime.\n"
"* You can `downgrade()` a `Rc` into a *weakly reference-counted* object to\n"
" create cycles that will be dropped properly (likely in combination with\n"
" `RefCell`)."
msgstr ""
"* `Rc`๋ ์ฐธ์กฐ ์นด์ดํธ๋ฅผ ํตํด ์ฐธ์กฐ๊ฐ ์๋ ๋์์ `Rc`๊ฐ ๊ฐ๋ฆฌํค๊ณ ์๋ ๊ฐ์ด ๋ฉ๋ชจ๋ฆฌ์์ ํด์ ๋์ง ์์์ ๋ณด์ฅํฉ๋๋ค.\n"
"* C++์ `std::shared_ptr`์ ์ ์ฌํฉ๋๋ค.\n"
"* `clone`์ ์ ๋ ดํฉ๋๋ค. ๊ฐ์ ๊ณณ์ ๊ฐ๋ฆฌํค๋ ํฌ์ธํฐ๋ฅผ ํ๋ ๋ ๋ง๋ค๊ณ , ์ฐธ์กฐ ์นด์ดํธ๋ฅผ ๋๋ฆฝ๋๋ค. ํฌ์ธํฐ๊ฐ ๊ฐ๋ฆฌํค๋ ๊ฐ ์์ฒด๊ฐ ๋ณต์ (๊น์ ๋ณต์ )๋์ง๋ ์์ผ๋ฉฐ, ๊ทธ๋์ ์ฝ๋์์ ์ฑ๋ฅ ๋ฌธ์ ๊ฐ ์๋์ง ๊ฒํ ํ ๋ ์ผ๋ฐ์ ์ผ๋ก `Rc`๋ฅผ `clone`ํ๋ ๊ฒ์ ๋ฌด์ํ ์ ์์ต๋๋ค.\n"
"* `make_mut`๋ ์ค์ ๋ก ํ์ํ ๊ฒฝ์ฐ์ ๋ด๋ถ ๊ฐ์ ๋ณต์ ํ๊ณ (\"clone-on-write\") ๊ฐ๋ณ ์ฐธ์กฐ๋ฅผ ๋ฐํํฉ๋๋ค.\n"
"* ์ฐธ์กฐ ์นด์ดํธ๋ฅผ ํ์ธํ๋ ค๋ฉด `Rc::strong_count`๋ฅผ ์ฌ์ฉํ์ธ์.\n"
"* ์ฌ๊ธฐ ์ธ๊ธ๋ ๋ช๊ฐ์ง ๋ฐ์ดํฐ ํ์
์ ๋น๊ตํด๋ณด์ธ์. `Box`๋ ๋ถ๋ณ/๊ฐ๋ณ ๋น๋ฆผ(borrow)์ ์ปดํ์ผ ์์ ์ ๊ฐ์ ํฉ๋๋ค. `RefCell`์ ์คํ ์์ ์ ๋ถ๋ณ/๊ฐ๋ณ ๋น๋ฆผ์ ๊ฐ์ ํ๋ฉฐ, ๋ง์ฝ ๋ฐํ์ ์์ ๋น๋ฆผ ๋ฌธ์ ๊ฐ ๋ฐ์ํ๋ฉด ํจ๋์ ์ผ์ผํต๋๋ค.\n"
"* `Rc`๋ `downgrade()`๋ก ๋ค์ด๊ทธ๋ ์ด๋ํ์ฌ **weak ์ฐธ์กฐ ์นด์ดํธ**๋ก ๋ณ๊ฒฝํ ์ ์์ต๋๋ค. ๊ทธ๋ฌ๋ฉด ์ํ๊ตฌ์กฐ๋ผ ํ๋๋ผ๋ drop์ด ๊ฐ๋ฅํฉ๋๋ค. (์๋ง๋ `RefCell` ์ ํจ๊ป ์ฌ์ฉํด์ผ ํ ๊ฒ์
๋๋ค.)"
#: src/std/rc.md:41
msgid ""
"```rust,editable\n"
"use std::rc::{Rc, Weak};\n"
"use std::cell::RefCell;\n"
"\n"
"#[derive(Debug)]\n"
"struct Node {\n"
" value: i64,\n"
" parent: Option>>,\n"
" children: Vec>>,\n"
"}\n"
"\n"
"fn main() {\n"
" let mut root = Rc::new(RefCell::new(Node {\n"
" value: 42,\n"
" parent: None,\n"
" children: vec![],\n"
" }));\n"
" let child = Rc::new(RefCell::new(Node {\n"
" value: 43,\n"
" children: vec![],\n"
" parent: Some(Rc::downgrade(&root))\n"
" }));\n"
" root.borrow_mut().children.push(child);\n"
"\n"
" println!(\"graph: {root:#?}\");\n"
"}\n"
"```"
msgstr ""
#: src/modules.md:1
msgid "# Modules"
msgstr "# ๋ชจ๋"
#: src/modules.md:3
msgid "We have seen how `impl` blocks let us namespace functions to a type."
msgstr "`impl`๋ธ๋ก์ ํด๋น ํ์
์ ํจ์๋ค์ ๋ํ ๋ค์์คํ์ด์ค๋ฅผ ์ ๊ณตํฉ๋๋ค."
#: src/modules.md:5
msgid "Similarly, `mod` lets us namespace types and functions:"
msgstr "๋ง์ฐฌ๊ฐ์ง๋ก, `mod`๋ ํ์
๊ณผ ํจ์๋ค์ ๋ํด ๋ค์์คํ์ด์ค๋ฅผ ์ ๊ณตํฉ๋๋ค:"
#: src/modules.md:7
msgid ""
"```rust,editable\n"
"mod foo {\n"
" pub fn do_something() {\n"
" println!(\"In the foo module\");\n"
" }\n"
"}\n"
"\n"
"mod bar {\n"
" pub fn do_something() {\n"
" println!(\"In the bar module\");\n"
" }\n"
"}\n"
"\n"
"fn main() {\n"
" foo::do_something();\n"
" bar::do_something();\n"
"}\n"
"```"
msgstr ""
#: src/modules.md:28
msgid ""
"* Packages provide functionality and include a `Cargo.toml` file that describes how to build a bundle of 1+ crates.\n"
"* Crates are a tree of modules, where a binary crate creates an executable and a library crate compiles to a library.\n"
"* Modules define organization, scope, and are the focus of this section."
msgstr ""
"* ํจํค์ง๋ ๊ธฐ๋ฅ์ ์ ๊ณตํ๋ฉฐ ํ๋์ ๋ํ `Cargo.toml` ํ์ผ์ ํฌํจํฉ๋๋ค. ํจํค์ง๋ฅผ ๊ตฌ์ฑํ๋ ํฌ๋ ์ดํธ๋ค์ ๋น๋ํ๋ ๋ฐฉ๋ฒ์ด ์ด ํ์ผ์ ๊ธฐ์ ๋ฉ๋๋ค.\n"
"* ํฌ๋ ์ดํธ๋ ๋ชจ๋์ ํธ๋ฆฌ์
๋๋ค. ๋ฐ์ด๋๋ฆฌ ํฌ๋ ์ดํธ๋ ์คํํ์ผ๋ก ๋น๋๋๊ณ , ๋ผ์ด๋ธ๋ฌ๋ฆฌ ํฌ๋ ์ดํธ๋ ๋ผ์ด๋ธ๋ฌ๋ฆฌ๋ก ๋น๋๋ฉ๋๋ค.\n"
"* ๋ชจ๋์ ์ฝ๋๋ฅผ ์กฐ์งํํ๊ณ ์ค์ฝํ๋ฅผ ์ ์ํ๋ ๋จ์์
๋๋ค."
#: src/modules/visibility.md:1
msgid "# Visibility"
msgstr "# ๊ฐ์์ฑ"
#: src/modules/visibility.md:3
msgid "Modules are a privacy boundary:"
msgstr "๋ชจ๋์ ํ์
์ด๋ ํจ์๋ ๊ธฐ๋ณธ์ ์ผ๋ก ๋ฐ๊นฅ์ ๋
ธ์ถ๋์ง ์์ต๋๋ค:"
#: src/modules/visibility.md:5
msgid ""
"* Module items are private by default (hides implementation details).\n"
"* Parent and sibling items are always visible.\n"
"* In other words, if an item is visible in module `foo`, it's visible in all the\n"
" descendants of `foo`."
msgstr ""
"* ๋ฐ๋ผ์ ๋ชจ๋์ ์ธ๋ถ ๊ตฌํ ๋ด์ฉ์ด ๊ฐ์ถฐ์ง๋๋ค.\n"
"* ๋ถ๋ชจ์ ์ด์ ํญ๋ชฉ์ ์ธ์ ๋ ์ ๊ทผ ๊ฐ๋ฅํฉ๋๋ค.\n"
"* ์ฆ, ๋ชจ๋ `foo`์์ ์ ๊ทผ ๊ฐ๋ฅํ ํญ๋ชฉ์ด๋ผ๋ฉด `foo` ์๋์ ๋ชจ๋ ๋ชจ๋์์ ์ ๊ทผ๊ฐ๋ฅํฉ๋๋ค."
#: src/modules/visibility.md:10
msgid ""
"```rust,editable\n"
"mod outer {\n"
" fn private() {\n"
" println!(\"outer::private\");\n"
" }\n"
"\n"
" pub fn public() {\n"
" println!(\"outer::public\");\n"
" }\n"
"\n"
" mod inner {\n"
" fn private() {\n"
" println!(\"outer::inner::private\");\n"
" }\n"
"\n"
" pub fn public() {\n"
" println!(\"outer::inner::public\");\n"
" super::private();\n"
" }\n"
" }\n"
"}\n"
"\n"
"fn main() {\n"
" outer::public();\n"
"}\n"
"```"
msgstr ""
#: src/modules/visibility.md:39
msgid "* Use the `pub` keyword to make modules public."
msgstr "* `pub` ํค์๋๋ ๋ชจ๋์๋ ์ฌ์ฉํ ์ ์์ต๋๋ค."
#: src/modules/visibility.md:41
msgid "Additionally, there are advanced `pub(...)` specifiers to restrict the scope of public visibility."
msgstr "๋ํ, ๊ณ ๊ธ ๊ธฐ๋ฅ์ผ๋ก `pub(...)` ์ง์ ์๋ฅผ ์ฌ์ฉํ์ฌ ๊ณต๊ฐ ๋ฒ์๋ฅผ ์ ํํ ์ ์์ต๋๋ค."
#: src/modules/visibility.md:43
msgid ""
"* See the [Rust Reference](https://doc.rust-lang.org/reference/visibility-and-privacy.html#pubin-path-pubcrate-pubsuper-and-pubself).\n"
"* Configuring `pub(crate)` visibility is a common pattern.\n"
"* Less commonly, you can give visibility to a specific path.\n"
"* In any case, visibility must be granted to an ancestor module (and all of its descendants)."
msgstr ""
"* [๊ณต์ ๋ฌธ์](https://doc.rust-lang.org/reference/visibility-and-privacy.html#pubin-path-pubcrate-pubsuper-and-pubself)๋ฅผ ์ฐธ๊ณ ํ์ธ์.\n"
"* `pub(crate)`๋ก ๊ฐ์์ฑ์ ์ง์ ํ๋ ๊ฒ์ด ์์ฃผ ์ฐ์
๋๋ค.\n"
"* ์์ฃผ ์ฐ์ด์ง ์์ง๋ง ํน์ ๊ฒฝ๋ก์ ๋ํด์๋ง ๊ฐ์์ฑ์ ๋ถ์ฌํ ์ ์์ต๋๋ค.\n"
"* ์ด๋ค ๊ฒฝ์ฐ์ด๋ ๊ฐ์์ฑ์ด ๋ถ์ฌ๋๋ฉด ํด๋น ๋ชจ๋์ ํฌํจํ์ฌ ํ์์ ๋ชจ๋ ๋ชจ๋์ด ์ ์ฉ๋ฐ์ต๋๋ค."
#: src/modules/paths.md:1
msgid "# Paths"
msgstr "# ๊ฒฝ๋ก"
#: src/modules/paths.md:3
msgid "Paths are resolved as follows:"
msgstr "๊ฒฝ๋ก๋ ์๋์ ๊ฐ์ด ๊ตฌ๋ถํฉ๋๋ค:"
#: src/modules/paths.md:5
msgid ""
"1. As a relative path:\n"
" * `foo` or `self::foo` refers to `foo` in the current module,\n"
" * `super::foo` refers to `foo` in the parent module.\n"
"\n"
"2. As an absolute path:\n"
" * `crate::foo` refers to `foo` in the root of the current crate,\n"
" * `bar::foo` refers to `foo` in the `bar` crate."
msgstr ""
"1. ์๋ ๊ฒฝ๋ก\n"
" * `foo` ๋๋ `self::foo`๋ ํ์ฌ ๋ชจ๋ ๋ด๋ถ์ `foo`๋ฅผ ๊ฐ๋ฆฌํต๋๋ค.\n"
" * `super::foo`๋ ๋ถ๋ชจ ๋ชจ๋์ `foo`๋ฅผ ๊ฐ๋ฆฌํต๋๋ค.\n"
"\n"
"2. ์ ๋ ๊ฒฝ๋ก\n"
" * `crate::foo`๋ ํ์ฌ ํฌ๋ ์ดํธ ๋ฃจํธ์ `foo`๋ฅผ ๊ฐ๋ฆฌํต๋๋ค.\n"
" * `bar::foo`๋ `bar`ํฌ๋ ์ดํธ์ `foo`๋ฅผ ๊ฐ๋ฆฌํต๋๋ค."
#: src/modules/filesystem.md:1
msgid "# Filesystem Hierarchy"
msgstr "# ํ์ผ์์คํ
๊ณ์ธต"
#: src/modules/filesystem.md:3
msgid "The module content can be omitted:"
msgstr "๋ชจ๋์ ๋ด์ฉ์ ์๋ต๋ ์ ์์ต๋๋ค:"
#: src/modules/filesystem.md:5
msgid ""
"```rust,editable,compile_fail\n"
"mod garden;\n"
"```"
msgstr ""
#: src/modules/filesystem.md:9
msgid "The `garden` module content is found at:"
msgstr "`garden` ๋ชจ๋์ ๋ด์ฉ์ ์๋ ์์น์์ ํ์ธ ํ ์ ์์ต๋๋ค:"
#: src/modules/filesystem.md:11
msgid ""
"* `src/garden.rs` (modern Rust 2018 style)\n"
"* `src/garden/mod.rs` (older Rust 2015 style)"
msgstr ""
#: src/modules/filesystem.md:14
msgid "Similarly, a `garden::vegetables` module can be found at:"
msgstr "์ ์ฌํ๊ฒ `garden::vegetables` ๋ชจ๋์ ์๋ ์์น์์ ํ์ธํ ์ ์์ต๋๋ค:"
#: src/modules/filesystem.md:16
msgid ""
"* `src/garden/vegetables.rs` (modern Rust 2018 style)\n"
"* `src/garden/vegetables/mod.rs` (older Rust 2015 style)"
msgstr ""
#: src/modules/filesystem.md:19
msgid "The `crate` root is in:"
msgstr "`crate(ํฌ๋ ์ดํธ)`์ ๋ฃจํธ๋ ์๋ ๊ฒฝ๋ก ์
๋๋ค:"
#: src/modules/filesystem.md:21
msgid ""
"* `src/lib.rs` (for a library crate)\n"
"* `src/main.rs` (for a binary crate)"
msgstr ""
"* `src/lib.rs` (๋ผ์ด๋ธ๋ฌ๋ฆฌ ํฌ๋ ์ดํธ)\n"
"* `src/main.rs` (๋ฐ์ด๋๋ฆฌ ํฌ๋ ์ดํธ)"
#: src/modules/filesystem.md:26
msgid ""
"* The change from `module/mod.rs` to `module.rs` doesn't preclude the use of submodules in Rust 2018.\n"
" (It was mandatory in Rust 2015.)\n"
"\n"
" The following is valid:\n"
"\n"
" ```ignore\n"
" src/\n"
" โโโ main.rs\n"
" โโโ top_module.rs\n"
" โโโ top_module/\n"
" โโโ sub_module.rs\n"
" ```\n"
"\n"
"* The main reason for the change is to prevent many files named `mod.rs`, which can be hard\n"
" to distinguish in IDEs.\n"
"\n"
"* Rust will look for modules in `modulename/mod.rs` and `modulename.rs`, but this can be changed\n"
" with a compiler directive:\n"
"\n"
" ```rust,ignore\n"
" #[path = \"some/path.rs\"]\n"
" mod some_module { }\n"
" ```\n"
"\n"
" This is useful, for example, if you would like to place tests for a module in a file named\n"
" `some_module_test.rs`, similar to the convention in Go."
msgstr ""
"* `module/mod.rs`๋ฅผ `module.rs`๋ก ๋ฐ๊พผ๋ค ํ๋๋ผ๋ Rust 2018์์๋ ํ์ ๋ชจ๋์ ์ฌ์ฉํ ์ ์์ต๋๋ค. (Rust 2015์์๋ ํ์ ๋ชจ๋์ด ์๋ ๋ชจ๋์ `module/mod.rs` ํํ์ฌ์ผ ํ์ต๋๋ค.)\n"
"\n"
" ์๋์ฒ๋ผ ๊ตฌ์ฑํ๋๋ฐ ์๋ฌด๋ฐ ๋ฌธ์ ๊ฐ ์์ต๋๋ค:\n"
"\n"
" ```ignore\n"
" src/\n"
" โโโ main.rs\n"
" โโโ top_module.rs\n"
" โโโ top_module/\n"
" โโโ sub_module.rs\n"
" ```\n"
"\n"
"* ์ด๋ ๊ฒ ๋ณ๊ฒฝ๋ ์ฃผ๋ ์ด์ ๋ ๋ชจ๋ ๋๊ฐ์ ์ด๋ฆ์ `mod.rs` ํ์ผ์ด ์๋ฉ ์๊ธฐ๋ ๊ฒ์ ๋ฐฉ์งํ๊ธฐ ์ํด์ ์
๋๋ค. IDE์์๋ ์ด๋ค์ ๊ตฌ๋ถํ๊ธฐ๊ฐ ๊น๋ค๋ก์ ์ต๋๋ค.\n"
"\n"
"* ๋ฌ์คํธ๋ ๋ชจ๋์ ์ฐพ์ ๋ `modulename/mod.rs`์ `modulename.rs` ํ์ผ์ ๊ฒ์ฌํ๋๋ฐ, ์ปดํ์ผ๋ฌ ๋๋ ํฐ๋ธ๋ก ์ด๋ฅผ ๋ณ๊ฒฝํ ์ ์์ต๋๋ค.\n"
"\n"
" ```rust,ignore\n"
" #[path = \"some/path.rs\"]\n"
" mod some_module { }\n"
" ```\n"
"\n"
" Go์ธ์ด ์์์ฒ๋ผ ์ด๋ค ๋ชจ๋์ ํ
์คํธ๋ฅผ `some_module_test.rs` ๊ฐ์ ํ์ผ์ ๋๊ณ ์ถ์ ๊ฒฝ์ฐ์ ์ ์ฉํฉ๋๋ค."
#: src/exercises/day-2/afternoon.md:1
msgid "# Day 2: Afternoon Exercises"
msgstr "# 2์ผ์ฐจ ์คํ ์ฐ์ต๋ฌธ์ "
#: src/exercises/day-2/afternoon.md:3
msgid "The exercises for this afternoon will focus on strings and iterators."
msgstr "์ด๋ฒ ์ฐ์ต๋ฌธ์ ๋ ๋ฌธ์์ด๊ณผ ๋ฐ๋ณต์์ ์ด์ ์ ๋ง์ถ ๊ฒ์
๋๋ค."
#: src/exercises/day-2/luhn.md:1
msgid "# Luhn Algorithm"
msgstr "# ๋ฃฌ(Luhn) ์๊ณ ๋ฆฌ์ฆ"
#: src/exercises/day-2/luhn.md:3
msgid ""
"The [Luhn algorithm](https://en.wikipedia.org/wiki/Luhn_algorithm) is used to\n"
"validate credit card numbers. The algorithm takes a string as input and does the\n"
"following to validate the credit card number:"
msgstr "[๋ฃฌ(Luhn) ์๊ณ ๋ฆฌ์ฆ](https://ko.wikipedia.org/wiki/%EB%A3%AC_%EC%95%8C%EA%B3%A0%EB%A6%AC%EC%A6%98)์ ์ ์ฉ์นด๋ ๋ฒํธ ๊ฒ์ฆ์ ์ฌ์ฉ๋๋ ์๊ณ ๋ฆฌ์ฆ ์
๋๋ค. ์ด ์๊ณ ๋ฆฌ์ฆ์ ์ ์ฉ์นด๋ ๋ฒํธ๋ฅผ `๋ฌธ์์ด`๋ก ์
๋ ฅ๋ฐ๊ณ , ์๋์ ์์์ ๋ฐ๋ผ ์ ์ฉ์นด๋ ๋ฒํธ์ ์ ํจ์ฑ์ ํ์ธํฉ๋๋ค:"
#: src/exercises/day-2/luhn.md:7
msgid ""
"* Ignore all spaces. Reject number with less than two digits.\n"
"\n"
"* Moving from right to left, double every second digit: for the number `1234`,\n"
" we double `3` and `1`.\n"
"\n"
"* After doubling a digit, sum the digits. So doubling `7` becomes `14` which\n"
" becomes `5`.\n"
"\n"
"* Sum all the undoubled and doubled digits.\n"
"\n"
"* The credit card number is valid if the sum ends with `0`."
msgstr ""
"* ๋ชจ๋ ๊ณต๋ฐฑ์ ๋ฌด์ํฉ๋๋ค. 2์๋ฆฌ ๋ฏธ๋ง ์ซ์๋ ๋ฌด์ํฉ๋๋ค.\n"
"\n"
"* ์ค๋ฅธ์ชฝ์์ ์ผ์ชฝ์ผ๋ก ์ด๋ํ๋ฉฐ 2๋ฒ์งธ ์๋ฆฌ๋ง๋ค ์ซ์๋ฅผ 2๋ฐฐ ์ฆ๊ฐ์ํต๋๋ค. ์๋ฅผ ๋ค์ด `1234`์์ `3`๊ณผ `1`์ ๊ฐ๊ฐ 2๋ฅผ ๊ณฑํฉ๋๋ค.\n"
"\n"
"* ๋๋ฐฐ๋ก ๋ง๋ ์ซ์๊ฐ 2์๋ฆฌ๋ผ๋ฉด ๊ฐ ์๋ฆฌ ์ซ์๋ฅผ ๋ํฉ๋๋ค. ์๋ฅผ ๋ค์ด, `7`์ ๋๋ฐฐ๋ก ๋ง๋ค๋ฉด `14`์ด๋ฏ๋ก `5`๊ฐ ๋ฉ๋๋ค.\n"
"\n"
"* ๋ชจ๋ ์๋ฆฌ์ ์ซ์๋ฅผ ๋ํฉ๋๋ค.\n"
"\n"
"* ํฉ๊ณ์ ๋์๋ฆฌ๊ฐ `0`์ธ ๊ฒฝ์ฐ ์ ํจํ ์ ์ฉ์นด๋ ๋ฒํธ์
๋๋ค."
#: src/exercises/day-2/luhn.md:19
msgid ""
"Copy the following code to > = vec![\n"
" Box::new(Dog { name: String::from(\"Fido\") }),\n"
" Box::new(Cat),\n"
" ];\n"
" for pet in pets {\n"
" pet.say_hello();\n"
" }\n"
"}\n"
"```"
msgstr ""
#: src/traits.md:41
msgid ""
"* Traits may specify pre-implemented (default) methods and methods that users are required to implement themselves. Methods with default implementations can rely on required methods.\n"
"* Types that implement a given trait may be of different sizes. This makes it impossible to have things like `Vec` in the example above.\n"
"* `dyn Greet` is a way to tell the compiler about a dynamically sized type that implements `Greet`.\n"
"* In the example, `pets` holds Fat Pointers to objects that implement `Greet`. The Fat Pointer consists of two components, a pointer to the actual object and a pointer to the virtual method table for the `Greet` implementation of that particular object.\n"
"* Compare these outputs in the above example:\n"
" ```rust,ignore\n"
" println!(\"{} {}\", std::mem::size_of::(), std::mem::size_of::());\n"
" println!(\"{} {}\", std::mem::size_of::<&Dog>(), std::mem::size_of::<&Cat>());\n"
" println!(\"{}\", std::mem::size_of::<&dyn Greet>());\n"
" println!(\"{}\", std::mem::size_of::>());\n"
" ```"
msgstr ""
"* ํธ๋ ์์ ์ฌ์ฉ์๊ฐ ์ง์ ๊ตฌํํด์ผ ํ๋ ๋ฉ์๋์ ์ฌ์ ๊ตฌํ๋(๋ํดํธ) ๋ฉ์๋๋ฅผ ์ง์ ํ ์ ์์ต๋๋ค. ๊ธฐ๋ณธ ๊ตฌํ๋ ๋ฉ์๋๋ (๋ค๋ฅธ)ํ์ ๋ฉ์๋๋ฅผ ์์กดํ ์ ์์ต๋๋ค.\n"
"* ์ฌ๋ฌ ํ์
์ด ๊ฐ์ ํธ๋ ์์ ๊ตฌํํ๋๋ผ๋ ๊ทธ ํฌ๊ธฐ๋ ์๋ก ๋ค๋ฅผ ์ ์์ต๋๋ค. ๊ทธ๋์ `Vec`๊ฐ์ ๊ฒ์ ๋ถ๊ฐ๋ฅํฉ๋๋ค. ์๋ํ๋ฉด `Greet`ํธ๋ ์์ ๊ตฌํํ๋ ํ์
๋ค ์ค ์ด๋ค ํฌ๊ธฐ์ ํ์
์ด ์ค์ ๋ก ์ฌ์ฉ๋ ์ง, ์ปดํ์ผ ์์ ์ ๋ฐฉ๋ฒ์ด ์๋ ๋ฐ๋ฉด, `Vec<>`๋ ํ์
์ ํฌ๊ธฐ๋ฅผ ์ปดํ์ผ ์์ ์๊ณ ์ ํ๊ธฐ ๋๋ฌธ์
๋๋ค.\n"
"* `dyn Greet`๋ `Greet`์ ๊ตฌํํ๋, ๊ฐ๋ณ ํฌ๊ธฐ์ ํ์
์ ์๋ฏธํฉ๋๋ค.\n"
"* ์์ ์์ `pets`๋ `Greet`์ ๊ตฌํํ๋ ๊ฐ์ฒด๋ค์ Fat pointer๋ฅผ ๋ด๊ณ ์์ต๋๋ค. Fat pointer๋ ์ค์ ๊ฐ์ฒด์ ๋ํ ํฌ์ธํฐ์ ๊ทธ ๊ฐ์ฒด๊ฐ `Greet`์ ๊ตฌํํ๊ณ ์๋ ๊ฐ์ ํจ์ ํ
์ด๋ธ์ ๋ํ ํฌ์ธํฐ๋ฅผ ๊ฐ์ง๋๋ค.\n"
"* ์๋ ์ฝ๋์ ๊ฒฐ๊ณผ์ ๋น๊ตํด๋ณด์ธ์:\n"
" ```rust,ignore\n"
" println!(\"{} {}\", std::mem::size_of::(), std::mem::size_of::());\n"
" println!(\"{} {}\", std::mem::size_of::<&Dog>(), std::mem::size_of::<&Cat>());\n"
" println!(\"{}\", std::mem::size_of::<&dyn Greet>());\n"
" println!(\"{}\", std::mem::size_of::>());\n"
" ```"
#: src/traits/deriving-traits.md:1
msgid "# Deriving Traits"
msgstr "# ํธ๋ ์ ์์ํ๊ธฐ(Deriving Traits)"
#: src/traits/deriving-traits.md:3
msgid "You can let the compiler derive a number of traits:"
msgstr "์ปดํ์ผ๋ฌ๊ฐ ์ฌ๋ฌ๊ฐ์ง ํธ๋ ์์ ์์(derive)ํ๋๋ก ํ ์ ์์ต๋๋ค. ์ด ๊ฒฝ์ฐ ์ปดํ์ผ๋ฌ๊ฐ ํธ๋ ์์ ์๋์ผ๋ก ๊ตฌํํฉ๋๋ค:"
#: src/traits/deriving-traits.md:5
msgid ""
"```rust,editable\n"
"#[derive(Debug, Clone, PartialEq, Eq, Default)]\n"
"struct Player {\n"
" name: String,\n"
" strength: u8,\n"
" hit_points: u8,\n"
"}\n"
"\n"
"fn main() {\n"
" let p1 = Player::default();\n"
" let p2 = p1.clone();\n"
" println!(\"Is {:?}\\nequal to {:?}?\\nThe answer is {}!\", &p1, &p2,\n"
" if p1 == p2 { \"yes\" } else { \"no\" });\n"
"}\n"
"```"
msgstr ""
#: src/traits/default-methods.md:1
msgid "# Default Methods"
msgstr "# ๋ํดํธ ๋ฉ์๋"
#: src/traits/default-methods.md:3
msgid "Traits can implement behavior in terms of other trait methods:"
msgstr "ํธ๋ ์์ ๋ํดํธ ๋ฉ์๋์์ ๋ค๋ฅธ(๊ตฌํ๋์ง ์์) ๋ฉ์๋๋ฅผ ์ด์ฉํ ์ ์์ต๋๋ค:"
#: src/traits/default-methods.md:5
msgid ""
"```rust,editable\n"
"trait Equals {\n"
" fn equal(&self, other: &Self) -> bool;\n"
" fn not_equal(&self, other: &Self) -> bool {\n"
" !self.equal(other)\n"
" }\n"
"}\n"
"\n"
"#[derive(Debug)]\n"
"struct Centimeter(i16);\n"
"\n"
"impl Equals for Centimeter {\n"
" fn equal(&self, other: &Centimeter) -> bool {\n"
" self.0 == other.0\n"
" }\n"
"}\n"
"\n"
"fn main() {\n"
" let a = Centimeter(10);\n"
" let b = Centimeter(20);\n"
" println!(\"{a:?} equals {b:?}: {}\", a.equal(&b));\n"
" println!(\"{a:?} not_equals {b:?}: {}\", a.not_equal(&b));\n"
"}\n"
"```"
msgstr ""
#: src/traits/important-traits.md:1
msgid "# Important Traits"
msgstr "# ์ค์ํ ํธ๋ ์๋ค"
#: src/traits/important-traits.md:3
msgid "We will now look at some of the most common traits of the Rust standard library:"
msgstr "๋ฌ์คํธ ํ์ค ๋ผ์ด๋ธ๋ฌ๋ฆฌ์๋ ๋ค์๊ณผ ๊ฐ์ ๋ฒ์ฉ ํธ๋ ์๋ค์ด ์ ์๋์ด ์์ต๋๋ค:"
#: src/traits/important-traits.md:5
msgid ""
"* [`Iterator`][1] and [`IntoIterator`][2] used in `for` loops,\n"
"* [`From`][3] and [`Into`][4] used to convert values,\n"
"* [`Read`][5] and [`Write`][6] used for IO,\n"
"* [`Add`][7], [`Mul`][8], ... used for operator overloading, and\n"
"* [`Drop`][9] used for defining destructors.\n"
"* [`Default`][10] used to construct a default instance of a type."
msgstr ""
"* [`Iterator`][1]์ [`IntoIterator`][2] ํธ๋ ์์ `for` ๋ฃจํ์์ ์ฌ์ฉ๋ฉ๋๋ค.\n"
"* [`From`][3]๊ณผ [`Into`][4] ํธ๋ ์์ ๊ฐ์ ๋ณํํ ๋ ์ฌ์ฉ๋ฉ๋๋ค.\n"
"* [`Read`][5]์ [`Write`][6] ํธ๋ ์์ I/O์ ์ฌ์ฉ๋ฉ๋๋ค.\n"
"* [`Add`][7], [`Mul`][8] ๋ฑ์ ํธ๋ ์๋ค์ ์ฐ์ฐ์ ์ค๋ฒ๋ก๋ฉ(overloading)์ ์ฌ์ฉ๋ฉ๋๋ค.\n"
"* [`Drop`][9] ํธ๋ ์์ ์๋ฉธ์ ์ ์์ ์ฌ์ฉ๋ฉ๋๋ค.\n"
"* [`Default`][10] ํธ๋ ์์ ์ด๋ค ํ์
์ ๊ธฐ๋ณธ๊ฐ ์ธ์คํด์ค๋ฅผ ๋ง๋ค๋ ์ฌ์ฉ๋ฉ๋๋ค."
#: src/traits/iterator.md:1
msgid "# Iterators"
msgstr "# Iterators"
#: src/traits/iterator.md:3
msgid "You can implement the [`Iterator`][1] trait on your own types:"
msgstr "`Iterator`ํธ๋ ์์ ์ฌ๋ฌ๋ถ์ด ์ ์ํ ํ์
์์ ๊ตฌํํด ๋ณด๊ฒ ์ต๋๋ค:"
#: src/traits/iterator.md:5
msgid ""
"```rust,editable\n"
"struct Fibonacci {\n"
" curr: u32,\n"
" next: u32,\n"
"}\n"
"\n"
"impl Iterator for Fibonacci {\n"
" type Item = u32;\n"
"\n"
" fn next(&mut self) -> Option {\n"
" let new_next = self.curr + self.next;\n"
" self.curr = self.next;\n"
" self.next = new_next;\n"
" Some(self.curr)\n"
" }\n"
"}\n"
"\n"
"fn main() {\n"
" let fib = Fibonacci { curr: 0, next: 1 };\n"
" for (i, n) in fib.enumerate().take(5) {\n"
" println!(\"fib({i}): {n}\");\n"
" }\n"
"}\n"
"```"
msgstr ""
#: src/traits/iterator.md:32
msgid ""
"* `IntoIterator` is the trait that makes for loops work. It is implemented by collection types such as\n"
" `Vec` and references to them such as `&Vec` and `&[T]`. Ranges also implement it.\n"
"* The `Iterator` trait implements many common functional programming operations over collections \n"
" (e.g. `map`, `filter`, `reduce`, etc). This is the trait where you can find all the documentation\n"
" about them. In Rust these functions should produce the code as efficient as equivalent imperative\n"
" implementations.\n"
" "
msgstr ""
"* `IntoIterator`๋ ๋ฃจํ๊ฐ ์๋ํ๋๋ก ๋ง๋๋ ํธ๋ ์์
๋๋ค. `Vec`์ ๊ฐ์ ์ปฌ๋ ์
ํ์
๊ณผ ๊ทธ์ ๋ํ ์ฐธ์กฐ ํ์
(`&Vec`, `&[T]`)๋ค ๋ชจ๋ ์ด ํธ๋ ์์ ๊ตฌํํฉ๋๋ค. Range ์ญ์ ์ด๋ฅผ ๊ตฌํํฉ๋๋ค.\n"
"* `Iterator` ํธ๋ ์์ ์ปฌ๋ ์
์ ๋ํด ๋ค์ํ ํจ์ํ ํ๋ก๊ทธ๋๋ฐ ์ฐ์ฐ (`map`, `filter`, `reduce` ๋ฑ)์ ๊ตฌํํฉ๋๋ค. ์ด ์ฐ์ฐ๋ค์ ๋ํ ์์ธํ ์ค๋ช
์ `Iterator` ํธ๋ ์์ API ๋ ํผ๋ฐ์ค์์ ์ฐพ์ ์ ์์ต๋๋ค. ๋ฌ์คํธ์์ ์ด๋ฌํ ํจ์ํ ์ฐ์ฐ๋ค์ ์ ์ฐจํ์ผ๋ก ๊ตฌํ๋ ์ฝ๋์ ๋์ผํ ์ฑ๋ฅ์ ๋ณด์ฌ์ค๋๋ค.\n"
" "
#: src/traits/from-iterator.md:1
msgid "# FromIterator"
msgstr "# FromIterator"
#: src/traits/from-iterator.md:3
msgid "[`FromIterator`][1] lets you build a collection from an [`Iterator`][2]."
msgstr "์ด๋ค ์ปฌ๋ ์
์ด [`FromIterator`][1]๋ฅผ ๊ตฌํํ๊ณ ์๋ค๋ฉด [`Iterator`][2]๋ก๋ถํฐ ๊ทธ ์ปฌ๋ ์
์ ๋ง๋ค ์ ์์ต๋๋ค."
#: src/traits/from-iterator.md:5
msgid ""
"```rust,editable\n"
"fn main() {\n"
" let primes = vec![2, 3, 5, 7];\n"
" let prime_squares = primes\n"
" .into_iter()\n"
" .map(|prime| prime * prime)\n"
" .collect::>();\n"
"}\n"
"```"
msgstr ""
#: src/traits/from-iterator.md:17
msgid ""
"`Iterator` implements\n"
"`fn collect(self) -> B\n"
"where\n"
" B: FromIterator,\n"
" Self: Sized`"
msgstr ""
"`Iterator`์๋ ๋ค์ ํจ์๊ฐ ์ ์๋์ด ์์ต๋๋ค:\n"
"`fn collect(self) -> B\n"
"where\n"
" B: FromIterator,\n"
" Self: Sized`"
#: src/traits/from-iterator.md:23
msgid ""
"There are also implementations which let you do cool things like convert an\n"
"`Iterator- >` into a `Result
, E>`."
msgstr "`Iterator- >`์ `Result
, E>`๋ก ๋ณํํ ์ ์๋ ๋ฉ์ง ๊ธฐ๋ฅ๋ค๋ ๊ตฌํ๋์ด ์์ต๋๋ค."
#: src/traits/from-into.md:1
msgid "# `From` and `Into`"
msgstr "# `From`๊ณผ `Into`"
#: src/traits/from-into.md:3
msgid "Types implement [`From`][1] and [`Into`][2] to facilitate type conversions:"
msgstr "ํ์
์ ์ฉ์ดํ ํ๋ณํ์ ์ํด [`From`][1]๊ณผ [`Into`][2]๋ฅผ ๊ตฌํํฉ๋๋ค:"
#: src/traits/from-into.md:5
msgid ""
"```rust,editable\n"
"fn main() {\n"
" let s = String::from(\"hello\");\n"
" let addr = std::net::Ipv4Addr::from([127, 0, 0, 1]);\n"
" let one = i16::from(true);\n"
" let bigger = i32::from(123i16);\n"
" println!(\"{s}, {addr}, {one}, {bigger}\");\n"
"}\n"
"```"
msgstr ""
#: src/traits/from-into.md:15
msgid "[`Into`][2] is automatically implemented when [`From`][1] is implemented:"
msgstr "[`From`][1]์ด ๊ตฌํ๋๋ฉด [`Into`][2] ์ญ์ ์๋์ผ๋ก ๊ตฌํ๋ฉ๋๋ค:"
#: src/traits/from-into.md:17
msgid ""
"```rust,editable\n"
"fn main() {\n"
" let s: String = \"hello\".into();\n"
" let addr: std::net::Ipv4Addr = [127, 0, 0, 1].into();\n"
" let one: i16 = true.into();\n"
" let bigger: i32 = 123i16.into();\n"
" println!(\"{s}, {addr}, {one}, {bigger}\");\n"
"}\n"
"```"
msgstr ""
#: src/traits/from-into.md:29
msgid ""
"* That's why it is common to only implement `From`, as your type will get `Into` implementation too.\n"
"* When declaring a function argument input type like \"anything that can be converted into a `String`\", the rule is opposite, you should use `Into`.\n"
" Your function will accept types that implement `From` and those that _only_ implement `Into`.\n"
" "
msgstr ""
"* ๊ทธ๋ ๊ธฐ ๋๋ฌธ์ ์ฌ์ฉ์ ์ ์ ํ์
์ ๊ฒฝ์ฐ์๋ `From` ๋ง ๊ตฌํํ๋ ๊ฒ์ด ์ผ๋ฐ์ ์
๋๋ค.\n"
"* \"`String`์ผ๋ก ๋ณํํ ์ ์๋ ๋ชจ๋ ๊ฒ\"๊ณผ ๊ฐ์ ํจ์์ ์ธ์ ํ์
์ ์ ์ธํ ๋์๋ `Into`๋ฅผ ์ฌ์ฉํด์ผ ํจ์ ์กฐ์ฌํ์ธ์. ๊ทธ๋์ผ๋ง, ํจ์๋ `From`์ ๊ตฌํํ ํ์
๊ณผ `Into` _๋ง_ ๊ตฌํํ ํ์
๋ชจ๋๋ฅผ ์ธ์๋ก ๋ฐ์ ์ ์์ต๋๋ค.\n"
" "
#: src/traits/read-write.md:1
msgid "# `Read` and `Write`"
msgstr "# `Read`์ `Write`"
#: src/traits/read-write.md:3
msgid "Using [`Read`][1] and [`BufRead`][2], you can abstract over `u8` sources:"
msgstr "[`Read`][1]์ [`BufRead`][2]๋ฅผ ์ฌ์ฉํ๋ฉด `u8` ํ์
์ ๋ฐ์ดํฐ ์คํธ๋ฆผ์ ์ฝ์ ์ ์์ต๋๋ค:"
#: src/traits/read-write.md:5
msgid ""
"```rust,editable\n"
"use std::io::{BufRead, BufReader, Read, Result};\n"
"\n"
"fn count_lines(reader: R) -> usize {\n"
" let buf_reader = BufReader::new(reader);\n"
" buf_reader.lines().count()\n"
"}\n"
"\n"
"fn main() -> Result<()> {\n"
" let slice: &[u8] = b\"foo\\nbar\\nbaz\\n\";\n"
" println!(\"lines in slice: {}\", count_lines(slice));\n"
"\n"
" let file = std::fs::File::open(std::env::current_exe()?)?;\n"
" println!(\"lines in file: {}\", count_lines(file));\n"
" Ok(())\n"
"}\n"
"```"
msgstr ""
#: src/traits/read-write.md:23
msgid "Similarly, [`Write`][3] lets you abstract over `u8` sinks:"
msgstr "์ด์ ๋น์ทํ๊ฒ, `Write`๋ฅผ ์ฌ์นํ๋ฉด `u8` ํ์
์ ๋ฐ์ดํฐ๋ฅผ ์ธ ์ ์์ต๋๋ค:"
#: src/traits/read-write.md:25
msgid ""
"```rust,editable\n"
"use std::io::{Result, Write};\n"
"\n"
"fn log(writer: &mut W, msg: &str) -> Result<()> {\n"
" writer.write_all(msg.as_bytes())?;\n"
" writer.write_all(\"\\n\".as_bytes())\n"
"}\n"
"\n"
"fn main() -> Result<()> {\n"
" let mut buffer = Vec::new();\n"
" log(&mut buffer, \"Hello\")?;\n"
" log(&mut buffer, \"World\")?;\n"
" println!(\"Logged: {:?}\", buffer);\n"
" Ok(())\n"
"}\n"
"```"
msgstr ""
#: src/traits/operators.md:1
msgid "# `Add`, `Mul`, ..."
msgstr "# `Add`, `Mul`, ..."
#: src/traits/operators.md:3
msgid "Operator overloading is implemented via traits in [`std::ops`][1]:"
msgstr "์ฐ์ฐ์ ์ค๋ฒ๋ก๋๋ `std::ops`์ ์๋ ๋ค์ํ ํธ๋ ์๋ค์ ํตํด ๊ตฌํ๋ฉ๋๋ค:"
#: src/traits/operators.md:5
msgid ""
"```rust,editable\n"
"#[derive(Debug, Copy, Clone)]\n"
"struct Point { x: i32, y: i32 }\n"
"\n"
"impl std::ops::Add for Point {\n"
" type Output = Self;\n"
"\n"
" fn add(self, other: Self) -> Self {\n"
" Self {x: self.x + other.x, y: self.y + other.y}\n"
" }\n"
"}\n"
"\n"
"fn main() {\n"
" let p1 = Point { x: 10, y: 20 };\n"
" let p2 = Point { x: 100, y: 200 };\n"
" println!(\"{:?} + {:?} = {:?}\", p1, p2, p1 + p2);\n"
"}\n"
"```"
msgstr ""
#: src/traits/operators.md:26 src/traits/drop.md:34
msgid "Discussion points:"
msgstr "๋
ผ์์ :"
#: src/traits/operators.md:28
msgid ""
"* You could implement `Add` for `&Point`. In which situations is that useful? \n"
" * Answer: `Add:add` consumes `self`. If type `T` for which you are\n"
" overloading the operator is not `Copy`, you should consider overloading\n"
" the operator for `&T` as well. This avoids unnecessary cloning on the\n"
" call site.\n"
"* Why is `Output` an associated type? Could it be made a type parameter?\n"
" * Short answer: Type parameters are controlled by the caller, but\n"
" associated types (like `Output`) are controlled by the implementor of a\n"
" trait."
msgstr ""
"* `&Point`๊ฐ `Add`๋ฅผ ๊ตฌํํ๋๋ก ํ ์๋ ์์ต๋๋ค. ์ด๊ฒ ์ด๋ค ๊ฒฝ์ฐ์ ์ ์ฉํ ๊น์?\n"
" * ๋ต: `Add:add`๋ `self`๋ฅผ ์๋ชจํฉ๋๋ค. ๋ง์ฝ ํ์
`T`๊ฐ `Copy`ํธ๋ ์์ ๊ตฌํํ๊ณ ์์ง ์๋ค๋ฉด `&T`์ ๋ํด์๋ ์ฐ์ฐ์ ์ค๋ฒ๋ก๋ฉ์ ๊ณ ๋ คํด์ผ ํฉ๋๋ค. ์ด๋ ๊ฒ ํ๋ฉด ํธ์ถ๋ถ์์ ๋ถํ์ํ ๋ณต์ฌ๋ฅผ ํผํ ์ ์์ต๋๋ค.\n"
"* ์ `Output`์ด ์ฐ๊ด๋ ํ์
์ธ๊ฐ์? ํ์
ํ๋ผ๋ฉํฐ๋ก ๋ง๋ค ์ ์์๊น์?\n"
" * ๋ต: ํ์
ํ๋ผ๋ฉํฐ๋ฅผ ํธ์ถํ๋ ์ชฝ์์ ๊ฒฐ์ ํฉ๋๋ค. ๋ฐ๋ฉด ์ฐ๊ด๋ ํ์
(`Output`๊ฐ์) ์ ํธ๋ ์์ ๊ตฌํํ๋ ์ชฝ์์ ์ ์ด ๊ฐ๋ฅํฉ๋๋ค."
#: src/traits/drop.md:1
msgid "# The `Drop` Trait"
msgstr "# `Drop` ํธ๋ ์"
#: src/traits/drop.md:3
msgid "Values which implement [`Drop`][1] can specify code to run when they go out of scope:"
msgstr "[`Drop`][1]ํธ๋ ์์ ๊ตฌํํ๋ฉด, ๊ทธ ๊ฐ์ด ์ค์ฝํ ๋ฐ์ผ๋ก ๋๊ฐ ๋ ์คํ๋ ์ฝ๋๋ฅผ ์์ฑํ ์ ์์ต๋๋ค:"
#: src/traits/drop.md:5
msgid ""
"```rust,editable\n"
"struct Droppable {\n"
" name: &'static str,\n"
"}\n"
"\n"
"impl Drop for Droppable {\n"
" fn drop(&mut self) {\n"
" println!(\"Dropping {}\", self.name);\n"
" }\n"
"}\n"
"\n"
"fn main() {\n"
" let a = Droppable { name: \"a\" };\n"
" {\n"
" let b = Droppable { name: \"b\" };\n"
" {\n"
" let c = Droppable { name: \"c\" };\n"
" let d = Droppable { name: \"d\" };\n"
" println!(\"Exiting block B\");\n"
" }\n"
" println!(\"Exiting block A\");\n"
" }\n"
" drop(a);\n"
" println!(\"Exiting main\");\n"
"}\n"
"```"
msgstr ""
#: src/traits/drop.md:36
msgid ""
"* Why doesn't `Drop::drop` take `self`?\n"
" * Short-answer: If it did, `std::mem::drop` would be called at the end of\n"
" the block, resulting in another call to `Drop::drop`, and a stack\n"
" overflow!\n"
"* Try replacing `drop(a)` with `a.drop()`."
msgstr ""
"* `Drop::drop`์ ์ `self`๋ฅผ ์ธ์๋ก ๋ฐ์ง ์์ต๋๊น?\n"
" * ์งง์ ๋๋ต: ๋ง์ฝ ๊ทธ๋ ๊ฒ ๋๋ค๋ฉด `std::mem::drop`์ด ๋ธ๋ก์ ๋์์ ํธ์ถ๋๊ณ , ๋ค์ `Drop::drop`์ ํธ์ถํ๊ฒ๋ ์คํ ์ค๋ฒํ๋ก๊ฐ ๋ฐ์ํฉ๋๋ค.\n"
"* `drop(a)`๋ฅผ `a.drop()`๋ก ๋ณ๊ฒฝํด ๋ณด์๊ธฐ ๋ฐ๋๋๋ค."
#: src/traits/default.md:1
msgid "# The `Default` Trait"
msgstr "# `Default` ํธ๋ ์"
#: src/traits/default.md:3
msgid "[`Default`][1] trait provides a default implementation of a trait."
msgstr "[`Default`][1] ํธ๋ ์์ ๊ธฐ๋ณธ ๊ตฌํ์ ์ ๊ณตํฉ๋๋ค."
#: src/traits/default.md:5
msgid ""
"```rust,editable\n"
"#[derive(Debug, Default)]\n"
"struct Derived {\n"
" x: u32,\n"
" y: String,\n"
" z: Implemented,\n"
"}\n"
"\n"
"#[derive(Debug)]\n"
"struct Implemented(String);\n"
"\n"
"impl Default for Implemented {\n"
" fn default() -> Self {\n"
" Self(\"John Smith\".into())\n"
" }\n"
"}\n"
"\n"
"fn main() {\n"
" let default_struct: Derived = Default::default();\n"
" println!(\"{default_struct:#?}\");\n"
"\n"
" let almost_default_struct = Derived {\n"
" y: \"Y is set!\".into(),\n"
" ..Default::default()\n"
" };\n"
" println!(\"{almost_default_struct:#?}\");\n"
"\n"
" let nothing: Option = None;\n"
" println!(\"{:#?}\", nothing.unwrap_or_default());\n"
"}\n"
"\n"
"```"
msgstr ""
#: src/traits/default.md:40
msgid ""
" * It can be implemented directly or it can be derived via `#[derive(Default)]`.\n"
" * Derived implementation will produce an instance where all fields are set to their default values.\n"
" * This means all types in the struct must implement `Default` too.\n"
" * Standard Rust types often implement `Default` with reasonable values (e.g. `0`, `\"\"`, etc).\n"
" * The partial struct copy works nicely with default.\n"
" * Rust standard library is aware that types can implement `Default` and provides convenience methods that use it."
msgstr ""
" * ํธ๋ ์์ ์ง์ ๊ตฌํํ๊ฑฐ๋ `#[derive(Default)]`๋ฅผ ๋ถ์ฌ์ ์ปดํ์ผ๋ฌ์๊ฒ ๊ตฌํ์ ๋งก๊ธธ ์ ์์ต๋๋ค.\n"
" * ์ปดํ์ผ๋ฌ๊ฐ ์ ๊ณตํ๋ ์๋ ๊ตฌํ์ ๊ฒฝ์ฐ ๋ชจ๋ ํ๋์ ๋ํด ๊ธฐ๋ณธ ๊ฐ์ ์ค์ ํ ์ ์ธ์คํด์ค๋ฅผ ๋ฐํํฉ๋๋ค.\n"
" * ๊ตฌ์กฐ์ฒด์ ๊ฐ ํ๋ ํ์
๋ค์ด ๋ชจ๋ `Default`๋ฅผ ๊ตฌํํด์ผ ํจ์ ์๋ฏธํฉ๋๋ค.\n"
" * ๋ฌ์คํธ ํ์ค ํ์
๋ค์ ๋๋ถ๋ถ `Default`๋ฅผ ๊ตฌํํ๊ณ ์์ผ๋ฉฐ, ๊ธฐ๋ณธ ๊ฐ์ `0`์ด๋ `\"\"`์ฒ๋ผ ์์ ๊ฐ๋ฅํ ๊ฐ๋ค์
๋๋ค.\n"
" * ๊ตฌ์กฐ์ฒด ๋ถ๋ถ ๋ณต์ฌ๋ฅผ ํ ๋ `default`๋ฅผ ํธ๋ฆฌํ๊ฒ ์ฌ์ฉํ ์ ์์ต๋๋ค.\n"
" * ๋ฌ์คํธ ํ์ค ๋ผ์ด๋ธ๋ฌ๋ฆฌ๋ `Default` ํธ๋ ์์ ๊ตฌํํ ํ์
์ ์ํ ํธ์ ๋ฉ์๋๋ฅผ ์ ๊ณตํ๊ธฐ๋ ํฉ๋๋ค."
#: src/generics.md:1
msgid "# Generics"
msgstr "# ์ ๋ค๋ฆญ"
#: src/generics.md:3
msgid ""
"Rust support generics, which lets you abstract an algorithm (such as sorting)\n"
"over the types used in the algorithm."
msgstr "๋ฌ์คํธ๋ ์ ๋ค๋ฆญ์ ์ง์ํฉ๋๋ค. ์ด๋ฅผ ์ด์ฉํ๋ฉด ์๊ณ ๋ฆฌ์ฆ(์ ๋ ฌ๊ณผ ๊ฐ์)์ ์ถ์ํ ํ์ฌ ํน์ ํ์
์ ์์กดํ์ง ์๋๋ก ํ ์ ์์ต๋๋ค."
#: src/generics/data-types.md:1
msgid "# Generic Data Types"
msgstr "# ์ ๋ค๋ฆญ ๋ฐ์ดํฐ ํ์
"
#: src/generics/data-types.md:3
msgid "You can use generics to abstract over the concrete field type:"
msgstr "์ ๋ค๋ฆญ์ ์ฌ์ฉํ์ฌ ํ๋์ ํ์
์ ์ถ์ํ ํ ์ ์์ต๋๋ค:"
#: src/generics/data-types.md:5
msgid ""
"```rust,editable\n"
"#[derive(Debug)]\n"
"struct Point {\n"
" x: T,\n"
" y: T,\n"
"}\n"
"\n"
"fn main() {\n"
" let integer = Point { x: 5, y: 10 };\n"
" let float = Point { x: 1.0, y: 4.0 };\n"
" println!(\"{integer:?} and {float:?}\");\n"
"}\n"
"```"
msgstr ""
#: src/generics/methods.md:1
msgid "# Generic Methods"
msgstr "# ์ ๋ค๋ฆญ ๋ฉ์๋"
#: src/generics/methods.md:3
msgid "You can declare a generic type on your `impl` block:"
msgstr "`impl` ๋ธ๋ก์์๋ ์ ๋ค๋ฆญ ํ์
์ ์ ์ธํ ์ ์์ต๋๋ค:"
#: src/generics/methods.md:5
msgid ""
"```rust,editable\n"
"#[derive(Debug)]\n"
"struct Point(T, T);\n"
"\n"
"impl Point {\n"
" fn x(&self) -> &T {\n"
" &self.0 // + 10\n"
" }\n"
"\n"
" // fn set_x(&mut self, x: T)\n"
"}\n"
"\n"
"fn main() {\n"
" let p = Point(5, 10);\n"
" println!(\"p.x = {}\", p.x());\n"
"}\n"
"```"
msgstr ""
#: src/generics/methods.md:25
msgid ""
"* *Q:* Why `T` is specified twice in `impl Point {}`? Isn't that redundant?\n"
" * This is because it is a generic implementation section for generic type. They are independently generic.\n"
" * It means these methods are defined for any `T`.\n"
" * It is possible to write `impl Point { .. }`. \n"
" * `Point` is still generic and you can use `Point`, but methods in this block will only be available for `Point`."
msgstr ""
"* *์ง๋ฌธ:* `impl Point {}`์์ `T`๊ฐ ์ ๋ ๋ฒ ์ฌ์ฉ๋ฉ๋๊น?\n"
" * ์ ๋ค๋ฆญ ํ์
์ ๋ํ ์ ๋ค๋ฆญ ๊ตฌํ ์ด๊ธฐ ๋๋ฌธ์
๋๋ค. ์ด ๋ ์ ๋ค๋ฆญ์ ์๋ก ๋
๋ฆฝ์ ์
๋๋ค.\n"
" * ์ด๋ ์์์ ๋ชจ๋ `T`์ ๋ํด์ ์ด ๋ฉ์๋๋ค์ด ์ ์๋๋ค๋ ๊ฒ์ ์๋ฏธํฉ๋๋ค.\n"
" * `impl Point { .. }`์ ๊ฐ์ด ์์ฑํ๋ ๊ฒ๋ ๊ฐ๋ฅํฉ๋๋ค.\n"
" * `Point`๋ ์ฌ์ ํ ์ ๋ค๋ฆญ์ด๋ฉฐ `Point`๋ฅผ ์ฌ์ฉํ ์๋ ์์ง๋ง ์ด ๋ธ๋ก์ ๋ฉ์๋๋ `Point`๋ง ์ธ ์ ์์ต๋๋ค."
#: src/generics/trait-bounds.md:1
msgid "# Trait Bounds"
msgstr "# ์ ๋ค๋ฆญ ํ์
์ ํ(ํธ๋ ์ ๊ฒฝ๊ณ, Trait Bounds)"
#: src/generics/trait-bounds.md:3
msgid ""
"When working with generics, you often want to require the types to implement\n"
"some trait, so that you can call this trait's methods."
msgstr "์ ๋ค๋ฆญ์ ์ด์ฉํ๋ค ๋ณด๋ฉด ํ์
์ด ์ด๋ค ํธ๋ ์์ ๊ตฌํํ๊ณ ์์ด์ผ ํ๋ ๊ฒฝ์ฐ๊ฐ ์์ต๋๋ค. ๊ทธ๋์ผ ๊ทธ ํธ๋ ์์ ๋ฉ์๋๋ฅผ ํธ์ถํ ์ ์๊ธฐ ๋๋ฌธ์
๋๋ค."
#: src/generics/trait-bounds.md:6
msgid "You can do this with `T: Trait` or `impl Trait`:"
msgstr "`T: Trait` ํน์ `impl Trait`๋ฅผ ์ฌ์ฉํ๋ฉด ๋ฉ๋๋ค:"
#: src/generics/trait-bounds.md:8
msgid ""
"```rust,editable\n"
"fn duplicate(a: T) -> (T, T) {\n"
" (a.clone(), a.clone())\n"
"}\n"
"\n"
"// Syntactic sugar for:\n"
"// fn add_42_millions>(x: T) -> i32 {\n"
"fn add_42_millions(x: impl Into) -> i32 {\n"
" x.into() + 42_000_000\n"
"}\n"
"\n"
"// struct NotClonable;\n"
"\n"
"fn main() {\n"
" let foo = String::from(\"foo\");\n"
" let pair = duplicate(foo);\n"
" println!(\"{pair:?}\");\n"
"\n"
" let many = add_42_millions(42_i8);\n"
" println!(\"{many}\");\n"
" let many_more = add_42_millions(10_000_000);\n"
" println!(\"{many_more}\");\n"
"}\n"
"```"
msgstr ""
#: src/generics/trait-bounds.md:35
msgid "Show a `where` clause, students will encounter it when reading code."
msgstr "`where` ๋ฌธ๋ฒ์ ์ฌ์ฉํ ์๋ ์์ต๋๋ค. ์๊ฐ์๋ค๋ ์ฝ๋๋ฅผ ์ฝ๋ค๊ฐ ๊ทธ ๋ฌธ๋ฒ์ ๋ง์ฃผํ ์ ์์ต๋๋ค."
#: src/generics/trait-bounds.md:37
msgid ""
"```rust,ignore\n"
"fn duplicate(a: T) -> (T, T)\n"
"where\n"
" T: Clone,\n"
"{\n"
" (a.clone(), a.clone())\n"
"}\n"
"```"
msgstr ""
"```rust,ignore\n"
"fn duplicate(a: T) -> (T, T)\n"
"where\n"
" T: Clone,\n"
"{\n"
" (a.clone(), a.clone())\n"
"}\n"
"```"
#: src/generics/trait-bounds.md:46
msgid ""
"* It declutters the function signature if you have many parameters.\n"
"* It has additional features making it more powerful.\n"
" * If someone asks, the extra feature is that the type on the left of \":\" can be arbitrary, like `Option`.\n"
" "
msgstr ""
"* ์ด๋ฅผ ์ด์ฉํ๋ฉด ํ์
ํ๋ผ๋ฉํฐ๊ฐ ๋ง์ ๊ฒฝ์ฐ ํจ์ ์๊ทธ๋์ฒ๋ฅผ ๊ฐ๊ฒฐํ๊ฒ ์ ๋ฆฌํ๋ ๋ฐ ๋์์ด ๋ฉ๋๋ค.\n"
"* ์ข ๋ ๊ฐ๋ ฅํ ์ถ๊ฐ ๊ธฐ๋ฅ๋ ์ ๊ณตํฉ๋๋ค.\n"
" * `:` ์ผ์ชฝ์ ์์์ ํ์
(์๋ฅผ ๋ค์ด `Option`)์ ์ฌ์ฉํ ์ ์์ต๋๋ค.\n"
" "
#: src/generics/impl-trait.md:1
msgid "# `impl Trait`"
msgstr "# ํธ๋ ์ ๊ตฌํํ๊ธฐ(`impl Trait`)"
#: src/generics/impl-trait.md:3
msgid ""
"Similar to trait bounds, an `impl Trait` syntax can be used in function\n"
"arguments and return values:"
msgstr "ํธ๋ ์ ๋ฐ์ด๋์ ์ ์ฌํ๊ฒ `impl Trait` ๋ฌธ๋ฒ์ ํจ์์ ์ธ์์ ๋ฐํ๊ฐ์๋ ์ ์ฉ ๊ฐ๋ฅํฉ๋๋ค:"
#: src/generics/impl-trait.md:6
msgid ""
"```rust,editable\n"
"use std::fmt::Display;\n"
"\n"
"fn get_x(name: impl Display) -> impl Display {\n"
" format!(\"Hello {name}\")\n"
"}\n"
"\n"
"fn main() {\n"
" let x = get_x(\"foo\");\n"
" println!(\"{x}\");\n"
"}\n"
"```"
msgstr ""
#: src/generics/impl-trait.md:19
msgid ""
"* `impl Trait` cannot be used with the `::<>` turbo fish syntax.\n"
"* `impl Trait` allows you to work with types which you cannot name."
msgstr ""
"* `impl Trait`๋ฅผ ํฐ๋ณดํผ์ฌ๋ฌธ๋ฒ(`::<>`)๊ณผ ํจ๊ป ์ฌ์ฉํ ์๋ ์์ต๋๋ค.\n"
"* `impl Trait`๋ฅผ ์ด์ฉํ๋ฉด ์ด๋ฆ์ด ์๋ ํ์
์ ๋ค๋ฃฐ ์ ์์ต๋๋ค."
#: src/generics/impl-trait.md:24
msgid "The meaning of `impl Trait` is a bit different in the different positions."
msgstr "`impl Trait`๋ ์ด๋์ ์ฌ์ฉ๋์๋๋์ ๋ฐ๋ผ ์๋ฏธ๊ฐ ์กฐ๊ธ์ฉ ๋ค๋ฆ
๋๋ค."
#: src/generics/impl-trait.md:26
msgid ""
"* For a parameter, `impl Trait` is like an anonymous generic parameter with a trait bound.\n"
"* For a return type, it means that the return type is some concrete type that implements the trait,\n"
" without naming the type. This can be useful when you don't want to expose the concrete type in a\n"
" public API."
msgstr ""
"* ํจ์ ์ธ์์ ํ์
์ผ๋ก ์ฌ์ฉ๋์์ ๊ฒฝ์ฐ์๋ `impl Trait`๋ ํธ๋ ์ ๊ฒฝ๊ณ๊ฐ ์๋ ์ต๋ช
์ ์ ๋ค๋ฆญ ํ์
์ ์๋ฏธํฉ๋๋ค.\n"
"* ๋ฆฌํด ํ์
์ผ๋ก ์ฌ์ฉ๋์์ ๊ฒฝ์ฐ์๋, ๊ทธ ํธ๋ ์์ ๊ตฌํํ๋ ๊ตฌ์ฒด์ ์ธ ํ์
์ธ๋ฐ, ํ์
์ด๋ฆ์ ํ๋ก๊ทธ๋๋จธ๊ฐ ์ง์ง ์์๋ค๋ ๊ฒ์ ์๋ฏธํฉ๋๋ค. ์ด๋ ๊ทธ ๊ตฌ์ฒด์ ์ธ ํ์
์ด๋ฆ์ API๋ก ๊ณต๊ฐํ๊ณ ์ถ์ง ์์ ๊ฒฝ์ฐ์ ์ ์ฉํฉ๋๋ค."
#: src/generics/impl-trait.md:31
msgid ""
"This example is great, because it uses `impl Display` twice. It helps to explain that\n"
"nothing here enforces that it is _the same_ `impl Display` type. If we used a single \n"
"`T: Display`, it would enforce the constraint that input `T` and return `T` type are the same type.\n"
"It would not work for this particular function, as the type we expect as input is likely not\n"
"what `format!` returns. If we wanted to do the same via `: Display` syntax, we'd need two\n"
"independent generic parameters."
msgstr "์ด ์์๋ `impl Display`๊ฐ ๋๋ฒ ์ฌ์ฉ ๋์๋ค๋ ์ ์์ ํ๋ฅญํฉ๋๋ค. ์ฌ๊ธฐ์ ์ค์ํ ๊ฒ์ ์ด ๋ `impl Display`๊ฐ ์ค์ ๋ก ๊ฐ์ ํ์
์ผ ํ์๊ฐ ์๋ค๋ ๊ฒ์
๋๋ค. ๋ง์ฝ `T: Display`๋ก ํธ๋ ์ ๊ฒฝ๊ณ๋ฅผ ์ ํ๊ณ ์
๋ ฅ ํ๋ผ๋ฉํฐ์ ๋ฆฌํด ๊ฐ์ ํ์
์ ๋ชจ๋ `T`๋ก ํ๋ค๋ฉด, ์ด๋ ์
๋ ฅ๊ณผ ๋ฆฌํด๊ฐ์ด ๊ฐ์ ํ์
์์ ๊ฐ์ ํฉ๋๋ค. ์ด๋ ๊ฒ ํ๋ค๋ฉด ์์ ์์ ๋ ๋์ํ์ง ์์์ ๊ฒ์
๋๋ค. ์๋ํ๋ฉด, ์
๋ ฅ ๊ฐ์ ํ์
์ด `format!`์ด ๋ฆฌํดํ๋ ํ์
๊ณผ ๊ฐ์ง ์์ ๊ฐ๋ฅ์ฑ์ด ๋๊ธฐ ๋๋ฌธ์
๋๋ค. ๋ง์ฝ `: Display` ๋ฌธ๋ฒ์ ์ฌ์ฉํ๊ณ ์ถ๋ค๋ฉด ๋
๋ฆฝ์ ์ธ ์ ๋ค๋ฆญ ๋งค๊ฐ๋ณ์๊ฐ ๋ ๊ฐ๊ฐ ํ์ํฉ๋๋ค."
#: src/generics/closures.md:1
msgid "# Closures"
msgstr "# ํด๋ก์ (Closure)"
#: src/generics/closures.md:3
msgid ""
"Closures or lambda expressions have types which cannot be named. However, they\n"
"implement special [`Fn`](https://doc.rust-lang.org/std/ops/trait.Fn.html),\n"
"[`FnMut`](https://doc.rust-lang.org/std/ops/trait.FnMut.html), and\n"
"[`FnOnce`](https://doc.rust-lang.org/std/ops/trait.FnOnce.html) traits:"
msgstr "ํด๋ก์ ํน์ ๋๋คํํ์์ ์ต๋ช
ํ์
์
๋๋ค. ์ด๋ค์ [`Fn`](https://doc.rust-lang.org/std/ops/trait.Fn.html),[`FnMut`](https://doc.rust-lang.org/std/ops/trait.FnMut.html), [`FnOnce`](https://doc.rust-lang.org/std/ops/trait.FnOnce.html) ๋ผ๋ ํน๋ณํ ํธ๋ ์์ ๊ตฌํํฉ๋๋ค:"
#: src/generics/closures.md:8
msgid ""
"```rust,editable\n"
"fn apply_with_log(func: impl FnOnce(i32) -> i32, input: i32) -> i32 {\n"
" println!(\"Calling function on {input}\");\n"
" func(input)\n"
"}\n"
"\n"
"fn main() {\n"
" let add_3 = |x| x + 3;\n"
" let mul_5 = |x| x * 5;\n"
"\n"
" println!(\"add_3: {}\", apply_with_log(add_3, 10));\n"
" println!(\"mul_5: {}\", apply_with_log(mul_5, 20));\n"
"}\n"
"```"
msgstr ""
#: src/generics/closures.md:25
msgid "If you have an `FnOnce`, you may only call it once. It might consume captured values."
msgstr "`FnOnce`๋ ํ๋ฒ๋ง ํธ์ถ๋๋ฉฐ ์บก์ฒ๋ ๊ฐ์ ์๋ชจํฉ๋๋ค."
#: src/generics/closures.md:27
msgid "An `FnMut` might mutate captured values, so you can call it multiple times but not concurrently."
msgstr "`FnMut`๋ ์บก์ฒ๋ ๊ฐ์ ๋ณ๊ฒฝํ ์ ์์ผ๋ฏ๋ก ์ฌ๋ฌ๋ฒ ํธ์ถ์ ๊ฐ๋ฅํ์ง๋ง ๋์์ ํธ์ถ ํ ์๋ ์์ต๋๋ค."
#: src/generics/closures.md:29
msgid ""
"An `Fn` neither consumes nor mutates captured values, or perhaps captures nothing at all, so it can\n"
"be called multiple times concurrently."
msgstr "`Fn`์ ์บก์ฒ๋ ๊ฐ์ ์๋ชจ๋ ๋ณ๊ฒฝ๋ ํ์ง ์๊ณ , ํน์ ์ด๋ค ๊ฒ๋ ์บก์ณํ์ง ์์์ ์๋ ์๊ธฐ ๋๋ฌธ์ ๋์์ ์ฌ๋ฌ๋ฒ ํธ์ถํ ์ ์์ต๋๋ค."
#: src/generics/closures.md:32
msgid ""
"`FnMut` is a subtype of `FnOnce`. `Fn` is a subtype of `FnMut` and `FnOnce`. I.e. you can use an\n"
"`FnMut` wherever an `FnOnce` is called for, and you can use an `Fn` wherever an `FnMut` or `FnOnce`\n"
"is called for."
msgstr "`FnMut` ๋ `FnOnce`์ ํ์ํ์
์
๋๋ค. `Fn`์ `FnMut`๊ณผ `FnOnce`์ ํ์ ํ์
์
๋๋ค. ์ฆ, `FnMut`๋ `FnOnce`๊ฐ ํธ์ถ๋๋ ๊ณณ์ด๋ฉด ์ด๋์๋ ์ฌ์ฉ ํ ์ ์๊ณ `Fn`์ `FnMut`์ `FnOnce`๊ฐ ํธ์ถ๋๋ ๊ณณ์ด๋ฉด ์ด๋๋ ์ฌ์ฉํ ์ ์์ต๋๋ค."
#: src/generics/closures.md:36
msgid "`move` closures only implement `FnOnce`."
msgstr "ํด๋ก์ ๊ฐ `move`์ ํจ๊ป ์ ์ธ๋์๋ค๋ฉด ๊ทธ ํด๋ก์ ๋ ์ค์ง `FnOnce`๋ง ๊ตฌํํฉ๋๋ค."
#: src/generics/monomorphization.md:1
msgid "# Monomorphization"
msgstr "# ๋จํํ(Monomorphization)"
#: src/generics/monomorphization.md:3
msgid "Generic code is turned into non-generic code based on the call sites:"
msgstr "์ ๋ค๋ฆญ ์ฝ๋๋ ํธ์ถ๋ถ์์ ๋น ์ ๋ค๋ฆญ ์ฝ๋๋ก ์ ํ๋ฉ๋๋ค:"
#: src/generics/monomorphization.md:5
msgid ""
"```rust,editable\n"
"fn main() {\n"
" let integer = Some(5);\n"
" let float = Some(5.0);\n"
"}\n"
"```"
msgstr ""
#: src/generics/monomorphization.md:12
msgid "behaves as if you wrote"
msgstr "์ ์ฝ๋๋ ์๋์ ๊ฐ์ด ๋์ํฉ๋๋ค"
#: src/generics/monomorphization.md:14
msgid ""
"```rust,editable\n"
"enum Option_i32 {\n"
" Some(i32),\n"
" None,\n"
"}\n"
"\n"
"enum Option_f64 {\n"
" Some(f64),\n"
" None,\n"
"}\n"
"\n"
"fn main() {\n"
" let integer = Option_i32::Some(5);\n"
" let float = Option_f64::Some(5.0);\n"
"}\n"
"```"
msgstr ""
#: src/generics/monomorphization.md:31
msgid ""
"This is a zero-cost abstraction: you get exactly the same result as if you had\n"
"hand-coded the data structures without the abstraction."
msgstr "์ด๊ฒ์ด ๋ฐ๋ก ๋น์ฉ์ด ๋ค์ง ์๋ (zero-cost) ์ถ์ํ ์
๋๋ค: ๋ฌ์คํธ์ ์ ๋ค๋ฆญ์ ์ถ์ํ๋ฅผ ๊ฑฐ์น์ง ์๊ณ ์ง์ ๊ตฌ์ฒด์ ์ธ ํ์
์ ์จ์ ์ฝ๋ฉํ ๊ฒ๊ณผ ์ ํํ ๋์ผํ ๊ฒฐ๊ณผ๋ฅผ ๋ณด์ฌ์ค๋๋ค."
#: src/generics/trait-objects.md:1
msgid "# Trait Objects"
msgstr "# ํธ๋ ์ ๊ฐ์ฒด"
#: src/generics/trait-objects.md:3
msgid "We've seen how a function can take arguments which implement a trait:"
msgstr "ํจ์๊ฐ ํน์ ํธ๋ ์์ ๊ตฌํํ๋ ์ธ์๋ฅผ ์
๋ ฅ์ผ๋ก ๋ฐ๋๋ก ํ๋ ๋ฐฉ๋ฒ์ ๋ํด ์ค๋ช
ํ์์ต๋๋ค:"
#: src/generics/trait-objects.md:5
msgid ""
"```rust,editable\n"
"use std::fmt::Display;\n"
"\n"
"fn print(x: T) {\n"
" println!(\"Your value: {x}\");\n"
"}\n"
"\n"
"fn main() {\n"
" print(123);\n"
" print(\"Hello\");\n"
"}\n"
"```"
msgstr ""
#: src/generics/trait-objects.md:18
msgid "However, how can we store a collection of mixed types which implement `Display`?"
msgstr "๊ทธ๋ฐ๋ฐ, ์๋์ ๊ฐ์ด `Display`๋ฅผ ๊ตฌํํ๋ ์๋ก ๋ค๋ฅธ ํ์
๋ค์ ์ฝ๋ ์
์ ์ ์ฅํ๊ณ ์ถ๋ค๋ฉด ์ด๋ป๊ฒ ํด์ผ ํ ๊น์?"
#: src/generics/trait-objects.md:20
msgid ""
"```rust,editable,compile_fail\n"
"fn main() {\n"
" let xs = vec![123, \"Hello\"];\n"
"}\n"
"```"
msgstr ""
#: src/generics/trait-objects.md:26
msgid "For this, we need _trait objects_:"
msgstr "์ด๋ฅผ ์ํด์๋ \"ํธ๋ ์ ๊ฐ์ฒด\"๊ฐ ํ์ํฉ๋๋ค:"
#: src/generics/trait-objects.md:28
msgid ""
"```rust,editable\n"
"use std::fmt::Display;\n"
"\n"
"fn main() {\n"
" let xs: Vec> = vec![Box::new(123), Box::new(\"Hello\")];\n"
" for x in xs {\n"
" println!(\"x: {x}\");\n"
" }\n"
"}\n"
"```"
msgstr ""
#: src/generics/trait-objects.md:39
msgid "Memory layout after allocating `xs`:"
msgstr "`xs`๊ฐ ํ ๋น๋ ๋ ๋ฉ๋ชจ๋ฆฌ ๋ ์ด์์:"
#: src/generics/trait-objects.md:41
msgid ""
"```bob\n"
" Stack Heap\n"
".- - - - - - - - - - - - - -. .- - - - - - - - - - - - - - - - - - - - - - - -.\n"
": : : :\n"
": xs : : :\n"
": +-----------+-------+ : : +-----+-----+ :\n"
": | ptr | o---+---+-----+-->| o o | o o | :\n"
": | len | 2 | : : +-|-|-+-|-|-+ :\n"
": | capacity | 2 | : : | | | | +----+----+----+----+----+ :\n"
": +-----------+-------+ : : | | | '-->| H | e | l | l | o | :\n"
": : : | | | +----+----+----+----+----+ :\n"
"`- - - - - - - - - - - - - -' : | | | :\n"
" : | | | +-------------------------+ :\n"
" : | | '---->| \"::fmt\" | :\n"
" : | | +-------------------------+ :\n"
" : | | :\n"
" : | | +----+----+----+----+ :\n"
" : | '-->| 7b | 00 | 00 | 00 | :\n"
" : | +----+----+----+----+ :\n"
" : | :\n"
" : | +-------------------------+ :\n"
" : '---->| \"::fmt\" | :\n"
" : +-------------------------+ :\n"
" : :\n"
" : :\n"
" '- - - - - - - - - - - - - - - - - - - - - - - -'\n"
"```"
msgstr ""
"```bob\n"
" ์คํ ํ\n"
".- - - - - - - - - - - - - -. .- - - - - - - - - - - - - - - - - - - - - - - -.\n"
": : : :\n"
": xs : : :\n"
": +-----------+-------+ : : +-----+-----+ :\n"
": | ptr | o---+---+-----+-->| o o | o o | :\n"
": | len | 2 | : : +-|-|-+-|-|-+ :\n"
": | capacity | 2 | : : | | | | +----+----+----+----+----+ :\n"
": +-----------+-------+ : : | | | '-->| H | e | l | l | o | :\n"
": : : | | | +----+----+----+----+----+ :\n"
"`- - - - - - - - - - - - - -' : | | | :\n"
" : | | | +-------------------------+ :\n"
" : | | '---->| \"::fmt\" | :\n"
" : | | +-------------------------+ :\n"
" : | | :\n"
" : | | +----+----+----+----+ :\n"
" : | '-->| 7b | 00 | 00 | 00 | :\n"
" : | +----+----+----+----+ :\n"
" : | :\n"
" : | +-------------------------+ :\n"
" : '---->| \"::fmt\" | :\n"
" : +-------------------------+ :\n"
" : :\n"
" : :\n"
" '- - - - - - - - - - - - - - - - - - - - - - - -'\n"
"```"
#: src/generics/trait-objects.md:69
msgid ""
"Similarly, you need a trait object if you want to return different types\n"
"implementing a trait:"
msgstr "๋ง์ฐฌ๊ฐ์ง๋ก, ๊ฐ์ ํธ๋ ์์ ๊ตฌํํ๋ ์๋ก ๋ค๋ฅธ ํ์
์ ๊ฐ์ ๋ฆฌํดํ ๋์๋ ํธ๋ ์ ๊ฐ์ฒด๊ฐ ํ์ํฉ๋๋ค:"
#: src/generics/trait-objects.md:72
msgid ""
"```rust,editable\n"
"fn numbers(n: i32) -> Box> {\n"
" if n > 0 {\n"
" Box::new(0..n)\n"
" } else {\n"
" Box::new((n..0).rev())\n"
" }\n"
"}\n"
"\n"
"fn main() {\n"
" println!(\"{:?}\", numbers(-5).collect::>());\n"
" println!(\"{:?}\", numbers(5).collect::>());\n"
"}\n"
"\n"
"```"
msgstr ""
#: src/exercises/day-3/morning.md:1
msgid "# Day 3: Morning Exercises"
msgstr "# 3์ผ์ฐจ ์ค์ ์ฐ์ต๋ฌธ์ "
#: src/exercises/day-3/morning.md:3
msgid "We will design a classical GUI library traits and trait objects."
msgstr "์ด๋ฒ ์ฐ์ต๋ฌธ์ ์์๋ ํธ๋ ์์ ํธ๋ ์ ๊ฐ์ฒด๋ฅผ ํตํด ๊ณ ์ ์ ์ธ GUI ๋ผ์ด๋ธ๋ฌ๋ฆฌ๋ฅผ ์ค๊ณํ ๊ฒ์
๋๋ค."
#: src/exercises/day-3/simple-gui.md:1
msgid "# A Simple GUI Library"
msgstr "# ๊ฐ๋จํ GUI ๋ผ์ด๋ธ๋ฌ๋ฆฌ"
#: src/exercises/day-3/simple-gui.md:3
msgid ""
"Let us design a classical GUI library using our new knowledge of traits and\n"
"trait objects."
msgstr "์ด๋ฒ ์ฐ์ต๋ฌธ์ ์์๋ ํธ๋ ์์ ํธ๋ ์ ๊ฐ์ฒด์ ๋ํด ๋ฐฐ์ด๊ฒ์ ํ์ฉํ์ฌ ๊ณ ์ ์ ์ธ GUI ๋ผ์ด๋ธ๋ฌ๋ฆฌ๋ฅผ ์ค๊ณํ ๊ฒ์
๋๋ค."
#: src/exercises/day-3/simple-gui.md:6
msgid "We will have a number of widgets in our library:"
msgstr "๋ผ์ด๋ธ๋ฌ๋ฆฌ์๋ ๋ช ๊ฐ์ง ์์ ฏ์ด ์์ต๋๋ค:"
#: src/exercises/day-3/simple-gui.md:8
msgid ""
"* `Window`: has a `title` and contains other widgets.\n"
"* `Button`: has a `label` and a callback function which is invoked when the\n"
" button is pressed.\n"
"* `Label`: has a `label`."
msgstr ""
"* `Window`: `title` ์์ฑ์ ๊ฐ์ง๊ณ ์์ผ๋ฉฐ, ๋ค๋ฅธ ์์ ฏ๋ค์ ํฌํจํ ์ ์์ต๋๋ค.\n"
"* `Button`: `label` ์์ฑ์ ๊ฐ์ง๊ณ ์์ผ๋ฉฐ, ๋ฒํผ์ด ๋๋ ธ์๋ ์คํ๋๋ ์ฝ๋ฐฑ ํจ์๊ฐ ์์ต๋๋ค.\n"
"* `Label`: `label` ์์ฑ์ ๊ฐ์ง๊ณ ์์ต๋๋ค."
#: src/exercises/day-3/simple-gui.md:13
msgid "The widgets will implement a `Widget` trait, see below."
msgstr "์์ ฏ๋ค์ ๋ชจ๋ `Widget` ํธ๋ ์์ ๊ตฌํํฉ๋๋ค. ์๋ ์ฝ๋๋ฅผ ์ฐธ์กฐํ์ธ์."
#: src/exercises/day-3/simple-gui.md:15
msgid ""
"Copy the code below to ,\n"
"}\n"
"\n"
"impl Button {\n"
" fn new(label: &str, callback: Box) -> Button {\n"
" Button {\n"
" label: Label::new(label),\n"
" callback,\n"
" }\n"
" }\n"
"}\n"
"\n"
"pub struct Window {\n"
" title: String,\n"
" widgets: Vec>,\n"
"}\n"
"\n"
"impl Window {\n"
" fn new(title: &str) -> Window {\n"
" Window {\n"
" title: title.to_owned(),\n"
" widgets: Vec::new(),\n"
" }\n"
" }\n"
"\n"
" fn add_widget(&mut self, widget: Box) {\n"
" self.widgets.push(widget);\n"
" }\n"
"}\n"
"\n"
"\n"
"impl Widget for Label {\n"
" fn width(&self) -> usize {\n"
" unimplemented!()\n"
" }\n"
"\n"
" fn draw_into(&self, buffer: &mut dyn std::fmt::Write) {\n"
" unimplemented!()\n"
" }\n"
"}\n"
"\n"
"impl Widget for Button {\n"
" fn width(&self) -> usize {\n"
" unimplemented!()\n"
" }\n"
"\n"
" fn draw_into(&self, buffer: &mut dyn std::fmt::Write) {\n"
" unimplemented!()\n"
" }\n"
"}\n"
"\n"
"impl Widget for Window {\n"
" fn width(&self) -> usize {\n"
" unimplemented!()\n"
" }\n"
"\n"
" fn draw_into(&self, buffer: &mut dyn std::fmt::Write) {\n"
" unimplemented!()\n"
" }\n"
"}\n"
"\n"
"fn main() {\n"
" let mut window = Window::new(\"Rust GUI Demo 1.23\");\n"
" window.add_widget(Box::new(Label::new(\"This is a small text GUI demo.\")));\n"
" window.add_widget(Box::new(Button::new(\n"
" \"Click me!\",\n"
" Box::new(|| println!(\"You clicked the button!\")),\n"
" )));\n"
" window.draw();\n"
"}\n"
"```"
msgstr ""
#: src/exercises/day-3/simple-gui.md:123
msgid "The output of the above program can be something simple like this:"
msgstr "์ ํ๋ก๊ทธ๋จ์ ์ถ๋ ฅ์ ์๋์ ๊ฐ์ต๋๋ค:"
#: src/exercises/day-3/simple-gui.md:125
msgid ""
"```text\n"
"========\n"
"Rust GUI Demo 1.23\n"
"========\n"
"\n"
"This is a small text GUI demo.\n"
"\n"
"| Click me! |\n"
"```"
msgstr ""
#: src/exercises/day-3/simple-gui.md:135
msgid ""
"If you want to draw aligned text, you can use the\n"
"[fill/alignment](https://doc.rust-lang.org/std/fmt/index.html#fillalignment)\n"
"formatting operators. In particular, notice how you can pad with different\n"
"characters (here a `'/'`) and how you can control alignment:"
msgstr "ํ
์คํธ๋ฅผ ์ค๋ง์ถค ํด์ ๊ทธ๋ฆฌ๋ ค๋ฉด [fill/alignment](https://doc.rust-lang.org/std/fmt/index.html#fillalignment)๋ฅผ ์ฐธ์กฐํ์๊ธฐ ๋ฐ๋๋๋ค. ํน์ ๋ฌธ์(์ฌ๊ธฐ์๋ `'/'`)๋ก ํจ๋ฉ์ ์ฃผ๋ ๋ฐฉ๋ฒ๊ณผ ์ ๋ ฌ์ ์ ์ดํ๋ ๋ฐฉ๋ฒ์ ํ์ธํ์๊ธฐ ๋ฐ๋๋๋ค:"
#: src/exercises/day-3/simple-gui.md:140
msgid ""
"```rust,editable\n"
"fn main() {\n"
" let width = 10;\n"
" println!(\"left aligned: |{:/ {\n"
" let username_file_result = fs::File::open(path);\n"
"\n"
" let mut username_file = match username_file_result {\n"
" Ok(file) => file,\n"
" Err(e) => return Err(e),\n"
" };\n"
"\n"
" let mut username = String::new();\n"
"\n"
" match username_file.read_to_string(&mut username) {\n"
" Ok(_) => Ok(username),\n"
" Err(e) => Err(e),\n"
" }\n"
"}\n"
"\n"
"fn main() {\n"
" //fs::write(\"config.dat\", \"alice\").unwrap();\n"
" let username = read_username(\"config.dat\");\n"
" println!(\"username or error: {username:?}\");\n"
"}\n"
"```"
msgstr ""
#: src/error-handling/try-operator.md:52
#: src/error-handling/converting-error-types-example.md:52
msgid ""
"* The `username` variable can be either `Ok(string)` or `Err(error)`.\n"
"* Use the `fs::write` call to test out the different scenarios: no file, empty file, file with username."
msgstr ""
"* `username` ๋ณ์๋ `Ok(string)`์ด๊ฑฐ๋ `Err(error)`์ผ ์ ์์ต๋๋ค.\n"
"* `fs::write` ๋ฉ์๋๋ฅผ ์ฌ์ฉํ์ฌ ํ์ผ์ด ์๊ฑฐ๋, ๋น์๊ฑฐ๋, ์ค๋ณต๋๋ ๊ฒฝ์ฐ ๋ฑ์ ํ
์คํธํด ๋ด
๋๋ค."
#: src/error-handling/converting-error-types.md:1
#: src/error-handling/converting-error-types-example.md:1
msgid "# Converting Error Types"
msgstr "# ์๋ฌ ํ์
์ด ๋ค๋ฅผ ๊ฒฝ์ฐ"
#: src/error-handling/converting-error-types.md:3
msgid "The effective expansion of `?` is a little more complicated than previously indicated:"
msgstr "์ค์ ๋ก `?`๊ฐ ์ ์ฉ๋๋ ๊ณผ์ ์ ์๊น ์ค๋ช
ํ ๊ฒ ๋ณด๋ค ์ข ๋ ๋ณต์กํฉ๋๋ค:"
#: src/error-handling/converting-error-types.md:5
msgid ""
"```rust,ignore\n"
"expression?\n"
"```"
msgstr ""
#: src/error-handling/converting-error-types.md:9
msgid "works the same as"
msgstr "์ ํํ์ ์๋์ ๊ฐ์ต๋๋ค"
#: src/error-handling/converting-error-types.md:11
msgid ""
"```rust,ignore\n"
"match expression {\n"
" Ok(value) => value,\n"
" Err(err) => return Err(From::from(err)),\n"
"}\n"
"```"
msgstr ""
#: src/error-handling/converting-error-types.md:18
msgid ""
"The `From::from` call here means we attempt to convert the error type to the\n"
"type returned by the function:"
msgstr "`From::from`์ ํตํด ์๋์ ์๋ฌ ํ์
์ ์ด ํจ์๊ฐ ๋ฐํํ๋ ์๋ฌ ํ์
์ผ๋ก ๋ณํํ๊ณ ์์ต๋๋ค:"
#: src/error-handling/converting-error-types-example.md:3
msgid ""
"```rust,editable\n"
"use std::error::Error;\n"
"use std::fmt::{self, Display, Formatter};\n"
"use std::fs::{self, File};\n"
"use std::io::{self, Read};\n"
"\n"
"#[derive(Debug)]\n"
"enum ReadUsernameError {\n"
" IoError(io::Error),\n"
" EmptyUsername(String),\n"
"}\n"
"\n"
"impl Error for ReadUsernameError {}\n"
"\n"
"impl Display for ReadUsernameError {\n"
" fn fmt(&self, f: &mut Formatter) -> fmt::Result {\n"
" match self {\n"
" Self::IoError(e) => write!(f, \"IO error: {}\", e),\n"
" Self::EmptyUsername(filename) => write!(f, \"Found no username in {}\", filename),\n"
" }\n"
" }\n"
"}\n"
"\n"
"impl From for ReadUsernameError {\n"
" fn from(err: io::Error) -> ReadUsernameError {\n"
" ReadUsernameError::IoError(err)\n"
" }\n"
"}\n"
"\n"
"fn read_username(path: &str) -> Result {\n"
" let mut username = String::with_capacity(100);\n"
" File::open(path)?.read_to_string(&mut username)?;\n"
" if username.is_empty() {\n"
" return Err(ReadUsernameError::EmptyUsername(String::from(path)));\n"
" }\n"
" Ok(username)\n"
"}\n"
"\n"
"fn main() {\n"
" //fs::write(\"config.dat\", \"\").unwrap();\n"
" let username = read_username(\"config.dat\");\n"
" println!(\"username or error: {username:?}\");\n"
"}\n"
"```"
msgstr ""
#: src/error-handling/converting-error-types-example.md:55
msgid ""
"It is good practice for all error types to implement `std::error::Error`, which requires `Debug` and\n"
"`Display`. It's generally helpful for them to implement `Clone` and `Eq` too where possible, to make\n"
"life easier for tests and consumers of your library. In this case we can't easily do so, because\n"
"`io::Error` doesn't implement them."
msgstr "์๋ฌ ํ์
์ด `std::error::Error`๋ฅผ ๊ตฌํํ๋๋ก ํ๋ ๊ฒ์ ์ข์ ์ต๊ด์
๋๋ค. ๊ทธ๋ฌ๋ฉด `Debug`์ `Display` ํธ๋ ์ ๋ํ ๊ตฌํ์ ํด์ผ ํฉ๋๋ค. ๊ฐ๋ฅํ๋ค๋ฉด `Clone`๊ณผ `Eq` ํธ๋ ์๋ ๊ตฌํํ๋๋ก ํ์ธ์. ์ฌ๋ฌ๋ถ์ ๋ผ์ด๋ธ๋ฌ๋ฆฌ๊ฐ ํ
์คํธ ํ๊ธฐ ์ฌ์์ง๊ณ , ์ฌ์ฉํ๊ธฐ ์ข์์ง ๊ฒ๋๋ค. ๋ค๋ง, ์ด ์์ ์์๋ ๊ทธ๋ ๊ฒ ํ๊ธฐ ํ๋ญ๋๋ค. ์๋ํ๋ฉด `io::Error`๋ ์ด ํธ๋ ์๋ค์ ๊ตฌํํ๊ณ ์์ง ์๊ธฐ ๋๋ฌธ์
๋๋ค."
#: src/error-handling/deriving-error-enums.md:1
msgid "# Deriving Error Enums"
msgstr "# ๋๋ค๋ฅธ ์ค๋ฅ ์ด๊ฑฐํ"
#: src/error-handling/deriving-error-enums.md:3
msgid ""
"The [thiserror](https://docs.rs/thiserror/) crate is a popular way to create an\n"
"error enum like we did on the previous page:"
msgstr "[thiserror](https://docs.rs/thiserror/)๋, ์ด์ ํ์ด์ง์์ ๋ณด์๋ ๊ฒ๊ณผ ๊ฐ์ ์๋ฌ ์ด๊ฑฐํ์ ์ฝ๊ฒ ๋ง๋ค ์ ์๊ฒ ํด ์ฃผ๋ ์ ๋ช
ํ ํฌ๋ ์ดํธ ์
๋๋ค:"
#: src/error-handling/deriving-error-enums.md:6
msgid ""
"```rust,editable,compile_fail\n"
"use std::{fs, io};\n"
"use std::io::Read;\n"
"use thiserror::Error;\n"
"\n"
"#[derive(Debug, Error)]\n"
"enum ReadUsernameError {\n"
" #[error(\"Could not read: {0}\")]\n"
" IoError(#[from] io::Error),\n"
" #[error(\"Found no username in {0}\")]\n"
" EmptyUsername(String),\n"
"}\n"
"\n"
"fn read_username(path: &str) -> Result {\n"
" let mut username = String::with_capacity(100);\n"
" fs::File::open(path)?.read_to_string(&mut username)?;\n"
" if username.is_empty() {\n"
" return Err(ReadUsernameError::EmptyUsername(String::from(path)));\n"
" }\n"
" Ok(username)\n"
"}\n"
"\n"
"fn main() {\n"
" //fs::write(\"config.dat\", \"\").unwrap();\n"
" match read_username(\"config.dat\") {\n"
" Ok(username) => println!(\"Username: {username}\"),\n"
" Err(err) => println!(\"Error: {err}\"),\n"
" }\n"
"}\n"
"```"
msgstr ""
#: src/error-handling/deriving-error-enums.md:39
msgid ""
"`thiserror`'s derive macro automatically implements `std::error::Error`, and optionally `Display`\n"
"(if the `#[error(...)]` attributes are provided) and `From` (if the `#[from]` attribute is added).\n"
"It also works for structs."
msgstr "`thiserror`์ derive ๋งคํฌ๋ก๋ฅผ ์ด์ฉํ๋ฉด `std::error::Error`๊ณผ `Display`(๋ง์ฝ `#[error(...)]` ์ดํธ๋ฆฌ๋ทฐํธ๋ฅผ ์ถ๊ฐํ์ ๊ฒฝ์ฐ), `From`(๋ง์ฝ `#[from]` ์ดํธ๋ฆฌ๋ทฐํธ๋ฅผ ์ถ๊ฐํ์ ๊ฒฝ์ฐ) ํธ๋ ์๋ค์ด ์๋์ผ๋ก ๊ตฌํ์ด ๋ฉ๋๋ค. ๊ตฌ์กฐ์ฒด์ ๋ํด์๋ ์ฌ์ฉ ๊ฐ๋ฅํฉ๋๋ค."
#: src/error-handling/deriving-error-enums.md:43
msgid "It doesn't affect your public API, which makes it good for libraries."
msgstr "์ด ๋งคํฌ๋ก๋ฅผ ์ฌ์ฉํด๋ ๋ฐ์ผ๋ก ๋
ธ์ถ๋๋ API๊ฐ ๋ณ๊ฒฝ๋์ง๋ ์์ต๋๋ค. ๋ผ์ด๋ธ๋ฌ๋ฆฌ๋ฅผ ๋ง๋ค ๊ฒฝ์ฐ์๋ ์ด๊ฒ ์ค์ํ์ฃ ."
#: src/error-handling/dynamic-errors.md:1
msgid "# Dynamic Error Types"
msgstr "# ๋์ ์ธ ์๋ฌ ํ์
"
#: src/error-handling/dynamic-errors.md:3
msgid ""
"Sometimes we want to allow any type of error to be returned without writing our own enum covering\n"
"all the different possibilities. `std::error::Error` makes this easy."
msgstr "๋๋๋ก ์ฐ๋ฆฌ๋, ๋ฐ์ ๊ฐ๋ฅํ ๋ชจ๋ ์๋ฌ๋ฅผ ์ผ์ผํ ์ด๊ฑฐํ์ง ์๊ณ , ์ด๋ค ์ข
๋ฅ์ ์๋ฌ๋ผ๋ ์๊ด์์ด ๋ฆฌํดํ๊ณ ์ถ์ ๋๊ฐ ์์ต๋๋ค. `std::error::Error`๋ฅผ ์ด์ฉํ๋ฉด ์ฝ์ต๋๋ค."
#: src/error-handling/dynamic-errors.md:6
msgid ""
"```rust,editable,compile_fail\n"
"use std::fs::{self, File};\n"
"use std::io::Read;\n"
"use thiserror::Error;\n"
"use std::error::Error;\n"
"\n"
"#[derive(Clone, Debug, Eq, Error, PartialEq)]\n"
"#[error(\"Found no username in {0}\")]\n"
"struct EmptyUsernameError(String);\n"
"\n"
"fn read_username(path: &str) -> Result> {\n"
" let mut username = String::with_capacity(100);\n"
" File::open(path)?.read_to_string(&mut username)?;\n"
" if username.is_empty() {\n"
" return Err(EmptyUsernameError(String::from(path)).into());\n"
" }\n"
" Ok(username)\n"
"}\n"
"\n"
"fn main() {\n"
" //fs::write(\"config.dat\", \"\").unwrap();\n"
" match read_username(\"config.dat\") {\n"
" Ok(username) => println!(\"Username: {username}\"),\n"
" Err(err) => println!(\"Error: {err}\"),\n"
" }\n"
"}\n"
"```"
msgstr ""
#: src/error-handling/dynamic-errors.md:36
msgid ""
"This saves on code, but gives up the ability to cleanly handle different error cases differently in\n"
"the program. As such it's generally not a good idea to use `Box` in the public API of a\n"
"library, but it can be a good option in a program where you just want to display the error message\n"
"somewhere."
msgstr "์ด๋ ๊ฒ ํ๋ฉด ์ฝ๋์ ์์ ์ค์ผ ์ ์์ต๋๋ค. ๊ทธ๋ฌ๋ ์๋ก ๋ค๋ฅธ ์ข
๋ฅ์ ์๋ฌ๋ฅผ ๊ตฌ๋ณํ์ฌ ๋ค๋ฅด๊ฒ ์ฒ๋ฆฌํ๋ ๊ฒ์ด ๋ถ๊ฐ๋ฅํด ์ง๋๋ค. ๋๋ฌธ์, `Box`๋ฅผ ๋ผ์ด๋ธ๋ฌ๋ฆฌ์ API๋ก ๋
ธ์ถํ๋๊ฒ ์ข์ ๋์์ธ์ ์๋๋๋ค. ์๋ฌ ๋ฐ์ ์, ๊ทธ์ ์๋ฌ ๋ฉ์์ง๋ฅผ ์ถ๋ ฅํ๊ณ ์ถ์ ๊ฒฝ์ฐ์ ๊ฐ์ด ์ ํ๋ ์ํฉ์์๋ ์ ์ฉํ ์ ์์ต๋๋ค."
#: src/error-handling/error-contexts.md:1
msgid "# Adding Context to Errors"
msgstr "# ์ค๋ฅ์ ๋ฌธ๋งฅ ์ถ๊ฐ"
#: src/error-handling/error-contexts.md:3
msgid ""
"The widely used [anyhow](https://docs.rs/anyhow/) crate can help you add\n"
"contextual information to your errors and allows you to have fewer\n"
"custom error types:"
msgstr "[anyhow](https://docs.rs/anyhow/) ํฌ๋ ์ดํธ๋ ์๋ฌ์ ์๋ฌ๊ฐ ๋ฐ์ํ ๋ฌธ๋งฅ์ ๋ํ ์ ๋ณด๋ฅผ ์ถ๊ฐํ๊ธฐ ์ํด ๋๋ฆฌ ์ฌ์ฉ๋๋ฉฐ, ์ด๋ฅผ ์ด์ฉํ๋ฉด ์๋ก ๋ค๋ฅธ ๋ฌธ๋งฅ์ ๋ํ๋ด๊ธฐ ์ฌ์ฉ์ ์ ์ ์ค๋ฅ ํ์
์ ๋ง์ด ๋ง๋ค์ด์ผ ํ๋ ๋ถํธํจ์ ํผํ ์ ์์ต๋๋ค:"
#: src/error-handling/error-contexts.md:7
msgid ""
"```rust,editable,compile_fail\n"
"use std::{fs, io};\n"
"use std::io::Read;\n"
"use anyhow::{Context, Result, bail};\n"
"\n"
"fn read_username(path: &str) -> Result {\n"
" let mut username = String::with_capacity(100);\n"
" fs::File::open(path)\n"
" .with_context(|| format!(\"Failed to open {path}\"))?\n"
" .read_to_string(&mut username)\n"
" .context(\"Failed to read\")?;\n"
" if username.is_empty() {\n"
" bail!(\"Found no username in {path}\");\n"
" }\n"
" Ok(username)\n"
"}\n"
"\n"
"fn main() {\n"
" //fs::write(\"config.dat\", \"\").unwrap();\n"
" match read_username(\"config.dat\") {\n"
" Ok(username) => println!(\"Username: {username}\"),\n"
" Err(err) => println!(\"Error: {err:?}\"),\n"
" }\n"
"}\n"
"```"
msgstr ""
"```rust,editable,compile_fail\n"
"use std::{fs, io};\n"
"use std::io::Read;\n"
"use anyhow::{Context, Result, bail};\n"
"\n"
"fn read_username(path: &str) -> Result {\n"
" let mut username = String::with_capacity(100);\n"
" fs::File::open(path)\n"
" .with_context(|| format!(\"Failed to open {path}\"))?\n"
" .read_to_string(&mut username)\n"
" .context(\"Failed to read\")?;\n"
" if username.is_empty() {\n"
" bail!(\"Found no username in {path}\");\n"
" }\n"
" Ok(username)\n"
"}\n"
"\n"
"fn main() {\n"
" //fs::write(\"config.dat\", \"\").unwrap();\n"
" match read_username(\"config.dat\") {\n"
" Ok(username) => println!(\"Username: {username}\"),\n"
" Err(err) => println!(\"Error: {err:?}\"),\n"
" }\n"
"}\n"
"```"
#: src/error-handling/error-contexts.md:35
msgid ""
"* `anyhow::Result` is a type alias for `Result`.\n"
"* `anyhow::Error` is essentially a wrapper around `Box`. As such it's again generally not\n"
" a good choice for the public API of a library, but is widely used in applications.\n"
"* Actual error type inside of it can be extracted for examination if necessary.\n"
"* Functionality provided by `anyhow::Result` may be familiar to Go developers, as it provides\n"
" similar usage patterns and ergonomics to `(T, error)` from Go."
msgstr ""
"* `anyhow::Result`๋ `Result`์ ํ์
์จ๋ฆฌ์ด์ค(alias)์
๋๋ค.\n"
"* `anyhow::Error`๋ `Box`์ ๋ํผ ํ์
์ด๋ผ ํ ์ ์์ต๋๋ค. ๋ฐ๋ผ์ ๋ผ์ด๋ธ๋ฌ๋ฆฌ์ ๊ณต๊ฐ API๋ก์ ์ฌ์ฉํ๊ธฐ์ ๋ถ์ ํฉํ๋ค๊ณ ํ ์ ์์ง๋ง ๋ง์ ์ ํ๋ฆฌ์ผ์ด์
์ ๋๋ฆฌ ์ฌ์ฉ๋๊ณ ์์ต๋๋ค.\n"
"* ํ์ํ๋ค๋ฉด `anyhow::Error`์ ์ ์ฅ๋ ์ง์ง ์๋ฌ ํ์
์ ๊บผ๋ด์ด ๊ฒ์ฌํ ์๋ ์์ต๋๋ค.\n"
"* `anyhow::Result`๊ฐ ์ ๊ณตํ๋ ๊ธฐ๋ฅ๋ค์ด Go ์ธ์ด ๊ฐ๋ฐ์๋ค์๊ฒ๋ ์ต์ํ ๊ฒ์
๋๋ค. Go์ธ์ด์์ ๋ฐํ ๊ฐ์ผ๋ก ์ฌ์ฉํ๋ `(T, error)` ํจํด๊ณผ ๋น์ทํ๊ธฐ ๋๋ฌธ์
๋๋ค."
#: src/testing.md:1
msgid "# Testing"
msgstr "# ํ
์คํ
"
#: src/testing.md:3
msgid "Rust and Cargo come with a simple unit test framework:"
msgstr "๋ฌ์คํธ์ ์นด๊ณ (cargo)๋ ๊ฐ๋จํ ๋จ์ ํ
์คํธ ํ๋ ์์ํฌ์ ํจ๊ป ์ ๊ณต๋ฉ๋๋ค:"
#: src/testing.md:5
msgid ""
"* Unit tests are supported throughout your code.\n"
"\n"
"* Integration tests are supported via the `tests/` directory."
msgstr ""
"* ๋จ์ ํ
์คํธ๋ ์ฝ๋ ์ ๋ฐ์์ ์ง์๋ฉ๋๋ค.\n"
"\n"
"* ํตํฉ ํ
์คํธ๋ `tests/` ๋๋ ํฐ๋ฆฌ๋ฅผ ํตํด ์ง์๋ฉ๋๋ค."
#: src/testing/unit-tests.md:1
msgid "# Unit Tests"
msgstr "# ๋จ์ ํ
์คํธ"
#: src/testing/unit-tests.md:3
msgid "Mark unit tests with `#[test]`:"
msgstr "๋จ์ ํ
์คํธ๋ `#[test]` ๋ก ํ์ํฉ๋๋ค:"
#: src/testing/unit-tests.md:5
msgid ""
"```rust,ignore\n"
"fn first_word(text: &str) -> &str {\n"
" match text.find(' ') {\n"
" Some(idx) => &text[..idx],\n"
" None => &text,\n"
" }\n"
"}\n"
"\n"
"#[test]\n"
"fn test_empty() {\n"
" assert_eq!(first_word(\"\"), \"\");\n"
"}\n"
"\n"
"#[test]\n"
"fn test_single_word() {\n"
" assert_eq!(first_word(\"Hello\"), \"Hello\");\n"
"}\n"
"\n"
"#[test]\n"
"fn test_multiple_words() {\n"
" assert_eq!(first_word(\"Hello World\"), \"Hello\");\n"
"}\n"
"```"
msgstr ""
#: src/testing/unit-tests.md:29
msgid "Use `cargo test` to find and run the unit tests."
msgstr "`cargo test` ์ปค๋งจ๋๋ฅผ ์ฌ์ฉํ๋ฉด ๋จ์ ํ
์คํธ๋ฅผ ์ฐพ์์ ์คํํฉ๋๋ค."
#: src/testing/test-modules.md:1
msgid "# Test Modules"
msgstr "# ํ
์คํธ ๋ชจ๋"
#: src/testing/test-modules.md:3
msgid ""
"Unit tests are often put in a nested module (run tests on the\n"
"[Playground](https://play.rust-lang.org/)):"
msgstr "๋จ์ ํ
์คํธ๋ ์๋ ๋ชจ๋ ๋ฐ์ ์๋ธ ๋ชจ๋๋ก ๋ง๋๋ ๊ฒฝ์ฐ๊ฐ ๋ง์ต๋๋ค. ([ํ๋ ์ด๊ทธ๋ผ์ด๋](https://play.rust-lang.org/)์์ ๋ค์ ํ
์คํธ๋ฅผ ์ํํด ๋ณด์ธ์):"
#: src/testing/test-modules.md:6
msgid ""
"```rust,editable\n"
"fn helper(a: &str, b: &str) -> String {\n"
" format!(\"{a} {b}\")\n"
"}\n"
"\n"
"pub fn main() {\n"
" println!(\"{}\", helper(\"Hello\", \"World\"));\n"
"}\n"
"\n"
"#[cfg(test)]\n"
"mod tests {\n"
" use super::*;\n"
"\n"
" #[test]\n"
" fn test_helper() {\n"
" assert_eq!(helper(\"foo\", \"bar\"), \"foo bar\");\n"
" }\n"
"}\n"
"```"
msgstr ""
#: src/testing/test-modules.md:26
msgid ""
"* This lets you unit test private helpers.\n"
"* The `#[cfg(test)]` attribute is only active when you run `cargo test`."
msgstr ""
"* ์ด๋ ๊ฒ ์๋ธ ๋ชจ๋๋ก ํ
์คํธ๋ฅผ ๋ง๋ค๋ฉด privateํ ํฌํผ ํจ์์ ๋ํ ๋จ์ ํ
์คํธ๋ ๊ฐ๋ฅํฉ๋๋ค.\n"
"* `#[cfg(test)]` ์ดํธ๋ฆฌ๋ทฐํธ๊ฐ ์ถ๊ฐ๋ ํญ๋ชฉ์ `cargo test`๋ฅผ ์ํํ์ ๊ฒฝ์ฐ์๋ง ๋์ํฉ๋๋ค."
#: src/testing/doc-tests.md:1
msgid "# Documentation Tests"
msgstr "# ๋ฌธ์ํ์ฃผ์ ํ
์คํธ"
#: src/testing/doc-tests.md:3
msgid "Rust has built-in support for documentation tests:"
msgstr "๋ฌ์คํธ๋ ๋ฌธ์ํ์ฃผ์์ ๋ํ ํ
์คํธ๋ฅผ ๋ด์ฅํ์ฌ ์ ๊ณตํฉ๋๋ค:"
#: src/testing/doc-tests.md:5
msgid ""
"```rust\n"
"/// Shortens a string to the given length.\n"
"///\n"
"/// ```\n"
"/// use playground::shorten_string;\n"
"/// assert_eq!(shorten_string(\"Hello World\", 5), \"Hello\");\n"
"/// assert_eq!(shorten_string(\"Hello World\", 20), \"Hello World\");\n"
"/// ```\n"
"pub fn shorten_string(s: &str, length: usize) -> &str {\n"
" &s[..std::cmp::min(length, s.len())]\n"
"}\n"
"```"
msgstr ""
"```rust\n"
"/// Shortens a string to the given length.\n"
"///\n"
"/// ```\n"
"/// use playground::shorten_string;\n"
"/// assert_eq!(shorten_string(\"Hello World\", 5), \"Hello\");\n"
"/// assert_eq!(shorten_string(\"Hello World\", 20), \"Hello World\");\n"
"/// ```\n"
"pub fn shorten_string(s: &str, length: usize) -> &str {\n"
" &s[..std::cmp::min(length, s.len())]\n"
"}\n"
"```"
#: src/testing/doc-tests.md:18
msgid ""
"* Code blocks in `///` comments are automatically seen as Rust code.\n"
"* The code will be compiled and executed as part of `cargo test`.\n"
"* Test the above code on the [Rust Playground](https://play.rust-lang.org/?version=stable&mode=debug&edition=2021&gist=3ce2ad13ea1302f6572cb15cd96becf0)."
msgstr ""
"* `///` ์ฃผ์์์ ์ฝ๋ ๋ธ๋ก์ ์๋์ผ๋ก ๋ฌ์คํธ ์ฝ๋๋ก ์ธ์๋ฉ๋๋ค.\n"
"* ์ด ์ฝ๋ ๋ธ๋ก์ `cargo test` ํธ์ถํ๋ฉด ์๋์ผ๋ก ์ปดํ์ผ๋๊ณ ์คํ๋ฉ๋๋ค.\n"
"* ์ ์ฝ๋๋ฅผ [Rust Playground](https://play.rust-lang.org/?version=stable&mode=debug&edition=2021&gist=3ce2ad13ea1302f6572cb15cd96becf0)์์ ํ
์คํธ ํด ๋ณด์๊ธฐ ๋ฐ๋๋๋ค."
#: src/testing/integration-tests.md:1
msgid "# Integration Tests"
msgstr "# ํตํฉ ํ
์คํธ"
#: src/testing/integration-tests.md:3
msgid "If you want to test your library as a client, use an integration test."
msgstr "๋ผ์ด๋ธ๋ฌ๋ฆฌ๋ฅผ ์ฌ์ฉ์ ์
์ฅ์์ ํ
์คํธ ํ๋ ค๋ฉด, ํตํฉ ํ
์คํธ๋ฅผ ํด์ผ ํฉ๋๋ค."
#: src/testing/integration-tests.md:5
msgid "Create a `.rs` file under `tests/`:"
msgstr "`test/`๋๋ ํฐ๋ฆฌ ์๋์ `.rs`ํ์ผ์ ํ๋ ๋ง๋์ธ์:"
#: src/testing/integration-tests.md:7
msgid ""
"```rust,ignore\n"
"use my_library::init;\n"
"\n"
"#[test]\n"
"fn test_init() {\n"
" assert!(init().is_ok());\n"
"}\n"
"```"
msgstr ""
"```rust,ignore\n"
"use my_library::init;\n"
"\n"
"#[test]\n"
"fn test_init() {\n"
" assert!(init().is_ok());\n"
"}\n"
"```"
#: src/testing/integration-tests.md:16
msgid "These tests only have access to the public API of your crate."
msgstr "์ด ํ
์คํธ๋ ํฌ๋ ์ดํธ์ ๊ณต๊ฐ API์๋ง ์ ๊ทผํ ์ ์์ต๋๋ค."
#: src/unsafe.md:1
msgid "# Unsafe Rust"
msgstr "# ์์ ํ์ง ์์ ๋ฌ์คํธ"
#: src/unsafe.md:3
msgid "The Rust language has two parts:"
msgstr "๋ฌ์คํธ๋ก ์์ฑ๋ ํ๋ก๊ทธ๋จ์ ํฌ๊ฒ ๋ ๋ถ๋ถ์ผ๋ก ๋๋ฉ๋๋ค:"
#: src/unsafe.md:5
msgid ""
"* **Safe Rust:** memory safe, no undefined behavior possible.\n"
"* **Unsafe Rust:** can trigger undefined behavior if preconditions are violated."
msgstr ""
"* **์์ ํ ๋ฌ์คํธ:** ๋ฉ๋ชจ๋ฆฌ ๊ด๋ จ ์ค๋ฅ ๋ฐ์ ๋ถ๊ฐ๋ฅ, ์ ์๋์ง ์์ ๋์ ์์.\n"
"* **์์ ํ์ง ์์ ๋ฌ์คํธ:** ํน๋ณํ ์กฐ๊ฑด์ ๋ง์กฑํ์ง ์์์ฑ๋ก ์ฌ์ฉ๋๋ฉด ์ ์๋์ง ์์ ๋์์ ์ ๋ฐํ ์ ์์."
#: src/unsafe.md:8
msgid ""
"We will be seeing mostly safe Rust in this course, but it's important to know\n"
"what Unsafe Rust is."
msgstr "์ด ๊ฐ์๋ ๋๋ถ๋ถ ์์ ํ ๋ฌ์คํธ์ ๋ํด ๋ค๋ฃจ์ง๋ง ์์ ํ์ง ์์ ๋ฌ์คํธ๊ฐ ๋ฌด์์ธ์ง๋ ์์ ๋์ด์ผ ํฉ๋๋ค."
#: src/unsafe.md:11
msgid ""
"Unsafe code is usually small and isolated, and its correctness should be carefully\n"
"documented. It is usually wrapped in a safe abstraction layer."
msgstr "๋ณดํต, ์์ ํ์ง ์์ ๋ฌ์คํธ ์ฝ๋๋ ํฌ๊ธฐ๊ฐ ์์ผ๋ฉฐ, ๋
๋ฆฝ์ ์ผ๋ก ์กด์ฌํฉ๋๋ค. ๊ทธ๋ฆฌ๊ณ ์ฝ๋๊ฐ ์ ์ ์๋ํ๋์ง์ ๋ํด ์ธ๋ฐํ๊ฒ ๋ฌธ์ํ๊ฐ ๋์ด ์์ต๋๋ค. ๊ทธ๋ฆฌ๊ณ , ๋ง์ ๊ฒฝ์ฐ ์์ ํ ๋ฌ์คํธ ์ฝ๋๋ฅผ ํตํด์ ์ถ์ํ๋ฅผ ์ํจ ํ ์ฌ์ฉํ๊ฒ ๋ฉ๋๋ค."
#: src/unsafe.md:14
msgid "Unsafe Rust gives you access to five new capabilities:"
msgstr "์์ ํ์ง ์์ ๋ฌ์คํธ๋ฅผ ์ด์ฉํ๋ฉด ๋ค์๊ณผ ๊ฐ์ ๋ค์ฏ ๊ฐ์ง ๊ฒ๋ค์ด ๊ฐ๋ฅํด ์ง๋๋ค:"
#: src/unsafe.md:16
msgid ""
"* Dereference raw pointers.\n"
"* Access or modify mutable static variables.\n"
"* Access `union` fields.\n"
"* Call `unsafe` functions, including `extern` functions.\n"
"* Implement `unsafe` traits."
msgstr ""
"* ์์ ํฌ์ธํฐ ์ญ์ฐธ์กฐ(๋ฐ๋ผ๊ฐ๊ธฐ)\n"
"* ์ ์ ๊ฐ๋ณ๋ณ์ ์ ๊ทผ ๋ฐ ์์ \n"
"* `union` ํ๋ ์ ๊ทผ\n"
"* `extern` ํจ์๋ฅผ ํฌํจํ `unsafe` ํจ์ ํธ์ถ\n"
"* `unsafe` ํธ๋ ์ ๊ตฌํ."
#: src/unsafe.md:22
msgid ""
"We will briefly cover unsafe capabilities next. For full details, please see\n"
"[Chapter 19.1 in the Rust Book](https://doc.rust-lang.org/book/ch19-01-unsafe-rust.html)\n"
"and the [Rustonomicon](https://doc.rust-lang.org/nomicon/)."
msgstr "์ ๊ธฐ๋ฅ๋ค์ ๋ํด ๊ฐ๋ตํ ์ดํด๋ณด๊ฒ ์ต๋๋ค. ์์ธํ ๋ด์ฉ์ [๋ฌ์คํธ ํ๋ก๊ทธ๋๋ฐ ์ธ์ด, 19.1์ ](https://doc.rust-lang.org/book/ch19-01-unsafe-rust.html)๊ณผ [Rustonomicon](https://doc.rust-lang.org/nomicon/)๋ฅผ ์ฐธ์กฐํ์ธ์."
#: src/unsafe.md:28
msgid ""
"Unsafe Rust does not mean the code is incorrect. It means that developers have\n"
"turned off the compiler safety features and have to write correct code by\n"
"themselves. It means the compiler no longer enforces Rust's memory-safety rules."
msgstr "์์ ํ์ง ์์ ๋ฌ์คํธ๋ผ๊ณ ํด์ ์ฝ๋๊ฐ ๋ถ์ ํ ํ๋ค๋ ๋ป์ ์๋๋๋ค. ์ฌ๊ธฐ์ ์์ ํ์ง ์๋ค์ ์๋ฏธ๋ ์ปดํ์ผ๋ฌ๊ฐ ์ ๊ณตํด์ฃผ๋ ์์ ์ฅ์น๋ค์ด ๊บผ์ง ์ํ์ด๋ฉฐ, ๊ฐ๋ฐ์๊ฐ ์ค์ค๋ก ์ ํํ๊ณ ์์ ํ ์ฝ๋๋ฅผ ์์ฑํด์ผ ํจ์ ์๋ฏธํฉ๋๋ค. ์ด๋ ์ปดํ์ผ๋ฌ๊ฐ ๋ ์ด์ ๋ฌ์คํธ์ ๋ฉ๋ชจ๋ฆฌ ์์ ๊ณผ ๊ด๋ จ๋ ๊ท์น๋ค์ ์ ์ฉํ์ง ์๋๋ค๋ ๊ฒ์
๋๋ค."
#: src/unsafe/raw-pointers.md:1
msgid "# Dereferencing Raw Pointers"
msgstr "# ์์ ํฌ์ธํฐ ์ญ์ฐธ์กฐ(๋ฐ๋ผ๊ฐ๊ธฐ)"
#: src/unsafe/raw-pointers.md:3
msgid "Creating pointers is safe, but dereferencing them requires `unsafe`:"
msgstr "ํฌ์ธํฐ๋ฅผ ๋ง๋๋ ๊ฒ์ ์์ ํฉ๋๋ค. ํ์ง๋ง ์ญ์ฐธ์กฐ(๋ฐ๋ผ๊ฐ๊ธฐ)ํ ๊ฒฝ์ฐ `unsafe`๊ฐ ํ์ํฉ๋๋ค:"
#: src/unsafe/raw-pointers.md:5
msgid ""
"```rust,editable\n"
"fn main() {\n"
" let mut num = 5;\n"
"\n"
" let r1 = &mut num as *mut i32;\n"
" let r2 = r1 as *const i32;\n"
"\n"
" // Safe because r1 and r2 were obtained from references and so are guaranteed to be non-null and\n"
" // properly aligned, the objects underlying the references from which they were obtained are\n"
" // live throughout the whole unsafe block, and they are not accessed either through the\n"
" // references or concurrently through any other pointers.\n"
" unsafe {\n"
" println!(\"r1 is: {}\", *r1);\n"
" *r1 = 10;\n"
" println!(\"r2 is: {}\", *r2);\n"
" }\n"
"}\n"
"```"
msgstr ""
"```rust,editable\n"
"fn main() {\n"
" let mut num = 5;\n"
"\n"
" let r1 = &mut num as *mut i32;\n"
" let r2 = r1 as *const i32;\n"
"\n"
" // ์๋ ์ฝ๋๋ ์์ ํฉ๋๋ค. r1๊ณผ r2๋ ์ฐธ์กฐ๋ก ๋ถํฐ ๋ง๋ค์ด ์ก๊ธฐ ๋๋ฌธ์ null์ด ์๋๋ฉฐ\n"
" // align์ด ๋ง๋ค๋ ๊ฒ์ด ๋ณด์ฅ๋ฉ๋๋ค. ์ฐธ์กฐ๊ฐ ๊ฐ๋ฆฌํค๋ ๊ฐ์ฒด๋ค์ unsafe ๋ธ๋ญ์ด ์ํ๋๋\n"
" // ๋์ ๋ฉ๋ชจ๋ฆฌ์ ์ด์์์ต๋๋ค. ๊ทธ๋ฆฌ๊ณ ์ด ๊ฐ์ฒด๋ค์ r1๊ณผ r2๊ฐ ์๋ ๋ค๋ฅธ ์ด๋ค ์ฐธ์กฐ๋\n"
" // ํฌ์ธํฐ๋ก๋ ์ ๊ทผ์ด ์๋๊ณ ์์ต๋๋ค.\n"
" unsafe {\n"
" println!(\"r1 is: {}\", *r1);\n"
" *r1 = 10;\n"
" println!(\"r2 is: {}\", *r2);\n"
" }\n"
"}\n"
"```"
#: src/unsafe/raw-pointers.md:26
msgid ""
"It is good practice (and required by the Android Rust style guide) to write a comment for each\n"
"`unsafe` block explaining how the code inside it satisfies the safety requirements of the unsafe\n"
"operations it is doing."
msgstr "๋ชจ๋ `unsafe` ๋ธ๋ก์ ๋ํด ์ ๊ทธ ์ฝ๋๊ฐ ์์ ํ์ง์ ๋ํ ์ค๋ช
์ ์ฃผ์์ผ๋ก ๋ค๋ ๊ฒ์ ์ข์ ์ต๊ด์
๋๋ค(์ฌ์ค ์๋๋ก์ด๋์ ๋ฌ์คํธ ์คํ์ผ ๊ฐ์ด๋์์๋ ์ด๊ฒ ํ์์
๋๋ค)."
#: src/unsafe/raw-pointers.md:30
msgid ""
"In the case of pointer dereferences, this means that the pointers must be\n"
"[_valid_](https://doc.rust-lang.org/std/ptr/index.html#safety), i.e.:"
msgstr "ํฌ์ธํฐ ์ญ์ฐธ์กฐ๋ฅผ ํ ๊ฒฝ์ฐ, ํฌ์ธํฐ๊ฐ [_์ ํจ_](https://doc.rust-lang.org/std/ptr/index.html#safety)ํด์ผ ํฉ๋๋ค. ์๋ฅผ ๋ค์ด:"
#: src/unsafe/raw-pointers.md:33
msgid ""
" * The pointer must be non-null.\n"
" * The pointer must be _dereferenceable_ (within the bounds of a single allocated object).\n"
" * The object must not have been deallocated.\n"
" * There must not be concurrent accesses to the same location.\n"
" * If the pointer was obtained by casting a reference, the underlying object must be live and no\n"
" reference may be used to access the memory."
msgstr ""
" * ํฌ์ธํฐ๋ null์ด๋ฉด ์๋ฉ๋๋ค.\n"
" * ํฌ์ธํฐ๋ ๋ฐ๋ผ๊ฐ๊ธฐ๊ฐ ๊ฐ๋ฅํด์ผ ํฉ๋๋ค (๊ฐ์ฒด์ ์ด๋ ํ ๋ถ๋ถ์ ๊ฐ๋ฆฌํค๊ณ ์์ด์ผ ํฉ๋๋ค).\n"
" * ์ด๋ฏธ ๋ฐํ๋ ๊ฐ์ฒด๋ฅผ ๊ฐ๋ฆฌํค๋ฉด ์๋ฉ๋๋ค.\n"
" * ๊ฐ์ ์์น์ ๋ํด ๋์์ ์ธ ์ ๊ทผ์ด ์์ผ๋ฉด ์๋ฉ๋๋ค.\n"
" * ์ฐธ์กฐ๋ฅผ ์บ์คํ
ํด์ ํฌ์ธํฐ๋ฅผ ๋ง๋ค์๋ค๋ฉด, ๊ทธ ์ฐธ์กฐ๊ฐ ๊ฐ๋ฆฌํค๋ ๊ฐ์ฒด๋ ์ด์ ์์ด์ผ ํ๋ฉฐ, ๊ทธ ๊ฐ์ฒด์ ๋ฉ๋ชจ๋ฆฌ๋ฅผ ์ ๊ทผํ๋ ์ฐธ์กฐ๊ฐ ํ๋๋ ์์ด์ผ ํฉ๋๋ค."
#: src/unsafe/raw-pointers.md:40
msgid "In most cases the pointer must also be properly aligned."
msgstr "๋๋ถ๋ถ์ ๊ฒฝ์ฐ ํฌ์ธํฐ๋ align๋์ด ์์ด์ผ ํฉ๋๋ค."
#: src/unsafe/mutable-static-variables.md:1
msgid "# Mutable Static Variables"
msgstr "# ์ ์ ๊ฐ๋ณ ๋ณ์"
#: src/unsafe/mutable-static-variables.md:3
msgid "It is safe to read an immutable static variable:"
msgstr "๋ถ๋ณ ์ ์ ๋ณ์๋ฅผ ์ฝ๋ ๊ฒ์ ์์ ํฉ๋๋ค:"
#: src/unsafe/mutable-static-variables.md:5
msgid ""
"```rust,editable\n"
"static HELLO_WORLD: &str = \"Hello, world!\";\n"
"\n"
"fn main() {\n"
" println!(\"HELLO_WORLD: {HELLO_WORLD}\");\n"
"}\n"
"```"
msgstr ""
"```rust,editable\n"
"static HELLO_WORLD: &str = \"Hello, world!\";\n"
"\n"
"fn main() {\n"
" println!(\"HELLO_WORLD: {HELLO_WORLD}\");\n"
"}\n"
"```"
#: src/unsafe/mutable-static-variables.md:13
msgid ""
"However, since data races can occur, it is unsafe to read and write mutable\n"
"static variables:"
msgstr "ํ์ง๋ง, ๋ฐ์ดํฐ ๋ ์ด์ค๊ฐ ๋ฐ์ํ ์ ์์ผ๋ฏ๋ก ์ ์ ๊ฐ๋ณ๋ณ์๋ฅผ ์ฝ๊ณ ์ฐ๋ ๊ฒ์ ์์ ํ์ง ์์ต๋๋ค:"
#: src/unsafe/mutable-static-variables.md:16
msgid ""
"```rust,editable\n"
"static mut COUNTER: u32 = 0;\n"
"\n"
"fn add_to_counter(inc: u32) {\n"
" unsafe { COUNTER += inc; } // Potential data race!\n"
"}\n"
"\n"
"fn main() {\n"
" add_to_counter(42);\n"
"\n"
" unsafe { println!(\"COUNTER: {COUNTER}\"); } // Potential data race!\n"
"}\n"
"```"
msgstr ""
#: src/unsafe/mutable-static-variables.md:32
msgid ""
"Using a mutable static is generally a bad idea, but there are some cases where it might make sense\n"
"in low-level `no_std` code, such as implementing a heap allocator or working with some C APIs."
msgstr "์ผ๋ฐ์ ์ผ๋ก ์ด์ผ๊ธฐ ํด์, ์ ์ ๊ฐ๋ณ ๋ณ์๋ฅผ ์ฐ๋ ๊ฒ์ ์ข์ ์์ด๋์ด๊ฐ ์๋๋๋ค. ๊ทธ๋ฌ๋ `no_std`์ ๊ฐ์ ์ ์์ค ์ฝ๋ฉ์ ํ ๊ฒฝ์ฐ์๋ ํ์ํ๊ธฐ๋ ํฉ๋๋ค. ์๋ฅผ ๋ค์ด ํ ํ ๋น๊ธฐ๋ฅผ ๊ตฌํํ๊ฑฐ๋, C API๋ฅผ ์ฌ์ฉํ๋ ๊ฒ ๊ทธ๋ฐ ๊ฒฝ์ฐ์
๋๋ค."
#: src/unsafe/unions.md:1
msgid "# Unions"
msgstr "# ์ ๋์จ"
#: src/unsafe/unions.md:3
msgid "Unions are like enums, but you need to track the active field yourself:"
msgstr "์ ๋์จ ํ์
์ ์ด๊ฑฐํ(enum)๊ณผ ๋น์ทํ์ง๋ง, ์ด๋ค ํ๋์ ํด๋นํ๋ ๊ฐ์ ๊ฐ์ง๊ณ ์๋์ง ์ฌ๋ถ๋ฅผ ํ๋ก๊ทธ๋๋จธ๊ฐ ์๋์ผ๋ก ์ถ์ ํด์ผ ํฉ๋๋ค:"
#: src/unsafe/unions.md:5
msgid ""
"```rust,editable\n"
"#[repr(C)]\n"
"union MyUnion {\n"
" i: u8,\n"
" b: bool,\n"
"}\n"
"\n"
"fn main() {\n"
" let u = MyUnion { i: 42 };\n"
" println!(\"int: {}\", unsafe { u.i });\n"
" println!(\"bool: {}\", unsafe { u.b }); // Undefined behavior!\n"
"}\n"
"```"
msgstr ""
"```rust,editable\n"
"#[repr(C)]\n"
"union MyUnion {\n"
" i: u8,\n"
" b: bool,\n"
"}\n"
"\n"
"fn main() {\n"
" let u = MyUnion { i: 42 };\n"
" println!(\"int: {}\", unsafe { u.i });\n"
" println!(\"bool: {}\", unsafe { u.b }); // Undefined behavior!\n"
"}\n"
"```"
#: src/unsafe/unions.md:21
msgid ""
"Unions are very rarely needed in Rust as you can usually use an enum. They are occasionally needed\n"
"for interacting with C library APIs."
msgstr "๋ฌ์คํธ์๋ ์ด๊ฑฐํ์ด ์๊ธฐ ๋๋ฌธ์ ์ ๋์จ์ด ํ์ํ ๊ฒฝ์ฐ๋ ๊ทนํ ๋๋ญ
๋๋ค. ์ ๋์จ์ C ๋ผ์ด๋ธ๋ฌ๋ฆฌ API๋ฅผ ์ฌ์ฉํ ๋ ๊ฐ๋ ํ์ํฉ๋๋ค."
#: src/unsafe/unions.md:24
msgid ""
"If you just want to reinterpret bytes as a different type, you probably want\n"
"[`std::mem::transmute`](https://doc.rust-lang.org/stable/std/mem/fn.transmute.html) or a safe\n"
"wrapper such as the [`zerocopy`](https://crates.io/crates/zerocopy) crate."
msgstr "๋ฐ์ดํธ๋ค์ ํน์ ํ์
์ผ๋ก ์ฌํด์ ํ๊ณ ์ถ๋ค๋ฉด [`std::mem::transmute`](https://doc.rust-lang.org/stable/std/mem/fn.transmute.html)๋ ์ข ๋ ์์ ํ [`zerocopy`](https://crates.io/crates/zerocopy) ํฌ๋ ์ดํธ๋ฅผ ์ฌ์ฉํ์ธ์."
#: src/unsafe/calling-unsafe-functions.md:1
msgid "# Calling Unsafe Functions"
msgstr "# '์์ ํ์ง ์์' ํจ์ ํธ์ถ"
#: src/unsafe/calling-unsafe-functions.md:3
msgid ""
"A function or method can be marked `unsafe` if it has extra preconditions you\n"
"must uphold to avoid undefined behaviour:"
msgstr "ํจ์๋ ๋ฉ์๋๊ฐ ์ ์๋์ง ์์ ๋์์ผ๋ก ๋น ์ง์ง ์๊ฒ ํ๊ธฐ ์ํด์ ๋ง์กฑํด์ผ ํ๋ ์ ์ ์กฐ๊ฑด์ด ์๋ ๊ฒฝ์ฐ, ๊ทธ ํจ์๋ ๋ฉ์๋๋ฅผ `unsafe`๋ก ํ์ํ ์ ์์ต๋๋ค:"
#: src/unsafe/calling-unsafe-functions.md:6
msgid ""
"```rust,editable\n"
"fn main() {\n"
" let emojis = \"๐ปโ๐\";\n"
"\n"
" // Safe because the indices are in the correct order, within the bounds of\n"
" // the string slice, and lie on UTF-8 sequence boundaries.\n"
" unsafe {\n"
" println!(\"emoji: {}\", emojis.get_unchecked(0..4));\n"
" println!(\"emoji: {}\", emojis.get_unchecked(4..7));\n"
" println!(\"emoji: {}\", emojis.get_unchecked(7..11));\n"
" }\n"
"\n"
" println!(\"char count: {}\", count_chars(unsafe { emojis.get_unchecked(0..7) }));\n"
"\n"
" // Not upholding the UTF-8 encoding requirement breaks memory safety!\n"
" // println!(\"emoji: {}\", unsafe { emojis.get_unchecked(0..3) });\n"
" // println!(\"char count: {}\", count_chars(unsafe { emojis.get_unchecked(0..3) }));\n"
"}\n"
"\n"
"fn count_chars(s: &str) -> usize {\n"
" s.chars().map(|_| 1).sum()\n"
"}\n"
"```"
msgstr ""
#: src/unsafe/writing-unsafe-functions.md:1
msgid "# Writing Unsafe Functions"
msgstr "# '์์ ํ์ง ์์' ํจ์ ์์ฑํ๊ธฐ"
#: src/unsafe/writing-unsafe-functions.md:3
msgid ""
"You can mark your own functions as `unsafe` if they require particular conditions to avoid undefined\n"
"behaviour."
msgstr "์ฌ๋ฌ๋ถ์ด ์์ฑํ ํจ์๋ฅผ ์ฌ์ฉํ ๋ ์ด๋ค ํน๋ณํ ์กฐ๊ฑด์ ๋ง์กฑํด์ผ ํ๋ค๋ฉด, `unsafe`๋ก ๋งํนํ ์ ์์ต๋๋ค."
#: src/unsafe/writing-unsafe-functions.md:6
msgid ""
"```rust,editable\n"
"/// Swaps the values pointed to by the given pointers.\n"
"///\n"
"/// # Safety\n"
"///\n"
"/// The pointers must be valid and properly aligned.\n"
"unsafe fn swap(a: *mut u8, b: *mut u8) {\n"
" let temp = *a;\n"
" *a = *b;\n"
" *b = temp;\n"
"}\n"
"\n"
"fn main() {\n"
" let mut a = 42;\n"
" let mut b = 66;\n"
"\n"
" // Safe because ...\n"
" unsafe {\n"
" swap(&mut a, &mut b);\n"
" }\n"
"\n"
" println!(\"a = {}, b = {}\", a, b);\n"
"}\n"
"```"
msgstr ""
"```rust,editable\n"
"/// Swaps the values pointed to by the given pointers.\n"
"///\n"
"/// # Safety\n"
"///\n"
"/// The pointers must be valid and properly aligned.\n"
"unsafe fn swap(a: *mut u8, b: *mut u8) {\n"
" let temp = *a;\n"
" *a = *b;\n"
" *b = temp;\n"
"}\n"
"\n"
"fn main() {\n"
" let mut a = 42;\n"
" let mut b = 66;\n"
"\n"
" // Safe because ...\n"
" unsafe {\n"
" swap(&mut a, &mut b);\n"
" }\n"
"\n"
" println!(\"a = {}, b = {}\", a, b);\n"
"}\n"
"```"
#: src/unsafe/writing-unsafe-functions.md:33
msgid "We wouldn't actually use pointers for this because it can be done safely with references."
msgstr "์ฐธ์กฐ๋ฅผ ์ฌ์ฉํ๋ฉด ์์ ํ๊ฒ ๊ตฌํํ ์ ์๊ธฐ ๋๋ฌธ์, ์ค์ ๋ก ํฌ์ธํฐ๋ฅผ ์ฌ์ฉํ ํ์๋ ์์ต๋๋ค."
#: src/unsafe/writing-unsafe-functions.md:35
msgid ""
"Note that unsafe code is allowed within an unsafe function without an `unsafe` block. We can\n"
"prohibit this with `#[deny(unsafe_op_in_unsafe_fn)]`. Try adding it and see what happens."
msgstr "unsafe ์ฝ๋๊ฐ unsafe ํจ์์ ๋ด๋ถ์์ ํธ์ถ๋ ๊ฒฝ์ฐ์๋ `unsafe`๋ธ๋ก์ ์ง์ ํ์ง ์์๋ ๋ฉ๋๋ค. `unsafe`๋ธ๋ก์ ํญ์ ์ง์ ํ๋๋ก ํ๊ณ ์ถ๋ค๋ฉด `#[deny(unsafe_op_in_unsafe_fn)]`๋ฅผ ์ด์ฉํ์ธ์. ์ด ์ดํธ๋ฆฌ๋ทฐํธ๋ฅผ ์ถ๊ฐํด ๋ณด๊ณ ์ด๋ค ์ผ์ด ์ผ์ด๋๋์ง ํ์ธํด ๋ณด์ธ์."
#: src/unsafe/extern-functions.md:1
msgid "# Calling External Code"
msgstr "# ์ธ๋ถ ์ฝ๋ ํธ์ถ"
#: src/unsafe/extern-functions.md:3
msgid ""
"Functions from other languages might violate the guarantees of Rust. Calling\n"
"them is thus unsafe:"
msgstr "๋ค๋ฅธ ์ธ์ด์ ํจ์๋ ๋ฌ์คํธ์ ๋ณด์ฆ์ ์๋ฐํ ์ ์์ต๋๋ค. ๋ฐ๋ผ์ ์ด๋ฅผ ํธ์ถํ๋ ๊ฒ์ ์์ ํ์ง ์์ต๋๋ค:"
#: src/unsafe/extern-functions.md:6
msgid ""
"```rust,editable\n"
"extern \"C\" {\n"
" fn abs(input: i32) -> i32;\n"
"}\n"
"\n"
"fn main() {\n"
" unsafe {\n"
" // Undefined behavior if abs misbehaves.\n"
" println!(\"Absolute value of -3 according to C: {}\", abs(-3));\n"
" }\n"
"}\n"
"```"
msgstr ""
"```rust,editable\n"
"extern \"C\" {\n"
" fn abs(input: i32) -> i32;\n"
"}\n"
"\n"
"fn main() {\n"
" unsafe {\n"
" // Undefined behavior if abs misbehaves.\n"
" println!(\"Absolute value of -3 according to C: {}\", abs(-3));\n"
" }\n"
"}\n"
"```"
#: src/unsafe/extern-functions.md:21
msgid ""
"This is usually only a problem for extern functions which do things with pointers which might\n"
"violate Rust's memory model, but in general any C function might have undefined behaviour under any\n"
"arbitrary circumstances."
msgstr "์ด๊ฒ ๋ฌธ์ ๊ฐ ๋๋ ๊ฒฝ์ฐ๋ ๋๋ถ๋ถ ์ธ๋ถ ํจ์๊ฐ ๋ฌ์คํธ์ ๋ฉ๋ชจ๋ฆฌ ๋ชจ๋ธ์ ์๋ฐํ๊ณ ์์ ๊ฒฝ์ฐ์
๋๋ค. ๊ทธ๋ฌ๋ ์ด๋ค Cํจ์๋ผ๋ ์ด๋ค ์์์ ์ํฉ์์๋ ์ ์๋์ง ์์ ๋์์ ํ ์ ์๊ธฐ ๋๋ฌธ์, ์๋ฐํ ๋งํด์๋ ๋ชจ๋ ์ธ๋ถ ํจ์์ ๋ํด์ ๋ฌธ์ ์
๋๋ค."
#: src/unsafe/extern-functions.md:25
msgid ""
"The `\"C\"` in this example is the ABI;\n"
"[other ABIs are available too](https://doc.rust-lang.org/reference/items/external-blocks.html)."
msgstr "์ ์์ ์ฝ๋์์ `\"C\"`๋ ABI๋ฅผ ์๋ฏธํฉ๋๋ค. [๋ค๋ฅธ ABI๋ ์์ต๋๋ค.](https://doc.rust-lang.org/reference/items/external-blocks.html)"
#: src/unsafe/unsafe-traits.md:1
msgid "# Implementing Unsafe Traits"
msgstr "# ์์ ํ์ง ์์ ํธ๋ ์ ๊ตฌํํ๊ธฐ"
#: src/unsafe/unsafe-traits.md:3
msgid ""
"Like with functions, you can mark a trait as `unsafe` if the implementation must guarantee\n"
"particular conditions to avoid undefined behaviour."
msgstr "ํจ์์์์ ๋ง์ฐฌ๊ฐ์ง๋ก ํธ๋ ์๋ `unsafe`๋ก ๋งํน ๊ฐ๋ฅํฉ๋๋ค. ๋ง์ฝ ๊ทธ ํธ๋ ์์ ๊ตฌํํ ๋ ์ ์๋์ง ์์ ๋์์ ํผํ๊ธฐ ์ํด ํน๋ณํ ์กฐ๊ฑด์ด ํ์ํ๋ค๋ฉด ๋ง์ด์ง์."
#: src/unsafe/unsafe-traits.md:6
msgid ""
"For example, the `zerocopy` crate has an unsafe trait that looks\n"
"[something like this](https://docs.rs/zerocopy/latest/zerocopy/trait.AsBytes.html):"
msgstr "์๋ฅผ ๋ค์ด `zerocopy` ํฌ๋ ์ดํธ์๋ [์์ ํ์ง ์์ ํธ๋ ์](https://docs.rs/zerocopy/latest/zerocopy/trait.AsBytes.html)์ด ์์ต๋๋ค:"
#: src/unsafe/unsafe-traits.md:9
msgid ""
"```rust,editable\n"
"use std::mem::size_of_val;\n"
"use std::slice;\n"
"\n"
"/// ...\n"
"/// # Safety\n"
"/// The type must have a defined representation and no padding.\n"
"pub unsafe trait AsBytes {\n"
" fn as_bytes(&self) -> &[u8] {\n"
" unsafe {\n"
" slice::from_raw_parts(self as *const Self as *const u8, size_of_val(self))\n"
" }\n"
" }\n"
"}\n"
"\n"
"// Safe because u32 has a defined representation and no padding.\n"
"unsafe impl AsBytes for u32 {}\n"
"```"
msgstr ""
"```rust,editable\n"
"use std::mem::size_of_val;\n"
"use std::slice;\n"
"\n"
"/// ...\n"
"/// # Safety\n"
"/// The type must have a defined representation and no padding.\n"
"pub unsafe trait AsBytes {\n"
" fn as_bytes(&self) -> &[u8] {\n"
" unsafe {\n"
" slice::from_raw_parts(self as *const Self as *const u8, size_of_val(self))\n"
" }\n"
" }\n"
"}\n"
"\n"
"// Safe because u32 has a defined representation and no padding.\n"
"unsafe impl AsBytes for u32 {}\n"
"```"
#: src/unsafe/unsafe-traits.md:30
msgid ""
"There should be a `# Safety` section on the Rustdoc for the trait explaining the requirements for\n"
"the trait to be safely implemented."
msgstr "์์ ํ์ง ์์ ํธ๋ ์์ ๋ง๋ค ๋์๋ ์ฃผ์์ `# Safety` ํญ๋ชฉ์ด ์์ด์ ์ด ํธ๋ ์์ ์์ ํ๊ฒ ๊ตฌํํ๋ ค๋ฉด ์ด๋ค ์๊ตฌ์ฌํญ๋ค์ ๋ง์กฑํด์ผ ํ๋์ง๋ฅผ ์ค๋ช
ํด์ผ ํฉ๋๋ค."
#: src/unsafe/unsafe-traits.md:33
msgid "The actual safety section for `AsBytes` is rather longer and more complicated."
msgstr "`AsBytes`์์ ์ง์ผ์ผ ํ ์์ ์ฑ์ ๋ํ ์ค์ ์ค๋ช
์ ์ข ๋ ๊ธธ๊ณ ๋ณต์กํฉ๋๋ค."
#: src/unsafe/unsafe-traits.md:35
msgid "The built-in `Send` and `Sync` traits are unsafe."
msgstr "๋นํธ์ธ ํธ๋ ์์ธ `Send`์ `Sync`๋ ์์ ํ์ง ์์ ํธ๋ ์ ์
๋๋ค."
#: src/exercises/day-3/afternoon.md:1
msgid "# Day 3: Afternoon Exercises"
msgstr "# 3์ผ์ฐจ ์คํ ์ฐ์ต๋ฌธ์ "
#: src/exercises/day-3/afternoon.md:3
msgid "Let us build a safe wrapper for reading directory content!"
msgstr "๋๋ ํฐ๋ฆฌ์ ๋ด์ฉ์ ์ฝ๋ ์์ ํ ๋ํผ ์ฝ๋๋ฅผ ์์ฑํด ๋ด
์๋ค!"
#: src/exercises/day-3/afternoon.md:7
msgid "After looking at the exercise, you can look at the [solution] provided."
msgstr "์ฐ์ต๋ฌธ์ ๋ฅผ ์ดํด ๋ณธ ํ, ์ ๊ณต๋ [ํด๋ต][solution]์ ์ดํด๋ณผ ์ ์์ต๋๋ค."
#: src/exercises/day-3/safe-ffi-wrapper.md:1
msgid "# Safe FFI Wrapper"
msgstr "# FFI๋ํผ"
#: src/exercises/day-3/safe-ffi-wrapper.md:3
msgid ""
"Rust has great support for calling functions through a _foreign function\n"
"interface_ (FFI). We will use this to build a safe wrapper for the `libc`\n"
"functions you would use from C to read the filenames of a directory."
msgstr "๋ฌ์คํธ๋ _์ธ๋ถ ๊ธฐ๋ฅ ํธ์ถ(FFI)_์ ์ง์ํฉ๋๋ค. ์ฐ๋ฆฌ๋ ์ด๋ฅผ ์ด์ฉํ์ฌ ๋๋ ํฐ๋ฆฌ์์ ํ์ผ ์ด๋ฆ์ ์ฝ์ด์ค๋ `libc` ํจ์์ ๋ํ ์์ ํ ๋ํผ๋ฅผ ๋ง๋ค ๊ฒ์
๋๋ค."
#: src/exercises/day-3/safe-ffi-wrapper.md:7
msgid "You will want to consult the manual pages:"
msgstr "์๋ ๋ฆฌ๋
์ค ๋ฉ๋ด์ผ ๋ฌธ์๋ค์ ์ฐธ์กฐํ์๊ธฐ ๋ฐ๋๋๋ค:"
#: src/exercises/day-3/safe-ffi-wrapper.md:9
msgid ""
"* [`opendir(3)`](https://man7.org/linux/man-pages/man3/opendir.3.html)\n"
"* [`readdir(3)`](https://man7.org/linux/man-pages/man3/readdir.3.html)\n"
"* [`closedir(3)`](https://man7.org/linux/man-pages/man3/closedir.3.html)"
msgstr ""
"* [`opendir(3)`](https://man7.org/linux/man-pages/man3/opendir.3.html)\n"
"* [`readdir(3)`](https://man7.org/linux/man-pages/man3/readdir.3.html)\n"
"* [`closedir(3)`](https://man7.org/linux/man-pages/man3/closedir.3.html)"
#: src/exercises/day-3/safe-ffi-wrapper.md:13
msgid ""
"You will also want to browse the [`std::ffi`] module, particular for [`CStr`]\n"
"and [`CString`] types which are used to hold NUL-terminated strings coming from\n"
"C. The [Nomicon] also has a very useful chapter about FFI."
msgstr "[`std::ffi`] ๋ชจ๋์ ํ์ํ๋๊ฒ ํ์ํ ์ง๋ ๋ชจ๋ฅด๊ฒ ์ต๋๋ค. C์์ ์ฌ์ฉ๋๋ NUL-terminated ๋ฌธ์์ด์ ๋ด๊ธฐ ์ํ [`CStr`]๊ณผ [`CString`] ํ์
์ ํ์ธํด ๋ณด์ธ์. [Nomicon]๋ฌธ์ ๋ํ FFI์ ๋ํ ์ ์ฉํ ๋ด์ฉ์ ๋ด๊ณ ์์ต๋๋ค."
#: src/exercises/day-3/safe-ffi-wrapper.md:22
msgid ""
"Copy the code below to {\n"
" // Call opendir and return a Ok value if that worked,\n"
" // otherwise return Err with a message.\n"
" unimplemented!()\n"
" }\n"
"}\n"
"\n"
"impl Iterator for DirectoryIterator {\n"
" type Item = OsString;\n"
" fn next(&mut self) -> Option {\n"
" // Keep calling readdir until we get a NULL pointer back.\n"
" unimplemented!()\n"
" }\n"
"}\n"
"\n"
"impl Drop for DirectoryIterator {\n"
" fn drop(&mut self) {\n"
" // Call closedir as needed.\n"
" unimplemented!()\n"
" }\n"
"}\n"
"\n"
"fn main() -> Result<(), String> {\n"
" let iter = DirectoryIterator::new(\".\")?;\n"
" println!(\"files: {:#?}\", iter.collect::>());\n"
" Ok(())\n"
"}\n"
"```"
msgstr ""
#: src/welcome-day-4.md:1
msgid "# Welcome to Day 4"
msgstr "# 4์ผ์ฐจ ๊ฐ์"
#: src/welcome-day-4.md:3
msgid ""
"This morning, we will focus on Concurrency: threads, channels, shared state, `Send` and `Sync`.\n"
"In the afternoon, we will have a chance to see Rust in action."
msgstr ""
"์ค์ ์๋ ๋์์ฑ์ ๋ค๋ฃน๋๋ค: ์ฐ๋ ๋, ์ฑ๋, ๊ณต์ ์ํ, `Send`์ `Sync`.\n"
"์คํ์๋ ๋ฌ์คํธ๊ฐ ์ค์ ์ฌ์ฉ๋๋ ์ฌ๋ก๋ฅผ ์ดํด๋ด
๋๋ค."
#: src/welcome-day-4.md:8
msgid ""
"This is a good time to give an outline of what you will cover in the afternoon\n"
"section, as announced in the course offering."
msgstr "์คํ์ ๋ค๋ฃฐ ๋ด์ฉ์ ๊ฐ์๋ฅผ ์๊ฐํ๋ ๊ฒ๋ ์ข์ต๋๋ค."
#: src/concurrency.md:1
msgid "# Fearless Concurrency"
msgstr "# ๊ฒ์๋ ๋์์ฑ"
#: src/concurrency.md:3
msgid ""
"Rust has full support for concurrency using OS threads with mutexes and\n"
"channels."
msgstr "๋ฌ์คํธ๋ ๋์์ฑ ์ง์์ด ๋ง๊ฐํฉ๋๋ค. ์ด์์ฒด์ ๋ ๋ฒจ์ ์ค๋ ๋๋ฅผ ์ฌ์ฉํ๋ฉฐ, ๋ฎคํ์ค์ ์ฑ๋๋ ์ง์ํฉ๋๋ค."
#: src/concurrency.md:6
msgid ""
"The Rust type system plays an important role in making many concurrency bugs\n"
"compile time bugs. This is often referred to as _fearless concurrency_ since you\n"
"can rely on the compiler to ensure correctness at runtime."
msgstr "๋ฌ์คํธ์ ํ์
์์คํ
์ ํ๋ก๊ทธ๋จ์ ๋์์ฑ ๋ฒ๊ทธ๊ฐ ์์ ๊ฒฝ์ฐ, ์ปดํ์ผ ์์ ์๋ฌ๊ฐ ๋ฐ์ํ๋๋ก ํด ์ค๋๋ค. ์ปดํ์ผ๋ฌ๋ฅผ ์ด์ฉํด์ ํ๋ก๊ทธ๋จ์ด ์ํ์์ ์ ํํ ๋์ํจ์ ๋ฏธ๋ฆฌ ๋ณด์ฅํด ์ฃผ๊ธฐ ๋๋ฌธ์, ์ฌ๋๋ค์ ์ด๋ฅผ ์ข
์ข
_๊ฒ์๋ ๋์์ฑ_ ์ด๋ผ๊ณ ํฉ๋๋ค."
#: src/concurrency/threads.md:1
msgid "# Threads"
msgstr "# ์ค๋ ๋"
#: src/concurrency/threads.md:3
msgid "Rust threads work similarly to threads in other languages:"
msgstr "๋ฌ์คํธ์ ์ค๋ ๋๋ ๋ค๋ฅธ ์ธ์ด์ ์ค๋ ๋์ ์ ์ฌํ๊ฒ ๋์ํฉ๋๋ค:"
#: src/concurrency/threads.md:5
msgid ""
"```rust,editable\n"
"use std::thread;\n"
"use std::time::Duration;\n"
"\n"
"fn main() {\n"
" thread::spawn(|| {\n"
" for i in 1..10 {\n"
" println!(\"Count in thread: {i}!\");\n"
" thread::sleep(Duration::from_millis(5));\n"
" }\n"
" });\n"
"\n"
" for i in 1..5 {\n"
" println!(\"Main thread: {i}\");\n"
" thread::sleep(Duration::from_millis(5));\n"
" }\n"
"}\n"
"```"
msgstr ""
#: src/concurrency/threads.md:24
msgid ""
"* Threads are all daemon threads, the main thread does not wait for them.\n"
"* Thread panics are independent of each other.\n"
" * Panics can carry a payload, which can be unpacked with `downcast_ref`."
msgstr ""
"* ์ค๋ ๋๋ ๋ชจ๋ ๋ฐ๋ชฌ ์ค๋ ๋์
๋๋ค. ๋ฐ๋ผ์ ๋ฉ์ธ ์ค๋ ๋๋ ์ด ์ค๋ ๋๋ค์ด ๋๋๊ธฐ๋ฅผ ๊ธฐ๋ค๋ฆฌ์ง ์์ต๋๋ค.\n"
"* ํ ์ค๋ ๋์์ ๋ฐ์ํ ํจ๋์ ๋ค๋ฅธ ์ค๋ ๋์๊ฒ ์ํฅ์ ๋ผ์น์ง ์์ต๋๋ค.\n"
" * ํจ๋์ ์ถ๊ฐ์ ๋ณด(ํ์ด๋ก๋)๋ฅผ ํฌํจํ ์ ์์ผ๋ฉฐ, ์ด๋ `downcast_ref`๋ก ํ์ด๋ณผ ์ ์์ต๋๋ค."
#: src/concurrency/threads.md:32
msgid ""
"* Notice that the thread is stopped before it reaches 10 โ the main thread is\n"
" not waiting.\n"
"\n"
"* Use `let handle = thread::spawn(...)` and later `handle.join()` to wait for\n"
" the thread to finish.\n"
"\n"
"* Trigger a panic in the thread, notice how this doesn't affect `main`.\n"
"\n"
"* Use the `Result` return value from `handle.join()` to get access to the panic\n"
" payload. This is a good time to talk about [`Any`]."
msgstr ""
"* ๋ฉ์ธ ์ค๋ ๋๊ฐ ์์ ์ค๋ ๋๋ฅผ ๊ธฐ๋ค๋ฆฌ์ง ์๊ธฐ ๋๋ฌธ์ ์์ ์ค๋ ๋์ for๋ฌธ์ 10๊น์ง ๊ฐ์ง ์์ต๋๋ค.\n"
"\n"
"* ๋ง์ฝ ๋ฉ์ธ ์ค๋ ๋๊ฐ ์์ ์ค๋ ๋๊ฐ ๋๋ ๋ ๊น์ง ๊ธฐ๋ค๋ฆฌ๊ธฐ๋ฅผ ์ํ๋ค๋ฉด `let handle = thread::spawn(...)`์ผ๋ก ์ค๋ ๋๋ฅผ ์ ์ธํ ํ `handle.join()`๋ก ์ฐ๊ฒฐํ์ฌ ์ฌ์ฉํฉ๋๋ค.\n"
"\n"
"* ์์ ์ค๋ ๋์์ ๋ฐ์ํ ํจ๋์ด ๋ฉ์ธ ์ค๋ ๋์๋ ์ํฅ์ ์ฃผ์ง ์์์ ํ์ธํ์๊ธฐ ๋ฐ๋๋๋ค.\n"
"\n"
"* `handle.join()`์ฌ์ฉ์ `Result` ๋ฐํ๊ฐ์ ํตํด ํจ๋์ ์ถ๊ฐ์ ๋ณด์ ์ ๊ทผํ ์ ์์ต๋๋ค. ์ด ์์ ์์ [`Any`]์ ๋ํด ์ด์ผ๊ธฐ๋ฅผ ํด ๋ณด๋ฉด ์ข์ต๋๋ค."
#: src/concurrency/scoped-threads.md:1
msgid "# Scoped Threads"
msgstr "# ๋ฒ์ ์ค๋ ๋(Scoped Threads)"
#: src/concurrency/scoped-threads.md:3
msgid "Normal threads cannot borrow from their environment:"
msgstr "๋ณดํต, ์ค๋ ๋๋ ์ค๋ ๋ ๋ฐ์์ ๋ฐ์ดํฐ๋ฅผ ๋น๋ฆด ์ ์์ต๋๋ค:"
#: src/concurrency/scoped-threads.md:5
msgid ""
"```rust,editable,compile_fail\n"
"use std::thread;\n"
"\n"
"fn main() {\n"
" let s = String::from(\"Hello\");\n"
"\n"
" thread::spawn(|| {\n"
" println!(\"Length: {}\", s.len());\n"
" });\n"
"}\n"
"```"
msgstr ""
#: src/concurrency/scoped-threads.md:17
msgid "However, you can use a [scoped thread][1] for this:"
msgstr "ํ์ง๋ง, [scoped thread][1]์์๋ ๊ฐ๋ฅํฉ๋๋ค:"
#: src/concurrency/scoped-threads.md:19
msgid ""
"```rust,editable\n"
"use std::thread;\n"
"\n"
"fn main() {\n"
" let s = String::from(\"Hello\");\n"
"\n"
" thread::scope(|scope| {\n"
" scope.spawn(|| {\n"
" println!(\"Length: {}\", s.len());\n"
" });\n"
" });\n"
"}\n"
"```"
msgstr ""
#: src/concurrency/scoped-threads.md:37
msgid ""
"* The reason for that is that when the `thread::scope` function completes, all the threads are guaranteed to be joined, so they can return borrowed data.\n"
"* Normal Rust borrowing rules apply: you can either borrow mutably by one thread, or immutably by any number of threads.\n"
" "
msgstr ""
"* `thread::scope` ํจ์๊ฐ ์๋ฃ๋๋ฉด ๊ทธ ์์์ ์์ฑ๋ ๋ชจ๋ ์ค๋ ๋๋ค์ด ์ข
๋ฃํ์์ด ๋ณด์ฅ๋๊ธฐ ๋๋ฌธ์, ๊ทธ ๋ ๋น๋ ธ๋ ๋ฐ์ดํฐ๋ค์ ๋ค์ ๋ฐํํ ์ ์๊ธฐ ๋๋ฌธ์
๋๋ค.\n"
"* ์ผ๋ฐ์ ์ธ ๋ฌ์คํธ์ ๋น๋ฆผ ๊ท์น์ด ์ ์ฉ๋ฉ๋๋ค: ํ ์ค๋ ๋์ ์ํ ๊ฐ๋ณ ๋น๋ฆผ ๋๋ ์ฌ๋ฌ ์ค๋ ๋์ ๋ํ ๋ถ๋ณ ๋น๋ฆผ์ค ํ๋๋ง ๊ฐ๋ฅํฉ๋๋ค.\n"
" "
#: src/concurrency/channels.md:1
msgid "# Channels"
msgstr "# ์ฑ๋"
#: src/concurrency/channels.md:3
msgid ""
"Rust channels have two parts: a `Sender` and a `Receiver`. The two parts\n"
"are connected via the channel, but you only see the end-points."
msgstr "๋ฌ์คํธ์ ์ฑ๋์ `Sender` ์ `Receiver` ๋ ๋ถ๋ถ์ผ๋ก ๊ตฌ์ฑ๋ฉ๋๋ค. ์ด ๋์ ์ฑ๋์ ํตํด ์๋ก ์ฐ๊ฒฐ๋์ด ์์ง๋ง, ์ฐ๋ฆฌ๋ ์ฑ๋์ ๋ณผ ์๋ ์๊ณ ์ด ์ ๋๋จ๋ง์ ์ฌ์ฉํ๊ฒ ๋ฉ๋๋ค."
#: src/concurrency/channels.md:6
msgid ""
"```rust,editable\n"
"use std::sync::mpsc;\n"
"use std::thread;\n"
"\n"
"fn main() {\n"
" let (tx, rx) = mpsc::channel();\n"
"\n"
" tx.send(10).unwrap();\n"
" tx.send(20).unwrap();\n"
"\n"
" println!(\"Received: {:?}\", rx.recv());\n"
" println!(\"Received: {:?}\", rx.recv());\n"
"\n"
" let tx2 = tx.clone();\n"
" tx2.send(30).unwrap();\n"
" println!(\"Received: {:?}\", rx.recv());\n"
"}\n"
"```"
msgstr ""
#: src/concurrency/channels.md:27
msgid ""
"* `mpsc` stands for Multi-Producer, Single-Consumer. `Sender` and `SyncSender` implement `Clone` (so\n"
" you can make multiple producers) but `Receiver` does not.\n"
"* `send()` and `recv()` return `Result`. If they return `Err`, it means the counterpart `Sender` or\n"
" `Receiver` is dropped and the channel is closed."
msgstr ""
"* `mpsc`๋ โMulti-Produce, Single-Consumerโ๋ฅผ ์๋ฏธํฉ๋๋ค. `Sender`์ `SyncSender`๋ `Clone`์ ๊ตฌํํ์ง๋ง (์ฆ, ์ฌ๋ฌ๊ฐ์ producer๋ฅผ ๋ง๋ค์ ์์ต๋๋ค) `Receiver`๋ `Clone`์ ๊ตฌํํ์ง ์์ต๋๋ค.\n"
"* `send()`์ `recv()`๋ `Result`๋ฅผ ๋ฐํํฉ๋๋ค. ๋ง์ผ `Err`๊ฐ ๋ฐํ๋๋ค๋ฉด, ์๋๋ฐฉ์ `Sender`๋๋ `Receiver`๊ฐ ์ญ์ ๋์๊ณ ์ฑ๋์ด ๋ซํ๋ค๋ ๋ป์
๋๋ค."
#: src/concurrency/channels/unbounded.md:1
msgid "# Unbounded Channels"
msgstr "# ๋ฌด๊ฒฝ๊ณ ์ฑ๋(Unbounded Channels)"
#: src/concurrency/channels/unbounded.md:3
msgid "You get an unbounded and asynchronous channel with `mpsc::channel()`:"
msgstr "`mpsc::channel()` ํจ์๋ ๊ฒฝ๊ณ๊ฐ ์๋ ๋น๋๊ธฐ ์ฑ๋์ ์์ฑํฉ๋๋ค:"
#: src/concurrency/channels/unbounded.md:5
msgid ""
"```rust,editable\n"
"use std::sync::mpsc;\n"
"use std::thread;\n"
"use std::time::Duration;\n"
"\n"
"fn main() {\n"
" let (tx, rx) = mpsc::channel();\n"
"\n"
" thread::spawn(move || {\n"
" let thread_id = thread::current().id();\n"
" for i in 1..10 {\n"
" tx.send(format!(\"Message {i}\")).unwrap();\n"
" println!(\"{thread_id:?}: sent Message {i}\");\n"
" }\n"
" println!(\"{thread_id:?}: done\");\n"
" });\n"
" thread::sleep(Duration::from_millis(100));\n"
"\n"
" for msg in rx.iter() {\n"
" println!(\"Main: got {}\", msg);\n"
" }\n"
"}\n"
"```"
msgstr ""
#: src/concurrency/channels/bounded.md:1
msgid "# Bounded Channels"
msgstr "# ๊ฒฝ๊ณ๊ฐ ์๋ ์ฑ๋(Bounded Channels)"
#: src/concurrency/channels/bounded.md:3
msgid "Bounded and synchronous channels make `send` block the current thread:"
msgstr "๊ฒฝ๊ณ๊ฐ ์๋ ๋๊ธฐ ์ฑ๋์ `send`๊ฐ ํ์ ์ค๋ ๋๋ฅผ ๋ธ๋กํน ํ๋๋ก ๋ง๋ญ๋๋ค:"
#: src/concurrency/channels/bounded.md:5
msgid ""
"```rust,editable\n"
"use std::sync::mpsc;\n"
"use std::thread;\n"
"use std::time::Duration;\n"
"\n"
"fn main() {\n"
" let (tx, rx) = mpsc::sync_channel(3);\n"
"\n"
" thread::spawn(move || {\n"
" let thread_id = thread::current().id();\n"
" for i in 1..10 {\n"
" tx.send(format!(\"Message {i}\")).unwrap();\n"
" println!(\"{thread_id:?}: sent Message {i}\");\n"
" }\n"
" println!(\"{thread_id:?}: done\");\n"
" });\n"
" thread::sleep(Duration::from_millis(100));\n"
"\n"
" for msg in rx.iter() {\n"
" println!(\"Main: got {msg}\");\n"
" }\n"
"}\n"
"```"
msgstr ""
#: src/concurrency/shared_state.md:1
msgid "# Shared State"
msgstr "# ์ํ ๊ณต์ (Shared State)"
#: src/concurrency/shared_state.md:3
msgid ""
"Rust uses the type system to enforce synchronization of shared data. This is\n"
"primarily done via two types:"
msgstr "๋ฌ์คํธ๋ ์ฃผ๋ก ์๋ ๋ ๊ฐ์ง ํ์
์ ์ด์ฉํด์ ๊ณต์ ๋ฐ์ดํฐ ๋๊ธฐํ๋ฅผ ์ํํฉ๋๋ค:"
#: src/concurrency/shared_state.md:6
msgid ""
"* [`Arc`][1], atomic reference counted `T`: handles sharing between threads and\n"
" takes care to deallocate `T` when the last reference is dropped,\n"
"* [`Mutex`][2]: ensures mutually exclusive access to the `T` value."
msgstr ""
"* [`Arc`][1], `T`์ ๋ํ ์ํ ๋ฏน ์ฐธ์กฐ ์นด์ดํธ: ์ด ์ฐธ์กฐ๋ ๋ค์์ ์ค๋ ๋ ์ฌ์ด์์ ๊ณต์ ๋ ์ ์๊ณ , ์ฐธ์กฐํ๋ ๋ง์ง๋ง ์ค๋ ๋๊ฐ ์ข
๋ฃํ ๊ฒฝ์ฐ `T`๋ฅผ ๋ฐํํฉ๋๋ค.\n"
"* [`Mutex`][2]: `T`๊ฐ์ ๋ํ ์ํธ ๋ฐฐ์ ์์ธ์ค๋ฅผ ๋ณด์ฅํฉ๋๋ค."
#: src/concurrency/shared_state/arc.md:1
msgid "# `Arc`"
msgstr "# `Arc`"
#: src/concurrency/shared_state/arc.md:3
msgid "[`Arc`][1] allows shared read-only access via its `clone` method:"
msgstr "[`Arc`][1]์ `clone` ๋ฉ์๋๋ฅผ ์ด์ฉํ๋ฉด ์ฌ๋ฌ ์ค๋ ๋๊ฐ ํ ๋ฐ์ดํฐ๋ฅผ ๋์์ (_์ญ์ฃผ_: ๊ทธ๋ฆฌ๊ณ ์์ ํ๊ฒ. ์ค๋ ๋๊ฐ ํ๋๋ผ๋ ์ด์์๋ ๋์์๋ `T`๊ฐ ๋ฐํ๋์ง ์์) ์ฝ์ ์ ์์ต๋๋ค:"
#: src/concurrency/shared_state/arc.md:5
msgid ""
"```rust,editable\n"
"use std::thread;\n"
"use std::sync::Arc;\n"
"\n"
"fn main() {\n"
" let v = Arc::new(vec![10, 20, 30]);\n"
" let mut handles = Vec::new();\n"
" for _ in 1..5 {\n"
" let v = v.clone();\n"
" handles.push(thread::spawn(move || {\n"
" let thread_id = thread::current().id();\n"
" println!(\"{thread_id:?}: {v:?}\");\n"
" }));\n"
" }\n"
"\n"
" handles.into_iter().for_each(|h| h.join().unwrap());\n"
" println!(\"v: {v:?}\");\n"
"}\n"
"```"
msgstr ""
#: src/concurrency/shared_state/arc.md:29
msgid ""
"* `Arc` stands for \"Atomic Reference Counted\", a thread safe version of `Rc` that uses atomic\n"
" operations.\n"
"* `Arc` implements `Clone` whether or not `T` does. It implements `Send` and `Sync` iff `T`\n"
" implements them both.\n"
"* `Arc::clone()` has the cost of atomic operations that get executed, but after that the use of the\n"
" `T` is free.\n"
"* Beware of reference cycles, `Arc` does not use a garbage collector to detect them.\n"
" * `std::sync::Weak` can help."
msgstr ""
"* `Arc`๋ \"Atomic Reference Counted\"๋ฅผ ์๋ฏธํ๋ฉฐ, ์ค๋ ๋ ์์ ์ฑ์ ๋ณด์ฅํ๋ `Rc`๋ผ๊ณ ์๊ฐํ๋ฉด ๋ฉ๋๋ค.\n"
"* `T`๊ฐ `Clone`์ ๊ตฌํํ๋ ์ํ๋ `Arc`๋ `Clone`์ ๊ตฌํํฉ๋๋ค. `Send`์ `Sync`๋ `T`๊ฐ ์ด๋ค์ ๊ตฌํํ๋ ๊ฒฝ์ฐ์๋ง ๊ตฌํ๋ฉ๋๋ค.\n"
"* `Arc::clone()`๋ ์ํ ๋ฏน ์ฐ์ฐ์ ์ํํ๊ธฐ ๋๋ฌธ์ ๊ทธ ๋ ์ฝ์คํธ๊ฐ ์ข ์์ง๋ง, ์ผ๋จ `clone()`์ด ๋๋ ํ `T`๋ฅผ ์ฌ์ฉํ๋ ๋์๋ ์๋ฌด๋ฐ ์ค๋ฒํค๋๊ฐ ์์ต๋๋ค.\n"
"* ์ํ ์ฐธ์กฐ๊ฐ ๋ฐ์ํ์ง ์๋๋ก ์ฃผ์ํด์ผ ํฉ๋๋ค. ๋ฌ์คํธ๋ ์ํ ์ฐธ์กฐ๋ฅผ ๊ฐ์งํ๋ ๊ฐ๋น์ง ์ปฌ๋ํฐ๊ฐ ์์ต๋๋ค.\n"
" * ์ํ ์ฐธ์กฐ๋ฅผ ํผํ๋๋ฐ `std::sync::Weak`๊ฐ ๋์์ด ๋ ๊ฒ์
๋๋ค."
#: src/concurrency/shared_state/mutex.md:1
msgid "# `Mutex`"
msgstr "# `Mutex`"
#: src/concurrency/shared_state/mutex.md:3
msgid ""
"[`Mutex`][1] ensures mutual exclusion _and_ allows mutable access to `T`\n"
"behind a read-only interface:"
msgstr "[`Mutex`][1]๋ฅผ ์ด์ฉํ๋ฉด ๋ถ๋ณ ์ฐธ์กฐ๋ฅผ ํตํด์๋ `T`์ ๊ฐ์ ์์ ํ ์๊ฐ ์์ผ๋ฉฐ, _์ด์ ๋ํด์_ ํ ๋ฒ์ ํ ์ค๋ ๋๋ง `T`์ ๊ฐ์ ์ ๊ทผ(์ฝ๊ฑฐ๋ ์ฐ๊ฑฐ๋)ํจ์ ๋ณด์ฅํด ์ค๋๋ค:"
#: src/concurrency/shared_state/mutex.md:6
msgid ""
"```rust,editable\n"
"use std::sync::Mutex;\n"
"\n"
"fn main() {\n"
" let v = Mutex::new(vec![10, 20, 30]);\n"
" println!(\"v: {:?}\", v.lock().unwrap());\n"
"\n"
" {\n"
" let mut guard = v.lock().unwrap();\n"
" guard.push(40);\n"
" }\n"
"\n"
" println!(\"v: {:?}\", v.lock().unwrap());\n"
"}\n"
"```"
msgstr ""
#: src/concurrency/shared_state/mutex.md:22
msgid ""
"Notice how we have a [`impl Sync for Mutex`][2] blanket\n"
"implementation."
msgstr "๋ชจ๋ `Mutex`๋ [`impl Sync for Mutex`][2]๋ฅผ ์๋์ผ๋ก ๊ตฌํํจ์ ์ฐธ์กฐํ์ธ์."
#: src/concurrency/shared_state/mutex.md:31
msgid ""
"* `Mutex` in Rust looks like a collection with just one element - the protected data.\n"
" * It is not possible to forget to acquire the mutex before accessing the protected data.\n"
"* You can get an `&mut T` from an `&Mutex` by taking the lock. The `MutexGuard` ensures that the\n"
" `&mut T` doesn't outlive the lock being held.\n"
"* `Mutex` implements both `Send` and `Sync` iff `T` implements `Send`.\n"
"* A read-write lock counterpart - `RwLock`.\n"
"* Why does `lock()` return a `Result`? \n"
" * If the thread that held the `Mutex` panicked, the `Mutex` becomes \"poisoned\" to signal that\n"
" the data it protected might be in an inconsistent state. Calling `lock()` on a poisoned mutex\n"
" fails with a [`PoisonError`]. You can call `into_inner()` on the error to recover the data\n"
" regardless."
msgstr ""
"* ๋ฌ์คํธ์ `Mutex`๋ ์ค์ง ํ๋์ ๋ฐ์ดํฐ๋ง ๋ด์ ์ ์๋ ์ปฌ๋ ์
์ฒ๋ผ ๋ณผ ์๋ ์์ต๋๋ค. ๋ค๋ฅธ ์ปฌ๋ ์
๊ณผ ๋ค๋ฅธ ์ ์, ๊ทธ ๋ฐ์ดํฐ๊ฐ ๋์์ฑ ๋ฌธ์ ๋ก๋ถํฐ ์์ ๋กญ๋ค๋ ์ ์
๋๋ค.\n"
" * `Mutex`๋ ๋ฎคํ
์ค๋ฅผ ํ๋ํ์ง ์์ผ๋ฉด ๋ณดํธ๋ ๋ฐ์ดํฐ์ ์ ๊ทผํ๋ ๊ฒ์ด ๋ถ๊ฐ๋ฅ ํ๋๋ก ๋์์ธ ๋์ด ์์ต๋๋ค.\n"
"* `&Mutex`์ ๋ํด lock์ ํ๋ํ๋ฉด `&mut T`๋ฅผ ์ป์ ์ ์์ต๋๋ค. `MutexGuard`๋ `&mut T`๊ฐ ํ๋ํ lock๋ณด๋ค ์ค๋ ์ด์๋จ์ง ์์์ ๋ณด์ฅํฉ๋๋ค.\n"
"* `Mutex`๋ ์ค์ง `T`๊ฐ `Send`๋ฅผ ๊ตฌํํ๋ ๊ฒฝ์ฐ์๋ง `Send`์ `Sync`๋ฅผ ๊ตฌํํฉ๋๋ค.\n"
"* ์ฝ๊ธฐ-์ฐ๊ธฐ lock์ `RwLock`์ ์ฌ์ฉํฉ๋๋ค.\n"
"* ์ `lock()`์ด `Result`๋ฅผ ๋ฐํํ ๊น์?\n"
" * `Mutex`๋ฅผ ํ๋ํ ์ค๋ ๋์์ ํจ๋์ด ๋ฐ์ํ๋ฉด, ๋ฐ์ดํฐ๊ฐ ์ฌ๋ฐ๋ฅด์ง ์์ ์ํฉ์ด ๋ ์ ์์ต๋๋ค. ์ด๋ฅผ `Mutex`๊ฐ \"์ค๋
(poisoned)\" ๋์๋ค๊ณ ํํํ๋ฉฐ, ์ค๋
๋ ๋ฎคํ
์ค์์ `lock()`์ ํธ์ถํ๋ฉด ์คํจํ๊ณ [`PoisonError`]๊ฐ ๋ฐ์ํฉ๋๋ค. ์ด๋ฌํ ์ค๋ฅ๋ก๋ถํฐ ๋ฐ์ดํฐ๋ฅผ ๋ณต๊ตฌํ๊ธฐ ์ํด `into_inner()`๋ฅผ ํธ์ถํ ์ ์์ต๋๋ค."
#: src/concurrency/shared_state/example.md:3
msgid "Let us see `Arc` and `Mutex` in action:"
msgstr "`Arc`์ `Mutex`์ ๋์์ ์ดํด๋ด
์๋ค:"
#: src/concurrency/shared_state/example.md:5
msgid ""
"```rust,editable,compile_fail\n"
"use std::thread;\n"
"// use std::sync::{Arc, Mutex};\n"
"\n"
"fn main() {\n"
" let mut v = vec![10, 20, 30];\n"
" let handle = thread::spawn(|| {\n"
" v.push(10);\n"
" });\n"
" v.push(1000);\n"
"\n"
" handle.join().unwrap();\n"
" println!(\"v: {v:?}\");\n"
"}\n"
"```"
msgstr ""
#: src/concurrency/shared_state/example.md:23
msgid "Possible solution:"
msgstr ""
#: src/concurrency/shared_state/example.md:25
msgid ""
"```rust,editable\n"
"use std::sync::{Arc, Mutex};\n"
"use std::thread;\n"
"\n"
"fn main() {\n"
" let v = Arc::new(Mutex::new(vec![10, 20, 30]));\n"
"\n"
" let v2 = v.clone();\n"
" let handle = thread::spawn(move || {\n"
" let mut v2 = v2.lock().unwrap();\n"
" v2.push(10);\n"
" });\n"
"\n"
" {\n"
" let mut v = v.lock().unwrap();\n"
" v.push(1000);\n"
" }\n"
"\n"
" handle.join().unwrap();\n"
"\n"
" println!(\"v: {v:?}\");\n"
"}\n"
"```"
msgstr ""
#: src/concurrency/shared_state/example.md:49
msgid "Notable parts:"
msgstr "๋์ฌ๊ฒจ ๋ณผ ๋ถ๋ถ:"
#: src/concurrency/shared_state/example.md:51
msgid ""
"* `v` is wrapped in both `Arc` and `Mutex`, because their concerns are orthogonal.\n"
" * Wrapping a `Mutex` in an `Arc` is a common pattern to share mutable state between threads.\n"
"* `v: Arc<_>` needs to be cloned as `v2` before it can be moved into another thread. Note `move` was added to the lambda signature.\n"
"* Blocks are introduced to narrow the scope of the `LockGuard` as much as possible."
msgstr ""
"* `v`๋ `Arc`์ `Mutex` ๋ชจ๋์ ํฌํจ๋์ด ์์ต๋๋ค. ์ด๋ `Arc`์ `Mutex`๊ฐ ์๋ก ์์ ํ ๋ค๋ฅธ ๋ฌธ์ ๋ฅผ ์ํ ๋๊ตฌ์ด๊ธฐ ๋๋ฌธ์
๋๋ค.\n"
" * `Mutex`๋ฅผ `Arc`๋ก ๋ํํ๋ ๊ฒ์ ๊ฐ๋ณ ์ํ๋ฅผ ์ค๋ ๋๋ค ๊ฐ์ ๊ณต์ ํ ๋ ํํ ์ฌ์ฉํ๋ ํจํด์
๋๋ค.\n"
"* `v: Arc<_>`๋ฅผ ๋ค๋ฅธ ์ค๋ ๋์์ ์ฌ์ฉํ๋ ค๋ฉด, ๋จผ์ `v2`๋ก ๋ณต์ฌ๋ฅผ ํ๊ณ ์ด๋ฅผ ๊ทธ ์ค๋ ๋๋ก ์ด๋ ํด์ผ ํฉ๋๋ค. ๊ทธ๋์ ๋๋ค์ ์๊ทธ๋์ฒ์ `move`๊ฐ ์๋ ๊ฒ์
๋๋ค.\n"
"* ๋ธ๋ก์ `LockGuard`์ ๋ฒ์๋ฅผ ์ต๋ํ ์ขํ๊ธฐ ์ํด ์ฌ์ฉ๋์์ต๋๋ค."
#: src/concurrency/send-sync.md:1
msgid "# `Send` and `Sync`"
msgstr "# `Send`์ `Sync`"
#: src/concurrency/send-sync.md:3
msgid "How does Rust know to forbid shared access across thread? The answer is in two traits:"
msgstr "๋ฌ์คํธ๋ ์ด๋ป๊ฒ ํด์ ์ค๋ ๋ ๊ฐ์ ํน์ ๋ฐ์ดํฐ ํ์
์ด ๊ณต์ ๋ ์ ์๊ฑฐ๋, ์๋๋ค๋ ๊ฒ์ ์๊น์? ์ ๋ต์ ๋ค์ ๋ ํธ๋ ์์ ์์ต๋๋ค:"
#: src/concurrency/send-sync.md:5
msgid ""
"* [`Send`][1]: a type `T` is `Send` if it is safe to move a `T` across a thread\n"
" boundary.\n"
"* [`Sync`][2]: a type `T` is `Sync` if it is safe to move a `&T` across a thread\n"
" boundary."
msgstr ""
"* [`Send`][1]: `T`๊ฐ ์ค๋ ๋ ๊ฐ ์ด๋์ด ์์ ํ๋ค๋ฉด, `T`์ ํ์
์ `Send`์
๋๋ค.\n"
"* [`Sync`][2]: `&T`๊ฐ ์ค๋ ๋ ๊ฐ ์ด๋์ด ์์ ํ๋ค๋ฉด, `&T`์ ํ์
์ `Sync`์
๋๋ค."
#: src/concurrency/send-sync.md:10
msgid ""
"`Send` and `Sync` are [unsafe traits][3]. The compiler will automatically derive them for your types\n"
"as long as they only contain `Send` and `Sync` types. You can also implement them manually when you\n"
"know it is valid."
msgstr "`Send`์ `Sync` ํธ๋ ์์ [์์ ํ์ง ์์ ํธ๋ ์][3]์
๋๋ค. ์ปดํ์ผ๋ฌ๋ ํ์
์ ์์๋ค์ด ๋ชจ๋ `Send`์ `Sync` ํ์
์ด๋ฉด ์๋์ผ๋ก ์ด ํธ๋ ์๋ค์ ์ ์ฉ์์ผ ์ค๋๋ค. ๋ฌผ๋ก ์ฌ๋ฌ๋ถ ์ค์ค๋ก ๋ง๋ค๊ณ ์๊ณ ์๋ค๋ฉด ์ง์ ๊ตฌํํด๋ ๋ฉ๋๋ค."
#: src/concurrency/send-sync.md:20
msgid ""
"* One can think of these traits as markers that the type has certain thread-safety properties.\n"
"* They can be used in the generic constraints as normal traits.\n"
" "
msgstr ""
"* `Sync`์ `Send`๋ ์ด๋ค ํ์
์ด ํน์ ํ ์ค๋ ๋-์์ ์์ฑ์ ๊ฐ์ง์ ๋ํ๋ด๋ ๋ง์ปค๋ก ์๊ฐํ ์ ์์ต๋๋ค.\n"
"* ์ด ๋ ํธ๋ ์ดํธ๋ ์ ๋๋ฆญ์์ ์ ์ฝ ์กฐ๊ฑด์ ๋ํ๋ด๋ ํธ๋ ์ดํธ๋ก ์ฌ์ฉ๋ ์๋ ์์ต๋๋ค.\n"
" "
#: src/concurrency/send-sync/send.md:1
msgid "# `Send`"
msgstr "# `Send`"
#: src/concurrency/send-sync/send.md:3
msgid "> A type `T` is [`Send`][1] if it is safe to move a `T` value to another thread."
msgstr "> `T`๊ฐ ์ค๋ ๋ ๊ฐ์ ์์ ํ๊ฒ ์ด๋๋ ์ ์๋ค๋ฉด, `T`์ ํ์
์ `Send`์
๋๋ค."
#: src/concurrency/send-sync/send.md:5
msgid ""
"The effect of moving ownership to another thread is that _destructors_ will run\n"
"in that thread. So the question is when you can allocate a value in one thread\n"
"and deallocate it in another."
msgstr "์์ ๊ถ์ ๋ค๋ฅธ ์ค๋ ๋๋ก ์ด๋ํ๋ฉด ์๋ฉธ์๊ฐ ํด๋น ์ค๋ ๋์์ ์คํ๋ฉ๋๋ค. ์ฌ๊ธฐ์ ์๋ฌธ์ \"์ธ์ ํ ์ค๋ ๋์์ ๊ฐ์ ํ ๋นํ๊ณ ๋ค๋ฅธ ์ค๋ ๋์์ ๊ฐ์ ํ ๋น ํด์ ํ ์ ์๋๊ฐ\" ์
๋๋ค."
#: src/concurrency/send-sync/sync.md:1
msgid "# `Sync`"
msgstr "# `Sync`"
#: src/concurrency/send-sync/sync.md:3
msgid ""
"> A type `T` is [`Sync`][1] if it is safe to access a `T` value from multiple\n"
"> threads at the same time."
msgstr "> `&T`๊ฐ ์ฌ๋ฌ ์ค๋ ๋์์ ์์ ํ๊ฒ ์ ๊ทผ๋ ์ ์๋ค๋ฉด, `&T`์ ํ์
์ `Sync`์
๋๋ค."
#: src/concurrency/send-sync/sync.md:6
msgid "More precisely, the definition is:"
msgstr "์ข ๋ ์ ํํ ์ ์๋ ๋ค์๊ณผ ๊ฐ์ต๋๋ค:"
#: src/concurrency/send-sync/sync.md:8
msgid "> `T` is `Sync` if and only if `&T` is `Send`"
msgstr "`&T`๊ฐ `Send`์ธ ๊ฒฝ์ฐ์๋ง `T`์ ํ์
์ด `Sync`๊ฐ ๋ฉ๋๋ค"
#: src/concurrency/send-sync/sync.md:14
msgid "This statement is essentially a shorthand way of saying that if a type is thread-safe for shared use, it is also thread-safe to pass references of it across threads."
msgstr "์ ๋ฌธ์ฅ์ ํ์ด์ ์ด์ผ๊ธฐ ํ๋ฉด, ์ด๋ค ํ์
์ด ์ค๋ ๋ ๊ฐ์ ๊ณต์ ๋์ด์ ์ฌ์ฉ๋๊ธฐ์ ์์ ํ๋ค๋ฉด ๊ทธ ํ์
์ ์ฐธ์กฐ ํ์
์ ์ค๋ ๋ ๊ฐ์ ์ด๋ ๊ฐ๋ฅํ๋ค๋ ๊ฒ์
๋๋ค."
#: src/concurrency/send-sync/sync.md:16
msgid "This is because if a type is Sync it means that it can be shared across multiple threads without the risk of data races or other synchronization issues, so it is safe to move it to another thread. A reference to the type is also safe to move to another thread, because the data it references can be accessed from any thread safely."
msgstr "์ด๋ ๋ค์๊ณผ ๊ฐ์ด ์ฆ๋ช
ํ ์ ์์ต๋๋ค: ์ด๋ค ํ์
์ด `Sync`๋ผ๋ ๋ง์ ๊ณง ๊ทธ ํ์
์ด ์ฌ๋ฌ ์ค๋ ๋๋ค ์ฌ์ด์์ ๋ฐ์ดํฐ ๋ ์ด์ค๋ ์ฌํ ๋๊ธฐํ ๋ฌธ์ ์์ด ๊ณต์ ๊ฐ๋ฅํ๋ค๋ ๋ง์
๋๋ค. ์ค๋ ๋ ๊ฐ ๊ณต์ ๊ฐ ์์ ํ๋ค๋ฉด, ์ค๋ ๋๊ฐ ์ด๋๋ ์์ ํ ์ ๋ฐ์ ์์ต๋๋ค. ์ด๋ค ํ์
์ ์ค๋ ๋๊ฐ ์ด๋์ด ์์ ํ๋ค๋ฉด, ๊ทธ ํ์
์ ์ฐธ์กฐ ๋ํ ์ค๋ ๋๊ฐ ์ด๋์ด ์์ ํ ์ ๋ฐ์ ์์ต๋๋ค."
#: src/concurrency/send-sync/examples.md:1
msgid "# Examples"
msgstr "# ์์ "
#: src/concurrency/send-sync/examples.md:3
msgid "## `Send + Sync`"
msgstr ""
#: src/concurrency/send-sync/examples.md:5
msgid "Most types you come across are `Send + Sync`:"
msgstr "์ฌ๋ฌ๋ถ์ด ๋ค๋ฃจ๊ฒ ๋ ๋๋ถ๋ถ์ ํ์
์ `Send + Sync`์
๋๋ค:"
#: src/concurrency/send-sync/examples.md:7
msgid ""
"* `i8`, `f32`, `bool`, `char`, `&str`, ...\n"
"* `(T1, T2)`, `[T; N]`, `&[T]`, `struct { x: T }`, ...\n"
"* `String`, `Option`, `Vec`, `Box`, ...\n"
"* `Arc`: Explicitly thread-safe via atomic reference count.\n"
"* `Mutex`: Explicitly thread-safe via internal locking.\n"
"* `AtomicBool`, `AtomicU8`, ...: Uses special atomic instructions."
msgstr ""
"* `i8`, `f32`, `bool`, `char`, `&str`, ...\n"
"* `(T1, T2)`, `[T; N]`, `&[T]`, `struct { x: T }`, ...\n"
"* `String`, `Option`, `Vec`, `Box`, ...\n"
"* `Arc`: ์ฐธ์กฐ ์นด์ดํธ ์กฐ์์ ์ํ ๋ฏน ํ๊ธฐ ๋๋ฌธ์ ์ค๋ ๋ ์์ ํจ.\n"
"* `Mutex`: ๊ฐ์ ์ ๊ทผํ๊ธฐ ์ํด ๋ฎคํ์ค๋ฅผ ์ ๊ถ์ผ ํ๊ธฐ ๋๋ฌธ์ ์ค๋ ๋ ์์ ํจ.\n"
"* `AtomicBool`, `AtomicU8`, ...: ๊ฐ์ ์ ๊ทผํ ๋ ํน๋ณํ ์ํ ๋ฏน ๋ช
๋ น์ด๋ค์ ์ฌ์ฉํฉ๋๋ค."
#: src/concurrency/send-sync/examples.md:14
msgid ""
"The generic types are typically `Send + Sync` when the type parameters are\n"
"`Send + Sync`."
msgstr "์ ๋ค๋ฆญ ํ์
์ ์ผ๋ฐ์ ์ผ๋ก ํ์
ํ๋ผ๋ฉํฐ๊ฐ `Send + Sync`์ด๋ฉด `Send + Sync` ์
๋๋ค."
#: src/concurrency/send-sync/examples.md:17
msgid "## `Send + !Sync`"
msgstr ""
#: src/concurrency/send-sync/examples.md:19
msgid ""
"These types can be moved to other threads, but they're not thread-safe.\n"
"Typically because of interior mutability:"
msgstr "์๋ ํ์
๋ค์ ๋ค๋ฅธ ์ค๋ ๋๋ก ์ด๋๋ ์ ์์ง๋ง ๋ด๋ถ์ ์ผ๋ก ๊ฐ์ด ๋ณ๊ฒฝ๋ ์ ์๊ธฐ ๋๋ฌธ์ ์ค๋ ๋ ์์ ํ์ง ์์ต๋๋ค:"
#: src/concurrency/send-sync/examples.md:22
msgid ""
"* `mpsc::Sender`\n"
"* `mpsc::Receiver`\n"
"* `Cell`\n"
"* `RefCell`"
msgstr ""
#: src/concurrency/send-sync/examples.md:27
msgid "## `!Send + Sync`"
msgstr ""
#: src/concurrency/send-sync/examples.md:29
msgid "These types are thread-safe, but they cannot be moved to another thread:"
msgstr "์๋ ํ์
๋ค์ ์ค๋ ๋ ์์ ํ์ง๋ง ๋ค๋ฅธ ์ค๋ ๋๋ก ์ด๋๋ ์ ์์ต๋๋ค:"
#: src/concurrency/send-sync/examples.md:31
msgid ""
"* `MutexGuard`: Uses OS level primitives which must be deallocated on the\n"
" thread which created them."
msgstr "* `MutexGuard`: ๋ด๋ถ์ ์ผ๋ก, ์ด์์ฒด์ ๊ฐ ์ ๊ณตํ๋ primitive๋ฅผ ์ฌ์ฉํ๋๋ฐ, ์ด primitive๋ ์์ฑ๋ ์ค๋ ๋์์ ํด์ ๊ฐ ์ด๋ฃจ์ด์ ธ์ผ ํฉ๋๋ค. (_์ญ์ฃผ_: ๊ทธ๋์ ๋ค๋ฅธ ์ค๋ ๋๋ก ์ฎ๊ธธ ์ ์์ต๋๋ค.)"
#: src/concurrency/send-sync/examples.md:34
msgid "## `!Send + !Sync`"
msgstr ""
#: src/concurrency/send-sync/examples.md:36
msgid "These types are not thread-safe and cannot be moved to other threads:"
msgstr "์๋ ํ์
๋ค์ ์ค๋ ๋ ์์ ํ์ง๋ ์๊ณ ๋ค๋ฅธ ์ค๋ ๋๋ก ์ด๋๋ ์๋ ์์ต๋๋ค:"
#: src/concurrency/send-sync/examples.md:38
msgid ""
"* `Rc`: each `Rc` has a reference to an `RcBox`, which contains a\n"
" non-atomic reference count.\n"
"* `*const T`, `*mut T`: Rust assumes raw pointers may have special\n"
" concurrency considerations."
msgstr ""
"* `Rc`: `Rc` ๋ ์ํ ๋ฏนํ์ง ์์ ๋ฐฉ์์ผ๋ก ์ฐธ์กฐ ์นด์ดํธ๋ฅผ ์กฐ์ํ๋ `RcBox`๋ฅผ ์ฐธ์กฐํฉ๋๋ค.\n"
"* `*const T`, `*mut T`: ๋ฌ์คํธ๋ ํฌ์ธํฐ๊ฐ ์ค๋ ๋ ์์ ํ์ง ์๋ค๊ณ ๊ฐ์ ํฉ๋๋ค."
#: src/exercises/day-4/morning.md:1 src/exercises/day-4/android.md:1
msgid "# Exercises"
msgstr "# ์ฐ์ต๋ฌธ์ "
#: src/exercises/day-4/morning.md:3
msgid "Let us practice our new concurrency skills with"
msgstr "๋์์ฑ ๊ธฐ๋ฒ๋ค์ ์ฐ์ตํด ๋ด
์๋ค"
#: src/exercises/day-4/morning.md:5
msgid ""
"* Dining philosophers: a classic problem in concurrency.\n"
"\n"
"* Multi-threaded link checker: a larger project where you'll use Cargo to\n"
" download dependencies and then check links in parallel."
msgstr ""
"* ์์ฌํ๋ ์ฒ ํ์ ๋ฌธ์ : ๊ณ ์ ์ ์ธ ๋์์ฑ ๋ฌธ์ ์
๋๋ค.\n"
"\n"
"* ๋ฉํฐ ์ค๋ ๋ ๋งํฌ ๊ฒ์ฌ๊ธฐ: ๋ณ๋ ฌ์ ์ผ๋ก ์นํ์ด์ง์ ๋งํฌ๋ค์ ์ฒดํฌํฉ๋๋ค. ์นด๊ณ ๋ฅผ ํตํด ๋ช ๊ฐ์ง ์์กด์ฑ๋ค์ ๋ค์ด๋๋ฅด ๋ฐ์์ผ ํ๋ ํฐ ํ๋ก์ ํธ ์
๋๋ค."
#: src/exercises/day-4/dining-philosophers.md:1
msgid "# Dining Philosophers"
msgstr "# ์์ฌํ๋ ์ฒ ํ์๋ค"
#: src/exercises/day-4/dining-philosophers.md:3
msgid "The dining philosophers problem is a classic problem in concurrency:"
msgstr "์์ฌํ๋ ์ฒ ํ์ ๋ฌธ์ ๋ ๋์์ฑ์ ์์ด์ ๊ณ ์ ์ ์ธ ๋ฌธ์ ์
๋๋ค:"
#: src/exercises/day-4/dining-philosophers.md:5
msgid ""
"> Five philosophers dine together at the same table. Each philosopher has their\n"
"> own place at the table. There is a fork between each plate. The dish served is\n"
"> a kind of spaghetti which has to be eaten with two forks. Each philosopher can\n"
"> only alternately think and eat. Moreover, a philosopher can only eat their\n"
"> spaghetti when they have both a left and right fork. Thus two forks will only\n"
"> be available when their two nearest neighbors are thinking, not eating. After\n"
"> an individual philosopher finishes eating, they will put down both forks."
msgstr ""
"> 5๋ช
์ ์ฒ ํ์๊ฐ ์ํ์์ ์์ฌ๋ฅผ ํ๊ณ ์์ต๋๋ค. \n"
"> ์ฒ ํ์๋ ์ํ์์ ์์ ์ ์๋ฆฌ์ ์์์์ต๋๋ค.\n"
"> ํฌํฌ๋ ๊ฐ ์ ์ ์ฌ์ด์ ์์ต๋๋ค. \n"
"> ์ ๊ณต๋๋ ์๋ฆฌ๋ฅผ ๋จน๊ธฐ ์ํด์๋ ๋ ๊ฐ์ ํฌํฌ๋ฅผ ๋ชจ๋ ์ฌ์ฉํด์ผํฉ๋๋ค.\n"
"> ์ฒ ํ์๋ ์๊ฐ์ ํ๋ค๊ฐ ๋ฐฐ๊ฐ ๊ณ ํ๋ฉด ์์ ์ ์ข,์ฐ์ ํฌํฌ๋ฅผ ๋ค์ด ์๋ฆฌ๋ฅผ ๋จน์ต๋๋ค.\n"
"> ์ฒ ํ์๋ ์๋ฆฌ๋ฅผ ๋จน์ ํ์๋ ํฌํฌ๋ฅผ ๋ค์ ์๋ฆฌ์ ๋ด๋ ค๋์ต๋๋ค.\n"
"> ์ฒ ํ์๋ ์์ ์ ์ข,์ฐ์ ํฌํฌ๊ฐ ์์๋๋ง ์๋ฆฌ๋ฅผ ๋จน์ ์ ์์ต๋๋ค.\n"
"> ๋ฐ๋ผ์ ๋ ๊ฐ์ ํฌํฌ๋ ์ค์ง ์์ ์ ์ข,์ฐ ์ฒ ํ์๊ฐ ์๊ฐ์ ํ ๋๋ง ์ฌ์ฉํ ์ ์์ต๋๋ค."
#: src/exercises/day-4/dining-philosophers.md:13
msgid ""
"You will need a local [Cargo installation](../../cargo/running-locally.md) for\n"
"this exercise. Copy the code below to `src/main.rs` file, fill out the blanks,\n"
"and test that `cargo run` does not deadlock:"
msgstr "์ด๋ฒ ํ๋ จ์์๋ [์นด๊ณ ์ค์นํ๊ธฐ](../../cargo/running-locally.md)๊ฐ ํ์ํฉ๋๋ค. ์๋ ์ฝ๋๋ฅผ ๋ณต์ฌํด์ `src/main.rs`์ ๋ถ์ฌ๋๊ณ ๋น ๋ถ๋ถ์ ์ฑ์ฐ๊ณ , `cargo run` ์ปค๋งจ๋๋ก ํ
์คํธ ํด์ ๊ต์ฐฉ์ํ(๋ฐ๋๋ฝ)๊ฐ ๋ฐ์ํ์ง ์๋์ง ํ์ธํฉ๋๋ค:"
#: src/exercises/day-4/dining-philosophers.md:17
msgid ""
"```rust,compile_fail\n"
"use std::sync::mpsc;\n"
"use std::sync::{Arc, Mutex};\n"
"use std::thread;\n"
"use std::time::Duration;\n"
"\n"
"struct Fork;\n"
"\n"
"struct Philosopher {\n"
" name: String,\n"
" // left_fork: ...\n"
" // right_fork: ...\n"
" // thoughts: ...\n"
"}\n"
"\n"
"impl Philosopher {\n"
" fn think(&self) {\n"
" self.thoughts\n"
" .send(format!(\"Eureka! {} has a new idea!\", &self.name))\n"
" .unwrap();\n"
" }\n"
"\n"
" fn eat(&self) {\n"
" // Pick up forks...\n"
" println!(\"{} is eating...\", &self.name);\n"
" thread::sleep(Duration::from_millis(10));\n"
" }\n"
"}\n"
"\n"
"static PHILOSOPHERS: &[&str] =\n"
" &[\"Socrates\", \"Plato\", \"Aristotle\", \"Thales\", \"Pythagoras\"];\n"
"\n"
"fn main() {\n"
" // Create forks\n"
"\n"
" // Create philosophers\n"
"\n"
" // Make them think and eat\n"
"\n"
" // Output their thoughts\n"
"}\n"
"```"
msgstr ""
#: src/exercises/day-4/link-checker.md:1
msgid "# Multi-threaded Link Checker"
msgstr "# ๋ฉํฐ์ค๋ ๋ ๋งํฌ ๊ฒ์ฌ๊ธฐ"
#: src/exercises/day-4/link-checker.md:3
msgid ""
"Let us use our new knowledge to create a multi-threaded link checker. It should\n"
"start at a webpage and check that links on the page are valid. It should\n"
"recursively check other pages on the same domain and keep doing this until all\n"
"pages have been validated."
msgstr "์๋ก ๋ฐฐ์ด๊ฒ๋ค์ ํ์ฉํด์ ๋ฉํฐ ์ค๋ ๋ ๋งํฌ ๊ฒ์ฌ๊ธฐ๋ฅผ ๋ง๋ญ๋๋ค. ์ด ๊ฒ์ฌ๊ธฐ๋ ์นํ์ด์ง ์์ ์๋ ๋งํฌ๋ค์ด ์ ํจํ์ง ํ์ธํฉ๋๋ค. ๊ทธ๋ฆฌ๊ณ ์ฌ๊ท์ ์ผ๋ก ๋์ผ ๋๋ฉ์ธ์ ๋ค๋ฅธ ๋ชจ๋ ํ์ด์ง๊ฐ ์ ํจํ์ง ํ์ธํฉ๋๋ค."
#: src/exercises/day-4/link-checker.md:8
msgid ""
"For this, you will need an HTTP client such as [`reqwest`][1]. Create a new\n"
"Cargo project and `reqwest` it as a dependency with:"
msgstr "์ด๋ฅผ ์ํด์ [`reqwest`][1]์ ๊ฐ์ HTTP ํด๋ผ์ด์ธํธ๊ฐ ํ์ํฉ๋๋ค. ์๋ก์ด ๋ก์ปฌ ํ๋ก์ ํธ๋ฅผ ๋ง๋ค๊ณ [`reqwest`][1]๋ฅผ ์์กด์ฑ์ ์ถ๊ฐํ์ญ์์:"
#: src/exercises/day-4/link-checker.md:11
msgid ""
"```shell\n"
"$ cargo new link-checker\n"
"$ cd link-checker\n"
"$ cargo add --features blocking,rustls-tls reqwest\n"
"```"
msgstr ""
#: src/exercises/day-4/link-checker.md:17
msgid ""
"> If `cargo add` fails with `error: no such subcommand`, then please edit the\n"
"> `Cargo.toml` file by hand. Add the dependencies listed below."
msgstr "> ๋ง์ผ `cargo add` ์ปค๋งจ๋๊ฐ `error: no such subcommand` ๋ก ์คํจํ๋ค๋ฉด `Cargo.toml` ํ์ผ์ ์ง์ ์์ ํด๋ ๋ฉ๋๋ค. ์๋์ ์ ์ฒด ์์กด์ฑ ๋ด์ฉ์ด ์์ต๋๋ค."
#: src/exercises/day-4/link-checker.md:20
msgid "You will also need a way to find links. We can use [`scraper`][2] for that:"
msgstr "๋งํฌ๋ฅผ ์ฐพ๊ธฐ ์ํด์ [`scraper`][2]๋ ์ถ๊ฐํฉ๋๋ค:"
#: src/exercises/day-4/link-checker.md:22
msgid ""
"```shell\n"
"$ cargo add scraper\n"
"```"
msgstr ""
#: src/exercises/day-4/link-checker.md:26
msgid ""
"Finally, we'll need some way of handling errors. We use [`thiserror`][3] for\n"
"that:"
msgstr "๋ง์ง๋ง์ผ๋ก ์ค๋ฅ ์ฒ๋ฆฌํ๋ ๋ฐฉ๋ฒ์ผ๋ก [`thiserror`][3]๋ ์ถ๊ฐํฉ๋๋ค:"
#: src/exercises/day-4/link-checker.md:29
msgid ""
"```shell\n"
"$ cargo add thiserror\n"
"```"
msgstr ""
#: src/exercises/day-4/link-checker.md:33
msgid "The `cargo add` calls will update the `Cargo.toml` file to look like this:"
msgstr "๋ชจ๋ `cargo add`๊ฐ ๋๋๋ฉด `Cargo.toml`์ ์๋ ๋ด์ฉ์ด ์ถ๊ฐ๋ฉ๋๋ค:"
#: src/exercises/day-4/link-checker.md:35
msgid ""
"```toml\n"
"[dependencies]\n"
"reqwest = { version = \"0.11.12\", features = [\"blocking\", \"rustls-tls\"] }\n"
"scraper = \"0.13.0\"\n"
"thiserror = \"1.0.37\"\n"
"```"
msgstr ""
#: src/exercises/day-4/link-checker.md:42
msgid ""
"You can now download the start page. Try with a small site such as\n"
"`https://www.google.org/`."
msgstr "์ด์ `https://www.google.org/` ๊ฐ์ ์น ํ์ด์ง๋ฅผ ํ์ํ ์ ์์ต๋๋ค."
#: src/exercises/day-4/link-checker.md:45
msgid "Your `src/main.rs` file should look something like this:"
msgstr "`rc/main.rs`ํ์ผ์ ์๋์ ๊ฐ์ต๋๋ค:"
#: src/exercises/day-4/link-checker.md:47
msgid ""
"```rust,compile_fail\n"
"use reqwest::blocking::{get, Response};\n"
"use reqwest::Url;\n"
"use scraper::{Html, Selector};\n"
"use thiserror::Error;\n"
"\n"
"#[derive(Error, Debug)]\n"
"enum Error {\n"
" #[error(\"request error: {0}\")]\n"
" ReqwestError(#[from] reqwest::Error),\n"
"}\n"
"\n"
"fn extract_links(response: Response) -> Result, Error> {\n"
" let base_url = response.url().to_owned();\n"
" let document = response.text()?;\n"
" let html = Html::parse_document(&document);\n"
" let selector = Selector::parse(\"a\").unwrap();\n"
"\n"
" let mut valid_urls = Vec::new();\n"
" for element in html.select(&selector) {\n"
" if let Some(href) = element.value().attr(\"href\") {\n"
" match base_url.join(href) {\n"
" Ok(url) => valid_urls.push(url),\n"
" Err(err) => {\n"
" println!(\"On {base_url}: could not parse {href:?}: {err} (ignored)\",);\n"
" }\n"
" }\n"
" }\n"
" }\n"
"\n"
" Ok(valid_urls)\n"
"}\n"
"\n"
"fn main() {\n"
" let start_url = Url::parse(\"https://www.google.org\").unwrap();\n"
" let response = get(start_url).unwrap();\n"
" match extract_links(response) {\n"
" Ok(links) => println!(\"Links: {links:#?}\"),\n"
" Err(err) => println!(\"Could not extract links: {err:#}\"),\n"
" }\n"
"}\n"
"```"
msgstr ""
#: src/exercises/day-4/link-checker.md:90
msgid "Run the code in `src/main.rs` with"
msgstr "์๋ ์ปค๋งจ๋๋ก ์์ค๋ฅผ ์คํํฉ๋๋ค"
#: src/exercises/day-4/link-checker.md:92
msgid ""
"```shell\n"
"$ cargo run\n"
"```"
msgstr ""
#: src/exercises/day-4/link-checker.md:96
msgid "## Tasks"
msgstr "## ํ ์ผ"
#: src/exercises/day-4/link-checker.md:98
msgid ""
"* Use threads to check the links in parallel: send the URLs to be checked to a\n"
" channel and let a few threads check the URLs in parallel.\n"
"* Extend this to recursively extract links from all pages on the\n"
" `www.google.org` domain. Put an upper limit of 100 pages or so so that you\n"
" don't end up being blocked by the site."
msgstr ""
"* ์ค๋ ๋๋ฅผ ์ฌ์ฉํ์ฌ ๋งํฌ๋ฅผ ๋ณ๋ ฌ๋ก ํ์ธํฉ๋๋ค: URL์ ์ฑ๋๋ก ๋ณด๋ด์ ๋ช ๊ฐ์ ์ค๋ ๋๊ฐ URL์ ๋ณ๋ ฌ๋ก ์ฒดํฌํ๋๋ก ํฉ๋๋ค.\n"
"* `www.google.org`๋๋ฉ์ธ์ ๋ชจ๋ ํ์ด์ง๋ฅผ ์ฌ๊ท์ ์ผ๋ก ํ์ธํ๊ธฐ ์ํด ์ฝ๋๋ฅผ ํ์ฅํด์ ์์ฑํฉ๋๋ค: ์ฐจ๋จ๋นํ์ง ์๋๋ก 100ํ์ด์ง ์ ๋๋ก ์ ํ์ ๋์๊ธฐ ๋ฐ๋๋๋ค."
#: src/android.md:1
msgid "# Android"
msgstr "# ์๋๋ก์ด๋"
#: src/android.md:3
msgid ""
"Rust is supported for native platform development on Android. This means that\n"
"you can write new operating system services in Rust, as well as extending\n"
"existing services."
msgstr "๋ฌ์คํธ๋ ์๋๋ก์ด๋ ๋ค์ดํฐ๋ธ ํ๋ซํผ ๊ฐ๋ฐ์ ์ง์ํฉ๋๋ค. ๊ธฐ์กด์ OS ์๋น์ค๋ฅผ ํ์ฅํ๊ฑฐ๋, ์๋ก์ด ์๋น์ค๋ฅผ ๋ง๋๋๋ฐ ๋ฌ์คํธ๋ฅผ ์ธ ์ ์์ต๋๋ค."
#: src/android.md:7
msgid ""
"> We will attempt to call Rust from one of your own projects today. So try to\n"
"> find a little corner of your code base where we can move some lines of code to\n"
"> Rust. The fewer dependencies and \"exotic\" types the better. Something that\n"
"> parses some raw bytes would be ideal."
msgstr "> ์ฐ๋ฆฌ๋ ์ค๋ ์ฌ๋ฌ๋ถ์ ํ๋ก์ ํธ์์ ๋ฌ์คํธ ์ฝ๋๋ฅผ ํธ์ถํด๋ณผ ๊ฒ์
๋๋ค. ๊ทธ ํ๋ก์ ํธ์์ ๋ฌ์คํธ๋ก ์ฎ๊ธธ๋ง ํ ์์ ๋ถ๋ถ์ ์ ํ์ธ์. ์์กด์ฑ์ด ์ ๊ณ \"ํน์ดํ\" ํ์
์ด ์ ์ ์๋ก ์ข์ต๋๋ค. ๋ฐ์ดํธ ๋ช ๊ฐ๋ฅผ ํ์ฑํ๋ ์ฝ๋๋ผ๋ฉด ์๋ฒฝํฉ๋๋ค."
#: src/android/setup.md:1
msgid "# Setup"
msgstr "# ์ค์น"
#: src/android/setup.md:3
msgid ""
"We will be using an Android Virtual Device to test our code. Make sure you have\n"
"access to one or create a new one with:"
msgstr "์๋๋ก์ด๋ ๊ฐ์ ๋๋ฐ์ด์ค(Android Virtual Device)๋ฅผ ์ฌ์ฉํ์ฌ ์ฌ๋ฌ๋ถ์ ์ฝ๋๋ฅผ ์ํํ ๊ฒ๋๋ค. ์๋ก์ด ๊ฐ์ ๋๋ฐ์ด์ค๋ฅผ ์์ฑํ๋ ค๋ฉด ์๋์ ๋ช
๋ น์ด๋ฅผ ์ฌ์ฉํ์ธ์:"
#: src/android/setup.md:6
msgid ""
"```shell\n"
"$ source build/envsetup.sh\n"
"$ lunch aosp_cf_x86_64_phone-userdebug\n"
"$ acloud create\n"
"```"
msgstr ""
#: src/android/setup.md:12
msgid ""
"Please see the [Android Developer\n"
"Codelab](https://source.android.com/docs/setup/start) for details."
msgstr "์์ธํ ๋ด์ฉ์ [Android Developer Codelab](https://source.android.com/docs/setup/start)์ ์ฐธ์กฐํ์ญ์์ค."
#: src/android/build-rules.md:1
msgid "# Build Rules"
msgstr "# ๋น๋ ๊ท์น(Build Rules)"
#: src/android/build-rules.md:3
msgid "The Android build system (Soong) supports Rust via a number of modules:"
msgstr "์๋๋ก์ด๋ ๋น๋ ์์คํ
(Soong)์ ๋ค์๊ณผ ๊ฐ์ ์ฌ๋ฌ ๋ชจ๋์ ํตํด ๋ฌ์คํธ๋ฅผ ์ง์ํฉ๋๋ค:"
#: src/android/build-rules.md:5
msgid ""
"| Module Type | Description |\n"
"|-------------------|----------------------------------------------------------------------------------------------------|\n"
"| `rust_binary` | Produces a Rust binary. |\n"
"| `rust_library` | Produces a Rust library, and provides both `rlib` and `dylib` variants. |\n"
"| `rust_ffi` | Produces a Rust C library usable by `cc` modules, and provides both static and shared variants. |\n"
"| `rust_proc_macro` | Produces a `proc-macro` Rust library. These are analogous to compiler plugins. |\n"
"| `rust_test` | Produces a Rust test binary that uses the standard Rust test harness. |\n"
"| `rust_fuzz` | Produces a Rust fuzz binary leveraging `libfuzzer`. |\n"
"| `rust_protobuf` | Generates source and produces a Rust library that provides an interface for a particular protobuf. |\n"
"| `rust_bindgen` | Generates source and produces a Rust library containing Rust bindings to C libraries. |"
msgstr ""
"| Module Type | Description |\n"
"|-------------------|------------------------------------------------------|\n"
"| `rust_binary` | ๋ฌ์คํธ ๋ฐ์ด๋๋ฆฌ๋ฅผ ์์ฑํฉ๋๋ค.|\n"
"| `rust_library` | ๋ฌ์คํธ ๋ผ์ด๋ธ๋ฌ๋ฆฌ(rlibํน์ dylib)๋ฅผ ์์ฑํฉ๋๋ค.|\n"
"| `rust_ffi` | cc ๋ชจ๋์์ ์ฌ์ฉํ ์ ์๋ C library (์ ์ ํน์ ๋์ )๋ฅผ ์์ฑํฉ๋๋ค.|\n"
"| `rust_proc_macro` | `proc-macro`๋ฅผ ๊ตฌํํ๋ ๋ฌ์คํธ ๋ผ์ด๋ธ๋ฌ๋ฆฌ๋ฅผ ์์ฑํฉ๋๋ค. ์ปดํ์ผ๋ฌ์ ํ๋ฌ๊ทธ์ธ์ผ๋ก ์๊ฐํด๋ ์ข์ต๋๋ค.|\n"
"| `rust_test` | ํ์ค ๋ฌ์คํธ ํ
์คํธ ๋ฌ๋๋ฅผ ์ฌ์ฉํ๋ ํ
์คํธ ๋ฐ์ด๋๋ฆฌ๋ฅผ ์์ฑํฉ๋๋ค.|\n"
"| `rust_fuzz` | `libfuzzer`๋ฅผ ์ฌ์ฉํ์ฌ fuzz ๋ฐ์ด๋๋ฆฌ๋ฅผ ์์ฑํฉ๋๋ค.|\n"
"| `rust_protobuf` | ํ๋กํ ๋ฒํ(protobuf) ์ธํฐํ์ด์ค๋ฅผ ์ ๊ณตํ๋ ๋ฌ์คํธ ๋ผ์ด๋ธ๋ฌ๋ฆฌ๋ฅผ ์์ฑํฉ๋๋ค.|\n"
"| `rust_bindgen` | C ๋ผ์ด๋ธ๋ฌ๋ฆฌ์ ๋ํ ๋ฌ์คํธ ๋ฐ์ธ๋ฉ์ ์ ๊ณตํ๋ ๋ฌ์คํธ ๋ผ์ด๋ธ๋ฌ๋ฆฌ๋ฅผ ์์ฑํฉ๋๋ค.|"
#: src/android/build-rules.md:16
msgid "We will look at `rust_binary` and `rust_library` next."
msgstr "๋ค์์ `rust_binary`์ `rust_library`๋ฅผ ์ดํด๋ด
๋๋ค."
#: src/android/build-rules/binary.md:1
msgid "# Rust Binaries"
msgstr "# ๋ฌ์คํธ ๋ฐ์ด๋๋ฆฌ"
#: src/android/build-rules/binary.md:3
msgid ""
"Let us start with a simple application. At the root of an AOSP checkout, create\n"
"the following files:"
msgstr "๊ฐ๋จํ ์์ฉ ํ๋ก๊ทธ๋จ์ผ๋ก ์์ํด ๋ณด๊ฒ ์ต๋๋ค. AOSP ์ฒดํฌ์์์ ๋ฃจํธ์์ ๋ค์ ํ์ผ์ ์์ฑํฉ๋๋ค:"
#: src/android/build-rules/binary.md:6 src/android/build-rules/library.md:13
msgid "_hello_rust/Android.bp_:"
msgstr ""
#: src/android/build-rules/binary.md:8
msgid ""
"```javascript\n"
"rust_binary {\n"
" name: \"hello_rust\",\n"
" crate_name: \"hello_rust\",\n"
" srcs: [\"src/main.rs\"],\n"
"}\n"
"```"
msgstr ""
#: src/android/build-rules/binary.md:16 src/android/build-rules/library.md:34
msgid "_hello_rust/src/main.rs_:"
msgstr ""
#: src/android/build-rules/binary.md:18
msgid ""
"```rust\n"
"//! Rust demo.\n"
"\n"
"/// Prints a greeting to standard output.\n"
"fn main() {\n"
" println!(\"Hello from Rust!\");\n"
"}\n"
"```"
msgstr ""
#: src/android/build-rules/binary.md:27
msgid "You can now build, push, and run the binary:"
msgstr "๊ทธ๋ฐ ๋ค์, ์ด ๋ฐ์ด๋๋ฆฌ๋ฅผ ๋น๋ํ๊ณ , ๊ฐ์ ๋๋ฐ์ด์ค์ ๋ฃ๊ณ , ์คํํฉ๋๋ค:"
#: src/android/build-rules/binary.md:29
msgid ""
"```shell\n"
"$ m hello_rust\n"
"$ adb push $ANDROID_PRODUCT_OUT/system/bin/hello_rust /data/local/tmp\n"
"$ adb shell /data/local/tmp/hello_rust\n"
"Hello from Rust!\n"
"```"
msgstr ""
#: src/android/build-rules/library.md:1
msgid "# Rust Libraries"
msgstr "# ๋ฌ์คํธ ๋ผ์ด๋ธ๋ฌ๋ฆฌ"
#: src/android/build-rules/library.md:3
msgid "You use `rust_library` to create a new Rust library for Android."
msgstr "`rust_library`๋ฅผ ์ฌ์ฉํ์ฌ ์๋๋ก์ด๋์ฉ ์ ๋ฌ์คํธ ๋ผ์ด๋ธ๋ฌ๋ฆฌ๋ฅผ ๋ง๋ญ๋๋ค."
#: src/android/build-rules/library.md:5
msgid "Here we declare a dependency on two libraries:"
msgstr "์ฌ๊ธฐ์ ๋ ๊ฐ์ ๋ผ์ด๋ธ๋ฌ๋ฆฌ์ ๋ํ ์์กด์ฑ์ ์ ์ธํฉ๋๋ค:"
#: src/android/build-rules/library.md:7
msgid ""
"* `libgreeting`, which we define below,\n"
"* `libtextwrap`, which is a crate already vendored in\n"
" [`external/rust/crates/`][crates]."
msgstr ""
"* ์๋์ ์ ์ํ `libgreeting`.\n"
"* [`external/rust/crates/`][crates]์ ์กด์ฌํ๋ `libtextwrap`."
#: src/android/build-rules/library.md:15
msgid ""
"```javascript\n"
"rust_binary {\n"
" name: \"hello_rust_with_dep\",\n"
" crate_name: \"hello_rust_with_dep\",\n"
" srcs: [\"src/main.rs\"],\n"
" rustlibs: [\n"
" \"libgreetings\",\n"
" \"libtextwrap\",\n"
" ],\n"
" prefer_rlib: true,\n"
"}\n"
"\n"
"rust_library {\n"
" name: \"libgreetings\",\n"
" crate_name: \"greetings\",\n"
" srcs: [\"src/lib.rs\"],\n"
"}\n"
"```"
msgstr ""
#: src/android/build-rules/library.md:36
msgid ""
"```rust,ignore\n"
"//! Rust demo.\n"
"\n"
"use greetings::greeting;\n"
"use textwrap::fill;\n"
"\n"
"/// Prints a greeting to standard output.\n"
"fn main() {\n"
" println!(\"{}\", fill(&greeting(\"Bob\"), 24));\n"
"}\n"
"```"
msgstr ""
#: src/android/build-rules/library.md:48
msgid "_hello_rust/src/lib.rs_:"
msgstr ""
#: src/android/build-rules/library.md:50
msgid ""
"```rust,ignore\n"
"//! Greeting library.\n"
"\n"
"/// Greet `name`.\n"
"pub fn greeting(name: &str) -> String {\n"
" format!(\"Hello {name}, it is very nice to meet you!\")\n"
"}\n"
"```"
msgstr ""
#: src/android/build-rules/library.md:59
msgid "You build, push, and run the binary like before:"
msgstr "์ด์ ์ฒ๋ผ, ๋น๋ํ๊ณ , ๊ฐ์ ๋๋ฐ์ด์ค๋ก ๋ฃ๊ณ , ์คํํฉ๋๋ค:"
#: src/android/build-rules/library.md:61
msgid ""
"```shell\n"
"$ m hello_rust_with_dep\n"
"$ adb push $ANDROID_PRODUCT_OUT/system/bin/hello_rust_with_dep /data/local/tmp\n"
"$ adb shell /data/local/tmp/hello_rust_with_dep\n"
"Hello Bob, it is very\n"
"nice to meet you!\n"
"```"
msgstr ""
#: src/android/aidl.md:1
msgid "# AIDL"
msgstr "# AIDL"
#: src/android/aidl.md:3
msgid ""
"The [Android Interface Definition Language\n"
"(AIDL)](https://developer.android.com/guide/components/aidl) is supported in Rust:"
msgstr "๋ฌ์คํธ๋ [์๋๋ก์ด๋ ์ธํฐํ์ด์ค ์ ์ ์ธ์ด(AIDL)](https://developer.android.com/guide/components/aidl)๋ฅผ ์ง์ํฉ๋๋ค:"
#: src/android/aidl.md:6
msgid ""
"* Rust code can call existing AIDL servers,\n"
"* You can create new AIDL servers in Rust."
msgstr ""
"* ๋ฌ์คํธ ์ฝ๋์์ ๊ธฐ์กด AIDL ์๋ฒ๋ฅผ ํธ์ถ ํ ์ ์์ต๋๋ค. \n"
"* ๋ฌ์คํธ์์ ์๋ก์ด AIDL ์๋ฒ๋ฅผ ์์ฑํ ์ ์์ต๋๋ค."
#: src/android/aidl/interface.md:1
msgid "# AIDL Interfaces"
msgstr "# AIDL ์ธํฐํ์ด์ค"
#: src/android/aidl/interface.md:3
msgid "You declare the API of your service using an AIDL interface:"
msgstr "AIDL ์ธํฐํ์ด์ค๋ฅผ ์ด์ฉํด์ ์๋น์ค์ API๋ฅผ ์ ์ธํฉ๋๋ค:"
#: src/android/aidl/interface.md:5
msgid "*birthday_service/aidl/com/example/birthdayservice/IBirthdayService.aidl*:"
msgstr ""
#: src/android/aidl/interface.md:7
msgid ""
"```java\n"
"package com.example.birthdayservice;\n"
"\n"
"/** Birthday service interface. */\n"
"interface IBirthdayService {\n"
" /** Generate a Happy Birthday message. */\n"
" String wishHappyBirthday(String name, int years);\n"
"}\n"
"```"
msgstr ""
#: src/android/aidl/interface.md:17
msgid "*birthday_service/aidl/Android.bp*:"
msgstr ""
#: src/android/aidl/interface.md:19
msgid ""
"```javascript\n"
"aidl_interface {\n"
" name: \"com.example.birthdayservice\",\n"
" srcs: [\"com/example/birthdayservice/*.aidl\"],\n"
" unstable: true,\n"
" backend: {\n"
" rust: { // Rust is not enabled by default\n"
" enabled: true,\n"
" },\n"
" },\n"
"}\n"
"```"
msgstr ""
#: src/android/aidl/interface.md:32
msgid ""
"Add `vendor_available: true` if your AIDL file is used by a binary in the vendor\n"
"partition."
msgstr "AIDL ํ์ผ์ด ๋ฒค๋ ํํฐ์
์ ์๋ ๋ฐ์ด๋๋ฆฌ์์ ์ฌ์ฉ๋ ๊ฒฝ์ฐ `vendor_available: true`๋ฅผ ์ถ๊ฐํฉ๋๋ค."
#: src/android/aidl/implementation.md:1
msgid "# Service Implementation"
msgstr "# ์๋น์ค ๊ตฌํ"
#: src/android/aidl/implementation.md:3
msgid "We can now implement the AIDL service:"
msgstr "์ด์ AIDL์๋น์ค๋ฅผ ๊ตฌํํ ์ ์์ต๋๋ค:"
#: src/android/aidl/implementation.md:5
msgid "*birthday_service/src/lib.rs*:"
msgstr ""
#: src/android/aidl/implementation.md:7
msgid ""
"```rust,ignore\n"
"//! Implementation of the `IBirthdayService` AIDL interface.\n"
"use com_example_birthdayservice::aidl::com::example::birthdayservice::IBirthdayService::IBirthdayService;\n"
"use com_example_birthdayservice::binder;\n"
"\n"
"/// The `IBirthdayService` implementation.\n"
"pub struct BirthdayService;\n"
"\n"
"impl binder::Interface for BirthdayService {}\n"
"\n"
"impl IBirthdayService for BirthdayService {\n"
" fn wishHappyBirthday(&self, name: &str, years: i32) -> binder::Result {\n"
" Ok(format!(\n"
" \"Happy Birthday {name}, congratulations with the {years} years!\"\n"
" ))\n"
" }\n"
"}\n"
"```"
msgstr ""
#: src/android/aidl/implementation.md:26 src/android/aidl/server.md:28
#: src/android/aidl/client.md:37
msgid "*birthday_service/Android.bp*:"
msgstr ""
#: src/android/aidl/implementation.md:28
msgid ""
"```javascript\n"
"rust_library {\n"
" name: \"libbirthdayservice\",\n"
" srcs: [\"src/lib.rs\"],\n"
" crate_name: \"birthdayservice\",\n"
" rustlibs: [\n"
" \"com.example.birthdayservice-rust\",\n"
" \"libbinder_rs\",\n"
" ],\n"
"}\n"
"```"
msgstr ""
#: src/android/aidl/server.md:1
msgid "# AIDL Server"
msgstr "# AIDL ์๋ฒ"
#: src/android/aidl/server.md:3
msgid "Finally, we can create a server which exposes the service:"
msgstr "๋ง์ง๋ง์ผ๋ก ์๋น์ค๋ฅผ ์ ๊ณตํ๋ ์๋ฒ๋ฅผ ๋ง๋ค ์ ์์ต๋๋ค:"
#: src/android/aidl/server.md:5
msgid "*birthday_service/src/server.rs*:"
msgstr ""
#: src/android/aidl/server.md:7
msgid ""
"```rust,ignore\n"
"//! Birthday service.\n"
"use birthdayservice::BirthdayService;\n"
"use com_example_birthdayservice::aidl::com::example::birthdayservice::IBirthdayService::BnBirthdayService;\n"
"use com_example_birthdayservice::binder;\n"
"\n"
"const SERVICE_IDENTIFIER: &str = \"birthdayservice\";\n"
"\n"
"/// Entry point for birthday service.\n"
"fn main() {\n"
" let birthday_service = BirthdayService;\n"
" let birthday_service_binder = BnBirthdayService::new_binder(\n"
" birthday_service,\n"
" binder::BinderFeatures::default(),\n"
" );\n"
" binder::add_service(SERVICE_IDENTIFIER, birthday_service_binder.as_binder())\n"
" .expect(\"Failed to register service\");\n"
" binder::ProcessState::join_thread_pool()\n"
"}\n"
"```"
msgstr ""
#: src/android/aidl/server.md:30
msgid ""
"```javascript\n"
"rust_binary {\n"
" name: \"birthday_server\",\n"
" crate_name: \"birthday_server\",\n"
" srcs: [\"src/server.rs\"],\n"
" rustlibs: [\n"
" \"com.example.birthdayservice-rust\",\n"
" \"libbinder_rs\",\n"
" \"libbirthdayservice\",\n"
" ],\n"
" prefer_rlib: true,\n"
"}\n"
"```"
msgstr ""
#: src/android/aidl/deploy.md:1
msgid "# Deploy"
msgstr "# ๋ฐฐํฌ"
#: src/android/aidl/deploy.md:3
msgid "We can now build, push, and start the service:"
msgstr "์๋น์ค๋ฅผ ๋น๋ํ๊ณ , ๊ฐ์ ๋๋ฐ์ด์ค์ ๋ฃ๊ณ , ์์ ํ ์ ์์ต๋๋ค:"
#: src/android/aidl/deploy.md:5
msgid ""
"```shell\n"
"$ m birthday_server\n"
"$ adb push $ANDROID_PRODUCT_OUT/system/bin/birthday_server /data/local/tmp\n"
"$ adb shell /data/local/tmp/birthday_server\n"
"```"
msgstr ""
#: src/android/aidl/deploy.md:11
msgid "In another terminal, check that the service runs:"
msgstr "๋ค๋ฅธ ํฐ๋ฏธ๋์ ๋์์ ์๋น์ค๊ฐ ์ ์ํ๋๊ณ ์๋์ง ํ์ธํฉ๋๋ค:"
#: src/android/aidl/deploy.md:13
msgid ""
"```shell\n"
"$ adb shell service check birthdayservice\n"
"Service birthdayservice: found\n"
"```"
msgstr ""
#: src/android/aidl/deploy.md:18
msgid "You can also call the service with `service call`:"
msgstr "`service call`๋ช
๋ ์ด๋ก ์๋น์ค๋ฅผ ํธ์ถํ ์๋ ์์ต๋๋ค:"
#: src/android/aidl/deploy.md:20
msgid ""
"```shell\n"
"$ $ adb shell service call birthdayservice 1 s16 Bob i32 24\n"
"Result: Parcel(\n"
" 0x00000000: 00000000 00000036 00610048 00700070 '....6...H.a.p.p.'\n"
" 0x00000010: 00200079 00690042 00740072 00640068 'y. .B.i.r.t.h.d.'\n"
" 0x00000020: 00790061 00420020 0062006f 0020002c 'a.y. .B.o.b.,. .'\n"
" 0x00000030: 006f0063 0067006e 00610072 00750074 'c.o.n.g.r.a.t.u.'\n"
" 0x00000040: 0061006c 00690074 006e006f 00200073 'l.a.t.i.o.n.s. .'\n"
" 0x00000050: 00690077 00680074 00740020 00650068 'w.i.t.h. .t.h.e.'\n"
" 0x00000060: 00320020 00200034 00650079 00720061 ' .2.4. .y.e.a.r.'\n"
" 0x00000070: 00210073 00000000 's.!..... ')\n"
"```"
msgstr ""
#: src/android/aidl/client.md:1
msgid "# AIDL Client"
msgstr "# AIDL ํด๋ผ์ด์ธํธ"
#: src/android/aidl/client.md:3
msgid "Finally, we can create a Rust client for our new service."
msgstr "๋ง์ง๋ง์ผ๋ก, ์๊น ์ถ๊ฐํ ์๋น์ค์ ๋ํ ํด๋ผ์ด์ธํธ๋ฅผ ๋ฌ์คํธ๋ก ๋ง๋ค๊ฒ ์ต๋๋ค."
#: src/android/aidl/client.md:5
msgid "*birthday_service/src/client.rs*:"
msgstr ""
#: src/android/aidl/client.md:7
msgid ""
"```rust,ignore\n"
"//! Birthday service.\n"
"use com_example_birthdayservice::aidl::com::example::birthdayservice::IBirthdayService::IBirthdayService;\n"
"use com_example_birthdayservice::binder;\n"
"\n"
"const SERVICE_IDENTIFIER: &str = \"birthdayservice\";\n"
"\n"
"/// Connect to the BirthdayService.\n"
"pub fn connect() -> Result, binder::StatusCode> {\n"
" binder::get_interface(SERVICE_IDENTIFIER)\n"
"}\n"
"\n"
"/// Call the birthday service.\n"
"fn main() -> Result<(), binder::Status> {\n"
" let name = std::env::args()\n"
" .nth(1)\n"
" .unwrap_or_else(|| String::from(\"Bob\"));\n"
" let years = std::env::args()\n"
" .nth(2)\n"
" .and_then(|arg| arg.parse::().ok())\n"
" .unwrap_or(42);\n"
"\n"
" binder::ProcessState::start_thread_pool();\n"
" let service = connect().expect(\"Failed to connect to BirthdayService\");\n"
" let msg = service.wishHappyBirthday(&name, years)?;\n"
" println!(\"{msg}\");\n"
" Ok(())\n"
"}\n"
"```"
msgstr ""
#: src/android/aidl/client.md:39
msgid ""
"```javascript\n"
"rust_binary {\n"
" name: \"birthday_client\",\n"
" crate_name: \"birthday_client\",\n"
" srcs: [\"src/client.rs\"],\n"
" rustlibs: [\n"
" \"com.example.birthdayservice-rust\",\n"
" \"libbinder_rs\",\n"
" ],\n"
" prefer_rlib: true,\n"
"}\n"
"```"
msgstr ""
#: src/android/aidl/client.md:52
msgid "Notice that the client does not depend on `libbirthdayservice`."
msgstr "ํด๋ผ์ด์ธํธ๋ `libbirthdayservice`์ ์์กดํ์ง ์์์ ์ฃผ๋ชฉํ์ธ์."
#: src/android/aidl/client.md:54
msgid "Build, push, and run the client on your device:"
msgstr "๋น๋ํ๊ณ , ๊ฐ์ ๋๋ฐ์ด์ค๋ก ๋ฃ๊ณ , ์คํํฉ๋๋ค:"
#: src/android/aidl/client.md:56
msgid ""
"```shell\n"
"$ m birthday_client\n"
"$ adb push $ANDROID_PRODUCT_OUT/system/bin/birthday_client /data/local/tmp\n"
"$ adb shell /data/local/tmp/birthday_client Charlie 60\n"
"Happy Birthday Charlie, congratulations with the 60 years!\n"
"```"
msgstr ""
#: src/android/aidl/changing.md:1
msgid "# Changing API"
msgstr "# API ์์ "
#: src/android/aidl/changing.md:3
msgid ""
"Let us extend the API with more functionality: we want to let clients specify a\n"
"list of lines for the birthday card:"
msgstr "API๋ฅผ ํ์ฅํ์ฌ ๋ ๋ง์ ๊ธฐ๋ฅ์ ์ ๊ณตํด ๋ด
์๋ค. ํด๋ผ์ด์ธํธ๊ฐ ์์ผ ์นด๋์ ๋ด๊ธธ ๋ด์ฉ์ ์ง์ ํ ์ ์๋๋ก ํ๊ฒ ์ต๋๋ค:"
#: src/android/aidl/changing.md:6
msgid ""
"```java\n"
"package com.example.birthdayservice;\n"
"\n"
"/** Birthday service interface. */\n"
"interface IBirthdayService {\n"
" /** Generate a Happy Birthday message. */\n"
" String wishHappyBirthday(String name, int years, in String[] text);\n"
"}\n"
"```"
msgstr ""
#: src/android/logging.md:1
msgid "# Logging"
msgstr "# ๋ก๊น
"
#: src/android/logging.md:3
msgid ""
"You should use the `log` crate to automatically log to `logcat` (on-device) or\n"
"`stdout` (on-host):"
msgstr "`log` ํฌ๋ ์ดํธ๋ฅผ ์ฌ์ฉํ๋ฉด ์๋๋ก์ด๋ ๋๋ฐ์ด์ค ์์์ ์ํ๋ ๋์๋ `logcat`์ผ๋ก, ํธ์คํธ์์ ์ํ๋ ๋์๋ `stdout`์ผ๋ก ๋ก๊ทธ๊ฐ ์๋์ผ๋ก ์ถ๋ ฅ์ด ๋๋๋ก ํ ์ ์์ต๋๋ค:"
#: src/android/logging.md:6
msgid "_hello_rust_logs/Android.bp_:"
msgstr ""
#: src/android/logging.md:8
msgid ""
"```javascript\n"
"rust_binary {\n"
" name: \"hello_rust_logs\",\n"
" crate_name: \"hello_rust_logs\",\n"
" srcs: [\"src/main.rs\"],\n"
" rustlibs: [\n"
" \"liblog_rust\",\n"
" \"liblogger\",\n"
" ],\n"
" prefer_rlib: true,\n"
" host_supported: true,\n"
"}\n"
"```"
msgstr ""
#: src/android/logging.md:22
msgid "_hello_rust_logs/src/main.rs_:"
msgstr ""
#: src/android/logging.md:24
msgid ""
"```rust,ignore\n"
"//! Rust logging demo.\n"
"\n"
"use log::{debug, error, info};\n"
"\n"
"/// Logs a greeting.\n"
"fn main() {\n"
" logger::init(\n"
" logger::Config::default()\n"
" .with_tag_on_device(\"rust\")\n"
" .with_min_level(log::Level::Trace),\n"
" );\n"
" debug!(\"Starting program.\");\n"
" info!(\"Things are going fine.\");\n"
" error!(\"Something went wrong!\");\n"
"}\n"
"```"
msgstr ""
#: src/android/logging.md:42 src/android/interoperability/with-c/bindgen.md:98
#: src/android/interoperability/with-c/rust.md:73
msgid "Build, push, and run the binary on your device:"
msgstr "๋น๋ํ๊ณ , ๊ฐ์ ๋๋ฐ์ด์ค์ ๋ฃ๊ณ , ์คํํฉ๋๋ค:"
#: src/android/logging.md:44
msgid ""
"```shell\n"
"$ m hello_rust_logs\n"
"$ adb push $ANDROID_PRODUCT_OUT/system/bin/hello_rust_logs /data/local/tmp\n"
"$ adb shell /data/local/tmp/hello_rust_logs\n"
"```"
msgstr ""
#: src/android/logging.md:50
msgid "The logs show up in `adb logcat`:"
msgstr "`adb logcat`์ปค๋งจ๋๋ก ๋ก๊ทธ๋ฅผ ํ์ธํฉ๋๋ค:"
#: src/android/logging.md:52
msgid ""
"```shell\n"
"$ adb logcat -s rust\n"
"09-08 08:38:32.454 2420 2420 D rust: hello_rust_logs: Starting program.\n"
"09-08 08:38:32.454 2420 2420 I rust: hello_rust_logs: Things are going fine.\n"
"09-08 08:38:32.454 2420 2420 E rust: hello_rust_logs: Something went wrong!\n"
"```"
msgstr ""
#: src/android/interoperability.md:1
msgid "# Interoperability"
msgstr "# ์ํธ์ด์ฉ์ฑ(Interoperability)"
#: src/android/interoperability.md:3
msgid ""
"Rust has excellent support for interoperability with other languages. This means\n"
"that you can:"
msgstr "๋ฌ์คํธ๋ ๋ค์๊ณผ ๊ฐ์ด ๋ค๋ฅธ ์ธ์ด์์ ์ํธ์ด์ฉ์ฑ์ ํ๋ฅญํ ์ง์ํฉ๋๋ค:"
#: src/android/interoperability.md:6
msgid ""
"* Call Rust functions from other languages.\n"
"* Call functions written in other languages from Rust."
msgstr ""
"* ํ ์ธ์ด์์ ๋ฌ์คํธ ํจ์๋ฅผ ํธ์ถํฉ๋๋ค.\n"
"* ํ ์ธ์ด์ ํจ์๋ฅผ ๋ฌ์คํธ์์ ํธ์ถํฉ๋๋ค."
#: src/android/interoperability.md:9
msgid ""
"When you call functions in a foreign language we say that you're using a\n"
"_foreign function interface_, also known as FFI."
msgstr "ํ ์ธ์ด์ ํจ์๋ฅผ ํธ์ถํด์ ์ฌ์ฉํ๋ ๊ฒ์ FFI(foreign function interface)๋ผ๊ณ ํฉ๋๋ค."
#: src/android/interoperability/with-c.md:1
msgid "# Interoperability with C"
msgstr "# C์์ ์ํธ์ด์ฉ์ฑ"
#: src/android/interoperability/with-c.md:3
msgid ""
"Rust has full support for linking object files with a C calling convention.\n"
"Similarly, you can export Rust functions and call them from C."
msgstr "๋ฌ์คํธ๋ C ํธ์ถ๊ท์ฝ์ ๋ฐ๋ฅด๋ ์ค๋ธ์ ํธ ํ์ผ๊ณผ ๋งํนํ ์ ์์ต๋๋ค. ๋ํ, ๋ฐ๋๋ก ๋ฌ์คํธ ํจ์๋ฅผ ๋ด๋ณด๋ด์ C์์ ํธ์ถ ํ ์ ๋ ์์ต๋๋ค."
#: src/android/interoperability/with-c.md:6
msgid "You can do it by hand if you want:"
msgstr "์ํ๋ค๋ฉด ์๋์ ๊ฐ์ด ์๋์ผ๋ก ์ฝ๋ฉํ ์ ์์ต๋๋ค:"
#: src/android/interoperability/with-c.md:8
msgid ""
"```rust\n"
"extern \"C\" {\n"
" fn abs(x: i32) -> i32;\n"
"}\n"
"\n"
"fn main() {\n"
" let x = -42;\n"
" let abs_x = unsafe { abs(x) };\n"
" println!(\"{x}, {abs_x}\");\n"
"}\n"
"```"
msgstr ""
#: src/android/interoperability/with-c.md:20
msgid ""
"We already saw this in the [Safe FFI Wrapper\n"
"exercise](../../exercises/day-3/safe-ffi-wrapper.md)."
msgstr "์ฐ๋ฆฌ๋ ์ด๋ฏธ [Safe FFI ๋ํผ ์ฐ์ต๋ฌธ์ ](../../exercises/day-3/safe-ffi-wrapper.md)์์ ์ด๋ฅผ ๋ค๋ฃจ์์ต๋๋ค."
#: src/android/interoperability/with-c.md:23
msgid ""
"> This assumes full knowledge of the target platform. Not recommended for\n"
"> production."
msgstr "> ์ด๋ฌํ ๋ฐฉ๋ฒ์ ํ๊ฒ ํ๋ซํผ์ ๋ชจ๋ ๋ถ๋ถ์ ์ฌ์ ์ ์๊ณ ์๋ค๋ ์ ์ ๋ฅผ ๊น๊ณ ์์ต๋๋ค. ์์ฉ ํ๋ก์ ํธ์์๋ ๊ถ์ฅํ์ง ์์ต๋๋ค."
#: src/android/interoperability/with-c.md:26
msgid "We will look at better options next."
msgstr "์ข ๋ ๋์ ์ต์
์ ์ดํด๋ณด๊ฒ ์ต๋๋ค."
#: src/android/interoperability/with-c/bindgen.md:1
msgid "# Using Bindgen"
msgstr "# Bindgen ์ฌ์ฉํ๊ธฐ"
#: src/android/interoperability/with-c/bindgen.md:3
msgid ""
"The [bindgen](https://rust-lang.github.io/rust-bindgen/introduction.html) tool\n"
"can auto-generate bindings from a C header file."
msgstr "[bindgen](https://rust-lang.github.io/rust-bindgen/introduction.html)๋ C ํค๋ํ์ผ์์ ๋ฌ์คํธ ๋ฐ์ธ๋ฉ์ ์๋์ผ๋ก ์์ฑํ๋ ๋๊ตฌ์
๋๋ค."
#: src/android/interoperability/with-c/bindgen.md:6
msgid "First create a small C library:"
msgstr "๋จผ์ ์์ C๋ผ์ด๋ธ๋ฌ๋ฆฌ๋ฅผ ๋ง๋ค์ด ๋ณด๊ฒ ์ต๋๋ค:"
#: src/android/interoperability/with-c/bindgen.md:8
msgid "_interoperability/bindgen/libbirthday.h_:"
msgstr ""
#: src/android/interoperability/with-c/bindgen.md:10
msgid ""
"```c\n"
"typedef struct card {\n"
" const char* name;\n"
" int years;\n"
"} card;\n"
"\n"
"void print_card(const card* card);\n"
"```"
msgstr ""
#: src/android/interoperability/with-c/bindgen.md:19
msgid "_interoperability/bindgen/libbirthday.c_:"
msgstr ""
#: src/android/interoperability/with-c/bindgen.md:21
msgid ""
"```c\n"
"#include \n"
"#include \"libbirthday.h\"\n"
"\n"
"void print_card(const card* card) {\n"
" printf(\"+--------------\\n\");\n"
" printf(\"| Happy Birthday %s!\\n\", card->name);\n"
" printf(\"| Congratulations with the %i years!\\n\", card->years);\n"
" printf(\"+--------------\\n\");\n"
"}\n"
"```"
msgstr ""
#: src/android/interoperability/with-c/bindgen.md:33
msgid "Add this to your `Android.bp` file:"
msgstr "`Android.bp` ํ์ผ์ ์๋๋ฅผ ์ถ๊ฐํฉ๋๋ค:"
#: src/android/interoperability/with-c/bindgen.md:35
#: src/android/interoperability/with-c/bindgen.md:55
#: src/android/interoperability/with-c/bindgen.md:69
#: src/android/interoperability/with-c/bindgen.md:108
msgid "_interoperability/bindgen/Android.bp_:"
msgstr ""
#: src/android/interoperability/with-c/bindgen.md:37
msgid ""
"```javascript\n"
"cc_library {\n"
" name: \"libbirthday\",\n"
" srcs: [\"libbirthday.c\"],\n"
"}\n"
"```"
msgstr ""
#: src/android/interoperability/with-c/bindgen.md:44
msgid ""
"Create a wrapper header file for the library (not strictly needed in this\n"
"example):"
msgstr "๋ผ์ด๋ธ๋ฌ๋ฆฌ์ ๋ํ ํค๋ ํ์ผ์ ๋ง๋ญ๋๋ค(์ด ์์์์๋ ๋ฐ๋์ ํ์ํ ๊ฒ์ ์๋๋๋ค.):"
#: src/android/interoperability/with-c/bindgen.md:47
msgid "_interoperability/bindgen/libbirthday_wrapper.h_:"
msgstr ""
#: src/android/interoperability/with-c/bindgen.md:49
msgid ""
"```c\n"
"#include \"libbirthday.h\"\n"
"```"
msgstr ""
#: src/android/interoperability/with-c/bindgen.md:53
msgid "You can now auto-generate the bindings:"
msgstr "์ด์ ๋ฐ์ธ๋ฉ์ ์๋์ผ๋ก ์์ฑํ ์ ์์ต๋๋ค:"
#: src/android/interoperability/with-c/bindgen.md:57
msgid ""
"```javascript\n"
"rust_bindgen {\n"
" name: \"libbirthday_bindgen\",\n"
" crate_name: \"birthday_bindgen\",\n"
" wrapper_src: \"libbirthday_wrapper.h\",\n"
" source_stem: \"bindings\",\n"
" static_libs: [\"libbirthday\"],\n"
"}\n"
"```"
msgstr ""
#: src/android/interoperability/with-c/bindgen.md:67
msgid "Finally, we can use the bindings in our Rust program:"
msgstr "๋ง์นจ๋ด, ๋ฌ์คํธ ํ๋ก๊ทธ๋จ์์ ๋ฐ์ธ๋ฉ์ ์ฌ์ฉํ ์ ์์ต๋๋ค:"
#: src/android/interoperability/with-c/bindgen.md:71
msgid ""
"```javascript\n"
"rust_binary {\n"
" name: \"print_birthday_card\",\n"
" srcs: [\"main.rs\"],\n"
" rustlibs: [\"libbirthday_bindgen\"],\n"
"}\n"
"```"
msgstr ""
#: src/android/interoperability/with-c/bindgen.md:79
msgid "_interoperability/bindgen/main.rs_:"
msgstr ""
#: src/android/interoperability/with-c/bindgen.md:81
msgid ""
"```rust,compile_fail\n"
"//! Bindgen demo.\n"
"\n"
"use birthday_bindgen::{card, print_card};\n"
"\n"
"fn main() {\n"
" let name = std::ffi::CString::new(\"Peter\").unwrap();\n"
" let card = card {\n"
" name: name.as_ptr(),\n"
" years: 42,\n"
" };\n"
" unsafe {\n"
" print_card(&card as *const card);\n"
" }\n"
"}\n"
"```"
msgstr ""
#: src/android/interoperability/with-c/bindgen.md:100
msgid ""
"```shell\n"
"$ m print_birthday_card\n"
"$ adb push $ANDROID_PRODUCT_OUT/system/bin/print_birthday_card /data/local/tmp\n"
"$ adb shell /data/local/tmp/print_birthday_card\n"
"```"
msgstr ""
#: src/android/interoperability/with-c/bindgen.md:106
msgid "Finally, we can run auto-generated tests to ensure the bindings work:"
msgstr "๋ง์ง๋ง์ผ๋ก, ๋ฐ์ธ๋ฉ์ด ์ ์๋ํ๋์ง ํ์ธํ๊ธฐ ์ํด, ์๋ ์์ฑ๋ ํ
์คํธ๋ฅผ ์คํํด ๋ณด๊ฒ ์ต๋๋ค:"
#: src/android/interoperability/with-c/bindgen.md:110
msgid ""
"```javascript\n"
"rust_test {\n"
" name: \"libbirthday_bindgen_test\",\n"
" srcs: [\":libbirthday_bindgen\"],\n"
" crate_name: \"libbirthday_bindgen_test\",\n"
" test_suites: [\"general-tests\"],\n"
" auto_gen_config: true,\n"
" clippy_lints: \"none\", // Generated file, skip linting\n"
" lints: \"none\",\n"
"}\n"
"```"
msgstr ""
#: src/android/interoperability/with-c/bindgen.md:122
msgid ""
"```shell\n"
"$ atest libbirthday_bindgen_test\n"
"```"
msgstr ""
#: src/android/interoperability/with-c/rust.md:1
msgid "# Calling Rust"
msgstr "# C์์ ๋ฌ์คํธ ํธ์ถ"
#: src/android/interoperability/with-c/rust.md:3
msgid "Exporting Rust functions and types to C is easy:"
msgstr "๋ฌ์คํธ์์ ํ์
๊ณผ ํจ์๋ฅผ C๋ก ๋ด๋ณด๋ด๋ ๊ฒ์ ๊ฐ๋จํฉ๋๋ค:"
#: src/android/interoperability/with-c/rust.md:5
msgid "_interoperability/rust/libanalyze/analyze.rs_"
msgstr ""
#: src/android/interoperability/with-c/rust.md:7
msgid ""
"```rust,editable\n"
"//! Rust FFI demo.\n"
"#![deny(improper_ctypes_definitions)]\n"
"\n"
"use std::os::raw::c_int;\n"
"\n"
"/// Analyze the numbers.\n"
"#[no_mangle]\n"
"pub extern \"C\" fn analyze_numbers(x: c_int, y: c_int) {\n"
" if x < y {\n"
" println!(\"x ({x}) is smallest!\");\n"
" } else {\n"
" println!(\"y ({y}) is probably larger than x ({x})\");\n"
" }\n"
"}\n"
"```"
msgstr ""
#: src/android/interoperability/with-c/rust.md:24
msgid "_interoperability/rust/libanalyze/analyze.h_"
msgstr ""
#: src/android/interoperability/with-c/rust.md:26
msgid ""
"```c\n"
"#ifndef ANALYSE_H\n"
"#define ANALYSE_H\n"
"\n"
"extern \"C\" {\n"
"void analyze_numbers(int x, int y);\n"
"}\n"
"\n"
"#endif\n"
"```"
msgstr ""
#: src/android/interoperability/with-c/rust.md:37
msgid "_interoperability/rust/libanalyze/Android.bp_"
msgstr ""
#: src/android/interoperability/with-c/rust.md:39
msgid ""
"```javascript\n"
"rust_ffi {\n"
" name: \"libanalyze_ffi\",\n"
" crate_name: \"analyze_ffi\",\n"
" srcs: [\"analyze.rs\"],\n"
" include_dirs: [\".\"],\n"
"}\n"
"```"
msgstr ""
#: src/android/interoperability/with-c/rust.md:48
msgid "We can now call this from a C binary:"
msgstr "์ด์ ์ด ๋ฌ์คํธ ํจ์๋ฅผ C๋ฐ์ด๋๋ฆฌ์์ ํธ์ถํ ์ ์์ต๋๋ค:"
#: src/android/interoperability/with-c/rust.md:50
msgid "_interoperability/rust/analyze/main.c_"
msgstr ""
#: src/android/interoperability/with-c/rust.md:52
msgid ""
"```c\n"
"#include \"analyze.h\"\n"
"\n"
"int main() {\n"
" analyze_numbers(10, 20);\n"
" analyze_numbers(123, 123);\n"
" return 0;\n"
"}\n"
"```"
msgstr ""
#: src/android/interoperability/with-c/rust.md:62
msgid "_interoperability/rust/analyze/Android.bp_"
msgstr ""
#: src/android/interoperability/with-c/rust.md:64
msgid ""
"```javascript\n"
"cc_binary {\n"
" name: \"analyze_numbers\",\n"
" srcs: [\"main.c\"],\n"
" static_libs: [\"libanalyze_ffi\"],\n"
"}\n"
"```"
msgstr ""
#: src/android/interoperability/with-c/rust.md:75
msgid ""
"```shell\n"
"$ m analyze_numbers\n"
"$ adb push $ANDROID_PRODUCT_OUT/system/bin/analyze_numbers /data/local/tmp\n"
"$ adb shell /data/local/tmp/analyze_numbers\n"
"```"
msgstr ""
#: src/android/interoperability/with-c/rust.md:83
msgid ""
"`#[no_mangle]` disables Rust's usual name mangling, so the exported symbol will just be the name of\n"
"the function. You can also use `#[export_name = \"some_name\"]` to specify whatever name you want."
msgstr "`#[no_mangle]`์ ๋ฌ์คํธ์ ๋ค์ ๋งน๊ธ๋ง(name mangling)์ ๋นํ์ฑํํ๋ฏ๋ก ์ธ๋ถ๋ก ๋
ธ์ถ๋๋ ์ฌ๋ณผ์ ์ด๋ฆ์ ํจ์์ ์ด๋ฆ ๊ทธ๋๋ก๊ฐ ๋ฉ๋๋ค. ์ฌ๋ณผ ์ด๋ฆ์ ๋ฐ๊พธ๊ณ ์ถ๋ค๋ฉด `#[export_name = \"some_name\"]`์ ์ฌ์ฉํฉ๋๋ค."
#: src/android/interoperability/cpp.md:1
msgid "# With C++"
msgstr "# C++ ์์ ์ํธ์ด์ฉ์ฑ"
#: src/android/interoperability/cpp.md:3
msgid ""
"The [CXX crate][1] makes it possible to do safe interoperability between Rust\n"
"and C++."
msgstr "[CXX ํฌ๋ ์ดํธ][1]๋ ๋ฌ์คํธ์ C++ ์ฌ์ด์ ์์ ํ ์ํธ์ด์ฉ์ฑ์ ๊ฐ๋ฅํ๊ฒ ํด์ค๋๋ค."
#: src/android/interoperability/cpp.md:6
msgid "The overall approach looks like this:"
msgstr "์ ์ฒด์ ์ธ ์ ๊ทผ ๋ฐฉ๋ฒ์ ๋ค์๊ณผ ๊ฐ์ต๋๋ค:"
#: src/android/interoperability/cpp.md:8
msgid "![](\"cpp/overview.svg\")
"
msgstr ""
#: src/android/interoperability/cpp.md:10
msgid "See the [CXX tutorial][2] for an full example of using this."
msgstr "์ฌ์ฉํ๋ ๋ฐฉ๋ฒ์ ๋ํด์๋[CXX ํํ ๋ฆฌ์ผ][2] ๋ฅผ ์ฐธ์กฐํฉ๋๋ค."
#: src/android/interoperability/java.md:1
msgid "# Interoperability with Java"
msgstr "# Java์์ ์ํธ์ด์ฉ์ฑ"
#: src/android/interoperability/java.md:3
msgid ""
"Java can load shared objects via [Java Native Interface\n"
"(JNI)](https://en.wikipedia.org/wiki/Java_Native_Interface). The [`jni`\n"
"crate](https://docs.rs/jni/) allows you to create a compatible library."
msgstr "์๋ฐ๋ [Java Native Interface(JNI)](https://en.wikipedia.org/wiki/Java_Native_Interface)๋ฅผ ํตํด ๊ณต์ ๋ผ์ด๋ธ๋ฌ๋ฆฌ๋ฅผ ๋ก๋ํ ์ ์์ต๋๋ค. [`jni` ํฌ๋ ์ดํธ](https://docs.rs/jni/)๋ฅผ ์ฌ์ฉํ์ฌ JNI ๋ผ์ด๋ธ๋ฌ๋ฆฌ๋ฅผ ๋ง๋ค ์ ์์ต๋๋ค."
#: src/android/interoperability/java.md:7
msgid "First, we create a Rust function to export to Java:"
msgstr "๋จผ์ , ์๋ฐ๋ก ๋ด๋ณด๋ผ ๋ฌ์คํธ ํจ์๋ฅผ ์์ฑํฉ๋๋ค:"
#: src/android/interoperability/java.md:9
msgid "_interoperability/java/src/lib.rs_:"
msgstr ""
#: src/android/interoperability/java.md:11
msgid ""
"```rust,compile_fail\n"
"//! Rust <-> Java FFI demo.\n"
"\n"
"use jni::objects::{JClass, JString};\n"
"use jni::sys::jstring;\n"
"use jni::JNIEnv;\n"
"\n"
"/// HelloWorld::hello method implementation.\n"
"#[no_mangle]\n"
"pub extern \"system\" fn Java_HelloWorld_hello(\n"
" env: JNIEnv,\n"
" _class: JClass,\n"
" name: JString,\n"
") -> jstring {\n"
" let input: String = env.get_string(name).unwrap().into();\n"
" let greeting = format!(\"Hello, {input}!\");\n"
" let output = env.new_string(greeting).unwrap();\n"
" output.into_inner()\n"
"}\n"
"```"
msgstr ""
#: src/android/interoperability/java.md:32
#: src/android/interoperability/java.md:62
msgid "_interoperability/java/Android.bp_:"
msgstr ""
#: src/android/interoperability/java.md:34
msgid ""
"```javascript\n"
"rust_ffi_shared {\n"
" name: \"libhello_jni\",\n"
" crate_name: \"hello_jni\",\n"
" srcs: [\"src/lib.rs\"],\n"
" rustlibs: [\"libjni\"],\n"
"}\n"
"```"
msgstr ""
#: src/android/interoperability/java.md:43
msgid "Finally, we can call this function from Java:"
msgstr "์๋ฐ์์ ์ด ํจ์๋ฅผ ํธ์ถ ํ ์ ์์ต๋๋ค:"
#: src/android/interoperability/java.md:45
msgid "_interoperability/java/HelloWorld.java_:"
msgstr ""
#: src/android/interoperability/java.md:47
msgid ""
"```java\n"
"class HelloWorld {\n"
" private static native String hello(String name);\n"
"\n"
" static {\n"
" System.loadLibrary(\"hello_jni\");\n"
" }\n"
"\n"
" public static void main(String[] args) {\n"
" String output = HelloWorld.hello(\"Alice\");\n"
" System.out.println(output);\n"
" }\n"
"}\n"
"```"
msgstr ""
#: src/android/interoperability/java.md:64
msgid ""
"```javascript\n"
"java_binary {\n"
" name: \"helloworld_jni\",\n"
" srcs: [\"HelloWorld.java\"],\n"
" main_class: \"HelloWorld\",\n"
" required: [\"libhello_jni\"],\n"
"}\n"
"```"
msgstr ""
#: src/android/interoperability/java.md:73
msgid "Finally, you can build, sync, and run the binary:"
msgstr "๋ง์ง๋ง์ผ๋ก ๋ฐ์ด๋๋ฆฌ๋ฅผ ๋น๋, ์ฑํฌ, ์คํํฉ๋๋ค:"
#: src/android/interoperability/java.md:75
msgid ""
"```shell\n"
"$ m helloworld_jni\n"
"$ adb sync # requires adb root && adb remount\n"
"$ adb shell /system/bin/helloworld_jni\n"
"```"
msgstr ""
#: src/exercises/day-4/android.md:3
msgid ""
"For the last exercise, we will look at one of the projects you work with. Let us\n"
"group up and do this together. Some suggestions:"
msgstr "๋ง์ง๋ง ์ฐ์ต๋ฌธ์ ๋ ์ฌ๋ฌ๋ถ์ด ์์
ํ๊ณ ์๋ ํ๋ก์ ํธ ์ค ํ๋๋ฅผ FFI๋ก ๋ฌ์คํธ์ ์ฐ๊ณ ํด๋ณด๋ ๊ฒ์
๋๋ค. ๋ช ๊ฐ์ง ์์์
๋๋ค:"
#: src/exercises/day-4/android.md:6
msgid ""
"* Call your AIDL service with a client written in Rust.\n"
"\n"
"* Move a function from your project to Rust and call it."
msgstr ""
"* ๋น์ ์ AIDL์๋น์ค๋ฅผ ๋ฌ์คํธ ํด๋ผ์ด์ธํธ์์ ํธ์ถํด๋ด
๋๋ค.\n"
"\n"
"* ๋น์ ์ ํ๋ก์ ํธ์ ํจ์๋ฅผ ๋ฌ์คํธ๋ก ์ฎ๊ธฐ๊ณ ํธ์ถํด๋ด
๋๋ค."
#: src/exercises/day-4/android.md:12
msgid ""
"No solution is provided here since this is open-ended: it relies on someone in\n"
"the class having a piece of code which you can turn in to Rust on the fly."
msgstr "์ด ์ฐ์ต๋ฌธ์ ๋ ์ด๋ ค์๊ธฐ ๋๋ฌธ์ ํด๋ต์ด ์ ๊ณต๋์ง ์์ต๋๋ค. ํด๋์ค์์ ์ ์ถ๋ ์ฝ๋์ ์์กดํฉ๋๋ค."
#: src/thanks.md:1
msgid "# Thanks!"
msgstr "# ๊ฐ์ฌ์ธ์ฌ"
#: src/thanks.md:3
msgid ""
"_Thank you for taking Comprehensive Rust ๐ฆ!_ We hope you enjoyed it and that it\n"
"was useful."
msgstr "Comprehensive Rust ๐ฆ๋ฅผ ์ด์ฉํด ์ฃผ์
์ ๊ฐ์ฌํฉ๋๋ค. ์ฆ๊ฒ๊ณ ์ ์ตํ ์๊ฐ์ด์๊ธฐ๋ฅผ ๋ฐ๋๋๋ค."
#: src/thanks.md:6
msgid ""
"We've had a lot of fun putting the course together. The course is not perfect,\n"
"so if you spotted any mistakes or have ideas for improvements, please get in\n"
"[contact with us on\n"
"GitHub](https://github.com/google/comprehensive-rust/discussions). We would love\n"
"to hear from you."
msgstr "๊ฐ์๊ฐ ์๋ฒฝํ์ง ์์ผ๋ ์ค์๋ ๊ฐ์ ์ ์ด ์๋ค๋ฉด ์ธ์ ๋ ์ง [๊นํ๋ธ](https://github.com/google/comprehensive-rust/discussions)๋ก ์ฐ๋ฝ์ฃผ์ธ์."
#: src/other-resources.md:1
msgid "# Other Rust Resources"
msgstr "# ๋ฌ์คํธ ์ฐธ๊ณ ์๋ฃ"
#: src/other-resources.md:3
msgid ""
"The Rust community has created a wealth of high-quality and free resources\n"
"online."
msgstr "๋ฌ์คํธ ์ปค๋ฎค๋ํฐ๋ ์จ๋ผ์ธ์์ ๊ณ ํ์ง์ ๋ฌด๋ฃ ์์ค๋ฅผ ๋ง๋ค์์ต๋๋ค."
#: src/other-resources.md:6
msgid "## Official Documentation"
msgstr "## ๊ณต์ ๋ฌธ์๋ค"
#: src/other-resources.md:8
msgid "The Rust project hosts many resources. These cover Rust in general:"
msgstr "๋ฌ์คํธ ํ๋ก์ ํธ์๋ ์ฐธ์กฐํ ๋งํ ์๋ฃ๊ฐ ๋ง์ต๋๋ค. ์ผ๋ฐ์ ์ธ ๋ด์ฉ์ ๋ค๋ฃจ๋ ๋ช๊ฐ์ง ์ฐธ๊ณ ๋ฌธ์๋ค์
๋๋ค:"
#: src/other-resources.md:10
msgid ""
"* [The Rust Programming Language](https://doc.rust-lang.org/book/): the\n"
" canonical free book about Rust. Covers the language in detail and includes a\n"
" few projects for people to build.\n"
"* [Rust By Example](https://doc.rust-lang.org/rust-by-example/): covers the Rust\n"
" syntax via a series of examples which showcase different constructs. Sometimes\n"
" includes small exercises where you are asked to expand on the code in the\n"
" examples.\n"
"* [Rust Standard Library](https://doc.rust-lang.org/std/): full documentation of\n"
" the standard library for Rust.\n"
"* [The Rust Reference](https://doc.rust-lang.org/reference/): an incomplete book\n"
" which describes the Rust grammar and memory model."
msgstr ""
"* [The Rust Programming Language](https://doc.rust-lang.org/book/): ๋ฌ์คํธ์ ๋ํ ๋ฌด๋ฃ ํ์ค ์์ ์
๋๋ค. ์ธ์ด์ ๋ํ ์์ธํ ์ค๋ช
๊ณผ ์ฌ๋๋ค์ด ๋น๋ ํ ์ ์๋ ๋ช๊ฐ์ง ํ๋ก์ ํธ๋ฅผ ํฌํจํฉ๋๋ค.\n"
"* [Rust By Example](https://doc.rust-lang.org/rust-by-example/): ์ฌ๋ฌ ์์ ๋ฅผ ํตํด ๋ฌ์คํธ์ ๋ฌธ๋ฒ์ ๋ณด์ฌ์ฃผ๋ฉฐ ๋๋๋ก ์ฝ๋๋ฅผ ํ์ฅํ๋ ์ฝ๊ฐ์ ์ฐ์ต๋ฌธ์ ๋ค์ด ํฌํจ๋์ด ์์ต๋๋ค.\n"
"* [Rust Standard Library](https://doc.rust-lang.org/std/): ๋ฌ์คํธ ํ์ค ๋ผ์ด๋ธ๋ฌ๋ฆฌ ์ ์ฒด ๋ฌธ์์
๋๋ค.\n"
"* [The Rust Reference](https://doc.rust-lang.org/reference/): ๋ฉ๋ชจ๋ฆฌ ๋ชจ๋ธ๋ง๊ณผ ๋ฌ์คํธ ๋ฌธ๋ฒ์ ์ค๋ช
ํ๋ ๋ฌธ์์
๋๋ค.(์์ง ๋ถ์์ ํ๋คํจ)"
#: src/other-resources.md:22
msgid "More specialized guides hosted on the official Rust site:"
msgstr "์ข ๋ ์ ๋ฌธ์ ์ธ ๊ณต์ ๊ฐ์ด๋์
๋๋ค:"
#: src/other-resources.md:24
msgid ""
"* [The Rustonomicon](https://doc.rust-lang.org/nomicon/): covers unsafe Rust,\n"
" including working with raw pointers and interfacing with other languages\n"
" (FFI).\n"
"* [Asynchronous Programming in Rust](https://rust-lang.github.io/async-book/):\n"
" covers the new asynchronous programming model which was introduced after the\n"
" Rust Book was written.\n"
"* [The Embedded Rust Book](https://doc.rust-lang.org/stable/embedded-book/): an\n"
" introduction to using Rust on embedded devices without an operating system."
msgstr ""
"* [The Rustonomicon](https://doc.rust-lang.org/nomicon/): ์์ ํ์ง ์์ ๋ฌ์คํธ, FFI, rawํฌ์ธํฐ ์์
์ ๋ค๋ฃน๋๋ค.\n"
"* [Asynchronous Programming in Rust](https://rust-lang.github.io/async-book/): ๋ฌ์คํธ ๋ถ์ด ์์ฑ ๋ ์ดํ ๋์
๋ ์๋ก์ด ๋น๋๊ธฐ ํ๋ก๊ทธ๋๋ฐ ๋ชจ๋ธ์ ๋ค๋ฃน๋๋ค.\n"
"* [The Embedded Rust Book](https://doc.rust-lang.org/stable/embedded-book/): ์ด์์ฒด์ ๊ฐ ์๋ ์๋ฒ ๋๋ ์ฅ์น์์์ ๋ฌ์คํธ ์ฌ์ฉ๋ฒ์ ์๊ฐํฉ๋๋ค."
#: src/other-resources.md:33
msgid "## Unofficial Learning Material"
msgstr "## ๋น๊ณต์์ ํ์ต ์๋ฃ"
#: src/other-resources.md:35
msgid "A small selection of other guides and tutorial for Rust:"
msgstr "๋ฌ์คํธ์ ๋ํ ๊ธฐํ ์๋ด์์ ํํ ๋ฆฌ์ผ์ ์ผ๋ถ์
๋๋ค:"
#: src/other-resources.md:37
msgid ""
"* [Learn Rust the Dangerous Way](http://cliffle.com/p/dangerust/): covers Rust\n"
" from the perspective of low-level C programmers.\n"
"* [Rust for Embedded C\n"
" Programmers](https://docs.opentitan.org/doc/ug/rust_for_c/): covers Rust from\n"
" the perspective of developers who write firmware in C.\n"
"* [Rust for professionals](https://overexact.com/rust-for-professionals/):\n"
" covers the syntax of Rust using side-by-side comparisons with other languages\n"
" such as C, C++, Java, JavaScript, and Python.\n"
"* [Rust on Exercism](https://exercism.org/tracks/rust): 100+ exercises to help\n"
" you learn Rust.\n"
"* [Ferrous Teaching\n"
" Material](https://ferrous-systems.github.io/teaching-material/index.html): a\n"
" series of small presentations covering both basic and advanced part of the\n"
" Rust language. Other topics such as WebAssembly, and async/await are also\n"
" covered.\n"
"* [Beginner's Series to\n"
" Rust](https://docs.microsoft.com/en-us/shows/beginners-series-to-rust/) and\n"
" [Take your first steps with\n"
" Rust](https://docs.microsoft.com/en-us/learn/paths/rust-first-steps/): two\n"
" Rust guides aimed at new developers. The first is a set of 35 videos and the\n"
" second is a set of 11 modules which covers Rust syntax and basic constructs.\n"
"* [Learn Rust With Entirely Too Many Linked\n"
" Lists](https://rust-unofficial.github.io/too-many-lists/): in-depth\n"
" exploration of Rust's memory management rules, through implementing a few\n"
" different types of list structures."
msgstr ""
"* [Learn Rust the Dangerous Way](http://cliffle.com/p/dangerust/): C์ธ์ด ํ๋ก๊ทธ๋๋จธ ๊ด์ ์์ ๋ฌ์คํธ๋ฅผ ๋ค๋ฃน๋๋ค.\n"
"* [Rust for Embedded C Programmers](https://docs.opentitan.org/doc/ug/rust_for_c/): ์๋ฒ ๋๋ C๊ฐ๋ฐ์(ํ์จ์ด ๊ฐ๋ฐ์)๋ฅผ ์ํ ๋ฌ์คํธ ๊ฐ์ด๋์
๋๋ค.\n"
"* [Rust for professionals](https://overexact.com/rust-for-professionals/): ๋ค๋ฅธ ์ธ์ด(C/C++, Java, Python, Javascript)์์ ๋ณ๋ ฌ๋น๊ต๋ฅผ ์ฌ์ฉํ์ฌ ๋ฌ์คํธ ๋ฌธ๋ฒ์ ๋ค๋ฃน๋๋ค.\n"
"* [Rust on Exercism](https://exercism.org/tracks/rust): ๋ฌ์คํธ๋ฅผ ๋ฐฐ์ฐ๋๋ฐ ๋์์ด ๋๋ 100๊ฐ ์ด์์ ์ฐ์ต๋ฌธ์ \n"
"* [Ferrous Teaching Material](https://ferrous-systems.github.io/teaching-material/index.html): ๋ฌ์คํธ ์ธ์ด์ ๊ธฐ๋ณธ๋ถํฐ ๊ณ ๊ธ์ ์ ๋ถ ๋ค๋ฃจ๋ ์ผ๋ จ์ ์์ ํ๋ ์ ํ
์ด์
, ์น ์ด์
๋ธ๋ฆฌ, async/await ๊ฐ์ ๋ถ๋ถ๋ ํจ๊ป ๋ค๋ฃน๋๋ค.\n"
"* [Beginner's Series to Rust](https://docs.microsoft.com/en-us/shows/beginners-series-to-rust/), [Take your first steps with Rust](https://docs.microsoft.com/en-us/learn/paths/rust-first-steps/): ์ฒซ๋ฒ์งธ๋ 35๊ฐ์ ์๋ฆฌ์ฆ ์์์ด๋ฉฐ ๋๋ฒ์งธ๋ ๋ฌ์คํธ์ ๋ฌธ๋ฒ๊ณผ ๊ตฌ์กฐ๋ฅผ ๋ค๋ฃจ๋ 11๊ฐ์ ๋ชจ๋ ์ธํธ์
๋๋ค.\n"
"* [Learn Rust With Entirely Too Many Linked Lists](https://rust-unofficial.github.io/too-many-lists/): ๋ช๊ฐ์ง ์ ํ์ ๋ฆฌ์คํธ ์๋ฃ๊ตฌ์กฐ๋ฅผ ๊ตฌํํด๋ณด๋ฉด์ ๋ฌ์คํธ์ ๋ฉ๋ชจ๋ฆฌ ๊ด๋ฆฌ ๊ท์น๋ค์ ๊น์ด์๊ฒ ํ์ํฉ๋๋ค."
#: src/other-resources.md:63
msgid ""
"Please see the [Little Book of Rust Books](https://lborb.github.io/book/) for\n"
"even more Rust books."
msgstr "[Little Book of Rust Books](https://lborb.github.io/book/)์์ ๋ ๋ง์ ๋ฌ์คํธ ๋ถ์ ํ์ธํด๋ณด์ธ์."
#: src/credits.md:1
msgid "# Credits"
msgstr "# Credits"
#: src/credits.md:3
msgid ""
"The material here builds on top of the many great sources of Rust documentation.\n"
"See the page on [other resources](other-resources.md) for a full list of useful\n"
"resources."
msgstr "์ด ์๋ฃ๋ ๋ง์ ํ๋ฅญํ ๋ฌ์คํธ ๋ฌธ์๋ค์ ๋์์ ๋ฐ์ ์์ฑ๋์์ต๋๋ค. ์ ์ฉํ ์๋ฃ์ ์ ์ฒด ๋ชฉ๋ก์ [other resources](other-resources.md)์์ ์ดํด๋ณด์๊ธฐ ๋ฐ๋๋๋ค."
#: src/credits.md:7
msgid ""
"The material of Comprehensive Rust is licensed under the terms of the Apache 2.0\n"
"license, please see [`LICENSE`](../LICENSE) for details."
msgstr "Comprehensive Rust์ ์๋ฃ๋ Apache 2.0 ๋ผ์ด์ ์ค๋ฅผ ๋ฐ๋ฆ
๋๋ค. ์์ธํ๊ฑด [`LICENSE`](../LICENSE) ํ์ธํด ๋ณด์๊ธฐ ๋ฐ๋๋๋ค."
#: src/credits.md:10
msgid "## Rust by Example"
msgstr ""
#: src/credits.md:12
msgid ""
"Some examples and exercises have been copied and adapted from [Rust by\n"
"Example](https://doc.rust-lang.org/rust-by-example/). Please see the\n"
"`third_party/rust-by-example/` directory for details, including the license\n"
"terms."
msgstr "์ผ๋ถ ์์ ์ ์ฐ์ต๋ฌธ์ ๋ [Rust by Example](https://doc.rust-lang.org/rust-by-example/)์ ์ฐธ์กฐํ์์ต๋๋ค. ๋ผ์ด์ ์ค ์กฐํญ์ ํฌํจํ์ฌ ์ ์ฅ์์ `third_party/rust-by-example/` ํด๋๋ฅผ ์ฐธ์กฐํ์๊ธฐ ๋ฐ๋๋๋ค."
#: src/credits.md:17
msgid "## Rust on Exercism"
msgstr ""
#: src/credits.md:19
msgid ""
"Some exercises have been copied and adapted from [Rust on\n"
"Exercism](https://exercism.org/tracks/rust). Please see the\n"
"`third_party/rust-on-exercism/` directory for details, including the license\n"
"terms."
msgstr "์ผ๋ถ ์ฐ์ต๋ฌธ์ ๋ [Rust on Exercism](https://exercism.org/tracks/rust)์ ์ฐธ์กฐํ์์ต๋๋ค. ๋ผ์ด์ ์ค ์กฐํญ์ ํฌํจํ์ฌ ์ ์ฅ์์ `third_party/rust-on-exercism/`ํด๋๋ฅผ ์ฐธ์กฐํ์๊ธฐ ๋ฐ๋๋๋ค."
#: src/credits.md:24
msgid "## CXX"
msgstr ""
#: src/credits.md:26
msgid ""
"The [Interoperability with C++](android/interoperability/cpp.md) section uses an\n"
"image from [CXX](https://cxx.rs/). Please see the `third_party/cxx/` directory\n"
"for details, including the license terms."
msgstr "4์ผ์ฐจ ์คํ ๊ฐ์ ์ค [Interoperability with C++](android/interoperability/cpp.md)์์๋ [CXX](https://cxx.rs/)์ ์ด๋ฏธ์ง๋ฅผ ์ฌ์ฉํ์์ต๋๋ค. ๋ผ์ด์ ์ค ์กฐํญ์ ํฌํจํ์ฌ ์ ์ฅ์์ `third_party/cxx/`ํด๋๋ฅผ ์ฐธ์กฐํ์๊ธฐ ๋ฐ๋๋๋ค."
#: src/exercises/solutions.md:1
msgid "# Solutions"
msgstr "# ํด๋ต"
#: src/exercises/solutions.md:3
msgid "You will find solutions to the exercises on the following pages."
msgstr "์ฐ์ต๋ฌธ์ ์ ํด๋ต์ ๋ค์ ํ์ด์ง์์ ํ์ธํ ์ ์์ต๋๋ค."
#: src/exercises/solutions.md:5
msgid ""
"Feel free to ask questions about the solutions [on\n"
"GitHub](https://github.com/google/comprehensive-rust/discussions). Let us know\n"
"if you have a different or better solution than what is presented here."
msgstr "[๊นํ๋ธ](https://github.com/google/comprehensive-rust/discussions)์์ ์ด์ ๋ํด ์์ ๋กญ๊ฒ ์ง๋ฌธํ์๊ณ ๋ ๋์ ์๋ฃจ์
์ด ์๋ค๋ฉด ์๋ ค์ฃผ์๊ธฐ ๋ฐ๋๋๋ค."
#: src/exercises/solutions.md:10
msgid ""
"> **Note:** Please ignore the `// ANCHOR: label` and `// ANCHOR_END: label`\n"
"> comments you see in the solutions. They are there to make it possible to\n"
"> re-use parts of the solutions as the exercises."
msgstr "> **์ฐธ๊ณ :** `// ANCHOR: label`๊ณผ `// ANCHOR_END: label` ์ฃผ์์ ๋ฌธ์ ๋ฅผ ๊ตฌ์ฑํ๊ธฐ ์ํ ๋ฉํ ์ฃผ์์ผ๋ก ๋ฌด์ํ์๋ฉด ๋ฉ๋๋ค."
#: src/exercises/day-1/solutions-morning.md:1
msgid "# Day 1 Morning Exercises"
msgstr "# 1์ผ์ฐจ ์ค์ ์ฐ์ต๋ฌธ์ "
#: src/exercises/day-1/solutions-morning.md:3
msgid "## Arrays and `for` Loops"
msgstr "## ๋ฐฐ์ด๊ณผ `for`๋ฐ๋ณต๋ฌธ"
#: src/exercises/day-1/solutions-morning.md:5
msgid "([back to exercise](for-loops.md))"
msgstr ""
#: src/exercises/day-1/solutions-morning.md:7
msgid ""
"```rust\n"
"// Copyright 2022 Google LLC\n"
"//\n"
"// Licensed under the Apache License, Version 2.0 (the \"License\");\n"
"// you may not use this file except in compliance with the License.\n"
"// You may obtain a copy of the License at\n"
"//\n"
"// http://www.apache.org/licenses/LICENSE-2.0\n"
"//\n"
"// Unless required by applicable law or agreed to in writing, software\n"
"// distributed under the License is distributed on an \"AS IS\" BASIS,\n"
"// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n"
"// See the License for the specific language governing permissions and\n"
"// limitations under the License.\n"
"\n"
"// ANCHOR: transpose\n"
"fn transpose(matrix: [[i32; 3]; 3]) -> [[i32; 3]; 3] {\n"
" // ANCHOR_END: transpose\n"
" let mut result = [[0; 3]; 3];\n"
" for i in 0..3 {\n"
" for j in 0..3 {\n"
" result[j][i] = matrix[i][j];\n"
" }\n"
" }\n"
" return result;\n"
"}\n"
"\n"
"// ANCHOR: pretty_print\n"
"fn pretty_print(matrix: &[[i32; 3]; 3]) {\n"
" // ANCHOR_END: pretty_print\n"
" for row in matrix {\n"
" println!(\"{row:?}\");\n"
" }\n"
"}\n"
"\n"
"// ANCHOR: tests\n"
"#[test]\n"
"fn test_transpose() {\n"
" let matrix = [\n"
" [101, 102, 103], //\n"
" [201, 202, 203],\n"
" [301, 302, 303],\n"
" ];\n"
" let transposed = transpose(matrix);\n"
" assert_eq!(\n"
" transposed,\n"
" [\n"
" [101, 201, 301], //\n"
" [102, 202, 302],\n"
" [103, 203, 303],\n"
" ]\n"
" );\n"
"}\n"
"// ANCHOR_END: tests\n"
"\n"
"// ANCHOR: main\n"
"fn main() {\n"
" let matrix = [\n"
" [101, 102, 103], // <-- the comment makes rustfmt add a newline\n"
" [201, 202, 203],\n"
" [301, 302, 303],\n"
" ];\n"
"\n"
" println!(\"matrix:\");\n"
" pretty_print(&matrix);\n"
"\n"
" let transposed = transpose(matrix);\n"
" println!(\"transposed:\");\n"
" pretty_print(&transposed);\n"
"}\n"
"```"
msgstr ""
#: src/exercises/day-1/solutions-morning.md:78
msgid "### Bonus question"
msgstr "### ๋ณด๋์ค ๋ฌธ์ "
#: src/exercises/day-1/solutions-morning.md:80
msgid "It requires more advanced concepts. It might seem that we could use a slice-of-slices (`&[&[i32]]`) as the input type to transpose and thus make our function handle any size of matrix. However, this quickly breaks down: the return type cannot be `&[&[i32]]` since it needs to own the data you return."
msgstr "์ฌ์ค ์ด ๋ฌธ์ ๋ ๊ณ ๊ธ ๊ฐ๋
์ด ํ์ํฉ๋๋ค. ์ฌ๋ผ์ด์ค์ ์ฌ๋ผ์ด์ค(slice-of-slices, `&[&[i32]]`)๋ฅผ ์
๋ ฅ ํ์
์ผ๋ก ์ฌ์ฉํ๋ฉด ๋ชจ๋ ํฌ๊ธฐ์ ํ๋ ฌ์ ์ฒ๋ฆฌํ ์ ์์๊ฒ ๊ฐ์ต๋๋ค. ํ์ง๋ง ์ค์ ๋ก ํด๋ณด๋ฉด ๊ธ๋ฐฉ ์๋๋ค๋ ๊ฑธ ์ ์ ์์ต๋๋ค. ๋ฐํ๊ฐ์ ์์ ํด์ผ ํ๊ธฐ๋๋ฌธ์ `&[&[i32]]` ๋ฐํ ํ์
์ผ๋ก ์ฌ์ฉํ ์ ์์ต๋๋ค."
#: src/exercises/day-1/solutions-morning.md:82
msgid "You can attempt to use something like `Vec>`, but this doesn't work out-of-the-box either: it's hard to convert from `Vec>` to `&[&[i32]]` so now you cannot easily use `pretty_print` either."
msgstr "`Vec>`์ ๊ฐ์ ํ์
์ ์ฌ์ฉํ๋ ค๊ณ ์๋ํ ์๋ ์์ง๋ง ์ญ์ ์ฝ๊ฒ ๋์ง ์์ต๋๋ค. `Vec>` ํ์
์ `&[&[i32]]`๋ก ๋ณํํ๋ ๊ฒ์ด ์ด๋ ต๊ธฐ ๋๋ฌธ์ `pretty_print`์ ์ฌ์ฉํ๋๋ฐ ์ด๋ ค์์ด ์์ต๋๋ค."
#: src/exercises/day-1/solutions-morning.md:84
msgid "Once we get to traits and generics, we'll be able to use the [`std::convert::AsRef`][1] trait to abstract over anything that can be referenced as a slice."
msgstr "ํธ๋ ์๋ ์ ๋ค๋ฆญ์ ๋ค๋ฃจ๊ณ ๋๋ฉด [`std::convert::AsRef`][1] ํธ๋ ์์ ์ฌ์ฉํ์ฌ ์ฌ๋ผ์ด์ค์ฒ๋ผ ์ฌ์ฉ๋ ์ ์๋ ํ์
์ ์ถ์ํํ ์ ์์ต๋๋ค."
#: src/exercises/day-1/solutions-morning.md:86
msgid ""
"```rust\n"
"use std::convert::AsRef;\n"
"use std::fmt::Debug;\n"
"\n"
"fn pretty_print(matrix: Matrix)\n"
"where\n"
" T: Debug,\n"
" // A line references a slice of items\n"
" Line: AsRef<[T]>,\n"
" // A matrix references a slice of lines\n"
" Matrix: AsRef<[Line]>\n"
"{\n"
" for row in matrix.as_ref() {\n"
" println!(\"{:?}\", row.as_ref());\n"
" }\n"
"}\n"
"\n"
"fn main() {\n"
" // &[&[i32]]\n"
" pretty_print(&[&[1, 2, 3], &[4, 5, 6], &[7, 8, 9]]);\n"
" // [[&str; 2]; 2]\n"
" pretty_print([[\"a\", \"b\"], [\"c\", \"d\"]]);\n"
" // Vec>\n"
" pretty_print(vec![vec![1, 2], vec![3, 4]]);\n"
"}\n"
"```"
msgstr ""
#: src/exercises/day-1/solutions-morning.md:113
msgid "In addition, the type itself would not enforce that the child slices are of the same length, so such variable could contain an invalid matrix."
msgstr "๋ํ, ์ฌ๋ผ์ด์ค ํ์
์ ๊ธธ์ด๋ฅผ ํฌํจํ์ง ์๊ธฐ ๋๋ฌธ์ ํ ๋จ๊ณ ์๋์ ์ฌ๋ผ์ด์ค๋ค์ด ๊ฐ์ ๊ธธ์ด์์ ๋ณด์ฅํ ์ ์์ต๋๋ค. ๋๋ฌธ์ ์ฌ๋ผ์ด์ค ํ์
์ ๋ณ์์๋ ์๋ชป๋ ํ๋ ฌ์ด ์ ๋ฌ๋ ์ ์์ต๋๋ค."
#: src/exercises/day-1/solutions-afternoon.md:1
msgid "# Day 1 Afternoon Exercises"
msgstr "# 1์ผ์ฐจ ์คํ ์ฐ์ต๋ฌธ์ "
#: src/exercises/day-1/solutions-afternoon.md:3
msgid "## Designing a Library"
msgstr "## ๋์๊ด ์ค๊ณ"
#: src/exercises/day-1/solutions-afternoon.md:5
msgid "([back to exercise](book-library.md))"
msgstr ""
#: src/exercises/day-1/solutions-afternoon.md:7
msgid ""
"```rust\n"
"// Copyright 2022 Google LLC\n"
"//\n"
"// Licensed under the Apache License, Version 2.0 (the \"License\");\n"
"// you may not use this file except in compliance with the License.\n"
"// You may obtain a copy of the License at\n"
"//\n"
"// http://www.apache.org/licenses/LICENSE-2.0\n"
"//\n"
"// Unless required by applicable law or agreed to in writing, software\n"
"// distributed under the License is distributed on an \"AS IS\" BASIS,\n"
"// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n"
"// See the License for the specific language governing permissions and\n"
"// limitations under the License.\n"
"\n"
"// ANCHOR: setup\n"
"struct Library {\n"
" books: Vec,\n"
"}\n"
"\n"
"struct Book {\n"
" title: String,\n"
" year: u16,\n"
"}\n"
"\n"
"impl Book {\n"
" // This is a constructor, used below.\n"
" fn new(title: &str, year: u16) -> Book {\n"
" Book {\n"
" title: String::from(title),\n"
" year,\n"
" }\n"
" }\n"
"}\n"
"\n"
"// This makes it possible to print Book values with {}.\n"
"impl std::fmt::Display for Book {\n"
" fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {\n"
" write!(f, \"{} ({})\", self.title, self.year)\n"
" }\n"
"}\n"
"// ANCHOR_END: setup\n"
"\n"
"// ANCHOR: Library_new\n"
"impl Library {\n"
" fn new() -> Library {\n"
" // ANCHOR_END: Library_new\n"
" Library { books: Vec::new() }\n"
" }\n"
"\n"
" // ANCHOR: Library_len\n"
" //fn len(self) -> usize {\n"
" // unimplemented!()\n"
" //}\n"
" // ANCHOR_END: Library_len\n"
" fn len(&self) -> usize {\n"
" self.books.len()\n"
" }\n"
"\n"
" // ANCHOR: Library_is_empty\n"
" //fn is_empty(self) -> bool {\n"
" // unimplemented!()\n"
" //}\n"
" // ANCHOR_END: Library_is_empty\n"
" fn is_empty(&self) -> bool {\n"
" self.books.is_empty()\n"
" }\n"
"\n"
" // ANCHOR: Library_add_book\n"
" //fn add_book(self, book: Book) {\n"
" // unimplemented!()\n"
" //}\n"
" // ANCHOR_END: Library_add_book\n"
" fn add_book(&mut self, book: Book) {\n"
" self.books.push(book)\n"
" }\n"
"\n"
" // ANCHOR: Library_print_books\n"
" //fn print_books(self) {\n"
" // unimplemented!()\n"
" //}\n"
" // ANCHOR_END: Library_print_books\n"
" fn print_books(&self) {\n"
" for book in &self.books {\n"
" println!(\"{}\", book);\n"
" }\n"
" }\n"
"\n"
" // ANCHOR: Library_oldest_book\n"
" //fn oldest_book(self) -> Option<&Book> {\n"
" // unimplemented!()\n"
" //}\n"
" // ANCHOR_END: Library_oldest_book\n"
" fn oldest_book(&self) -> Option<&Book> {\n"
" self.books.iter().min_by_key(|book| book.year)\n"
" }\n"
"}\n"
"\n"
"// ANCHOR: main\n"
"// This shows the desired behavior. Uncomment the code below and\n"
"// implement the missing methods. You will need to update the\n"
"// method signatures, including the \"self\" parameter! You may\n"
"// also need to update the variable bindings within main.\n"
"fn main() {\n"
" let library = Library::new();\n"
"\n"
" //println!(\"Our library is empty: {}\", library.is_empty());\n"
"\n"
" let favorite_book = Book::new(\"Lord of the Rings\", 1954);\n"
" println!(\"Our favorite book {favorite_book} should go in the library\");\n"
" //library.add_book(favorite_book);\n"
" //library.add_book(Book::new(\"Alice's Adventures in Wonderland\", 1865));\n"
" //\n"
" //library.print_books();\n"
" //\n"
" //match library.oldest_book() {\n"
" // Some(book) => println!(\"My oldest book is {book}\"),\n"
" // None => println!(\"My library is empty!\"),\n"
" //}\n"
" //\n"
" //println!(\"Our library has {} books\", library.len());\n"
" for book in library.books {\n"
" println!(\"{book}\");\n"
" }\n"
"}\n"
"// ANCHOR_END: main\n"
"\n"
"#[test]\n"
"fn test_library_len() {\n"
" let mut library = Library::new();\n"
" assert_eq!(library.len(), 0);\n"
" assert!(library.is_empty());\n"
"\n"
" library.add_book(Book::new(\"Lord of the Rings\", 1954));\n"
" library.add_book(Book::new(\"Alice's Adventures in Wonderland\", 1865));\n"
" assert_eq!(library.len(), 2);\n"
" assert!(!library.is_empty());\n"
"}\n"
"\n"
"#[test]\n"
"fn test_library_is_empty() {\n"
" let mut library = Library::new();\n"
" assert!(library.is_empty());\n"
"\n"
" library.add_book(Book::new(\"Lord of the Rings\", 1954));\n"
" assert!(!library.is_empty());\n"
"}\n"
"\n"
"#[test]\n"
"fn test_library_print_books() {\n"
" let mut library = Library::new();\n"
" library.add_book(Book::new(\"Lord of the Rings\", 1954));\n"
" library.add_book(Book::new(\"Alice's Adventures in Wonderland\", 1865));\n"
" // We could try and capture stdout, but let us just call the\n"
" // method to start with.\n"
" library.print_books();\n"
"}\n"
"\n"
"#[test]\n"
"fn test_library_oldest_book() {\n"
" let mut library = Library::new();\n"
" assert!(library.oldest_book().is_none());\n"
"\n"
" library.add_book(Book::new(\"Lord of the Rings\", 1954));\n"
" assert_eq!(\n"
" library.oldest_book().map(|b| b.title.as_str()),\n"
" Some(\"Lord of the Rings\")\n"
" );\n"
"\n"
" library.add_book(Book::new(\"Alice's Adventures in Wonderland\", 1865));\n"
" assert_eq!(\n"
" library.oldest_book().map(|b| b.title.as_str()),\n"
" Some(\"Alice's Adventures in Wonderland\")\n"
" );\n"
"}\n"
"```"
msgstr ""
#: src/exercises/day-2/solutions-morning.md:1
msgid "# Day 2 Morning Exercises"
msgstr "# 2์ผ์ฐจ ์ค์ ์ฐ์ต๋ฌธ์ "
#: src/exercises/day-2/solutions-morning.md:3
msgid "## Points and Polygons"
msgstr "## ์ ๊ณผ ๋ค๊ฐํ"
#: src/exercises/day-2/solutions-morning.md:5
msgid "([back to exercise](points-polygons.md))"
msgstr ""
#: src/exercises/day-2/solutions-morning.md:7
msgid ""
"```rust\n"
"// Copyright 2022 Google LLC\n"
"//\n"
"// Licensed under the Apache License, Version 2.0 (the \"License\");\n"
"// you may not use this file except in compliance with the License.\n"
"// You may obtain a copy of the License at\n"
"//\n"
"// http://www.apache.org/licenses/LICENSE-2.0\n"
"//\n"
"// Unless required by applicable law or agreed to in writing, software\n"
"// distributed under the License is distributed on an \"AS IS\" BASIS,\n"
"// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n"
"// See the License for the specific language governing permissions and\n"
"// limitations under the License.\n"
"\n"
"#[derive(Debug, Copy, Clone, PartialEq, Eq)]\n"
"// ANCHOR: Point\n"
"pub struct Point {\n"
" // ANCHOR_END: Point\n"
" x: i32,\n"
" y: i32,\n"
"}\n"
"\n"
"// ANCHOR: Point-impl\n"
"impl Point {\n"
" // ANCHOR_END: Point-impl\n"
" pub fn new(x: i32, y: i32) -> Point {\n"
" Point { x, y }\n"
" }\n"
"\n"
" pub fn magnitude(self) -> f64 {\n"
" f64::from(self.x.pow(2) + self.y.pow(2)).sqrt()\n"
" }\n"
"\n"
" pub fn dist(self, other: Point) -> f64 {\n"
" (self - other).magnitude()\n"
" }\n"
"}\n"
"\n"
"impl std::ops::Add for Point {\n"
" type Output = Self;\n"
"\n"
" fn add(self, other: Self) -> Self::Output {\n"
" Self {\n"
" x: self.x + other.x,\n"
" y: self.y + other.y,\n"
" }\n"
" }\n"
"}\n"
"\n"
"impl std::ops::Sub for Point {\n"
" type Output = Self;\n"
"\n"
" fn sub(self, other: Self) -> Self::Output {\n"
" Self {\n"
" x: self.x - other.x,\n"
" y: self.y - other.y,\n"
" }\n"
" }\n"
"}\n"
"\n"
"// ANCHOR: Polygon\n"
"pub struct Polygon {\n"
" // ANCHOR_END: Polygon\n"
" points: Vec,\n"
"}\n"
"\n"
"// ANCHOR: Polygon-impl\n"
"impl Polygon {\n"
" // ANCHOR_END: Polygon-impl\n"
" pub fn new() -> Polygon {\n"
" Polygon { points: Vec::new() }\n"
" }\n"
"\n"
" pub fn add_point(&mut self, point: Point) {\n"
" self.points.push(point);\n"
" }\n"
"\n"
" pub fn left_most_point(&self) -> Option {\n"
" self.points.iter().min_by_key(|p| p.x).copied()\n"
" }\n"
"\n"
" pub fn iter(&self) -> impl Iterator- {\n"
" self.points.iter()\n"
" }\n"
"\n"
" pub fn length(&self) -> f64 {\n"
" if self.points.is_empty() {\n"
" return 0.0;\n"
" }\n"
"\n"
" let mut result = 0.0;\n"
" let mut last_point = self.points[0];\n"
" for point in &self.points[1..] {\n"
" result += last_point.dist(*point);\n"
" last_point = *point;\n"
" }\n"
" result += last_point.dist(self.points[0]);\n"
" result\n"
" }\n"
"}\n"
"\n"
"// ANCHOR: Circle\n"
"pub struct Circle {\n"
" // ANCHOR_END: Circle\n"
" center: Point,\n"
" radius: i32,\n"
"}\n"
"\n"
"// ANCHOR: Circle-impl\n"
"impl Circle {\n"
" // ANCHOR_END: Circle-impl\n"
" pub fn new(center: Point, radius: i32) -> Circle {\n"
" Circle { center, radius }\n"
" }\n"
"\n"
" pub fn circumference(&self) -> f64 {\n"
" 2.0 * std::f64::consts::PI * f64::from(self.radius)\n"
" }\n"
"\n"
" pub fn dist(&self, other: &Self) -> f64 {\n"
" self.center.dist(other.center)\n"
" }\n"
"}\n"
"\n"
"// ANCHOR: Shape\n"
"pub enum Shape {\n"
" Polygon(Polygon),\n"
" Circle(Circle),\n"
"}\n"
"// ANCHOR_END: Shape\n"
"\n"
"impl From
for Shape {\n"
" fn from(poly: Polygon) -> Self {\n"
" Shape::Polygon(poly)\n"
" }\n"
"}\n"
"\n"
"impl From for Shape {\n"
" fn from(circle: Circle) -> Self {\n"
" Shape::Circle(circle)\n"
" }\n"
"}\n"
"\n"
"impl Shape {\n"
" pub fn perimeter(&self) -> f64 {\n"
" match self {\n"
" Shape::Polygon(poly) => poly.length(),\n"
" Shape::Circle(circle) => circle.circumference(),\n"
" }\n"
" }\n"
"}\n"
"\n"
"// ANCHOR: unit-tests\n"
"#[cfg(test)]\n"
"mod tests {\n"
" use super::*;\n"
"\n"
" fn round_two_digits(x: f64) -> f64 {\n"
" (x * 100.0).round() / 100.0\n"
" }\n"
"\n"
" #[test]\n"
" fn test_point_magnitude() {\n"
" let p1 = Point::new(12, 13);\n"
" assert_eq!(round_two_digits(p1.magnitude()), 17.69);\n"
" }\n"
"\n"
" #[test]\n"
" fn test_point_dist() {\n"
" let p1 = Point::new(10, 10);\n"
" let p2 = Point::new(14, 13);\n"
" assert_eq!(round_two_digits(p1.dist(p2)), 5.00);\n"
" }\n"
"\n"
" #[test]\n"
" fn test_point_add() {\n"
" let p1 = Point::new(16, 16);\n"
" let p2 = p1 + Point::new(-4, 3);\n"
" assert_eq!(p2, Point::new(12, 19));\n"
" }\n"
"\n"
" #[test]\n"
" fn test_polygon_left_most_point() {\n"
" let p1 = Point::new(12, 13);\n"
" let p2 = Point::new(16, 16);\n"
"\n"
" let mut poly = Polygon::new();\n"
" poly.add_point(p1);\n"
" poly.add_point(p2);\n"
" assert_eq!(poly.left_most_point(), Some(p1));\n"
" }\n"
"\n"
" #[test]\n"
" fn test_polygon_iter() {\n"
" let p1 = Point::new(12, 13);\n"
" let p2 = Point::new(16, 16);\n"
"\n"
" let mut poly = Polygon::new();\n"
" poly.add_point(p1);\n"
" poly.add_point(p2);\n"
"\n"
" let points = poly.iter().cloned().collect::>();\n"
" assert_eq!(points, vec![Point::new(12, 13), Point::new(16, 16)]);\n"
" }\n"
"\n"
" #[test]\n"
" fn test_shape_perimeters() {\n"
" let mut poly = Polygon::new();\n"
" poly.add_point(Point::new(12, 13));\n"
" poly.add_point(Point::new(17, 11));\n"
" poly.add_point(Point::new(16, 16));\n"
" let shapes = vec![\n"
" Shape::from(poly),\n"
" Shape::from(Circle::new(Point::new(10, 20), 5)),\n"
" ];\n"
" let perimeters = shapes\n"
" .iter()\n"
" .map(Shape::perimeter)\n"
" .map(round_two_digits)\n"
" .collect::>();\n"
" assert_eq!(perimeters, vec![15.48, 31.42]);\n"
" }\n"
"}\n"
"// ANCHOR_END: unit-tests\n"
"\n"
"fn main() {}\n"
"```"
msgstr ""
#: src/exercises/day-2/solutions-afternoon.md:1
msgid "# Day 2 Afternoon Exercises"
msgstr "# 2์ผ์ฐจ ์คํ ์ฐ์ต๋ฌธ์ "
#: src/exercises/day-2/solutions-afternoon.md:3
msgid "## Luhn Algorithm"
msgstr "## ๋ฃฌ ์๊ณ ๋ฆฌ์ฆ"
#: src/exercises/day-2/solutions-afternoon.md:5
msgid "([back to exercise](luhn.md))"
msgstr ""
#: src/exercises/day-2/solutions-afternoon.md:7
msgid ""
"```rust\n"
"// Copyright 2022 Google LLC\n"
"//\n"
"// Licensed under the Apache License, Version 2.0 (the \"License\");\n"
"// you may not use this file except in compliance with the License.\n"
"// You may obtain a copy of the License at\n"
"//\n"
"// http://www.apache.org/licenses/LICENSE-2.0\n"
"//\n"
"// Unless required by applicable law or agreed to in writing, software\n"
"// distributed under the License is distributed on an \"AS IS\" BASIS,\n"
"// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n"
"// See the License for the specific language governing permissions and\n"
"// limitations under the License.\n"
"\n"
"// ANCHOR: luhn\n"
"pub fn luhn(cc_number: &str) -> bool {\n"
" // ANCHOR_END: luhn\n"
" let mut digits_seen = 0;\n"
" let mut sum = 0;\n"
" for (i, ch) in cc_number.chars().rev().filter(|&ch| ch != ' ').enumerate() {\n"
" match ch.to_digit(10) {\n"
" Some(d) => {\n"
" sum += if i % 2 == 1 {\n"
" let dd = d * 2;\n"
" dd / 10 + dd % 10\n"
" } else {\n"
" d\n"
" };\n"
" digits_seen += 1;\n"
" }\n"
" None => return false,\n"
" }\n"
" }\n"
"\n"
" if digits_seen < 2 {\n"
" return false;\n"
" }\n"
"\n"
" sum % 10 == 0\n"
"}\n"
"\n"
"fn main() {\n"
" let cc_number = \"1234 5678 1234 5670\";\n"
" println!(\n"
" \"Is {} a valid credit card number? {}\",\n"
" cc_number,\n"
" if luhn(cc_number) { \"yes\" } else { \"no\" }\n"
" );\n"
"}\n"
"\n"
"// ANCHOR: unit-tests\n"
"#[test]\n"
"fn test_non_digit_cc_number() {\n"
" assert!(!luhn(\"foo\"));\n"
"}\n"
"\n"
"#[test]\n"
"fn test_empty_cc_number() {\n"
" assert!(!luhn(\"\"));\n"
" assert!(!luhn(\" \"));\n"
" assert!(!luhn(\" \"));\n"
" assert!(!luhn(\" \"));\n"
"}\n"
"\n"
"#[test]\n"
"fn test_single_digit_cc_number() {\n"
" assert!(!luhn(\"0\"));\n"
"}\n"
"\n"
"#[test]\n"
"fn test_two_digit_cc_number() {\n"
" assert!(luhn(\" 0 0 \"));\n"
"}\n"
"\n"
"#[test]\n"
"fn test_valid_cc_number() {\n"
" assert!(luhn(\"4263 9826 4026 9299\"));\n"
" assert!(luhn(\"4539 3195 0343 6467\"));\n"
" assert!(luhn(\"7992 7398 713\"));\n"
"}\n"
"\n"
"#[test]\n"
"fn test_invalid_cc_number() {\n"
" assert!(!luhn(\"4223 9826 4026 9299\"));\n"
" assert!(!luhn(\"4539 3195 0343 6476\"));\n"
" assert!(!luhn(\"8273 1232 7352 0569\"));\n"
"}\n"
"// ANCHOR_END: unit-tests\n"
"```"
msgstr ""
#: src/exercises/day-2/solutions-afternoon.md:98
msgid "## Strings and Iterators"
msgstr "## ๋ฌธ์์ด๊ณผ ๋ฐ๋ณต์"
#: src/exercises/day-2/solutions-afternoon.md:100
msgid "([back to exercise](strings-iterators.md))"
msgstr ""
#: src/exercises/day-2/solutions-afternoon.md:102
msgid ""
"```rust\n"
"// Copyright 2022 Google LLC\n"
"//\n"
"// Licensed under the Apache License, Version 2.0 (the \"License\");\n"
"// you may not use this file except in compliance with the License.\n"
"// You may obtain a copy of the License at\n"
"//\n"
"// http://www.apache.org/licenses/LICENSE-2.0\n"
"//\n"
"// Unless required by applicable law or agreed to in writing, software\n"
"// distributed under the License is distributed on an \"AS IS\" BASIS,\n"
"// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n"
"// See the License for the specific language governing permissions and\n"
"// limitations under the License.\n"
"\n"
"// ANCHOR: prefix_matches\n"
"pub fn prefix_matches(prefix: &str, request_path: &str) -> bool {\n"
" // ANCHOR_END: prefix_matches\n"
" let prefixes = prefix.split('/');\n"
" let request_paths = request_path\n"
" .split('/')\n"
" .map(|p| Some(p))\n"
" .chain(std::iter::once(None));\n"
"\n"
" for (prefix, request_path) in prefixes.zip(request_paths) {\n"
" match request_path {\n"
" Some(request_path) => {\n"
" if (prefix != \"*\") && (prefix != request_path) {\n"
" return false;\n"
" }\n"
" }\n"
" None => return false,\n"
" }\n"
" }\n"
" true\n"
"}\n"
"\n"
"// ANCHOR: unit-tests\n"
"#[test]\n"
"fn test_matches_without_wildcard() {\n"
" assert!(prefix_matches(\"/v1/publishers\", \"/v1/publishers\"));\n"
" assert!(prefix_matches(\"/v1/publishers\", \"/v1/publishers/abc-123\"));\n"
" assert!(prefix_matches(\"/v1/publishers\", \"/v1/publishers/abc/books\"));\n"
"\n"
" assert!(!prefix_matches(\"/v1/publishers\", \"/v1\"));\n"
" assert!(!prefix_matches(\"/v1/publishers\", \"/v1/publishersBooks\"));\n"
" assert!(!prefix_matches(\"/v1/publishers\", \"/v1/parent/publishers\"));\n"
"}\n"
"\n"
"#[test]\n"
"fn test_matches_with_wildcard() {\n"
" assert!(prefix_matches(\n"
" \"/v1/publishers/*/books\",\n"
" \"/v1/publishers/foo/books\"\n"
" ));\n"
" assert!(prefix_matches(\n"
" \"/v1/publishers/*/books\",\n"
" \"/v1/publishers/bar/books\"\n"
" ));\n"
" assert!(prefix_matches(\n"
" \"/v1/publishers/*/books\",\n"
" \"/v1/publishers/foo/books/book1\"\n"
" ));\n"
"\n"
" assert!(!prefix_matches(\"/v1/publishers/*/books\", \"/v1/publishers\"));\n"
" assert!(!prefix_matches(\n"
" \"/v1/publishers/*/books\",\n"
" \"/v1/publishers/foo/booksByAuthor\"\n"
" ));\n"
"}\n"
"// ANCHOR_END: unit-tests\n"
"\n"
"fn main() {}\n"
"```"
msgstr ""
#: src/exercises/day-3/solutions-morning.md:1
msgid "# Day 3 Morning Exercise"
msgstr "# 3์ผ์ฐจ ์ค์ ์ฐ์ต๋ฌธ์ "
#: src/exercises/day-3/solutions-morning.md:3
msgid "## A Simple GUI Library"
msgstr "## ๊ฐ๋จํ GUI ๋ผ์ด๋ธ๋ฌ๋ฆฌ"
#: src/exercises/day-3/solutions-morning.md:5
msgid "([back to exercise](simple-gui.md))"
msgstr ""
#: src/exercises/day-3/solutions-morning.md:7
msgid ""
"```rust\n"
"// Copyright 2022 Google LLC\n"
"//\n"
"// Licensed under the Apache License, Version 2.0 (the \"License\");\n"
"// you may not use this file except in compliance with the License.\n"
"// You may obtain a copy of the License at\n"
"//\n"
"// http://www.apache.org/licenses/LICENSE-2.0\n"
"//\n"
"// Unless required by applicable law or agreed to in writing, software\n"
"// distributed under the License is distributed on an \"AS IS\" BASIS,\n"
"// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n"
"// See the License for the specific language governing permissions and\n"
"// limitations under the License.\n"
"\n"
"// ANCHOR: setup\n"
"pub trait Widget {\n"
" /// Natural width of `self`.\n"
" fn width(&self) -> usize;\n"
"\n"
" /// Draw the widget into a buffer.\n"
" fn draw_into(&self, buffer: &mut dyn std::fmt::Write);\n"
"\n"
" /// Draw the widget on standard output.\n"
" fn draw(&self) {\n"
" let mut buffer = String::new();\n"
" self.draw_into(&mut buffer);\n"
" println!(\"{buffer}\");\n"
" }\n"
"}\n"
"\n"
"pub struct Label {\n"
" label: String,\n"
"}\n"
"\n"
"impl Label {\n"
" fn new(label: &str) -> Label {\n"
" Label {\n"
" label: label.to_owned(),\n"
" }\n"
" }\n"
"}\n"
"\n"
"pub struct Button {\n"
" label: Label,\n"
" callback: Box,\n"
"}\n"
"\n"
"impl Button {\n"
" fn new(label: &str, callback: Box) -> Button {\n"
" Button {\n"
" label: Label::new(label),\n"
" callback,\n"
" }\n"
" }\n"
"}\n"
"\n"
"pub struct Window {\n"
" title: String,\n"
" widgets: Vec>,\n"
"}\n"
"\n"
"impl Window {\n"
" fn new(title: &str) -> Window {\n"
" Window {\n"
" title: title.to_owned(),\n"
" widgets: Vec::new(),\n"
" }\n"
" }\n"
"\n"
" fn add_widget(&mut self, widget: Box) {\n"
" self.widgets.push(widget);\n"
" }\n"
"}\n"
"\n"
"// ANCHOR_END: setup\n"
"\n"
"// ANCHOR: Window-width\n"
"impl Widget for Window {\n"
" fn width(&self) -> usize {\n"
" // ANCHOR_END: Window-width\n"
" std::cmp::max(\n"
" self.title.chars().count(),\n"
" self.widgets.iter().map(|w| w.width()).max().unwrap_or(0),\n"
" )\n"
" }\n"
"\n"
" // ANCHOR: Window-draw_into\n"
" fn draw_into(&self, buffer: &mut dyn std::fmt::Write) {\n"
" // ANCHOR_END: Window-draw_into\n"
" let mut inner = String::new();\n"
" for widget in &self.widgets {\n"
" widget.draw_into(&mut inner);\n"
" }\n"
"\n"
" let window_width = self.width();\n"
"\n"
" // TODO: after learning about error handling, you can change\n"
" // draw_into to return Result<(), std::fmt::Error>. Then use\n"
" // the ?-operator here instead of .unwrap().\n"
" writeln!(buffer, \"+-{:- usize {\n"
" // ANCHOR_END: Button-width\n"
" self.label.width() + 8 // add a bit of padding\n"
" }\n"
"\n"
" // ANCHOR: Button-draw_into\n"
" fn draw_into(&self, buffer: &mut dyn std::fmt::Write) {\n"
" // ANCHOR_END: Button-draw_into\n"
" let width = self.width();\n"
" let mut label = String::new();\n"
" self.label.draw_into(&mut label);\n"
"\n"
" writeln!(buffer, \"+{:- usize {\n"
" // ANCHOR_END: Label-width\n"
" self.label\n"
" .lines()\n"
" .map(|line| line.chars().count())\n"
" .max()\n"
" .unwrap_or(0)\n"
" }\n"
"\n"
" // ANCHOR: Label-draw_into\n"
" fn draw_into(&self, buffer: &mut dyn std::fmt::Write) {\n"
" // ANCHOR_END: Label-draw_into\n"
" writeln!(buffer, \"{}\", &self.label).unwrap();\n"
" }\n"
"}\n"
"\n"
"// ANCHOR: main\n"
"fn main() {\n"
" let mut window = Window::new(\"Rust GUI Demo 1.23\");\n"
" window.add_widget(Box::new(Label::new(\"This is a small text GUI demo.\")));\n"
" window.add_widget(Box::new(Button::new(\n"
" \"Click me!\",\n"
" Box::new(|| println!(\"You clicked the button!\")),\n"
" )));\n"
" window.draw();\n"
"}\n"
"// ANCHOR_END: main\n"
"```"
msgstr ""
#: src/exercises/day-3/solutions-afternoon.md:1
msgid "# Day 3 Afternoon Exercises"
msgstr "# 3์ผ์ฐจ ์คํ ์ฐ์ต๋ฌธ์ "
#: src/exercises/day-3/solutions-afternoon.md:3
msgid "## Safe FFI Wrapper"
msgstr "## FFI๋ํผ"
#: src/exercises/day-3/solutions-afternoon.md:5
msgid "([back to exercise](safe-ffi-wrapper.md))"
msgstr ""
#: src/exercises/day-3/solutions-afternoon.md:7
msgid ""
"```rust\n"
"// Copyright 2022 Google LLC\n"
"//\n"
"// Licensed under the Apache License, Version 2.0 (the \"License\");\n"
"// you may not use this file except in compliance with the License.\n"
"// You may obtain a copy of the License at\n"
"//\n"
"// http://www.apache.org/licenses/LICENSE-2.0\n"
"//\n"
"// Unless required by applicable law or agreed to in writing, software\n"
"// distributed under the License is distributed on an \"AS IS\" BASIS,\n"
"// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n"
"// See the License for the specific language governing permissions and\n"
"// limitations under the License.\n"
"\n"
"// ANCHOR: ffi\n"
"mod ffi {\n"
" use std::os::raw::{c_char, c_int, c_long, c_ulong, c_ushort};\n"
"\n"
" // Opaque type. See https://doc.rust-lang.org/nomicon/ffi.html.\n"
" #[repr(C)]\n"
" pub struct DIR {\n"
" _data: [u8; 0],\n"
" _marker: core::marker::PhantomData<(*mut u8, core::marker::PhantomPinned)>,\n"
" }\n"
"\n"
" // Layout as per readdir(3) and definitions in /usr/include/x86_64-linux-gnu.\n"
" #[repr(C)]\n"
" pub struct dirent {\n"
" pub d_ino: c_long,\n"
" pub d_off: c_ulong,\n"
" pub d_reclen: c_ushort,\n"
" pub d_type: c_char,\n"
" pub d_name: [c_char; 256],\n"
" }\n"
"\n"
" extern \"C\" {\n"
" pub fn opendir(s: *const c_char) -> *mut DIR;\n"
" pub fn readdir(s: *mut DIR) -> *const dirent;\n"
" pub fn closedir(s: *mut DIR) -> c_int;\n"
" }\n"
"}\n"
"\n"
"use std::ffi::{CStr, CString, OsStr, OsString};\n"
"use std::os::unix::ffi::OsStrExt;\n"
"\n"
"#[derive(Debug)]\n"
"struct DirectoryIterator {\n"
" path: CString,\n"
" dir: *mut ffi::DIR,\n"
"}\n"
"// ANCHOR_END: ffi\n"
"\n"
"// ANCHOR: DirectoryIterator\n"
"impl DirectoryIterator {\n"
" fn new(path: &str) -> Result {\n"
" // Call opendir and return a Ok value if that worked,\n"
" // otherwise return Err with a message.\n"
" // ANCHOR_END: DirectoryIterator\n"
" let path = CString::new(path).map_err(|err| format!(\"Invalid path: {err}\"))?;\n"
" // SAFETY: path.as_ptr() cannot be NULL.\n"
" let dir = unsafe { ffi::opendir(path.as_ptr()) };\n"
" if dir.is_null() {\n"
" Err(format!(\"Could not open {:?}\", path))\n"
" } else {\n"
" Ok(DirectoryIterator { path, dir })\n"
" }\n"
" }\n"
"}\n"
"\n"
"// ANCHOR: Iterator\n"
"impl Iterator for DirectoryIterator {\n"
" type Item = OsString;\n"
" fn next(&mut self) -> Option {\n"
" // Keep calling readdir until we get a NULL pointer back.\n"
" // ANCHOR_END: Iterator\n"
" // SAFETY: self.dir is never NULL.\n"
" let dirent = unsafe { ffi::readdir(self.dir) };\n"
" if dirent.is_null() {\n"
" // We have reached the end of the directory.\n"
" return None;\n"
" }\n"
" // SAFETY: dirent is not NULL and dirent.d_name is NUL\n"
" // terminated.\n"
" let d_name = unsafe { CStr::from_ptr((*dirent).d_name.as_ptr()) };\n"
" let os_str = OsStr::from_bytes(d_name.to_bytes());\n"
" Some(os_str.to_owned())\n"
" }\n"
"}\n"
"\n"
"// ANCHOR: Drop\n"
"impl Drop for DirectoryIterator {\n"
" fn drop(&mut self) {\n"
" // Call closedir as needed.\n"
" // ANCHOR_END: Drop\n"
" if !self.dir.is_null() {\n"
" // SAFETY: self.dir is not NULL.\n"
" if unsafe { ffi::closedir(self.dir) } != 0 {\n"
" panic!(\"Could not close {:?}\", self.path);\n"
" }\n"
" }\n"
" }\n"
"}\n"
"\n"
"// ANCHOR: main\n"
"fn main() -> Result<(), String> {\n"
" let iter = DirectoryIterator::new(\".\")?;\n"
" println!(\"files: {:#?}\", iter.collect::>());\n"
" Ok(())\n"
"}\n"
"// ANCHOR_END: main\n"
"```"
msgstr ""
#: src/exercises/day-4/solutions-morning.md:1
msgid "# Day 4 Morning Exercise"
msgstr "# 4์ผ์ฐจ ์ค์ ์ฐ์ต๋ฌธ์ "
#: src/exercises/day-4/solutions-morning.md:3
msgid "## Dining Philosophers"
msgstr "## ์์ฌํ๋ ์ฒ ํ์๋ค"
#: src/exercises/day-4/solutions-morning.md:5
msgid "([back to exercise](dining-philosophers.md))"
msgstr ""
#: src/exercises/day-4/solutions-morning.md:7
msgid ""
"```rust\n"
"// Copyright 2022 Google LLC\n"
"//\n"
"// Licensed under the Apache License, Version 2.0 (the \"License\");\n"
"// you may not use this file except in compliance with the License.\n"
"// You may obtain a copy of the License at\n"
"//\n"
"// http://www.apache.org/licenses/LICENSE-2.0\n"
"//\n"
"// Unless required by applicable law or agreed to in writing, software\n"
"// distributed under the License is distributed on an \"AS IS\" BASIS,\n"
"// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n"
"// See the License for the specific language governing permissions and\n"
"// limitations under the License.\n"
"\n"
"// ANCHOR: Philosopher\n"
"use std::sync::mpsc;\n"
"use std::sync::{Arc, Mutex};\n"
"use std::thread;\n"
"use std::time::Duration;\n"
"\n"
"struct Fork;\n"
"\n"
"struct Philosopher {\n"
" name: String,\n"
" // ANCHOR_END: Philosopher\n"
" left_fork: Arc
"
msgstr ""
#: src/android/interoperability/cpp.md:10
msgid "See the [CXX tutorial][2] for an full example of using this."
msgstr "์ฌ์ฉํ๋ ๋ฐฉ๋ฒ์ ๋ํด์๋[CXX ํํ ๋ฆฌ์ผ][2] ๋ฅผ ์ฐธ์กฐํฉ๋๋ค."
#: src/android/interoperability/java.md:1
msgid "# Interoperability with Java"
msgstr "# Java์์ ์ํธ์ด์ฉ์ฑ"
#: src/android/interoperability/java.md:3
msgid ""
"Java can load shared objects via [Java Native Interface\n"
"(JNI)](https://en.wikipedia.org/wiki/Java_Native_Interface). The [`jni`\n"
"crate](https://docs.rs/jni/) allows you to create a compatible library."
msgstr "์๋ฐ๋ [Java Native Interface(JNI)](https://en.wikipedia.org/wiki/Java_Native_Interface)๋ฅผ ํตํด ๊ณต์ ๋ผ์ด๋ธ๋ฌ๋ฆฌ๋ฅผ ๋ก๋ํ ์ ์์ต๋๋ค. [`jni` ํฌ๋ ์ดํธ](https://docs.rs/jni/)๋ฅผ ์ฌ์ฉํ์ฌ JNI ๋ผ์ด๋ธ๋ฌ๋ฆฌ๋ฅผ ๋ง๋ค ์ ์์ต๋๋ค."
#: src/android/interoperability/java.md:7
msgid "First, we create a Rust function to export to Java:"
msgstr "๋จผ์ , ์๋ฐ๋ก ๋ด๋ณด๋ผ ๋ฌ์คํธ ํจ์๋ฅผ ์์ฑํฉ๋๋ค:"
#: src/android/interoperability/java.md:9
msgid "_interoperability/java/src/lib.rs_:"
msgstr ""
#: src/android/interoperability/java.md:11
msgid ""
"```rust,compile_fail\n"
"//! Rust <-> Java FFI demo.\n"
"\n"
"use jni::objects::{JClass, JString};\n"
"use jni::sys::jstring;\n"
"use jni::JNIEnv;\n"
"\n"
"/// HelloWorld::hello method implementation.\n"
"#[no_mangle]\n"
"pub extern \"system\" fn Java_HelloWorld_hello(\n"
" env: JNIEnv,\n"
" _class: JClass,\n"
" name: JString,\n"
") -> jstring {\n"
" let input: String = env.get_string(name).unwrap().into();\n"
" let greeting = format!(\"Hello, {input}!\");\n"
" let output = env.new_string(greeting).unwrap();\n"
" output.into_inner()\n"
"}\n"
"```"
msgstr ""
#: src/android/interoperability/java.md:32
#: src/android/interoperability/java.md:62
msgid "_interoperability/java/Android.bp_:"
msgstr ""
#: src/android/interoperability/java.md:34
msgid ""
"```javascript\n"
"rust_ffi_shared {\n"
" name: \"libhello_jni\",\n"
" crate_name: \"hello_jni\",\n"
" srcs: [\"src/lib.rs\"],\n"
" rustlibs: [\"libjni\"],\n"
"}\n"
"```"
msgstr ""
#: src/android/interoperability/java.md:43
msgid "Finally, we can call this function from Java:"
msgstr "์๋ฐ์์ ์ด ํจ์๋ฅผ ํธ์ถ ํ ์ ์์ต๋๋ค:"
#: src/android/interoperability/java.md:45
msgid "_interoperability/java/HelloWorld.java_:"
msgstr ""
#: src/android/interoperability/java.md:47
msgid ""
"```java\n"
"class HelloWorld {\n"
" private static native String hello(String name);\n"
"\n"
" static {\n"
" System.loadLibrary(\"hello_jni\");\n"
" }\n"
"\n"
" public static void main(String[] args) {\n"
" String output = HelloWorld.hello(\"Alice\");\n"
" System.out.println(output);\n"
" }\n"
"}\n"
"```"
msgstr ""
#: src/android/interoperability/java.md:64
msgid ""
"```javascript\n"
"java_binary {\n"
" name: \"helloworld_jni\",\n"
" srcs: [\"HelloWorld.java\"],\n"
" main_class: \"HelloWorld\",\n"
" required: [\"libhello_jni\"],\n"
"}\n"
"```"
msgstr ""
#: src/android/interoperability/java.md:73
msgid "Finally, you can build, sync, and run the binary:"
msgstr "๋ง์ง๋ง์ผ๋ก ๋ฐ์ด๋๋ฆฌ๋ฅผ ๋น๋, ์ฑํฌ, ์คํํฉ๋๋ค:"
#: src/android/interoperability/java.md:75
msgid ""
"```shell\n"
"$ m helloworld_jni\n"
"$ adb sync # requires adb root && adb remount\n"
"$ adb shell /system/bin/helloworld_jni\n"
"```"
msgstr ""
#: src/exercises/day-4/android.md:3
msgid ""
"For the last exercise, we will look at one of the projects you work with. Let us\n"
"group up and do this together. Some suggestions:"
msgstr "๋ง์ง๋ง ์ฐ์ต๋ฌธ์ ๋ ์ฌ๋ฌ๋ถ์ด ์์
ํ๊ณ ์๋ ํ๋ก์ ํธ ์ค ํ๋๋ฅผ FFI๋ก ๋ฌ์คํธ์ ์ฐ๊ณ ํด๋ณด๋ ๊ฒ์
๋๋ค. ๋ช ๊ฐ์ง ์์์
๋๋ค:"
#: src/exercises/day-4/android.md:6
msgid ""
"* Call your AIDL service with a client written in Rust.\n"
"\n"
"* Move a function from your project to Rust and call it."
msgstr ""
"* ๋น์ ์ AIDL์๋น์ค๋ฅผ ๋ฌ์คํธ ํด๋ผ์ด์ธํธ์์ ํธ์ถํด๋ด
๋๋ค.\n"
"\n"
"* ๋น์ ์ ํ๋ก์ ํธ์ ํจ์๋ฅผ ๋ฌ์คํธ๋ก ์ฎ๊ธฐ๊ณ ํธ์ถํด๋ด
๋๋ค."
#: src/exercises/day-4/android.md:12
msgid ""
"No solution is provided here since this is open-ended: it relies on someone in\n"
"the class having a piece of code which you can turn in to Rust on the fly."
msgstr "์ด ์ฐ์ต๋ฌธ์ ๋ ์ด๋ ค์๊ธฐ ๋๋ฌธ์ ํด๋ต์ด ์ ๊ณต๋์ง ์์ต๋๋ค. ํด๋์ค์์ ์ ์ถ๋ ์ฝ๋์ ์์กดํฉ๋๋ค."
#: src/thanks.md:1
msgid "# Thanks!"
msgstr "# ๊ฐ์ฌ์ธ์ฌ"
#: src/thanks.md:3
msgid ""
"_Thank you for taking Comprehensive Rust ๐ฆ!_ We hope you enjoyed it and that it\n"
"was useful."
msgstr "Comprehensive Rust ๐ฆ๋ฅผ ์ด์ฉํด ์ฃผ์
์ ๊ฐ์ฌํฉ๋๋ค. ์ฆ๊ฒ๊ณ ์ ์ตํ ์๊ฐ์ด์๊ธฐ๋ฅผ ๋ฐ๋๋๋ค."
#: src/thanks.md:6
msgid ""
"We've had a lot of fun putting the course together. The course is not perfect,\n"
"so if you spotted any mistakes or have ideas for improvements, please get in\n"
"[contact with us on\n"
"GitHub](https://github.com/google/comprehensive-rust/discussions). We would love\n"
"to hear from you."
msgstr "๊ฐ์๊ฐ ์๋ฒฝํ์ง ์์ผ๋ ์ค์๋ ๊ฐ์ ์ ์ด ์๋ค๋ฉด ์ธ์ ๋ ์ง [๊นํ๋ธ](https://github.com/google/comprehensive-rust/discussions)๋ก ์ฐ๋ฝ์ฃผ์ธ์."
#: src/other-resources.md:1
msgid "# Other Rust Resources"
msgstr "# ๋ฌ์คํธ ์ฐธ๊ณ ์๋ฃ"
#: src/other-resources.md:3
msgid ""
"The Rust community has created a wealth of high-quality and free resources\n"
"online."
msgstr "๋ฌ์คํธ ์ปค๋ฎค๋ํฐ๋ ์จ๋ผ์ธ์์ ๊ณ ํ์ง์ ๋ฌด๋ฃ ์์ค๋ฅผ ๋ง๋ค์์ต๋๋ค."
#: src/other-resources.md:6
msgid "## Official Documentation"
msgstr "## ๊ณต์ ๋ฌธ์๋ค"
#: src/other-resources.md:8
msgid "The Rust project hosts many resources. These cover Rust in general:"
msgstr "๋ฌ์คํธ ํ๋ก์ ํธ์๋ ์ฐธ์กฐํ ๋งํ ์๋ฃ๊ฐ ๋ง์ต๋๋ค. ์ผ๋ฐ์ ์ธ ๋ด์ฉ์ ๋ค๋ฃจ๋ ๋ช๊ฐ์ง ์ฐธ๊ณ ๋ฌธ์๋ค์
๋๋ค:"
#: src/other-resources.md:10
msgid ""
"* [The Rust Programming Language](https://doc.rust-lang.org/book/): the\n"
" canonical free book about Rust. Covers the language in detail and includes a\n"
" few projects for people to build.\n"
"* [Rust By Example](https://doc.rust-lang.org/rust-by-example/): covers the Rust\n"
" syntax via a series of examples which showcase different constructs. Sometimes\n"
" includes small exercises where you are asked to expand on the code in the\n"
" examples.\n"
"* [Rust Standard Library](https://doc.rust-lang.org/std/): full documentation of\n"
" the standard library for Rust.\n"
"* [The Rust Reference](https://doc.rust-lang.org/reference/): an incomplete book\n"
" which describes the Rust grammar and memory model."
msgstr ""
"* [The Rust Programming Language](https://doc.rust-lang.org/book/): ๋ฌ์คํธ์ ๋ํ ๋ฌด๋ฃ ํ์ค ์์ ์
๋๋ค. ์ธ์ด์ ๋ํ ์์ธํ ์ค๋ช
๊ณผ ์ฌ๋๋ค์ด ๋น๋ ํ ์ ์๋ ๋ช๊ฐ์ง ํ๋ก์ ํธ๋ฅผ ํฌํจํฉ๋๋ค.\n"
"* [Rust By Example](https://doc.rust-lang.org/rust-by-example/): ์ฌ๋ฌ ์์ ๋ฅผ ํตํด ๋ฌ์คํธ์ ๋ฌธ๋ฒ์ ๋ณด์ฌ์ฃผ๋ฉฐ ๋๋๋ก ์ฝ๋๋ฅผ ํ์ฅํ๋ ์ฝ๊ฐ์ ์ฐ์ต๋ฌธ์ ๋ค์ด ํฌํจ๋์ด ์์ต๋๋ค.\n"
"* [Rust Standard Library](https://doc.rust-lang.org/std/): ๋ฌ์คํธ ํ์ค ๋ผ์ด๋ธ๋ฌ๋ฆฌ ์ ์ฒด ๋ฌธ์์
๋๋ค.\n"
"* [The Rust Reference](https://doc.rust-lang.org/reference/): ๋ฉ๋ชจ๋ฆฌ ๋ชจ๋ธ๋ง๊ณผ ๋ฌ์คํธ ๋ฌธ๋ฒ์ ์ค๋ช
ํ๋ ๋ฌธ์์
๋๋ค.(์์ง ๋ถ์์ ํ๋คํจ)"
#: src/other-resources.md:22
msgid "More specialized guides hosted on the official Rust site:"
msgstr "์ข ๋ ์ ๋ฌธ์ ์ธ ๊ณต์ ๊ฐ์ด๋์
๋๋ค:"
#: src/other-resources.md:24
msgid ""
"* [The Rustonomicon](https://doc.rust-lang.org/nomicon/): covers unsafe Rust,\n"
" including working with raw pointers and interfacing with other languages\n"
" (FFI).\n"
"* [Asynchronous Programming in Rust](https://rust-lang.github.io/async-book/):\n"
" covers the new asynchronous programming model which was introduced after the\n"
" Rust Book was written.\n"
"* [The Embedded Rust Book](https://doc.rust-lang.org/stable/embedded-book/): an\n"
" introduction to using Rust on embedded devices without an operating system."
msgstr ""
"* [The Rustonomicon](https://doc.rust-lang.org/nomicon/): ์์ ํ์ง ์์ ๋ฌ์คํธ, FFI, rawํฌ์ธํฐ ์์
์ ๋ค๋ฃน๋๋ค.\n"
"* [Asynchronous Programming in Rust](https://rust-lang.github.io/async-book/): ๋ฌ์คํธ ๋ถ์ด ์์ฑ ๋ ์ดํ ๋์
๋ ์๋ก์ด ๋น๋๊ธฐ ํ๋ก๊ทธ๋๋ฐ ๋ชจ๋ธ์ ๋ค๋ฃน๋๋ค.\n"
"* [The Embedded Rust Book](https://doc.rust-lang.org/stable/embedded-book/): ์ด์์ฒด์ ๊ฐ ์๋ ์๋ฒ ๋๋ ์ฅ์น์์์ ๋ฌ์คํธ ์ฌ์ฉ๋ฒ์ ์๊ฐํฉ๋๋ค."
#: src/other-resources.md:33
msgid "## Unofficial Learning Material"
msgstr "## ๋น๊ณต์์ ํ์ต ์๋ฃ"
#: src/other-resources.md:35
msgid "A small selection of other guides and tutorial for Rust:"
msgstr "๋ฌ์คํธ์ ๋ํ ๊ธฐํ ์๋ด์์ ํํ ๋ฆฌ์ผ์ ์ผ๋ถ์
๋๋ค:"
#: src/other-resources.md:37
msgid ""
"* [Learn Rust the Dangerous Way](http://cliffle.com/p/dangerust/): covers Rust\n"
" from the perspective of low-level C programmers.\n"
"* [Rust for Embedded C\n"
" Programmers](https://docs.opentitan.org/doc/ug/rust_for_c/): covers Rust from\n"
" the perspective of developers who write firmware in C.\n"
"* [Rust for professionals](https://overexact.com/rust-for-professionals/):\n"
" covers the syntax of Rust using side-by-side comparisons with other languages\n"
" such as C, C++, Java, JavaScript, and Python.\n"
"* [Rust on Exercism](https://exercism.org/tracks/rust): 100+ exercises to help\n"
" you learn Rust.\n"
"* [Ferrous Teaching\n"
" Material](https://ferrous-systems.github.io/teaching-material/index.html): a\n"
" series of small presentations covering both basic and advanced part of the\n"
" Rust language. Other topics such as WebAssembly, and async/await are also\n"
" covered.\n"
"* [Beginner's Series to\n"
" Rust](https://docs.microsoft.com/en-us/shows/beginners-series-to-rust/) and\n"
" [Take your first steps with\n"
" Rust](https://docs.microsoft.com/en-us/learn/paths/rust-first-steps/): two\n"
" Rust guides aimed at new developers. The first is a set of 35 videos and the\n"
" second is a set of 11 modules which covers Rust syntax and basic constructs.\n"
"* [Learn Rust With Entirely Too Many Linked\n"
" Lists](https://rust-unofficial.github.io/too-many-lists/): in-depth\n"
" exploration of Rust's memory management rules, through implementing a few\n"
" different types of list structures."
msgstr ""
"* [Learn Rust the Dangerous Way](http://cliffle.com/p/dangerust/): C์ธ์ด ํ๋ก๊ทธ๋๋จธ ๊ด์ ์์ ๋ฌ์คํธ๋ฅผ ๋ค๋ฃน๋๋ค.\n"
"* [Rust for Embedded C Programmers](https://docs.opentitan.org/doc/ug/rust_for_c/): ์๋ฒ ๋๋ C๊ฐ๋ฐ์(ํ์จ์ด ๊ฐ๋ฐ์)๋ฅผ ์ํ ๋ฌ์คํธ ๊ฐ์ด๋์
๋๋ค.\n"
"* [Rust for professionals](https://overexact.com/rust-for-professionals/): ๋ค๋ฅธ ์ธ์ด(C/C++, Java, Python, Javascript)์์ ๋ณ๋ ฌ๋น๊ต๋ฅผ ์ฌ์ฉํ์ฌ ๋ฌ์คํธ ๋ฌธ๋ฒ์ ๋ค๋ฃน๋๋ค.\n"
"* [Rust on Exercism](https://exercism.org/tracks/rust): ๋ฌ์คํธ๋ฅผ ๋ฐฐ์ฐ๋๋ฐ ๋์์ด ๋๋ 100๊ฐ ์ด์์ ์ฐ์ต๋ฌธ์ \n"
"* [Ferrous Teaching Material](https://ferrous-systems.github.io/teaching-material/index.html): ๋ฌ์คํธ ์ธ์ด์ ๊ธฐ๋ณธ๋ถํฐ ๊ณ ๊ธ์ ์ ๋ถ ๋ค๋ฃจ๋ ์ผ๋ จ์ ์์ ํ๋ ์ ํ
์ด์
, ์น ์ด์
๋ธ๋ฆฌ, async/await ๊ฐ์ ๋ถ๋ถ๋ ํจ๊ป ๋ค๋ฃน๋๋ค.\n"
"* [Beginner's Series to Rust](https://docs.microsoft.com/en-us/shows/beginners-series-to-rust/), [Take your first steps with Rust](https://docs.microsoft.com/en-us/learn/paths/rust-first-steps/): ์ฒซ๋ฒ์งธ๋ 35๊ฐ์ ์๋ฆฌ์ฆ ์์์ด๋ฉฐ ๋๋ฒ์งธ๋ ๋ฌ์คํธ์ ๋ฌธ๋ฒ๊ณผ ๊ตฌ์กฐ๋ฅผ ๋ค๋ฃจ๋ 11๊ฐ์ ๋ชจ๋ ์ธํธ์
๋๋ค.\n"
"* [Learn Rust With Entirely Too Many Linked Lists](https://rust-unofficial.github.io/too-many-lists/): ๋ช๊ฐ์ง ์ ํ์ ๋ฆฌ์คํธ ์๋ฃ๊ตฌ์กฐ๋ฅผ ๊ตฌํํด๋ณด๋ฉด์ ๋ฌ์คํธ์ ๋ฉ๋ชจ๋ฆฌ ๊ด๋ฆฌ ๊ท์น๋ค์ ๊น์ด์๊ฒ ํ์ํฉ๋๋ค."
#: src/other-resources.md:63
msgid ""
"Please see the [Little Book of Rust Books](https://lborb.github.io/book/) for\n"
"even more Rust books."
msgstr "[Little Book of Rust Books](https://lborb.github.io/book/)์์ ๋ ๋ง์ ๋ฌ์คํธ ๋ถ์ ํ์ธํด๋ณด์ธ์."
#: src/credits.md:1
msgid "# Credits"
msgstr "# Credits"
#: src/credits.md:3
msgid ""
"The material here builds on top of the many great sources of Rust documentation.\n"
"See the page on [other resources](other-resources.md) for a full list of useful\n"
"resources."
msgstr "์ด ์๋ฃ๋ ๋ง์ ํ๋ฅญํ ๋ฌ์คํธ ๋ฌธ์๋ค์ ๋์์ ๋ฐ์ ์์ฑ๋์์ต๋๋ค. ์ ์ฉํ ์๋ฃ์ ์ ์ฒด ๋ชฉ๋ก์ [other resources](other-resources.md)์์ ์ดํด๋ณด์๊ธฐ ๋ฐ๋๋๋ค."
#: src/credits.md:7
msgid ""
"The material of Comprehensive Rust is licensed under the terms of the Apache 2.0\n"
"license, please see [`LICENSE`](../LICENSE) for details."
msgstr "Comprehensive Rust์ ์๋ฃ๋ Apache 2.0 ๋ผ์ด์ ์ค๋ฅผ ๋ฐ๋ฆ
๋๋ค. ์์ธํ๊ฑด [`LICENSE`](../LICENSE) ํ์ธํด ๋ณด์๊ธฐ ๋ฐ๋๋๋ค."
#: src/credits.md:10
msgid "## Rust by Example"
msgstr ""
#: src/credits.md:12
msgid ""
"Some examples and exercises have been copied and adapted from [Rust by\n"
"Example](https://doc.rust-lang.org/rust-by-example/). Please see the\n"
"`third_party/rust-by-example/` directory for details, including the license\n"
"terms."
msgstr "์ผ๋ถ ์์ ์ ์ฐ์ต๋ฌธ์ ๋ [Rust by Example](https://doc.rust-lang.org/rust-by-example/)์ ์ฐธ์กฐํ์์ต๋๋ค. ๋ผ์ด์ ์ค ์กฐํญ์ ํฌํจํ์ฌ ์ ์ฅ์์ `third_party/rust-by-example/` ํด๋๋ฅผ ์ฐธ์กฐํ์๊ธฐ ๋ฐ๋๋๋ค."
#: src/credits.md:17
msgid "## Rust on Exercism"
msgstr ""
#: src/credits.md:19
msgid ""
"Some exercises have been copied and adapted from [Rust on\n"
"Exercism](https://exercism.org/tracks/rust). Please see the\n"
"`third_party/rust-on-exercism/` directory for details, including the license\n"
"terms."
msgstr "์ผ๋ถ ์ฐ์ต๋ฌธ์ ๋ [Rust on Exercism](https://exercism.org/tracks/rust)์ ์ฐธ์กฐํ์์ต๋๋ค. ๋ผ์ด์ ์ค ์กฐํญ์ ํฌํจํ์ฌ ์ ์ฅ์์ `third_party/rust-on-exercism/`ํด๋๋ฅผ ์ฐธ์กฐํ์๊ธฐ ๋ฐ๋๋๋ค."
#: src/credits.md:24
msgid "## CXX"
msgstr ""
#: src/credits.md:26
msgid ""
"The [Interoperability with C++](android/interoperability/cpp.md) section uses an\n"
"image from [CXX](https://cxx.rs/). Please see the `third_party/cxx/` directory\n"
"for details, including the license terms."
msgstr "4์ผ์ฐจ ์คํ ๊ฐ์ ์ค [Interoperability with C++](android/interoperability/cpp.md)์์๋ [CXX](https://cxx.rs/)์ ์ด๋ฏธ์ง๋ฅผ ์ฌ์ฉํ์์ต๋๋ค. ๋ผ์ด์ ์ค ์กฐํญ์ ํฌํจํ์ฌ ์ ์ฅ์์ `third_party/cxx/`ํด๋๋ฅผ ์ฐธ์กฐํ์๊ธฐ ๋ฐ๋๋๋ค."
#: src/exercises/solutions.md:1
msgid "# Solutions"
msgstr "# ํด๋ต"
#: src/exercises/solutions.md:3
msgid "You will find solutions to the exercises on the following pages."
msgstr "์ฐ์ต๋ฌธ์ ์ ํด๋ต์ ๋ค์ ํ์ด์ง์์ ํ์ธํ ์ ์์ต๋๋ค."
#: src/exercises/solutions.md:5
msgid ""
"Feel free to ask questions about the solutions [on\n"
"GitHub](https://github.com/google/comprehensive-rust/discussions). Let us know\n"
"if you have a different or better solution than what is presented here."
msgstr "[๊นํ๋ธ](https://github.com/google/comprehensive-rust/discussions)์์ ์ด์ ๋ํด ์์ ๋กญ๊ฒ ์ง๋ฌธํ์๊ณ ๋ ๋์ ์๋ฃจ์
์ด ์๋ค๋ฉด ์๋ ค์ฃผ์๊ธฐ ๋ฐ๋๋๋ค."
#: src/exercises/solutions.md:10
msgid ""
"> **Note:** Please ignore the `// ANCHOR: label` and `// ANCHOR_END: label`\n"
"> comments you see in the solutions. They are there to make it possible to\n"
"> re-use parts of the solutions as the exercises."
msgstr "> **์ฐธ๊ณ :** `// ANCHOR: label`๊ณผ `// ANCHOR_END: label` ์ฃผ์์ ๋ฌธ์ ๋ฅผ ๊ตฌ์ฑํ๊ธฐ ์ํ ๋ฉํ ์ฃผ์์ผ๋ก ๋ฌด์ํ์๋ฉด ๋ฉ๋๋ค."
#: src/exercises/day-1/solutions-morning.md:1
msgid "# Day 1 Morning Exercises"
msgstr "# 1์ผ์ฐจ ์ค์ ์ฐ์ต๋ฌธ์ "
#: src/exercises/day-1/solutions-morning.md:3
msgid "## Arrays and `for` Loops"
msgstr "## ๋ฐฐ์ด๊ณผ `for`๋ฐ๋ณต๋ฌธ"
#: src/exercises/day-1/solutions-morning.md:5
msgid "([back to exercise](for-loops.md))"
msgstr ""
#: src/exercises/day-1/solutions-morning.md:7
msgid ""
"```rust\n"
"// Copyright 2022 Google LLC\n"
"//\n"
"// Licensed under the Apache License, Version 2.0 (the \"License\");\n"
"// you may not use this file except in compliance with the License.\n"
"// You may obtain a copy of the License at\n"
"//\n"
"// http://www.apache.org/licenses/LICENSE-2.0\n"
"//\n"
"// Unless required by applicable law or agreed to in writing, software\n"
"// distributed under the License is distributed on an \"AS IS\" BASIS,\n"
"// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n"
"// See the License for the specific language governing permissions and\n"
"// limitations under the License.\n"
"\n"
"// ANCHOR: transpose\n"
"fn transpose(matrix: [[i32; 3]; 3]) -> [[i32; 3]; 3] {\n"
" // ANCHOR_END: transpose\n"
" let mut result = [[0; 3]; 3];\n"
" for i in 0..3 {\n"
" for j in 0..3 {\n"
" result[j][i] = matrix[i][j];\n"
" }\n"
" }\n"
" return result;\n"
"}\n"
"\n"
"// ANCHOR: pretty_print\n"
"fn pretty_print(matrix: &[[i32; 3]; 3]) {\n"
" // ANCHOR_END: pretty_print\n"
" for row in matrix {\n"
" println!(\"{row:?}\");\n"
" }\n"
"}\n"
"\n"
"// ANCHOR: tests\n"
"#[test]\n"
"fn test_transpose() {\n"
" let matrix = [\n"
" [101, 102, 103], //\n"
" [201, 202, 203],\n"
" [301, 302, 303],\n"
" ];\n"
" let transposed = transpose(matrix);\n"
" assert_eq!(\n"
" transposed,\n"
" [\n"
" [101, 201, 301], //\n"
" [102, 202, 302],\n"
" [103, 203, 303],\n"
" ]\n"
" );\n"
"}\n"
"// ANCHOR_END: tests\n"
"\n"
"// ANCHOR: main\n"
"fn main() {\n"
" let matrix = [\n"
" [101, 102, 103], // <-- the comment makes rustfmt add a newline\n"
" [201, 202, 203],\n"
" [301, 302, 303],\n"
" ];\n"
"\n"
" println!(\"matrix:\");\n"
" pretty_print(&matrix);\n"
"\n"
" let transposed = transpose(matrix);\n"
" println!(\"transposed:\");\n"
" pretty_print(&transposed);\n"
"}\n"
"```"
msgstr ""
#: src/exercises/day-1/solutions-morning.md:78
msgid "### Bonus question"
msgstr "### ๋ณด๋์ค ๋ฌธ์ "
#: src/exercises/day-1/solutions-morning.md:80
msgid "It requires more advanced concepts. It might seem that we could use a slice-of-slices (`&[&[i32]]`) as the input type to transpose and thus make our function handle any size of matrix. However, this quickly breaks down: the return type cannot be `&[&[i32]]` since it needs to own the data you return."
msgstr "์ฌ์ค ์ด ๋ฌธ์ ๋ ๊ณ ๊ธ ๊ฐ๋
์ด ํ์ํฉ๋๋ค. ์ฌ๋ผ์ด์ค์ ์ฌ๋ผ์ด์ค(slice-of-slices, `&[&[i32]]`)๋ฅผ ์
๋ ฅ ํ์
์ผ๋ก ์ฌ์ฉํ๋ฉด ๋ชจ๋ ํฌ๊ธฐ์ ํ๋ ฌ์ ์ฒ๋ฆฌํ ์ ์์๊ฒ ๊ฐ์ต๋๋ค. ํ์ง๋ง ์ค์ ๋ก ํด๋ณด๋ฉด ๊ธ๋ฐฉ ์๋๋ค๋ ๊ฑธ ์ ์ ์์ต๋๋ค. ๋ฐํ๊ฐ์ ์์ ํด์ผ ํ๊ธฐ๋๋ฌธ์ `&[&[i32]]` ๋ฐํ ํ์
์ผ๋ก ์ฌ์ฉํ ์ ์์ต๋๋ค."
#: src/exercises/day-1/solutions-morning.md:82
msgid "You can attempt to use something like `Vec