{"id":29911,"date":"2025-09-21T14:00:27","date_gmt":"2025-09-21T11:00:27","guid":{"rendered":"https:\/\/fatihsoysal.com\/blog\/rust-hizli-baslangic-rehberi\/"},"modified":"2025-09-21T14:00:27","modified_gmt":"2025-09-21T11:00:27","slug":"rust-hizli-baslangic-rehberi","status":"publish","type":"post","link":"https:\/\/fatihsoysal.com\/blog\/rust-hizli-baslangic-rehberi\/","title":{"rendered":"Rust H\u0131zl\u0131 Ba\u015flang\u0131\u00e7 Rehberi"},"content":{"rendered":"

Rust H\u0131zl\u0131 Ba\u015flang\u0131\u00e7 Rehberi<\/p>\n

Rust \u00f6\u011frenmeye mi karar verdiniz? Performans odakl\u0131, g\u00fcvenli ve modern bir dil olan Rust'\u0131n sundu\u011fu imkanlar\u0131 ke\u015ffetmek i\u00e7in do\u011fru yerdesiniz. Bu kapsaml\u0131 rehber, Rust'\u0131 s\u0131f\u0131rdan \u00f6\u011frenmenize ve uzman seviyesine ula\u015fman\u0131za yard\u0131mc\u0131 olacak pratik bilgiler ve \u00f6rnekler sunuyor. H\u0131zl\u0131, g\u00fcvenli ve modern uygulamalar geli\u015ftirmek i\u00e7in Rust'\u0131n g\u00fcc\u00fcnden yararlanmay\u0131 \u00f6\u011frenin!<\/p>\n

Rust'a Giri\u015f: Neden Rust \u00d6\u011frenmeliyim?<\/h2>\n

G\u00fcn\u00fcm\u00fczde yaz\u0131l\u0131m geli\u015ftirme d\u00fcnyas\u0131nda, performans ve g\u00fcvenlik en \u00f6nemli \u00f6ncelikler aras\u0131nda yer al\u0131yor. C++ gibi performans odakl\u0131 diller, bellek y\u00f6netimi hatalar\u0131na kar\u015f\u0131 savunmas\u0131z olabilirken, Python gibi y\u00fcksek seviyeli diller performans a\u00e7\u0131s\u0131ndan dezavantajlara sahip olabilir. \u0130\u015fte bu noktada Rust devreye giriyor. Rust, hem performans hem de bellek g\u00fcvenli\u011fi konusunda benzersiz bir denge sunan, modern bir sistem programlama dilidir. Haf\u0131za g\u00fcvenli\u011fi sorunlar\u0131na neden olabilecek bellek s\u0131z\u0131nt\u0131lar\u0131, as\u0131l\u0131 i\u015faret\u00e7iler ve yar\u0131\u015f ko\u015fullar\u0131na kar\u015f\u0131 sa\u011flam koruma mekanizmalar\u0131yla, Rust, g\u00fcvenilir ve y\u00fcksek performansl\u0131 yaz\u0131l\u0131mlar geli\u015ftirmenizi sa\u011flar. Ayr\u0131ca, Rust'\u0131n modern ve geli\u015fmi\u015f \u00f6zelliklerle dolu olmas\u0131, geli\u015ftirici deneyimini b\u00fcy\u00fck \u00f6l\u00e7\u00fcde art\u0131r\u0131r. Daha fazla bilgi i\u00e7in Fatih Soysal'\u0131n web sitesini<\/a> ziyaret edebilirsiniz.<\/p>\n

Rust Temel Kavramlar\u0131: \u0130lk Ad\u0131mlar<\/h2>\n

Rust'\u0131 \u00f6\u011frenmeye ba\u015flamadan \u00f6nce, baz\u0131 temel kavramlar\u0131 anlamak \u00f6nemlidir. Bunlar aras\u0131nda de\u011fi\u015fkenler, veri tipleri, kontrol ak\u0131\u015f\u0131 yap\u0131lar\u0131 (if-else, d\u00f6ng\u00fcler), fonksiyonlar ve ownership (sahiplik) konsepti yer al\u0131r. Rust'\u0131n sahiplik sistemi, bellek y\u00f6netimini otomatik hale getirerek bellek s\u0131z\u0131nt\u0131lar\u0131n\u0131 ve di\u011fer hatalar\u0131 \u00f6nlemeye yard\u0131mc\u0131 olur. Ayr\u0131ca, Rust'\u0131n g\u00fc\u00e7l\u00fc tip sistemi, derleme zaman\u0131nda hatalar\u0131n yakalanmas\u0131n\u0131 sa\u011flar, bu da geli\u015ftirme s\u00fcrecinde daha az hata ile kar\u015f\u0131la\u015fman\u0131z\u0131 sa\u011flar. A\u015fa\u011f\u0131da basit bir “Merhaba D\u00fcnya” program\u0131 \u00f6rne\u011fi verilmi\u015ftir:<\/p>\n

<\/code><\/p>\n

rust\nfn main() {\n    println!(\"Merhaba D\u00fcnya!\");\n}<\/pre>\n
<\/code><\/p>\n
Bu basit program, main<\/code> fonksiyonunu tan\u0131mlar ve println!<\/code> makrosu ile konsola \"Merhaba D\u00fcnya!\" yazd\u0131r\u0131r.  Bu, Rust programlamas\u0131na ba\u015flamak i\u00e7in m\u00fckemmel bir ba\u015flang\u0131\u00e7 noktas\u0131d\u0131r.  Daha karma\u015f\u0131k projeler i\u00e7in,  Rust'\u0131n standart k\u00fct\u00fcphanesi ve \u00fc\u00e7\u00fcnc\u00fc taraf k\u00fct\u00fcphaneleri size geni\u015f bir ara\u00e7 seti sunar.<\/p>\n
Rust'ta Veri Yap\u0131lar\u0131 ve Algoritmalar: Uygulamada \u00d6rnekler<\/h2>\n
Rust, \u00e7e\u015fitli veri yap\u0131lar\u0131 ve algoritmalar\u0131 destekler.  Vekt\u00f6rler, listeler, hash map'ler gibi yayg\u0131n veri yap\u0131lar\u0131na ek olarak, Rust'ta karma\u015f\u0131k veri yap\u0131lar\u0131n\u0131 da kendimiz olu\u015fturabiliriz.  \u00d6rne\u011fin, bir ba\u011flant\u0131l\u0131 liste veya a\u011fa\u00e7 yap\u0131s\u0131 olu\u015fturarak \u00f6zelle\u015ftirilmi\u015f uygulamalar geli\u015ftirebiliriz.  A\u015fa\u011f\u0131da, bir vekt\u00f6r\u00fc kullanarak say\u0131lar\u0131n ortalamas\u0131n\u0131 hesaplayan bir \u00f6rnek verilmi\u015ftir:<\/p>\n
<\/code><\/p>\n
rust\nfn main() {\n    let numbers = vec![10, 20, 30, 40, 50];\n    let sum: i32 = numbers.iter().sum();\n    let average = sum as f64 \/ numbers.len() as f64;\n    println!(\"Ortalama: {}\", average);\n}<\/pre>\n
<\/code><\/p>\n
Bu \u00f6rnekte, vec!<\/code> makrosu ile bir vekt\u00f6r olu\u015fturuyoruz ve iter().sum()<\/code> metodu ile elemanlar\u0131n toplam\u0131n\u0131 hesapl\u0131yoruz. Sonras\u0131nda, ortalamay\u0131 hesaplamak i\u00e7in toplam\u0131 eleman say\u0131s\u0131na b\u00f6l\u00fcyoruz.  Bu \u00f6rnek, Rust'\u0131n veri yap\u0131lar\u0131 ve i\u015flevsel programlama yeteneklerini g\u00f6stermektedir. Daha karma\u015f\u0131k algoritmalar i\u00e7in, Rust'\u0131n sa\u011flam k\u00fct\u00fcphane deste\u011fi size yard\u0131mc\u0131 olacakt\u0131r. Daha ileri d\u00fczey \u00f6rnekler i\u00e7in Fatih Soysal'\u0131n bloguna<\/a> g\u00f6z atabilirsiniz.<\/p>\n
Rust'ta Ownership (Sahiplik) ve Borrowing (\u00d6d\u00fcn\u00e7 Verme): Bellek Y\u00f6netimi<\/h2>\n
Rust'\u0131n en \u00f6nemli \u00f6zelliklerinden biri, sahiplik (ownership) ve \u00f6d\u00fcn\u00e7 verme (borrowing) sistemidir. Bu sistem, bellek y\u00f6netimini g\u00fcvenli ve verimli bir \u015fekilde y\u00f6netmeyi sa\u011flar.  Sahiplik, bir de\u011fi\u015fkenin bellekteki bir de\u011fere ait oldu\u011funu belirtir.  Bir de\u011fi\u015fkenin yaln\u0131zca bir sahibi olabilir ve sahibi yok edildi\u011finde, bellek otomatik olarak serbest b\u0131rak\u0131l\u0131r.  \u00d6d\u00fcn\u00e7 verme ise, bir de\u011fi\u015fkenin de\u011ferine ge\u00e7ici olarak eri\u015fim sa\u011flamay\u0131 m\u00fcmk\u00fcn k\u0131lar.  Bu mekanizma, bellek s\u0131z\u0131nt\u0131lar\u0131n\u0131 ve as\u0131l\u0131 i\u015faret\u00e7ileri \u00f6nleyerek program\u0131n g\u00fcvenilirli\u011fini art\u0131r\u0131r.  Yanl\u0131\u015f kullan\u0131m durumlar\u0131nda derleyici, hata bildirimi g\u00f6ndererek geli\u015ftiriciyi uyar\u0131r.<\/p>\n
<\/code><\/p>\n
rust\nfn main() {\n    let s1 = String::from(\"hello\");\n    let s2 = s1; \/\/ s1'in sahipli\u011fi s2'ye ge\u00e7ti, s1 art\u0131k kullan\u0131lamaz.\n    \/\/println!(\"{}\", s1); \/\/ Hata: s1 art\u0131k ge\u00e7ersiz.\n    println!(\"{}\", s2);\n}<\/pre>\n
<\/code><\/p>\n
Bu \u00f6rnekte, s1<\/code> de\u011fi\u015fkeninin sahipli\u011fi s2<\/code> de\u011fi\u015fkenine aktar\u0131l\u0131yor ve s1<\/code> art\u0131k ge\u00e7ersiz hale geliyor.  Bu, Rust'\u0131n sahiplik sisteminin nas\u0131l \u00e7al\u0131\u015ft\u0131\u011f\u0131n\u0131 g\u00f6steren basit bir \u00f6rnektir. Daha karma\u015f\u0131k senaryolar i\u00e7in, Rust'\u0131n \u00f6d\u00fcn\u00e7 verme kurallar\u0131 ve ya\u015fam s\u00fcreleri (lifetimes) hakk\u0131nda daha derinlemesine bilgi edinmeniz gerekebilir.  \u00d6rne\u011fin, ya\u015fam s\u00fcreleri, i\u015flevler aras\u0131nda de\u011ferleri g\u00fcvenli bir \u015fekilde payla\u015fmak i\u00e7in kullan\u0131l\u0131r. Rust'\u0131n bellek y\u00f6netimi hakk\u0131nda daha ayr\u0131nt\u0131l\u0131 bilgi i\u00e7in, Rust belgesine bakabilirsiniz.<\/p>\n
Rust'ta Concurrency (E\u015fzamanl\u0131l\u0131k): Performans\u0131 Art\u0131rma<\/h2>\n
Modern sistemlerde, performans\u0131 art\u0131rmak i\u00e7in e\u015fzamanl\u0131l\u0131k (concurrency) \u00f6nemlidir.  Rust, g\u00fcvenli ve verimli e\u015fzamanl\u0131 programlama i\u00e7in g\u00fc\u00e7l\u00fc ara\u00e7lar sunar.  threads<\/code>, channels<\/code> ve mutex<\/code> gibi ara\u00e7lar, farkl\u0131 g\u00f6revleri ayn\u0131 anda \u00e7al\u0131\u015ft\u0131rmay\u0131 ve kaynak payla\u015f\u0131m\u0131n\u0131 y\u00f6netmeyi kolayla\u015ft\u0131r\u0131r.  Rust'\u0131n e\u015fzamanl\u0131l\u0131k sistemi, yar\u0131\u015f ko\u015fullar\u0131n\u0131 (race conditions) ve di\u011fer e\u015fzamanl\u0131l\u0131k hatalar\u0131n\u0131 \u00f6nlemek i\u00e7in tasarlanm\u0131\u015ft\u0131r.  A\u015fa\u011f\u0131da, iki thread kullanarak say\u0131lar\u0131n toplam\u0131n\u0131 hesaplayan basit bir \u00f6rnek verilmi\u015ftir:<\/p>\n
<\/code><\/p>\n
rust\nuse std::thread;\nuse std::sync::mpsc;\n\nfn main() {\n    let (tx, rx) = mpsc::channel();\n\n    thread::spawn(move || {\n        let numbers = vec![1, 2, 3, 4, 5];\n        let sum: i32 = numbers.iter().sum();\n        tx.send(sum).unwrap();\n    });\n\n    let sum = rx.recv().unwrap();\n    println!(\"Toplam: {}\", sum);\n}<\/pre>\n
<\/code><\/p>\n
Bu \u00f6rnekte, mpsc::channel()<\/code> ile bir kanal olu\u015fturuyoruz ve thread::spawn()<\/code> ile bir thread ba\u015flat\u0131yoruz.  Thread, say\u0131lar\u0131n toplam\u0131n\u0131 hesapl\u0131yor ve sonucu kanala g\u00f6nderiyor.  Ana thread ise, kanaldan sonucu al\u0131yor ve yazd\u0131r\u0131yor.  Bu \u00f6rnek, Rust'\u0131n e\u015fzamanl\u0131l\u0131k \u00f6zelliklerinin temel kullan\u0131m\u0131n\u0131 g\u00f6stermektedir.  Daha karma\u015f\u0131k senaryolar i\u00e7in,  Rust'\u0131n sa\u011flad\u0131\u011f\u0131 geli\u015fmi\u015f e\u015fzamanl\u0131l\u0131k ara\u00e7lar\u0131n\u0131 incelemeniz faydal\u0131 olacakt\u0131r.  \u00d6rne\u011fin, tokio<\/code> ve async<\/code>\/await<\/code> ile asenkron programlama performans\u0131 \u00f6nemli \u00f6l\u00e7\u00fcde art\u0131rabilir.<\/p>\n
Rust'ta Hata Y\u00f6netimi: G\u00fcvenli Kod Yaz\u0131m\u0131<\/h2>\n
Rust, hata y\u00f6netimi i\u00e7in g\u00fc\u00e7l\u00fc bir mekanizma sunar.  Result<\/code> tipi ve ?<\/code> operat\u00f6r\u00fc, hatalar\u0131 temiz ve okunabilir bir \u015fekilde y\u00f6netmenizi sa\u011flar. Result<\/code> tipi, bir i\u015flemin ba\u015far\u0131l\u0131 olup olmad\u0131\u011f\u0131n\u0131 ve ba\u015far\u0131s\u0131z olmas\u0131 durumunda hata bilgisini tutar.  ?<\/code> operat\u00f6r\u00fc ise, bir Result<\/code> tipindeki i\u015flemin ba\u015far\u0131s\u0131z olmas\u0131 durumunda, i\u015flevin hemen sonlanmas\u0131n\u0131 ve hatay\u0131 geri d\u00f6nd\u00fcrmesini sa\u011flar. Bu, hata kodlar\u0131n\u0131n da\u011f\u0131lm\u0131\u015f bir \u015fekilde i\u015flenmesini \u00f6nler ve kodun daha temiz ve anla\u015f\u0131l\u0131r olmas\u0131n\u0131 sa\u011flar.<\/p>\n
<\/code>rust
\nuse std::fs::File;
\nuse std::io::ErrorKind;<\/p>\n
fn main() -> std::io::Result<()> {
\n    let f = File::open(“hello.txt”);<\/p>\n
    let f = match f {
\n        Ok(file) => file,
\n        Err(error) => match error.kind() {
\n            ErrorKind::NotFound => match File::create(“hello.txt”) {
\n                Ok(fc) => fc,
\n                Err(e) => return Err(e),
\n            },
\n            other_error => return Err(other_error),
\n        },
\n    };
\n    Ok(())
\n}<\/p>\n
Bu \u00f6rnekte, File::open()<\/code> fonksiyonu, bir dosyay\u0131 a\u00e7maya \u00e7al\u0131\u015f\u0131r.  E\u011fer dosya bulunmazsa, File::create()<\/code> fonksiyonu ile yeni bir dosya olu\u015fturulur.  Hata y\u00f6netimi i\u00e7in match<\/code> ifadesi ve Result<\/code> tipi kullan\u0131lm\u0131\u015ft\u0131r. Bu yakla\u015f\u0131m, potansiyel hatalar\u0131n d\u00fczg\u00fcn bir \u015fekilde ele al\u0131nmas\u0131n\u0131 sa\u011flayarak, program\u0131n beklenmedik durumlarda \u00e7\u00f6kmesini engeller.  Daha karma\u015f\u0131k hata y\u00f6netimi senaryolar\u0131 i\u00e7in, Rust'\u0131n hata y\u00f6netimi mekanizmalar\u0131n\u0131 daha ayr\u0131nt\u0131l\u0131 bir \u015fekilde incelemeniz tavsiye edilir.<\/p>\n\n\n
Rust \u00d6\u011frenme Yol Haritas\u0131<\/h2>\n\n
Yeni Ba\u015flayanlar \u0130\u00e7in<\/h3>\n\n