[{"data":1,"prerenderedAt":827},["ShallowReactive",2],{"tag-labels":3,"site-header":4,"article-rahasia-zero-cost-abstraction-di-rust-id":72},{},{"featuredPost":5,"navigations":29},{"id":6,"title":7,"title_en":8,"slug":9,"excerpt":10,"excerpt_en":11,"has_translation":12,"published_at":13,"reading_time":14,"hidden_from_listing":15,"tags":16,"thumbnail_image":21,"og_image":22,"series":23,"authors":28},110,"Ketika Pilih Framework Cuma Biar Kelihatan Beda","When You Pick a Framework Just to Look Different","ketika-pilih-framework-cuma-biar-kelihatan-beda","Terakhir kali kamu milih framework atau library baru, itu karena masalahmu butuh alat itu, atau karena alatnya kedengaran keren dan belum banyak yang pakai? Pertanyaan ini nggak enak dijawab. Soalnya keputusan teknologi sering diambil dengan alasan yang nggak pernah ditulis di dokumen teknis mana pun.","The last time you chose a new framework or library, was it because your problem needed that tool, or because it sounded cool and few people around you were using it? That question is uncomfortable. Technology decisions are often made for reasons that never appear in any technical document.",true,"2026-10-06T15:25:21.000Z",5,false,[17,18,19,20],"karier","framework","opini","pengalaman",null,"\u002Fog\u002Fketika-pilih-framework-cuma-biar-kelihatan-beda.png",{"id":24,"title":25,"title_en":26,"slug":27},9,"Artikel","Articles","all",[],[30,46,67],{"collection":31,"item":32},"series",{"__typename":31,"title":25,"title_en":26,"slug":27,"children_series":33},[34,38,42],{"title":35,"title_en":36,"slug":37},"Kecerdasan Artifisial","Artificial Intelligence","kecerdasan-artifisial",{"title":39,"title_en":40,"slug":41},"Konsep Dasar Pemrograman","Programming Fundamentals","konsep-dasar-pemrograman",{"title":43,"title_en":44,"slug":45},"Algoritma dan Struktur Data","Algorithms and Data Structures","algoritma-struktur-data",{"collection":31,"item":47},{"__typename":31,"title":48,"title_en":48,"slug":49,"children_series":50},"Tutorial","tutorial",[51,55,59,63],{"title":52,"title_en":53,"slug":54},"Belajar Python","Learning Python","belajar-python",{"title":56,"title_en":57,"slug":58},"Belajar Golang","Learning Go","belajar-golang",{"title":60,"title_en":61,"slug":62},"Belajar Java","Learning Java","belajar-java",{"title":64,"title_en":65,"slug":66},"Belajar Pascal","Learning Pascal","belajar-pascal",{"collection":31,"item":68},{"__typename":31,"title":69,"title_en":69,"slug":70,"children_series":71},"Lab","lab",[],{"article":73,"renderedBody":709,"renderedTakeaway":710,"latestArticles":711,"toc":808},{"id":74,"title":75,"title_en":76,"slug":77,"excerpt":78,"excerpt_en":79,"has_translation":12,"published_at":80,"reading_time":81,"hidden_from_listing":15,"tags":82,"thumbnail_image":21,"og_image":88,"series":89,"authors":699,"body_locale":704,"available_locales":705,"body":707,"takeway":708,"prerequisite":21},124,"Rahasia Zero-Cost Abstraction di Rust, Dibedah dari Assembly","The Secret of Zero-Cost Abstractions in Rust, Opened Up from the Assembly","rahasia-zero-cost-abstraction-di-rust","\"Abstraksi tinggi selalu lebih lambat\" itu anggapan lama. Iterator Rust bisa menyamai loop manual, dan assembly-nya bisa kita baca sendiri. Yuk, kita bongkar!","\"Higher abstractions are always slower\" is an old assumption. Rust iterators can match a hand-written loop, and the assembly is there for you to read. Let's take it apart.","2026-10-13T05:19:00.000Z",6,[83,84,85,86,87],"rust","performance","system-programming","compiler","optimasi","\u002Fog\u002Frahasia-zero-cost-abstraction-di-rust.png",{"id":24,"title":25,"title_en":26,"slug":27,"description":21,"description_en":90,"articles":91,"children_series":692,"parent_series":21},"Everything that isn't a tutorial or a lab: explainers, opinions, and notes from building things.",[92,107,122,136,149,164,179,193,208,222,234,249,273,291,311,329,347,366,382,399,417,432,447,463,478,493,507,523,541,560,575,592,609,621,625,640,654,669,685],{"id":93,"title":94,"title_en":95,"slug":96,"excerpt":97,"excerpt_en":98,"has_translation":12,"published_at":99,"reading_time":14,"hidden_from_listing":15,"tags":100,"thumbnail_image":21,"og_image":104,"series":105,"authors":106},11,"Apa Kabar JavaScript? Rilis State of JS 2022","How's JavaScript Doing? The State of JS 2022 Results Are In","apa-kabar-javascript-rilis-state-of-js-2022","Survei State of JS 2022 resmi dirilis dengan lonjakan responden yang luar biasa! Framework dan build tool apa saja yang berhasil mencuri perhatian tahun ini?","The State of JS 2022 survey is out, and the respondent count jumped hard. Which frameworks and build tools actually stole the year?","2026-06-15T02:36:30.205Z",[101,102,103],"javascript","web","news","\u002Fog\u002Fapa-kabar-javascript-rilis-state-of-js-2022.png",{"id":24,"title":25,"title_en":26,"slug":27},[],{"id":108,"title":109,"title_en":110,"slug":111,"excerpt":112,"excerpt_en":113,"has_translation":12,"published_at":114,"reading_time":14,"hidden_from_listing":15,"tags":115,"thumbnail_image":21,"og_image":119,"series":120,"authors":121},12,"Buat PowerShell Lebih Berwarna dengan Starship","Make PowerShell More Colorful with Starship","buat-powershell-lebih-berwarna-dengan-starship","Bosen sama tampilan PowerShell yang hitam putih dan kaku? Yuk, sulap terminalmu jadi lebih interaktif, estetik, dan berwarna pakai Starship!","Tired of PowerShell looking black, white, and stiff? Turn your terminal into something interactive, aesthetic, and colorful with Starship!","2026-06-15T02:37:24.143Z",[116,117,118],"shell","windows","powershell","\u002Fog\u002Fbuat-powershell-lebih-berwarna-dengan-starship.png",{"id":24,"title":25,"title_en":26,"slug":27},[],{"id":123,"title":124,"title_en":125,"slug":126,"excerpt":127,"excerpt_en":128,"has_translation":12,"published_at":129,"reading_time":14,"hidden_from_listing":15,"tags":130,"thumbnail_image":21,"og_image":133,"series":134,"authors":135},13,"Hal yang Perlu Diperhatikan Sebelum Pindah ke Linux","Things to Consider Before Switching to Linux","hal-yang-perlu-diperhatikan-sebelum-pindah-ke-linux","Tertarik migrasi dari Windows ke Linux tapi masih ragu? Yuk, pelajari kelebihan, kekurangan, dan persiapan penting sebelum kamu benar-benar pindah!","Tempted to migrate from Windows to Linux but still unsure? Learn the upsides, the downsides, and the prep you need before you actually switch.","2026-06-15T02:37:24.570Z",[131,117,132],"linux","foss","\u002Fog\u002Fhal-yang-perlu-diperhatikan-sebelum-pindah-ke-linux.png",{"id":24,"title":25,"title_en":26,"slug":27},[],{"id":137,"title":138,"title_en":139,"slug":140,"excerpt":141,"excerpt_en":142,"has_translation":12,"published_at":143,"reading_time":14,"hidden_from_listing":15,"tags":144,"thumbnail_image":21,"og_image":146,"series":147,"authors":148},15,"Kenapa Ada Banyak Sekali Distro Linux?","Why Are There So Many Linux Distros?","kenapa-ada-banyak-sekali-distro-linux","Pernah bingung pas mau install Linux tapi malah disuguhi puluhan pilihan distro? Tenang, kalian nggak sendirian. Yuk, cari tahu kenapa distro Linux bisa sebanyak itu dan apa bedanya!","Were you confused when installing Linux handed you dozens of distro options? You're not alone. Here's why there are so many, and what actually differs.","2026-06-15T02:38:14.569Z",[131,145],"distro","\u002Fog\u002Fkenapa-ada-banyak-sekali-distro-linux.png",{"id":24,"title":25,"title_en":26,"slug":27},[],{"id":150,"title":151,"title_en":152,"slug":153,"excerpt":154,"excerpt_en":155,"has_translation":12,"published_at":156,"reading_time":14,"hidden_from_listing":15,"tags":157,"thumbnail_image":21,"og_image":161,"series":162,"authors":163},16,"Menggunakan TypeScript dengan Node.js dan Express","Using TypeScript with Node.js and Express","menggunakan-typescript-dengan-node-js-dan-express","Pengen bikin server Express di Node.js tapi pakai fitur-fitur keren TypeScript? Yuk, intip cara setup lengkapnya dari nol di sini!","Want to build an Express server on Node.js but use TypeScript's nicer features? Here's the complete setup from scratch.","2026-06-15T02:38:30.735Z",[101,158,159,160],"nodejs","express","typescript","\u002Fog\u002Fmenggunakan-typescript-dengan-node-js-dan-express.png",{"id":24,"title":25,"title_en":26,"slug":27},[],{"id":165,"title":166,"title_en":167,"slug":168,"excerpt":169,"excerpt_en":170,"has_translation":12,"published_at":171,"reading_time":14,"hidden_from_listing":15,"tags":172,"thumbnail_image":21,"og_image":176,"series":177,"authors":178},17,"Pemrograman Asynchronous vs Multithreading, Apa Sih Bedanya?","Asynchronous Programming vs Multithreading: What's the Real Difference?","pemrograman-asynchronous-dan-multithreading-apa-bedanya","Sering dengar istilah asynchronous dan multithreading pas ngoding tapi masih bingung bedanya? Yuk, kita bedah perbedaannya lewat analogi bikin mi instan yang gampang dipahami!","You keep hearing asynchronous and multithreading while coding, but the difference stays fuzzy? Let's take it apart with an instant-noodle analogy you can follow.","2026-06-15T02:38:31.093Z",[173,174,175],"pemrograman","concurrency","tips-coding","\u002Fog\u002Fpemrograman-asynchronous-dan-multithreading-apa-bedanya.png",{"id":24,"title":25,"title_en":26,"slug":27},[],{"id":180,"title":181,"title_en":182,"slug":183,"excerpt":184,"excerpt_en":185,"has_translation":12,"published_at":186,"reading_time":14,"hidden_from_listing":15,"tags":187,"thumbnail_image":21,"og_image":190,"series":191,"authors":192},18,"React, Angular, atau Vue: Pilih Framework yang Mana?","React, Angular, or Vue: Which Framework Should You Pick?","react-angular-vue-pilih-framework-yang-mana","Bingung menentukan pilihan di antara React, Angular, dan Vue untuk proyek web kalian berikutnya? Tenang, yuk kita bandingkan kelebihan masing-masing di sini!","Stuck choosing between React, Angular, and Vue for your next web project? Here's a side-by-side look at what each one actually does well.","2026-06-15T02:38:31.431Z",[188,189,18],"web-development","frontend","\u002Fog\u002Freact-angular-vue-pilih-framework-yang-mana.png",{"id":24,"title":25,"title_en":26,"slug":27},[],{"id":194,"title":195,"title_en":196,"slug":197,"excerpt":198,"excerpt_en":199,"has_translation":12,"published_at":200,"reading_time":14,"hidden_from_listing":15,"tags":201,"thumbnail_image":21,"og_image":205,"series":206,"authors":207},19,"Static Typing dan Dynamic Typing: Apa Bedanya?","Static Typing vs Dynamic Typing: What's the Difference?","static-typing-dan-dynamic-typing-apa-bedanya","Pernah bingung kenapa di Java tipe data harus dideklarasikan, sementara di Python tinggal pakai aja? Yuk, cari tahu perbedaan static typing dan dynamic typing di sini!","Ever wondered why Java makes you declare a type while Python just takes the value? Here's the difference between static typing and dynamic typing.","2026-06-15T02:39:15.869Z",[202,203,204],"programming","types","comparison","\u002Fog\u002Fstatic-typing-dan-dynamic-typing-apa-bedanya.png",{"id":24,"title":25,"title_en":26,"slug":27},[],{"id":209,"title":210,"title_en":211,"slug":212,"excerpt":213,"excerpt_en":214,"has_translation":12,"published_at":215,"reading_time":14,"hidden_from_listing":15,"tags":216,"thumbnail_image":21,"og_image":219,"series":220,"authors":221},20,"Tailwind v3.0 Rilis: Ada JIT, Arbitrary Values, dan Banyak Lagi!","Tailwind v3.0 Is Out: JIT, Arbitrary Values, and Plenty More","tailwind-v3-0-rilis-jit-arbitrary-dan-banyak-lagi","Tailwind CSS v3.0 resmi dirilis dengan segudang peningkatan performa yang bikin proses coding makin asyik. Apa aja sih fitur andalan yang wajib dicoba?","Tailwind CSS v3.0 shipped with a pile of performance upgrades that make styling more fun. Which features are worth trying first?","2026-06-15T02:39:25.372Z",[217,218,188],"tailwind-css","css-framework","\u002Fog\u002Ftailwind-v3-0-rilis-jit-arbitrary-dan-banyak-lagi.png",{"id":24,"title":25,"title_en":26,"slug":27},[],{"id":223,"title":224,"title_en":225,"slug":226,"excerpt":227,"excerpt_en":228,"has_translation":12,"published_at":229,"reading_time":14,"hidden_from_listing":15,"tags":230,"thumbnail_image":21,"og_image":231,"series":232,"authors":233},21,"TypeScript: JavaScript dengan Gaya dan Tipe Data Statis","TypeScript: JavaScript with Style and Static Types","typescript-javascript-dengan-gaya","Pernah pusing gara-gara runtime error di JavaScript? Yuk, kenalan dengan TypeScript yang bawa fitur static typing biar kode kalian makin rapi dan aman!","Tired of runtime errors in JavaScript? Meet TypeScript, which brings static typing so your code stays tidier and safer.","2026-06-15T02:39:25.712Z",[160,101,188],"\u002Fog\u002Ftypescript-javascript-dengan-gaya.png",{"id":24,"title":25,"title_en":26,"slug":27},[],{"id":235,"title":236,"title_en":237,"slug":238,"excerpt":239,"excerpt_en":240,"has_translation":12,"published_at":241,"reading_time":14,"hidden_from_listing":15,"tags":242,"thumbnail_image":21,"og_image":246,"series":247,"authors":248},22,"Yang Baru di Nuxt 3: Nitro Engine, Vite, dan Fitur Keren Lainnya","What's New in Nuxt 3: Nitro Engine, Vite, and Other Sharp Features","yang-baru-di-nuxt-3-nitro-vite-dan-banyak-lagi","Nuxt 3 hadir membawa perubahan arsitektur besar-besaran untuk menyelaraskan dengan Vue 3. Penasaran apa saja peningkatan performa dan fitur barunya?","Nuxt 3 brings a sweeping architecture change to line up with Vue 3. Here's what got faster and which new features are worth trying.","2026-06-15T02:39:26.086Z",[243,244,245],"nuxt-3","vue-3","frontend-framework","\u002Fog\u002Fyang-baru-di-nuxt-3-nitro-vite-dan-banyak-lagi.png",{"id":24,"title":25,"title_en":26,"slug":27},[],{"id":250,"title":251,"title_en":252,"slug":253,"excerpt":254,"excerpt_en":255,"has_translation":12,"published_at":256,"reading_time":257,"hidden_from_listing":15,"tags":258,"thumbnail_image":21,"og_image":264,"series":265,"authors":266},23,"Kenapa Pakai FastAPI dan Kenapa Dia Kenceng Banget?","Why Use FastAPI, and Why Is It So Fast?","kenapa-pakai-fastapi-dan-kenapa-dia-kenceng-banget","Sering dengar FastAPI tapi masih bingung kenapa dia bisa ngebut kayak NodeJS dan Go? Yuk, kita bedah bareng rahasia ASGI, sihir Pydantic, sampai dokumentasi otomatisnya!","You keep hearing about FastAPI but still wonder how it can keep pace with NodeJS and Go? Let's take apart ASGI, the Pydantic magic, and the automatic docs.","2026-08-16T13:22:46.956Z",4,[259,260,261,262,263],"fastapi","python","backend","asgi","pydantic","\u002Fog\u002Fkenapa-pakai-fastapi-dan-kenapa-dia-kenceng-banget.png",{"id":24,"title":25,"title_en":26,"slug":27},[267],{"authors_id":268},{"id":269,"name":270,"slug":271,"role":272,"profile_picture":21},2,"Inva","inva","Writer",{"id":274,"title":275,"title_en":276,"slug":277,"excerpt":278,"excerpt_en":279,"has_translation":12,"published_at":280,"reading_time":257,"hidden_from_listing":15,"tags":281,"thumbnail_image":21,"og_image":286,"series":287,"authors":288},24,"Kenapa Butuh Rate Limiting?","Why Do You Need Rate Limiting?","kenapa-butuh-rate-limiting","Pernah nggak sih endpoint login kalian diserbu bot yang nyoba nembak ribuan password cuma dalam semenit? Yuk, kita bahas kenapa Rate Limiting itu wajib, plus cara masangnya di FastAPI!","Has your login endpoint ever been hammered by a bot trying thousands of passwords in a single minute? Here is why rate limiting is mandatory, and how to wire it into FastAPI.","2026-08-17T04:00:27.728Z",[261,282,283,284,285,259],"rate-limiting","system-design","api","redis","\u002Fog\u002Fkenapa-butuh-rate-limiting.png",{"id":24,"title":25,"title_en":26,"slug":27},[289],{"authors_id":290},{"id":269,"name":270,"slug":271,"role":272,"profile_picture":21},{"id":292,"title":293,"title_en":294,"slug":295,"excerpt":296,"excerpt_en":297,"has_translation":12,"published_at":298,"reading_time":14,"hidden_from_listing":15,"tags":299,"thumbnail_image":21,"og_image":303,"series":304,"authors":305},25,"Kenapa Event Queue Bikin Backend Kalian Nggak Gampang Tumbang?","Why an Event Queue Keeps Your Backend From Collapsing","kenapa-event-queue-bikin-backend-kamu-nggak-gampang-tumbang","Pernah klik tombol Beli Sekarang dan notifikasi suksesnya muncul dalam sekejap, padahal di belakang layar ada invoice, email, sampai push notification yang harus dibuat? Rahasianya Event Queue. Yuk, kita bedah!","You hit Buy Now and the success notice appears instantly, while an invoice, an email, and a push notification still have to be built behind the scenes. The secret is the event queue.","2026-08-17T04:11:23.685Z",[261,283,300,301,302],"event-queue","message-broker","architecture","\u002Fog\u002Fkenapa-event-queue-bikin-backend-kamu-nggak-gampang-tumbang.png",{"id":24,"title":25,"title_en":26,"slug":27},[306],{"authors_id":307},{"id":308,"name":309,"slug":310,"role":272,"profile_picture":21},1,"Daffa Izzuddin","izzudd",{"id":312,"title":313,"title_en":314,"slug":315,"excerpt":316,"excerpt_en":317,"has_translation":12,"published_at":318,"reading_time":14,"hidden_from_listing":15,"tags":319,"thumbnail_image":21,"og_image":324,"series":325,"authors":326},26,"REST API vs gRPC: Kapan Sebaiknya Mulai Pindah dari JSON?","REST API vs gRPC: When Should You Start Moving Off JSON?","rest-api-vs-grpc-kapan-sebaiknya-pindah-dari-json","Pernah nggak sih sistem mikroservis kalian mulai kerasa berat padahal cuma tuker-tukeran data internal? Belum tentu masalah servernya. Yuk, kita bahas kapan REST + JSON masih juara dan kapan gRPC jadi jawabannya!","Has your microservice system started feeling heavy even though it only shuffles internal data? The server may not be the problem. Here is when REST + JSON still wins, and when gRPC is the answer.","2026-08-17T04:26:10.249Z",[261,320,321,322,323,283],"grpc","rest-api","microservices","protobuf","\u002Fog\u002Frest-api-vs-grpc-kapan-sebaiknya-pindah-dari-json.png",{"id":24,"title":25,"title_en":26,"slug":27},[327],{"authors_id":328},{"id":269,"name":270,"slug":271,"role":272,"profile_picture":21},{"id":330,"title":331,"title_en":332,"slug":333,"excerpt":334,"excerpt_en":335,"has_translation":12,"published_at":336,"reading_time":14,"hidden_from_listing":15,"tags":337,"thumbnail_image":21,"og_image":342,"series":343,"authors":344},27,"Background Worker & Task Queue: Jangan Jalankan Proses Berat di Request HTTP!","Background Workers & Task Queues: Don't Run Heavy Work Inside an HTTP Request","background-worker-task-queue-jangan-jalankan-proses-berat-di-http","Pernah nggak sih kalian klik Daftar Akun lalu halaman loading muter sampai 15 detik tanpa kepastian? Penyebabnya klasik banget. Yuk, kita bahas kenapa proses berat nggak boleh dijalanin di request HTTP!","You tap Create Account and the loading page spins for 15 seconds with no answer? The cause is classic. Here is why heavy work does not belong in an HTTP request.","2026-08-17T04:26:10.284Z",[261,338,339,259,340,285,341],"task-queue","celery","rabbitmq","async","\u002Fog\u002Fbackground-worker-task-queue-jangan-jalankan-proses-berat-di-http.png",{"id":24,"title":25,"title_en":26,"slug":27},[345],{"authors_id":346},{"id":308,"name":309,"slug":310,"role":272,"profile_picture":21},{"id":348,"title":349,"title_en":350,"slug":351,"excerpt":352,"excerpt_en":353,"has_translation":12,"published_at":354,"reading_time":14,"hidden_from_listing":15,"tags":355,"thumbnail_image":21,"og_image":361,"series":362,"authors":363},28,"Mengatasi N+1 Query Problem: Musuh Tersembunyi Performa Backend","Taming the N+1 Query Problem: The Hidden Enemy of Backend Performance","mengatasi-n-plus-1-query-problem-musuh-tersembunyi-backend","Pernah bikin endpoint yang cuma nampilin 50 postingan beserta nama penulisnya, tapi response-nya lambat banget? Bisa jadi kalian kena N+1 Query. Yuk, kita bedah penyebabnya dan cara memberantasnya!","You built an endpoint that only lists 50 posts with their author names, and the response takes 2-3 seconds? You may have hit N+1 Query. Here is the cause, and the cure.","2026-08-17T04:26:10.309Z",[356,357,358,359,360,84,261],"database","sql","orm","sqlalchemy","django","\u002Fog\u002Fmengatasi-n-plus-1-query-problem-musuh-tersembunyi-backend.png",{"id":24,"title":25,"title_en":26,"slug":27},[364],{"authors_id":365},{"id":308,"name":309,"slug":310,"role":272,"profile_picture":21},{"id":367,"title":368,"title_en":369,"slug":370,"excerpt":371,"excerpt_en":372,"has_translation":12,"published_at":373,"reading_time":257,"hidden_from_listing":15,"tags":374,"thumbnail_image":21,"og_image":377,"series":378,"authors":379},29,"Memahami Database Indexing: Rahasia Query Super Cepat","Understanding Database Indexing: The Secret to Very Fast Queries","memahami-database-indexing-rahasia-query-super-cepat","Query kalian mulai lelet padahal data baru nembus jutaan baris? Sebelum buru-buru *upgrade* server, yuk cek dulu *index*-nya. Yuk, kita bedah gimana *database indexing* sebenernya kerja!","Your queries have gone sluggish even though the data only just crossed a million rows? Before you rush to upgrade the server, check the indexes. Here is how database indexing actually works.","2026-08-17T04:26:10.325Z",[356,357,375,376,84,261],"postgresql","indexing","\u002Fog\u002Fmemahami-database-indexing-rahasia-query-super-cepat.png",{"id":24,"title":25,"title_en":26,"slug":27},[380],{"authors_id":381},{"id":308,"name":309,"slug":310,"role":272,"profile_picture":21},{"id":383,"title":384,"title_en":385,"slug":386,"excerpt":387,"excerpt_en":388,"has_translation":12,"published_at":389,"reading_time":257,"hidden_from_listing":15,"tags":390,"thumbnail_image":21,"og_image":394,"series":395,"authors":396},31,"Mengenal Redis: Lebih dari Sekadar In-Memory Cache","Getting to Know Redis: More Than Just an In-Memory Cache","mengenal-redis-lebih-dari-sekadar-in-memory-cache","Masih nganggep Redis cuma buat caching? Padahal dia bisa jadi leaderboard, message broker, sampai rate limiter lho. Yuk, kita bedah semua kemampuannya!","Still treating Redis as nothing but a cache? It can be a leaderboard, a message broker, even a rate limiter. Let's take apart everything it can do.","2026-08-17T04:26:10.360Z",[285,261,391,392,393,260],"cache","nosql","in-memory","\u002Fog\u002Fmengenal-redis-lebih-dari-sekadar-in-memory-cache.png",{"id":24,"title":25,"title_en":26,"slug":27},[397],{"authors_id":398},{"id":308,"name":309,"slug":310,"role":272,"profile_picture":21},{"id":400,"title":401,"title_en":402,"slug":403,"excerpt":404,"excerpt_en":405,"has_translation":12,"published_at":406,"reading_time":257,"hidden_from_listing":15,"tags":407,"thumbnail_image":21,"og_image":412,"series":413,"authors":414},32,"Docker Compose untuk Developer Santai: Satu Perintah Buat Jalankan Semua Service","Docker Compose for the Relaxed Developer: One Command to Run Every Service","docker-compose-untuk-developer-santai","Pernah nggak kalian ngulang-ngulang perintah `docker run` cuma buat nyalain web, database, dan cache satu-satu? Capek, kan? Yuk, kita rapikan semuanya jadi satu file dan satu perintah!","Do you keep retyping `docker run` just to bring up the web app, the database, and the cache one at a time? Here is how to fold all of them into one file and one command.","2026-08-17T04:26:10.375Z",[408,409,410,411,261],"docker","docker-compose","devops","containers","\u002Fog\u002Fdocker-compose-untuk-developer-santai.png",{"id":24,"title":25,"title_en":26,"slug":27},[415],{"authors_id":416},{"id":308,"name":309,"slug":310,"role":272,"profile_picture":21},{"id":418,"title":419,"title_en":420,"slug":421,"excerpt":422,"excerpt_en":423,"has_translation":12,"published_at":424,"reading_time":257,"hidden_from_listing":15,"tags":425,"thumbnail_image":21,"og_image":427,"series":428,"authors":429},33,"Berkenalan dengan RabbitMQ: Si Kurir Pesan Serba Bisa","Meet RabbitMQ: The Versatile Message Courier","berkenalan-dengan-rabbitmq-si-kurir-pesan-serba-bisa","Pernah nggak sih kalian klik Bayar Sekarang dan notifikasi suksesnya muncul seketika, padahal email konfirmasi baru nyampe beberapa detik kemudian? Rahasianya ada di satu kurir tak terlihat. Yuk, kita kenalan sama RabbitMQ!","You tap Pay Now and the success notice appears instantly, while the confirmation email only lands a few seconds later? The secret is one invisible courier. Meet RabbitMQ.","2026-08-17T04:26:10.388Z",[340,301,261,322,341,426],"queue","\u002Fog\u002Fberkenalan-dengan-rabbitmq-si-kurir-pesan-serba-bisa.png",{"id":24,"title":25,"title_en":26,"slug":27},[430],{"authors_id":431},{"id":269,"name":270,"slug":271,"role":272,"profile_picture":21},{"id":433,"title":434,"title_en":435,"slug":436,"excerpt":437,"excerpt_en":438,"has_translation":12,"published_at":439,"reading_time":257,"hidden_from_listing":15,"tags":440,"thumbnail_image":21,"og_image":442,"series":443,"authors":444},34,"Kenapa Backend Butuh Database Connection Pooling?","Why Does a Backend Need Database Connection Pooling?","kenapa-backend-butuh-database-connection-pooling","Pernah kena error Too many connections padahal CPU server masih santai di angka 30%? Masalahnya bukan di query kalian, tapi di cara aplikasi ngobrol sama database. Yuk, kenalan sama Connection Pooling!","Ever hit Too many connections while server CPU is still lounging at 30%? The problem is not your queries, it is how the application talks to the database. Meet connection pooling.","2026-08-24T06:06:47.088Z",[261,356,375,441,283,84],"connection-pooling","\u002Fog\u002Fkenapa-backend-butuh-database-connection-pooling.png",{"id":24,"title":25,"title_en":26,"slug":27},[445],{"authors_id":446},{"id":269,"name":270,"slug":271,"role":272,"profile_picture":21},{"id":448,"title":449,"title_en":450,"slug":451,"excerpt":452,"excerpt_en":453,"has_translation":12,"published_at":454,"reading_time":14,"hidden_from_listing":15,"tags":455,"thumbnail_image":21,"og_image":458,"series":459,"authors":460},35,"Mengenal Idempotency Key: Rahasia Anti-Double Charge di API Pembayaran","Idempotency Keys: The Secret to No Double Charges in Payment APIs","mengenal-idempotency-key-rahasia-anti-double-charge-di-api-pembayaran","Pernah internet kalian ngadat pas lagi nekan tombol Bayar, terus panik ngekliknya tiga kali? Kalau endpoint-nya nggak idempotent, saldo bisa kepotong berkali-kali. Yuk, kenalan sama Idempotency Key!","Ever had your connection stall right as you hit Pay, then panic-clicked three times? If the endpoint is not idempotent, the balance can be cut more than once. Meet the idempotency key.","2026-08-24T06:09:11.645Z",[261,284,456,283,457,259,285],"idempotency","payment","\u002Fog\u002Fmengenal-idempotency-key-rahasia-anti-double-charge-di-api-pembayaran.png",{"id":24,"title":25,"title_en":26,"slug":27},[461],{"authors_id":462},{"id":269,"name":270,"slug":271,"role":272,"profile_picture":21},{"id":464,"title":465,"title_en":466,"slug":467,"excerpt":468,"excerpt_en":469,"has_translation":12,"published_at":470,"reading_time":14,"hidden_from_listing":15,"tags":471,"thumbnail_image":21,"og_image":473,"series":474,"authors":475},36,"Mencegah Efek Domino di Mikroservis dengan Circuit Breaker Pattern","Stopping the Domino Effect in Microservices With the Circuit Breaker Pattern","mencegah-efek-domino-di-mikroservis-dengan-circuit-breaker-pattern","Pernah nggak sih, satu fitur minor di aplikasi kalian mendadak lelet, eh malah bikin halaman checkout dan login ikut down total? Itu namanya *cascading failure*. Yuk, kita bahas gimana *circuit breaker pattern* (pemutus arus) nyelametin arsitektur kalian!","Ever had one minor feature go slow and take the checkout page and login down with it? That is a cascading failure. Here is how the circuit breaker pattern saves your architecture.","2026-08-24T06:13:36.734Z",[261,322,472,283,302],"circuit-breaker","\u002Fog\u002Fmencegah-efek-domino-di-mikroservis-dengan-circuit-breaker-pattern.png",{"id":24,"title":25,"title_en":26,"slug":27},[476],{"authors_id":477},{"id":269,"name":270,"slug":271,"role":272,"profile_picture":21},{"id":479,"title":480,"title_en":481,"slug":482,"excerpt":483,"excerpt_en":484,"has_translation":12,"published_at":485,"reading_time":14,"hidden_from_listing":15,"tags":486,"thumbnail_image":21,"og_image":488,"series":489,"authors":490},37,"Kenapa Backend Butuh Graceful Shutdown? Jangan Asal Cabut Kabel Server!","Why Does a Backend Need Graceful Shutdown? Don't Yank the Server Cable","kenapa-backend-butuh-graceful-shutdown-jangan-asal-cabut-kabel-server","Pernah nggak sih, abis kalian nge-*deploy* backend, beberapa detik kemudian monitoring malah banjir *alert* **502 Bad Gateway** dari pengguna? Saldo udah kepotong tapi status order belum keburu ter-*update* di *database*. Yuk, kita bahas kenapa *graceful shutdown* itu wajib banget!","You deploy the backend and seconds later monitoring floods with 502 Bad Gateway alerts. The balance was cut but the order status never reached the database. Here is why graceful shutdown is mandatory.","2026-08-24T06:15:59.150Z",[261,410,259,408,487,283,302],"kubernetes","\u002Fog\u002Fkenapa-backend-butuh-graceful-shutdown-jangan-asal-cabut-kabel-server.png",{"id":24,"title":25,"title_en":26,"slug":27},[491],{"authors_id":492},{"id":269,"name":270,"slug":271,"role":272,"profile_picture":21},{"id":494,"title":495,"title_en":496,"slug":497,"excerpt":498,"excerpt_en":499,"has_translation":12,"published_at":500,"reading_time":14,"hidden_from_listing":15,"tags":501,"thumbnail_image":21,"og_image":502,"series":503,"authors":504},38,"Optimistic vs Pessimistic Locking: Mengatasi Rebutan Data di Database","Optimistic vs Pessimistic Locking: Handling the Data Fight in a Database","optimistic-vs-pessimistic-locking-mengatasi-rebutan-data-di-database","Seribu orang ngeklik \"Beli Sekarang\" di detik yang sama buat rebutan 1 tiket terakhir. Kira-kira apa yang bakal terjadi di server kalian? Yuk, kita banding *pessimistic* sama *optimistic locking*!","A thousand people tap Buy Now in the same second, fighting over the last ticket. What happens on your server? Here is pessimistic against optimistic locking.","2026-08-24T06:16:37.198Z",[261,356,174,375,283,302,357],"\u002Fog\u002Foptimistic-vs-pessimistic-locking-mengatasi-rebutan-data-di-database.png",{"id":24,"title":25,"title_en":26,"slug":27},[505],{"authors_id":506},{"id":269,"name":270,"slug":271,"role":272,"profile_picture":21},{"id":508,"title":509,"title_en":510,"slug":511,"excerpt":512,"excerpt_en":513,"has_translation":12,"published_at":514,"reading_time":14,"hidden_from_listing":15,"tags":515,"thumbnail_image":21,"og_image":518,"series":519,"authors":520},39,"Database Sharding vs Partitioning: Kapan Data Perlu Dipecah?","Database Sharding vs Partitioning: When Does Data Need Splitting?","database-sharding-vs-partitioning-kapan-data-perlu-dipecah","Tabel transaksi kalian udah nembus miliaran baris dan tiap *query* laporan bikin *CPU* melonjak 100%? Sebelum asal pecah data, yuk kita pahami dulu beda *sharding* sama *partitioning*!","Your transaction table has crossed a billion rows and every report query spikes CPU to 100%? Before splitting data blindly, understand the difference between sharding and partitioning.","2026-08-24T06:17:10.104Z",[261,356,375,283,302,516,517],"sharding","scaling","\u002Fog\u002Fdatabase-sharding-vs-partitioning-kapan-data-perlu-dipecah.png",{"id":24,"title":25,"title_en":26,"slug":27},[521],{"authors_id":522},{"id":269,"name":270,"slug":271,"role":272,"profile_picture":21},{"id":524,"title":525,"title_en":526,"slug":527,"excerpt":528,"excerpt_en":529,"has_translation":12,"published_at":530,"reading_time":14,"hidden_from_listing":15,"tags":531,"thumbnail_image":21,"og_image":536,"series":537,"authors":538},40,"Menyelami Distributed Tracing: Melacak Jejak Request di Balik Keruwetan Microservices","Inside Distributed Tracing: Following a Request Through Microservice Chaos","menyelami-distributed-tracing-melacak-jejak-request-microservices","Satu klik Checkout di backend kalian bisa memicu puluhan network call antar-service, tapi pas ada yang lambat, service mana sebenernya yang salah? Log aja nggak cukup buat njawab itu. Yuk, kita bedah Distributed Tracing!","One Checkout click in your backend can trigger dozens of network calls between services, but when one is slow, which service is at fault? Logs alone cannot answer that. Here is distributed tracing.","2026-08-31T02:33:31.602Z",[261,532,533,534,322,302,535],"distributed-systems","observability","open-telemetry","tracing","\u002Fog\u002Fmenyelami-distributed-tracing-melacak-jejak-request-microservices.png",{"id":24,"title":25,"title_en":26,"slug":27},[539],{"authors_id":540},{"id":269,"name":270,"slug":271,"role":272,"profile_picture":21},{"id":542,"title":543,"title_en":544,"slug":545,"excerpt":546,"excerpt_en":547,"has_translation":12,"published_at":548,"reading_time":14,"hidden_from_listing":15,"tags":549,"thumbnail_image":21,"og_image":555,"series":556,"authors":557},41,"Log Aggregation Modern dengan Grafana Loki dan Vector: Hemat Storage Tanpa Indeks Raksasa","Modern Log Aggregation With Grafana Loki and Vector: Save Storage Without a Giant Index","log-aggregation-modern-grafana-loki-vector-hemat-storage","Klaster Elasticsearch kalian rakus RAM dan boros storage, ya? Padahal nggak semua kata di log perlu diindeks, lho. Yuk, kita kenalan sama duet Grafana Loki dan Vector yang jauh lebih ramah kantong!","Your Elasticsearch cluster is greedy for RAM and wasteful with storage? Not every word in a log needs indexing. Meet the duo of Grafana Loki and Vector, far kinder to your wallet.","2026-09-01T15:45:01.066Z",[261,550,551,552,553,554,410,283],"observa","logging","grafana","loki","vector","\u002Fog\u002Flog-aggregation-modern-grafana-loki-vector-hemat-storage.png",{"id":24,"title":25,"title_en":26,"slug":27},[558],{"authors_id":559},{"id":269,"name":270,"slug":271,"role":272,"profile_picture":21},{"id":561,"title":562,"title_en":562,"slug":563,"excerpt":564,"excerpt_en":565,"has_translation":12,"published_at":566,"reading_time":14,"hidden_from_listing":15,"tags":567,"thumbnail_image":21,"og_image":570,"series":571,"authors":572},45,"Rate Limiting Algorithms: Token Bucket vs Leaky Bucket vs Sliding Window","rate-limiting-algorithms-token-bucket-leaky-bucket-sliding-window","Udah tahu kenapa *rate limiting* itu wajib, tapi masih bingung beda Token Bucket, Leaky Bucket, Fixed Window, dan Sliding Window? Yuk, kita adu empat algoritma ini bareng-bareng dan cari tahu mana yang paling pas buat API kalian!","You already know why *rate limiting* is mandatory, but the difference between Token Bucket, Leaky Bucket, Fixed Window, and Sliding Window is still fuzzy. Let's put all four algorithms side by side and find the one that fits your API.","2026-09-09T01:57:55.886Z",[261,283,282,285,568,302,569],"api-gateway","traffict-management","\u002Fog\u002Frate-limiting-algorithms-token-bucket-leaky-bucket-sliding-window.png",{"id":24,"title":25,"title_en":26,"slug":27},[573],{"authors_id":574},{"id":269,"name":270,"slug":271,"role":272,"profile_picture":21},{"id":576,"title":577,"title_en":578,"slug":579,"excerpt":580,"excerpt_en":581,"has_translation":12,"published_at":582,"reading_time":14,"hidden_from_listing":15,"tags":583,"thumbnail_image":21,"og_image":587,"series":588,"authors":589},46,"Mengapa C Mulai Ditinggalkan: Duel Filosofi Keamanan Rust vs Kesederhanaan Zig","Why C Is Being Left Behind: Rust's Safety Philosophy vs Zig's Simplicity","mengapa-c-mulai-ditinggalkan-duel-filosofi-rust-vs-zig","Pernah denger kalau sekitar 70% celah keamanan kritis software modern itu asalnya dari bahasa C? Iya, bahasa yang udah jadi fondasi internet ini 😅. Yuk, kita bedah duel filosofi Rust vs Zig dan cari tahu mana yang pas buat proyek kalian!","Have you heard that around 70% of critical security holes in modern software come from C? Yes, the language the internet is built on. Let's unpack the philosophy duel between Rust and Zig and see which one fits your project.","2026-09-09T02:19:05.266Z",[85,83,584,585,586],"zig","c","memory-safety","\u002Fog\u002Fmengapa-c-mulai-ditinggalkan-duel-filosofi-rust-vs-zig.png",{"id":24,"title":25,"title_en":26,"slug":27},[590],{"authors_id":591},{"id":269,"name":270,"slug":271,"role":272,"profile_picture":21},{"id":593,"title":594,"title_en":595,"slug":596,"excerpt":597,"excerpt_en":598,"has_translation":12,"published_at":599,"reading_time":600,"hidden_from_listing":15,"tags":601,"thumbnail_image":21,"og_image":606,"series":607,"authors":608},107,"Cara kamu pakai AI lebih menentukan daripada apakah kamu pakai AI","How You Use AI Matters More Than Whether You Use AI","cara-pakai-ai-menentukan-pemahaman-kode","Fiturnya selesai, test-nya hijau, dan dua hari kemudian kamu baca kodenya kayak kode orang lain. Ternyata ada satu cara pakai AI yang bikin kamu paham lebih baik daripada nggak pakai AI sama sekali. Yuk lihat datanya.","The feature is done, the tests are green, and two days later you read the code like a stranger wrote it. It turns out one way of using AI leaves you understanding more than not using AI at all. Here is the data.","2026-10-10T11:08:29.000Z",7,[602,603,604,605],"ai","belajar","kognitif","ai-assisted-coding","\u002Fog\u002Fcara-pakai-ai-menentukan-pemahaman-kode.png",{"id":24,"title":25,"title_en":26,"slug":27},[],{"id":610,"title":611,"title_en":612,"slug":613,"excerpt":614,"excerpt_en":615,"has_translation":12,"published_at":13,"reading_time":14,"hidden_from_listing":15,"tags":616,"thumbnail_image":21,"og_image":618,"series":619,"authors":620},109,"State of JS 2025 Bilang Developer Cuma Pakai 2,6 Framework Sepanjang Karier","State of JS 2025 Says Developers Use Only 2.6 Frameworks in a Whole Career","state-of-js-2025-developer-cuma-pakai-2-6-framework","Coba hitung semua framework yang pernah kamu coba, lalu potong jadi yang beneran dipakai buat kerjaan. Daftarnya jauh lebih pendek dari dugaan. State of JS 2025 nanya ke 13.002 developer, dan rata-ratanya cuma 2,6. Yuk, lihat angkanya bareng-bareng!","Try counting every framework you have ever touched, then cut the list down to what you actually used for work. It comes out far shorter than you would guess. State of JS 2025 asked 13,002 developers, and the average is only 2.6.",[101,617,18,17],"survei","\u002Fog\u002Fstate-of-js-2025-developer-cuma-pakai-2-6-framework.png",{"id":24,"title":25,"title_en":26,"slug":27},[],{"id":6,"title":7,"title_en":8,"slug":9,"excerpt":10,"excerpt_en":11,"has_translation":12,"published_at":13,"reading_time":14,"hidden_from_listing":15,"tags":622,"thumbnail_image":21,"og_image":22,"series":623,"authors":624},[17,18,19,20],{"id":24,"title":25,"title_en":26,"slug":27},[],{"id":626,"title":627,"title_en":628,"slug":629,"excerpt":630,"excerpt_en":631,"has_translation":12,"published_at":632,"reading_time":81,"hidden_from_listing":15,"tags":633,"thumbnail_image":21,"og_image":635,"series":636,"authors":637},111,"Rust Masuk Kernel Linux: Revolusi Nyata atau Cuma Euforia RIIR?","Rust Enters the Linux Kernel: A Real Revolution or Just RIIR Euphoria?","rust-di-kernel-linux-revolusi-atau-cuma-hype","Selama lebih dari 30 tahun kernel Linux cuma mau bahasa C, lalu tiba-tiba Rust resmi masuk di Linux 6.1. Itu revolusi beneran atau cuma kebawa euforia meme Rewrite It In Rust? Yuk lihat datanya, bukan cuma opininya.","For more than 30 years the Linux kernel only wanted C, then Rust officially landed in Linux 6.1. Is that a real revolution, or just the pull of the Rewrite It In Rust meme? Let's look at the data, not the opinions.","2026-10-07T03:40:24.000Z",[83,131,634,85,586],"kernel","\u002Fog\u002Frust-di-kernel-linux-revolusi-atau-cuma-hype.png",{"id":24,"title":25,"title_en":26,"slug":27},[638],{"authors_id":639},{"id":308,"name":309,"slug":310,"role":272,"profile_picture":21},{"id":641,"title":642,"title_en":643,"slug":644,"excerpt":645,"excerpt_en":646,"has_translation":12,"published_at":647,"reading_time":14,"hidden_from_listing":15,"tags":648,"thumbnail_image":21,"og_image":651,"series":652,"authors":653},112,"Aplikasimu lambat, dan kamu udah kepikiran ganti bahasa. Tunggu dulu","Your App Is Slow, and You're Already Thinking About Changing Languages. Wait.","aplikasimu-lambat-dan-kamu-udah-kepikiran-ganti-bahasa-tunggu-dulu","Ada endpoint yang grafiknya spike tiap beberapa menit, dan kepikiran buat pindah dari Go ke Rust? Discord dan Cloudflare beneran melakukannya — tapi cuma setelah kehabisan cara lain dan punya datanya. Yuk, bedah gejala mana yang beneran butuh rewrite, dan mana yang cuma butuh profiling. 🤔","An endpoint spikes every few minutes, and you are thinking of moving from Go to Rust? Discord and Cloudflare really did it, but only after running out of other options and having the data. Let's sort out which symptoms need a rewrite and which only need a profiler.","2026-10-08T09:40:00.000Z",[261,84,649,83,283,650],"golang","profiling","\u002Fog\u002Faplikasimu-lambat-dan-kamu-udah-kepikiran-ganti-bahasa-tunggu-dulu.png",{"id":24,"title":25,"title_en":26,"slug":27},[],{"id":655,"title":656,"title_en":657,"slug":658,"excerpt":659,"excerpt_en":660,"has_translation":12,"published_at":661,"reading_time":600,"hidden_from_listing":15,"tags":662,"thumbnail_image":21,"og_image":666,"series":667,"authors":668},113,"Garbage Collector dituduh bikin aplikasi lemot. Seberapa adil tuduhan itu?","The Garbage Collector Gets Blamed for Slow Apps. How Fair Is That?","garbage-collector-dituduh-bikin-aplikasi-lemot","GC sering jadi tersangka utama tiap aplikasi melambat, dan banyak yang percaya dia jalan pakai timer tiap beberapa detik. Dua-duanya nggak sepenuhnya benar. Yuk bedah cara kerja GC dari dalam, plus satu pengecualian yang bikin Discord kesakitan tiap 2 menit. 🤔","GC is always the prime suspect when an app slows down, and many people believe it runs on a timer every few seconds. Both beliefs are only partly right. Let's open up how GC works inside, plus one exception that made Discord hurt every 2 minutes.","2026-10-09T01:34:00.000Z",[261,84,649,663,664,665],"jvm","garbage-collector","memory","\u002Fog\u002Fgarbage-collector-dituduh-bikin-aplikasi-lemot.png",{"id":24,"title":25,"title_en":26,"slug":27},[],{"id":670,"title":671,"title_en":672,"slug":673,"excerpt":674,"excerpt_en":675,"has_translation":12,"published_at":676,"reading_time":14,"hidden_from_listing":15,"tags":677,"thumbnail_image":21,"og_image":680,"series":681,"authors":682},118,"Belajar Idempotency dari Stok yang Keburu Kebeli","Learning Idempotency from Stock That Got Bought Too Soon","pub-sub-sendiri-lalu-belajar-idempotency","Tugas pertama saya di kerjaan pertama: sistem yang kewalahan menerima webhook. Saya putuskan membangun pub\u002Fsub sendiri dari nol, dan pelajaran yang akhirnya datang bukan dari situ — tapi dari stok gudang yang keburu kebeli orang.","My first task at my first job was a system drowning in webhooks. I decided to build my own pub\u002Fsub from scratch, and the lesson that finally landed came from somewhere else: warehouse stock that got bought before the count caught up.","2026-10-10T14:03:00.000Z",[456,678,339,340,679],"event-driven","post-mortem","\u002Fog\u002Fpub-sub-sendiri-lalu-belajar-idempotency.png",{"id":24,"title":25,"title_en":26,"slug":27},[683],{"authors_id":684},{"id":308,"name":309,"slug":310,"role":272,"profile_picture":21},{"id":74,"title":75,"title_en":76,"slug":77,"excerpt":78,"excerpt_en":79,"has_translation":12,"published_at":80,"reading_time":81,"hidden_from_listing":15,"tags":82,"thumbnail_image":21,"og_image":88,"series":686,"authors":687},{"id":24,"title":25,"title_en":26,"slug":27},[688,690],{"authors_id":689},{"id":308,"name":309,"slug":310,"role":272,"profile_picture":21},{"authors_id":691},{"id":308,"name":309,"slug":310,"role":272,"profile_picture":21},[693,695,697],{"id":694,"title":35,"slug":37,"description":21,"cover_image":21},8,{"id":108,"title":39,"slug":41,"description":696,"cover_image":21},"Mengenal konsep dasar pemrograman. Pada seri ini kita akan membahas tentang bagaimana cara berkutat dengan variabel, mengatur alur program dengan struktur kontrol, me-reuse kode dengan fungsi, dan aturan sintaks pada bahasa pemrograman. Konsep-konsep ini pastinya akan sangat berguna ketika kita mulai mengkoding ceria.",{"id":137,"title":43,"slug":45,"description":698,"cover_image":21},"Algoritma dan struktur data adalah konsep fundamental dalam dunia pemrograman. Keduanya sangat penting dalam menyelesaikan masalah yang kompleks dengan efisien dan efektif. Dalam seri ini kita akan membahas berbagai macam struktur data dan algoritma yang harapannya bisa bikin kode kita lebih efektif dan efisien. Yuk belajar ASD bareng Inva! 👋",[700,702],{"authors_id":701},{"id":308,"name":309,"slug":310,"role":272,"profile_picture":21},{"authors_id":703},{"id":308,"name":309,"slug":310,"role":272,"profile_picture":21},"id",[706,704],"en","Ambil satu array angka, lalu tulis ini di JavaScript:\n\n```js\nconst total = angka\n  .filter((x) => x % 2 === 0)\n  .map((x) => x * 2)\n  .reduce((a, b) => a + b, 0);\n```\n\nSatu baris, enak dibaca, rapi banget, kan? 😅 Tapi kita semua tahu harganya: `filter` bikin array baru, `map` bikin array baru lagi, lalu `reduce` jalan di atas hasilnya. Buat array berisi sejuta angka, itu artinya dua array sementara yang harus dialokasikan, dibuang, dan dibersihkan *Garbage Collector*, padahal hasil akhirnya cuma satu bilangan.\n\nItu sebabnya programmer yang berburu performa tinggi sering turun kasta: nulis *loop* `for` mentah, pakai pointer manual, dan merelakan kodenya jadi lebih panjang demi satu-dua milidetik. Selama beberapa dekade, itu memang aturan tak tertulisnya: makin tinggi *level* abstraksi, makin mahal ongkos *runtime*-nya.\n\nRust menantang aturan itu dengan prinsip yang diwarisi dari dunia C++: *Zero-Cost Abstractions*. Bjarne Stroustrup, pencipta C++, merumuskannya seperti ini:\n\n> Secara umum, implementasi C++ mengikuti prinsip *zero-overhead*: yang nggak kamu pakai, nggak kamu bayar. Dan yang kamu pakai, nggak bisa kamu tulis sendiri dengan lebih efisien.\n\nKedengarannya kayak slogan *marketing*, ya. Makanya kita nggak akan percaya begitu saja. Yuk, kita bongkar *assembly*-nya sendiri, pakai `rustc` 1.99 dengan LLVM di belakangnya.\n\n## Jadi apa sih \"zero-cost\" itu?\n\nKata \"zero\" di sini bukan berarti gratis tanpa ongkos sama sekali. Ongkosnya tetap ada, cuma tempat membayarnya yang dipindah: dari *runtime* ke *compile-time*. **Biayanya pindah, bukan hilang.**\n\n`rustc` dan LLVM bekerja ekstra keras saat proses *build*. Mereka menyalin fungsi generik untuk tiap tipe konkret, membuka abstraksi berlapis jadi kode datar, lalu membuang seluruh pembukuan yang cuma jadi beban. Yang tersisa di berkas biner adalah instruksi mesin biasa, sering kali sama persis dengan versi manualnya.\n\nTiga mekanisme utama yang dipakai untuk itu: *monomorphization*, *iterator*, dan *closure*.\n\n## Rahasia 1: monomorphization, polimorfisme tanpa lompatan *runtime*\n\nDi bahasa yang pakai *dynamic dispatch* seperti Java atau Python, memanggil method dari sebuah *interface* berarti CPU harus mencari alamat fungsinya dulu di *runtime*, biasanya lewat *vtable*. Biaya satu lompatan emang kecil, tapi efeknya besar: kompiler cuma bisa melihat dari luar fungsi yang dipanggil, jadi dia kehilangan kesempatan membuang kode mati atau menyatukan perhitungan.\n\nRust bisa memilih jalur lain. Coba kode ini:\n\n```rust\ntrait Hitung {\n    fn nilai(&self) -> i32;\n}\n\nstruct A;\nimpl Hitung for A {\n    fn nilai(&self) -> i32 { 3 }\n}\n\nstruct B;\nimpl Hitung for B {\n    fn nilai(&self) -> i32 { 5 }\n}\n\nfn pakai\u003CT: Hitung>(x: T) -> i32 {\n    x.nilai()\n}\n\npub fn statis() -> i32 {\n    pakai(A) + pakai(B)\n}\n\npub fn dinamis(d: &dyn Hitung) -> i32 {\n    d.nilai()\n}\n```\n\nDua fungsi terakhir hasilnya sama-sama 8, tapi jalannya beda jauh. Ini yang dihasilkan `rustc -O` untuk `statis()` nih:\n\n```asm\nstatis:\n    mov     eax, 8\n    ret\n```\n\nDua instruksi 🤯 Tanpa pemanggilan fungsi, tanpa tabel *method*, tanpa jejak `A` atau `B`. Kompiler sudah menghitung semuanya di *compile-time* dan menyisakan jawabannya saja.\n\nSekarang versi `&dyn`, satu-satunya cara Rust memaksa *dynamic dispatch*:\n\n```asm\ndinamis:\n    jmp     qword ptr [rsi + 24]\n```\n\nSatu instruksi, tapi isinya lompat ke alamat yang baru diketahui saat program jalan, dibaca dari *vtable* pada offset 24. Kompiler berhenti di situ: dia nggak tahu fungsi apa yang bakal dipanggil, jadi nggak ada yang bisa di-*inline*.\n\nProses penyalinan inilah yang disebut *monomorphization*. Waktu kamu menulis `pakai::\u003CA>()` dan `pakai::\u003CB>()`, Rust benar-benar membuat dua fungsi berbeda di berkas biner, satu untuk `A` dan satu untuk `B`. Kamu tetap bisa memaksa *dynamic dispatch* kapan pun kamu mau, dan kadang itu memang keputusan yang benar. Bedanya, di Rust itu pilihan, bukan satu-satunya jalan.\n\n## Rahasia 2: iterator secepat *loop* manual\n\nBalik ke masalah di pembuka: rantai `.filter().map().sum()` di Rust.\n\n```rust\nlet numbers: Vec\u003Ci32> = (1..=10).collect();\n\nlet functional: i32 = numbers\n    .iter()\n    .filter(|&&x| x % 2 == 0)\n    .map(|&x| x * 2)\n    .sum();\n\nlet mut manual = 0;\nfor &x in &numbers {\n    if x % 2 == 0 {\n        manual += x * 2;\n    }\n}\n\nprintln!(\"iterator = {functional}, for loop = {manual}\");\n```\n\nDijalankan, hasilnya `iterator = 60, for loop = 60`, sama seperti yang kita harapkan.\n\nYang menarik bukan hasilnya, tapi apa yang terjadi setelah kompilasi. Dua fungsi itu dikompilasi terpisah dengan `rustc -O -C panic=abort`, lalu instruksinya dihitung satu per satu:\n\n- Versi *iterator*: 53 instruksi, nol instruksi `call`.\n- Versi *loop* manual: 57 instruksi, nol instruksi `call`.\n\nVersi iterator malah punya empat instruksi lebih sedikit, bukan lebih banyak. Dua-duanya juga berisi instruksi vektor yang sama: `movdqu`, `pand`, `paddd`, dan `pcmpeqd`. Artinya *loop*-nya diubah jadi SIMD 128-bit yang memproses empat bilangan `i32` sekaligus. Kalau `-C target-feature=+avx2` ditambahkan, keduanya naik ke instruksi `ymm` dan jumlahnya jadi 103 lawan 107, dengan pola yang sama.\n\nGimana kompiler bisa sejauh itu? Tiga hal:\n\n1. **Tanpa alokasi di *heap*.** Iterator Rust tuh *struct* kecil di *stack* yang cuma menyimpan posisi penelusuran. Nggak ada objek baru yang dibuat di tengah rantai.\n2. **Pengecekan batas ikut hilang.** Waktu kamu menulis `array[i]`, kompiler wajib menyisipkan pemeriksaan `i \u003C len` di *runtime* supaya akses di luar batas bisa dicegah. Lewat iterator, panjang dan arah penelusurannya bisa dibuktikan di *compile-time*, jadi pengecekan per elemen itu nggak perlu ada lagi. Di *assembly* di atas, yang tersisa cuma penambahan pointer biasa.\n3. **Hasilnya jadi ramah vektorisasi.** Rantai iterator adalah mesin status yang bersih dan tanpa efek samping, jadi LLVM gampang mengenalinya sebagai pola *map-filter-reduce* dan menggantinya dengan instruksi SIMD.\n\nIni bukan cuma teori di kertas. Buku resmi *The Rust Programming Language* pernah mengukur dua versi fungsi pencarian kata di teks *Sherlock Holmes*: versi *loop* 19.620.300 ns per iterasi, versi iterator 19.234.900 ns. Versi iterator sedikit lebih cepat. Angka itu dari mesin penulis buku di edisi pertama, jadi anggap petunjuk arah, bukan patokan mutlak.\n\n## Rahasia 3: closure itu cuma *struct* anonim\n\nDi bahasa ber-*Garbage Collector*, *closure* yang menangkap variabel dari luar biasanya butuh alokasi di *heap*: nilai yang ditangkap dibungkus jadi objek supaya umurnya lebih panjang dari fungsi asalnya.\n\nDi Rust caranya beda. *Closure* diterjemahkan jadi *struct* anonim yang isinya variabel yang ditangkap, dan disimpan di *stack* seperti nilai biasa:\n\n```rust\nlet batas = 5;\nlet dibaca = |x: i32| x > batas;                 \u002F\u002F cuma membaca  -> Fn\nlet mut hitungan = 0;\nlet mut menambah = |x: i32| { hitungan += x; };  \u002F\u002F mengubah      -> FnMut\nlet pemilik = String::from(\"halo\");\nlet memindah = move || pemilik.len();            \u002F\u002F memindahkan   -> FnOnce\n```\n\nBedanya cuma soal apa yang dilakukan *closure* itu ke variabel di sekitarnya, dan kompiler yang menentukannya:\n\n- Kalau *closure*-nya cuma membaca, dia meminjam referensi biasa dan mengimplementasikan *trait* `Fn`.\n- Kalau dia mengubah nilainya, pinjamannya jadi `&mut` dan *trait*-nya `FnMut`.\n- Kalau dia mengambil kepemilikannya, nilainya pindah ke dalam *struct*, dan *trait*-nya `FnOnce`.\n\nNggak ada *allocator* yang dilibatkan, karena semuanya hidup di *stack*. Dijalankan, outputnya: `dibaca(7)` balik `true`, `hitungan` berakhir di `7`, dan panjang `pemilik` tetap `4` walaupun isinya sudah dipindah masuk ke dalam *closure*.\n\n## Pajak yang tetap harus dibayar\n\nKalau abstraksinya benar-benar nol ongkos, kenapa nggak semua bahasa begitu? Karena ongkosnya nggak hilang, cuma pindah tempat.\n\n**Waktu *build* lebih lama.** Analisis *borrow checker*, *monomorphization*, dan optimasi agresif memang kerja berat. Tapi hati-hati dengan penjelasan populer yang menyalahkan *monomorphization* sendirian: salah satu pengembang kompiler Rust pernah bilang eksperimen di masa awal Rust menunjukkan *monomorphization* bukan penyebab utamanya, karena versi dinamis pun butuh banyak kode pembukuan yang harus dioptimasi. Penyebab sebenarnya tersebar, dari pohon dependensi yang besar sampai tahap optimasi LLVM itu sendiri.\n\n**Ukuran biner bisa membengkak.** Setiap tipe konkret menghasilkan salinan fungsinya sendiri. Pakai `Vec\u003Ci32>`, `Vec\u003Cu64>`, dan `Vec\u003CString>` di satu program, kamu dapat tiga salinan kode yang mirip. Di program kecil efeknya tipis; di proyek besar, *code bloat* itu nyata. Salah satu obatnya: pakai `&dyn Trait` untuk kode yang dipanggil jarang dan nggak butuh cepat. Seperti yang kita lihat di atas, itu memang benar-benar menghemat kode.\n\nJadi harga *zero-cost abstraction* bukan nol. Yang berubah cuma siapa yang membayarnya: mesin *build* kamu dan pembaca kodenya nanti, bukan CPU pengguna.\n\n## Penutup\n\nYang bikin prinsip ini menarik bukan sekadar performanya, tapi izin yang dia berikan: kamu nggak perlu merasa bersalah nulis iterator berantai, nyusun *trait* modular, atau bikin *closure* di kode yang kritis secara performa. Kalau memang ada biayanya, biaya itu ditaruh di tempat yang jauh lebih murah buat kamu bayar.\n\nKalau kamu mau lihat sendiri *assembly*-nya, tempel kode di atas ke [Compiler Explorer](https:\u002F\u002Fgodbolt.org\u002F), pilih `rustc` versi stabil, lalu tambahkan `-O -C panic=abort` di kolom argumen. Cara paling cepat buat berhenti percaya dan mulai memeriksa. Selamat ber-*systems programming* ria! 🦀\n","- Zero-cost abstraction bukan berarti bebas biaya, tapi memindahkan biaya itu ke tahap kompilasi supaya runtime-nya bersih.\n- Monomorphization menyalin fungsi generik untuk tiap tipe konkret, jadi kompiler bisa membuang lapisan abstraksinya sepenuhnya. Fungsi yang isinya dua pemanggilan trait menyusut jadi `mov eax, 8` dan `ret`.\n- Rantai iterator di Rust terukur secepat loop manual karena nggak ada alokasi heap, pengecekan batas hilang, dan loop-nya berubah jadi instruksi SIMD.\n- Closure diterjemahkan jadi struct anonim di stack, dan trait Fn, FnMut, atau FnOnce yang dipilih kompiler menunjukkan cara dia memakai variabel di sekitarnya.\n- Yang tetap dibayar: waktu build lebih lama dan ukuran biner yang bisa membengkak akibat duplikasi fungsi untuk tiap tipe konkret.","\u003Cp>Ambil satu array angka, lalu tulis ini di JavaScript:\u003C\u002Fp>\n\n\u003Cdiv class=\"code-block-wrapper my-6 not-prose rounded-xl border-2 border-black dark:border-gray-600 shadow-neo overflow-hidden bg-[#24292e] text-[#e1e4e8] transition-all\">\n  \u003Cdiv class=\"code-block-header flex items-center justify-between px-4 py-2.5 bg-[#1f2428] border-b-2 border-black dark:border-gray-600 font-mono text-xs font-bold text-gray-300 select-none\">\n    \u003Cdiv class=\"flex items-center gap-2\">\n      \u003Cspan class=\"w-3 h-3 rounded-full bg-[#ff5f56] border border-black\u002F40 inline-block\">\u003C\u002Fspan>\n      \u003Cspan class=\"w-3 h-3 rounded-full bg-[#ffbd2e] border border-black\u002F40 inline-block\">\u003C\u002Fspan>\n      \u003Cspan class=\"w-3 h-3 rounded-full bg-[#27c93f] border border-black\u002F40 inline-block\">\u003C\u002Fspan>\n      \u003Cspan class=\"ml-2 font-mono font-bold text-xs uppercase tracking-wider text-gray-300\">JS\u003C\u002Fspan>\n    \u003C\u002Fdiv>\n    \u003Cbutton type=\"button\" class=\"copy-code-btn flex items-center gap-1.5 px-3 py-1 text-xs font-bold bg-[#2f363d] text-gray-200 border-2 border-black dark:border-gray-500 rounded-lg shadow-neo-sm hover:translate-x-0.5 hover:translate-y-0.5 hover:shadow-none hover:bg-gray-700 transition-all cursor-pointer\" data-code=\"const%20total%20%3D%20angka%0A%20%20.filter((x)%20%3D%3E%20x%20%25%202%20%3D%3D%3D%200)%0A%20%20.map((x)%20%3D%3E%20x%20*%202)%0A%20%20.reduce((a%2C%20b)%20%3D%3E%20a%20%2B%20b%2C%200)%3B\" title=\"Salin kode\">\n      \u003Csvg class=\"w-3.5 h-3.5 copy-icon-svg\" fill=\"none\" stroke=\"currentColor\" viewBox=\"0 0 24 24\">\n        \u003Cpath stroke-linecap=\"round\" stroke-linejoin=\"round\" stroke-width=\"2\" d=\"M8 16H6a2 2 0 01-2-2V6a2 2 0 012-2h8a2 2 0 012 2v2m-6 12h8a2 2 0 002-2v-8a2 2 0 00-2-2h-8a2 2 0 00-2 2v8a2 2 0 002 2z\">\u003C\u002Fpath>\n      \u003C\u002Fsvg>\n      \u003Cspan class=\"copy-text\">Copy\u003C\u002Fspan>\n    \u003C\u002Fbutton>\n  \u003C\u002Fdiv>\n  \u003Cdiv class=\"code-block-content p-4 overflow-x-auto text-sm font-mono leading-relaxed bg-[#24292e]\">\n    \u003Cpre class=\"shiki github-dark\" style=\"background-color:#24292e;color:#e1e4e8\" tabindex=\"0\">\u003Ccode>\u003Cspan class=\"line\">\u003Cspan style=\"color:#F97583\">const\u003C\u002Fspan>\u003Cspan style=\"color:#79B8FF\"> total\u003C\u002Fspan>\u003Cspan style=\"color:#F97583\"> =\u003C\u002Fspan>\u003Cspan style=\"color:#E1E4E8\"> angka\u003C\u002Fspan>\u003C\u002Fspan>\n\u003Cspan class=\"line\">\u003Cspan style=\"color:#E1E4E8\">  .\u003C\u002Fspan>\u003Cspan style=\"color:#B392F0\">filter\u003C\u002Fspan>\u003Cspan style=\"color:#E1E4E8\">((\u003C\u002Fspan>\u003Cspan style=\"color:#FFAB70\">x\u003C\u002Fspan>\u003Cspan style=\"color:#E1E4E8\">) \u003C\u002Fspan>\u003Cspan style=\"color:#F97583\">=>\u003C\u002Fspan>\u003Cspan style=\"color:#E1E4E8\"> x \u003C\u002Fspan>\u003Cspan style=\"color:#F97583\">%\u003C\u002Fspan>\u003Cspan style=\"color:#79B8FF\"> 2\u003C\u002Fspan>\u003Cspan style=\"color:#F97583\"> ===\u003C\u002Fspan>\u003Cspan style=\"color:#79B8FF\"> 0\u003C\u002Fspan>\u003Cspan style=\"color:#E1E4E8\">)\u003C\u002Fspan>\u003C\u002Fspan>\n\u003Cspan class=\"line\">\u003Cspan style=\"color:#E1E4E8\">  .\u003C\u002Fspan>\u003Cspan style=\"color:#B392F0\">map\u003C\u002Fspan>\u003Cspan style=\"color:#E1E4E8\">((\u003C\u002Fspan>\u003Cspan style=\"color:#FFAB70\">x\u003C\u002Fspan>\u003Cspan style=\"color:#E1E4E8\">) \u003C\u002Fspan>\u003Cspan style=\"color:#F97583\">=>\u003C\u002Fspan>\u003Cspan style=\"color:#E1E4E8\"> x \u003C\u002Fspan>\u003Cspan style=\"color:#F97583\">*\u003C\u002Fspan>\u003Cspan style=\"color:#79B8FF\"> 2\u003C\u002Fspan>\u003Cspan style=\"color:#E1E4E8\">)\u003C\u002Fspan>\u003C\u002Fspan>\n\u003Cspan class=\"line\">\u003Cspan style=\"color:#E1E4E8\">  .\u003C\u002Fspan>\u003Cspan style=\"color:#B392F0\">reduce\u003C\u002Fspan>\u003Cspan style=\"color:#E1E4E8\">((\u003C\u002Fspan>\u003Cspan style=\"color:#FFAB70\">a\u003C\u002Fspan>\u003Cspan style=\"color:#E1E4E8\">, \u003C\u002Fspan>\u003Cspan style=\"color:#FFAB70\">b\u003C\u002Fspan>\u003Cspan style=\"color:#E1E4E8\">) \u003C\u002Fspan>\u003Cspan style=\"color:#F97583\">=>\u003C\u002Fspan>\u003Cspan style=\"color:#E1E4E8\"> a \u003C\u002Fspan>\u003Cspan style=\"color:#F97583\">+\u003C\u002Fspan>\u003Cspan style=\"color:#E1E4E8\"> b, \u003C\u002Fspan>\u003Cspan style=\"color:#79B8FF\">0\u003C\u002Fspan>\u003Cspan style=\"color:#E1E4E8\">);\u003C\u002Fspan>\u003C\u002Fspan>\u003C\u002Fcode>\u003C\u002Fpre>\n  \u003C\u002Fdiv>\n\u003C\u002Fdiv>\u003Cp>Satu baris, enak dibaca, rapi banget, kan? 😅 Tapi kita semua tahu harganya: \u003Ccode>filter\u003C\u002Fcode> bikin array baru, \u003Ccode>map\u003C\u002Fcode> bikin array baru lagi, lalu \u003Ccode>reduce\u003C\u002Fcode> jalan di atas hasilnya. Buat array berisi sejuta angka, itu artinya dua array sementara yang harus dialokasikan, dibuang, dan dibersihkan \u003Cem>Garbage Collector\u003C\u002Fem>, padahal hasil akhirnya cuma satu bilangan.\u003C\u002Fp>\n\u003Cp>Itu sebabnya programmer yang berburu performa tinggi sering turun kasta: nulis \u003Cem>loop\u003C\u002Fem> \u003Ccode>for\u003C\u002Fcode> mentah, pakai pointer manual, dan merelakan kodenya jadi lebih panjang demi satu-dua milidetik. Selama beberapa dekade, itu memang aturan tak tertulisnya: makin tinggi \u003Cem>level\u003C\u002Fem> abstraksi, makin mahal ongkos \u003Cem>runtime\u003C\u002Fem>-nya.\u003C\u002Fp>\n\u003Cp>Rust menantang aturan itu dengan prinsip yang diwarisi dari dunia C++: \u003Cem>Zero-Cost Abstractions\u003C\u002Fem>. Bjarne Stroustrup, pencipta C++, merumuskannya seperti ini:\u003C\u002Fp>\n\u003Cblockquote>\n\u003Cp>Secara umum, implementasi C++ mengikuti prinsip \u003Cem>zero-overhead\u003C\u002Fem>: yang nggak kamu pakai, nggak kamu bayar. Dan yang kamu pakai, nggak bisa kamu tulis sendiri dengan lebih efisien.\u003C\u002Fp>\n\u003C\u002Fblockquote>\n\u003Cp>Kedengarannya kayak slogan \u003Cem>marketing\u003C\u002Fem>, ya. Makanya kita nggak akan percaya begitu saja. Yuk, kita bongkar \u003Cem>assembly\u003C\u002Fem>-nya sendiri, pakai \u003Ccode>rustc\u003C\u002Fcode> 1.99 dengan LLVM di belakangnya.\u003C\u002Fp>\n\u003Ch2 id=\"jadi-apa-sih-zero-cost-itu\">Jadi apa sih "zero-cost" itu?\u003C\u002Fh2>\n\u003Cp>Kata "zero" di sini bukan berarti gratis tanpa ongkos sama sekali. Ongkosnya tetap ada, cuma tempat membayarnya yang dipindah: dari \u003Cem>runtime\u003C\u002Fem> ke \u003Cem>compile-time\u003C\u002Fem>. \u003Cstrong>Biayanya pindah, bukan hilang.\u003C\u002Fstrong>\u003C\u002Fp>\n\u003Cp>\u003Ccode>rustc\u003C\u002Fcode> dan LLVM bekerja ekstra keras saat proses \u003Cem>build\u003C\u002Fem>. Mereka menyalin fungsi generik untuk tiap tipe konkret, membuka abstraksi berlapis jadi kode datar, lalu membuang seluruh pembukuan yang cuma jadi beban. Yang tersisa di berkas biner adalah instruksi mesin biasa, sering kali sama persis dengan versi manualnya.\u003C\u002Fp>\n\u003Cp>Tiga mekanisme utama yang dipakai untuk itu: \u003Cem>monomorphization\u003C\u002Fem>, \u003Cem>iterator\u003C\u002Fem>, dan \u003Cem>closure\u003C\u002Fem>.\u003C\u002Fp>\n\u003Ch2 id=\"rahasia-1-monomorphization-polimorfisme-tanpa-lompatan-runtime\">Rahasia 1: monomorphization, polimorfisme tanpa lompatan \u003Cem>runtime\u003C\u002Fem>\u003C\u002Fh2>\n\u003Cp>Di bahasa yang pakai \u003Cem>dynamic dispatch\u003C\u002Fem> seperti Java atau Python, memanggil method dari sebuah \u003Cem>interface\u003C\u002Fem> berarti CPU harus mencari alamat fungsinya dulu di \u003Cem>runtime\u003C\u002Fem>, biasanya lewat \u003Cem>vtable\u003C\u002Fem>. Biaya satu lompatan emang kecil, tapi efeknya besar: kompiler cuma bisa melihat dari luar fungsi yang dipanggil, jadi dia kehilangan kesempatan membuang kode mati atau menyatukan perhitungan.\u003C\u002Fp>\n\u003Cp>Rust bisa memilih jalur lain. Coba kode ini:\u003C\u002Fp>\n\n\u003Cdiv class=\"code-block-wrapper my-6 not-prose rounded-xl border-2 border-black dark:border-gray-600 shadow-neo overflow-hidden bg-[#24292e] text-[#e1e4e8] transition-all\">\n  \u003Cdiv class=\"code-block-header flex items-center justify-between px-4 py-2.5 bg-[#1f2428] border-b-2 border-black dark:border-gray-600 font-mono text-xs font-bold text-gray-300 select-none\">\n    \u003Cdiv class=\"flex items-center gap-2\">\n      \u003Cspan class=\"w-3 h-3 rounded-full bg-[#ff5f56] border border-black\u002F40 inline-block\">\u003C\u002Fspan>\n      \u003Cspan class=\"w-3 h-3 rounded-full bg-[#ffbd2e] border border-black\u002F40 inline-block\">\u003C\u002Fspan>\n      \u003Cspan class=\"w-3 h-3 rounded-full bg-[#27c93f] border border-black\u002F40 inline-block\">\u003C\u002Fspan>\n      \u003Cspan class=\"ml-2 font-mono font-bold text-xs uppercase tracking-wider text-gray-300\">RUST\u003C\u002Fspan>\n    \u003C\u002Fdiv>\n    \u003Cbutton type=\"button\" class=\"copy-code-btn flex items-center gap-1.5 px-3 py-1 text-xs font-bold bg-[#2f363d] text-gray-200 border-2 border-black dark:border-gray-500 rounded-lg shadow-neo-sm hover:translate-x-0.5 hover:translate-y-0.5 hover:shadow-none hover:bg-gray-700 transition-all cursor-pointer\" data-code=\"trait%20Hitung%20%7B%0A%20%20%20%20fn%20nilai(%26self)%20-%3E%20i32%3B%0A%7D%0A%0Astruct%20A%3B%0Aimpl%20Hitung%20for%20A%20%7B%0A%20%20%20%20fn%20nilai(%26self)%20-%3E%20i32%20%7B%203%20%7D%0A%7D%0A%0Astruct%20B%3B%0Aimpl%20Hitung%20for%20B%20%7B%0A%20%20%20%20fn%20nilai(%26self)%20-%3E%20i32%20%7B%205%20%7D%0A%7D%0A%0Afn%20pakai%3CT%3A%20Hitung%3E(x%3A%20T)%20-%3E%20i32%20%7B%0A%20%20%20%20x.nilai()%0A%7D%0A%0Apub%20fn%20statis()%20-%3E%20i32%20%7B%0A%20%20%20%20pakai(A)%20%2B%20pakai(B)%0A%7D%0A%0Apub%20fn%20dinamis(d%3A%20%26dyn%20Hitung)%20-%3E%20i32%20%7B%0A%20%20%20%20d.nilai()%0A%7D\" title=\"Salin kode\">\n      \u003Csvg class=\"w-3.5 h-3.5 copy-icon-svg\" fill=\"none\" stroke=\"currentColor\" viewBox=\"0 0 24 24\">\n        \u003Cpath stroke-linecap=\"round\" stroke-linejoin=\"round\" stroke-width=\"2\" d=\"M8 16H6a2 2 0 01-2-2V6a2 2 0 012-2h8a2 2 0 012 2v2m-6 12h8a2 2 0 002-2v-8a2 2 0 00-2-2h-8a2 2 0 00-2 2v8a2 2 0 002 2z\">\u003C\u002Fpath>\n      \u003C\u002Fsvg>\n      \u003Cspan class=\"copy-text\">Copy\u003C\u002Fspan>\n    \u003C\u002Fbutton>\n  \u003C\u002Fdiv>\n  \u003Cdiv class=\"code-block-content p-4 overflow-x-auto text-sm font-mono leading-relaxed bg-[#24292e]\">\n    \u003Cpre class=\"shiki github-dark\" style=\"background-color:#24292e;color:#e1e4e8\" tabindex=\"0\">\u003Ccode>\u003Cspan class=\"line\">\u003Cspan style=\"color:#F97583\">trait\u003C\u002Fspan>\u003Cspan style=\"color:#B392F0\"> Hitung\u003C\u002Fspan>\u003Cspan style=\"color:#E1E4E8\"> {\u003C\u002Fspan>\u003C\u002Fspan>\n\u003Cspan class=\"line\">\u003Cspan style=\"color:#F97583\">    fn\u003C\u002Fspan>\u003Cspan style=\"color:#B392F0\"> nilai\u003C\u002Fspan>\u003Cspan style=\"color:#E1E4E8\">(\u003C\u002Fspan>\u003Cspan style=\"color:#F97583\">&\u003C\u002Fspan>\u003Cspan style=\"color:#79B8FF\">self\u003C\u002Fspan>\u003Cspan style=\"color:#E1E4E8\">) \u003C\u002Fspan>\u003Cspan style=\"color:#F97583\">->\u003C\u002Fspan>\u003Cspan style=\"color:#B392F0\"> i32\u003C\u002Fspan>\u003Cspan style=\"color:#E1E4E8\">;\u003C\u002Fspan>\u003C\u002Fspan>\n\u003Cspan class=\"line\">\u003Cspan style=\"color:#E1E4E8\">}\u003C\u002Fspan>\u003C\u002Fspan>\n\u003Cspan class=\"line\">\u003C\u002Fspan>\n\u003Cspan class=\"line\">\u003Cspan style=\"color:#F97583\">struct\u003C\u002Fspan>\u003Cspan style=\"color:#B392F0\"> A\u003C\u002Fspan>\u003Cspan style=\"color:#E1E4E8\">;\u003C\u002Fspan>\u003C\u002Fspan>\n\u003Cspan class=\"line\">\u003Cspan style=\"color:#F97583\">impl\u003C\u002Fspan>\u003Cspan style=\"color:#B392F0\"> Hitung\u003C\u002Fspan>\u003Cspan style=\"color:#F97583\"> for\u003C\u002Fspan>\u003Cspan style=\"color:#B392F0\"> A\u003C\u002Fspan>\u003Cspan style=\"color:#E1E4E8\"> {\u003C\u002Fspan>\u003C\u002Fspan>\n\u003Cspan class=\"line\">\u003Cspan style=\"color:#F97583\">    fn\u003C\u002Fspan>\u003Cspan style=\"color:#B392F0\"> nilai\u003C\u002Fspan>\u003Cspan style=\"color:#E1E4E8\">(\u003C\u002Fspan>\u003Cspan style=\"color:#F97583\">&\u003C\u002Fspan>\u003Cspan style=\"color:#79B8FF\">self\u003C\u002Fspan>\u003Cspan style=\"color:#E1E4E8\">) \u003C\u002Fspan>\u003Cspan style=\"color:#F97583\">->\u003C\u002Fspan>\u003Cspan style=\"color:#B392F0\"> i32\u003C\u002Fspan>\u003Cspan style=\"color:#E1E4E8\"> { \u003C\u002Fspan>\u003Cspan style=\"color:#79B8FF\">3\u003C\u002Fspan>\u003Cspan style=\"color:#E1E4E8\"> }\u003C\u002Fspan>\u003C\u002Fspan>\n\u003Cspan class=\"line\">\u003Cspan style=\"color:#E1E4E8\">}\u003C\u002Fspan>\u003C\u002Fspan>\n\u003Cspan class=\"line\">\u003C\u002Fspan>\n\u003Cspan class=\"line\">\u003Cspan style=\"color:#F97583\">struct\u003C\u002Fspan>\u003Cspan style=\"color:#B392F0\"> B\u003C\u002Fspan>\u003Cspan style=\"color:#E1E4E8\">;\u003C\u002Fspan>\u003C\u002Fspan>\n\u003Cspan class=\"line\">\u003Cspan style=\"color:#F97583\">impl\u003C\u002Fspan>\u003Cspan style=\"color:#B392F0\"> Hitung\u003C\u002Fspan>\u003Cspan style=\"color:#F97583\"> for\u003C\u002Fspan>\u003Cspan style=\"color:#B392F0\"> B\u003C\u002Fspan>\u003Cspan style=\"color:#E1E4E8\"> {\u003C\u002Fspan>\u003C\u002Fspan>\n\u003Cspan class=\"line\">\u003Cspan style=\"color:#F97583\">    fn\u003C\u002Fspan>\u003Cspan style=\"color:#B392F0\"> nilai\u003C\u002Fspan>\u003Cspan style=\"color:#E1E4E8\">(\u003C\u002Fspan>\u003Cspan style=\"color:#F97583\">&\u003C\u002Fspan>\u003Cspan style=\"color:#79B8FF\">self\u003C\u002Fspan>\u003Cspan style=\"color:#E1E4E8\">) \u003C\u002Fspan>\u003Cspan style=\"color:#F97583\">->\u003C\u002Fspan>\u003Cspan style=\"color:#B392F0\"> i32\u003C\u002Fspan>\u003Cspan style=\"color:#E1E4E8\"> { \u003C\u002Fspan>\u003Cspan style=\"color:#79B8FF\">5\u003C\u002Fspan>\u003Cspan style=\"color:#E1E4E8\"> }\u003C\u002Fspan>\u003C\u002Fspan>\n\u003Cspan class=\"line\">\u003Cspan style=\"color:#E1E4E8\">}\u003C\u002Fspan>\u003C\u002Fspan>\n\u003Cspan class=\"line\">\u003C\u002Fspan>\n\u003Cspan class=\"line\">\u003Cspan style=\"color:#F97583\">fn\u003C\u002Fspan>\u003Cspan style=\"color:#B392F0\"> pakai\u003C\u002Fspan>\u003Cspan style=\"color:#E1E4E8\"><\u003C\u002Fspan>\u003Cspan style=\"color:#B392F0\">T\u003C\u002Fspan>\u003Cspan style=\"color:#F97583\">:\u003C\u002Fspan>\u003Cspan style=\"color:#B392F0\"> Hitung\u003C\u002Fspan>\u003Cspan style=\"color:#E1E4E8\">>(x\u003C\u002Fspan>\u003Cspan style=\"color:#F97583\">:\u003C\u002Fspan>\u003Cspan style=\"color:#B392F0\"> T\u003C\u002Fspan>\u003Cspan style=\"color:#E1E4E8\">) \u003C\u002Fspan>\u003Cspan style=\"color:#F97583\">->\u003C\u002Fspan>\u003Cspan style=\"color:#B392F0\"> i32\u003C\u002Fspan>\u003Cspan style=\"color:#E1E4E8\"> {\u003C\u002Fspan>\u003C\u002Fspan>\n\u003Cspan class=\"line\">\u003Cspan style=\"color:#E1E4E8\">    x\u003C\u002Fspan>\u003Cspan style=\"color:#F97583\">.\u003C\u002Fspan>\u003Cspan style=\"color:#B392F0\">nilai\u003C\u002Fspan>\u003Cspan style=\"color:#E1E4E8\">()\u003C\u002Fspan>\u003C\u002Fspan>\n\u003Cspan class=\"line\">\u003Cspan style=\"color:#E1E4E8\">}\u003C\u002Fspan>\u003C\u002Fspan>\n\u003Cspan class=\"line\">\u003C\u002Fspan>\n\u003Cspan class=\"line\">\u003Cspan style=\"color:#F97583\">pub\u003C\u002Fspan>\u003Cspan style=\"color:#F97583\"> fn\u003C\u002Fspan>\u003Cspan style=\"color:#B392F0\"> statis\u003C\u002Fspan>\u003Cspan style=\"color:#E1E4E8\">() \u003C\u002Fspan>\u003Cspan style=\"color:#F97583\">->\u003C\u002Fspan>\u003Cspan style=\"color:#B392F0\"> i32\u003C\u002Fspan>\u003Cspan style=\"color:#E1E4E8\"> {\u003C\u002Fspan>\u003C\u002Fspan>\n\u003Cspan class=\"line\">\u003Cspan style=\"color:#B392F0\">    pakai\u003C\u002Fspan>\u003Cspan style=\"color:#E1E4E8\">(\u003C\u002Fspan>\u003Cspan style=\"color:#B392F0\">A\u003C\u002Fspan>\u003Cspan style=\"color:#E1E4E8\">) \u003C\u002Fspan>\u003Cspan style=\"color:#F97583\">+\u003C\u002Fspan>\u003Cspan style=\"color:#B392F0\"> pakai\u003C\u002Fspan>\u003Cspan style=\"color:#E1E4E8\">(\u003C\u002Fspan>\u003Cspan style=\"color:#B392F0\">B\u003C\u002Fspan>\u003Cspan style=\"color:#E1E4E8\">)\u003C\u002Fspan>\u003C\u002Fspan>\n\u003Cspan class=\"line\">\u003Cspan style=\"color:#E1E4E8\">}\u003C\u002Fspan>\u003C\u002Fspan>\n\u003Cspan class=\"line\">\u003C\u002Fspan>\n\u003Cspan class=\"line\">\u003Cspan style=\"color:#F97583\">pub\u003C\u002Fspan>\u003Cspan style=\"color:#F97583\"> fn\u003C\u002Fspan>\u003Cspan style=\"color:#B392F0\"> dinamis\u003C\u002Fspan>\u003Cspan style=\"color:#E1E4E8\">(d\u003C\u002Fspan>\u003Cspan style=\"color:#F97583\">:\u003C\u002Fspan>\u003Cspan style=\"color:#F97583\"> &dyn\u003C\u002Fspan>\u003Cspan style=\"color:#B392F0\"> Hitung\u003C\u002Fspan>\u003Cspan style=\"color:#E1E4E8\">) \u003C\u002Fspan>\u003Cspan style=\"color:#F97583\">->\u003C\u002Fspan>\u003Cspan style=\"color:#B392F0\"> i32\u003C\u002Fspan>\u003Cspan style=\"color:#E1E4E8\"> {\u003C\u002Fspan>\u003C\u002Fspan>\n\u003Cspan class=\"line\">\u003Cspan style=\"color:#E1E4E8\">    d\u003C\u002Fspan>\u003Cspan style=\"color:#F97583\">.\u003C\u002Fspan>\u003Cspan style=\"color:#B392F0\">nilai\u003C\u002Fspan>\u003Cspan style=\"color:#E1E4E8\">()\u003C\u002Fspan>\u003C\u002Fspan>\n\u003Cspan class=\"line\">\u003Cspan style=\"color:#E1E4E8\">}\u003C\u002Fspan>\u003C\u002Fspan>\u003C\u002Fcode>\u003C\u002Fpre>\n  \u003C\u002Fdiv>\n\u003C\u002Fdiv>\u003Cp>Dua fungsi terakhir hasilnya sama-sama 8, tapi jalannya beda jauh. Ini yang dihasilkan \u003Ccode>rustc -O\u003C\u002Fcode> untuk \u003Ccode>statis()\u003C\u002Fcode> nih:\u003C\u002Fp>\n\n\u003Cdiv class=\"code-block-wrapper my-6 not-prose rounded-xl border-2 border-black dark:border-gray-600 shadow-neo overflow-hidden bg-[#24292e] text-[#e1e4e8] transition-all\">\n  \u003Cdiv class=\"code-block-header flex items-center justify-between px-4 py-2.5 bg-[#1f2428] border-b-2 border-black dark:border-gray-600 font-mono text-xs font-bold text-gray-300 select-none\">\n    \u003Cdiv class=\"flex items-center gap-2\">\n      \u003Cspan class=\"w-3 h-3 rounded-full bg-[#ff5f56] border border-black\u002F40 inline-block\">\u003C\u002Fspan>\n      \u003Cspan class=\"w-3 h-3 rounded-full bg-[#ffbd2e] border border-black\u002F40 inline-block\">\u003C\u002Fspan>\n      \u003Cspan class=\"w-3 h-3 rounded-full bg-[#27c93f] border border-black\u002F40 inline-block\">\u003C\u002Fspan>\n      \u003Cspan class=\"ml-2 font-mono font-bold text-xs uppercase tracking-wider text-gray-300\">ASM\u003C\u002Fspan>\n    \u003C\u002Fdiv>\n    \u003Cbutton type=\"button\" class=\"copy-code-btn flex items-center gap-1.5 px-3 py-1 text-xs font-bold bg-[#2f363d] text-gray-200 border-2 border-black dark:border-gray-500 rounded-lg shadow-neo-sm hover:translate-x-0.5 hover:translate-y-0.5 hover:shadow-none hover:bg-gray-700 transition-all cursor-pointer\" data-code=\"statis%3A%0A%20%20%20%20mov%20%20%20%20%20eax%2C%208%0A%20%20%20%20ret\" title=\"Salin kode\">\n      \u003Csvg class=\"w-3.5 h-3.5 copy-icon-svg\" fill=\"none\" stroke=\"currentColor\" viewBox=\"0 0 24 24\">\n        \u003Cpath stroke-linecap=\"round\" stroke-linejoin=\"round\" stroke-width=\"2\" d=\"M8 16H6a2 2 0 01-2-2V6a2 2 0 012-2h8a2 2 0 012 2v2m-6 12h8a2 2 0 002-2v-8a2 2 0 00-2-2h-8a2 2 0 00-2 2v8a2 2 0 002 2z\">\u003C\u002Fpath>\n      \u003C\u002Fsvg>\n      \u003Cspan class=\"copy-text\">Copy\u003C\u002Fspan>\n    \u003C\u002Fbutton>\n  \u003C\u002Fdiv>\n  \u003Cdiv class=\"code-block-content p-4 overflow-x-auto text-sm font-mono leading-relaxed bg-[#24292e]\">\n    \u003Cpre class=\"shiki github-dark\" style=\"background-color:#24292e;color:#e1e4e8\">\u003Ccode>statis:\n    mov     eax, 8\n    ret\u003C\u002Fcode>\u003C\u002Fpre>\n  \u003C\u002Fdiv>\n\u003C\u002Fdiv>\u003Cp>Dua instruksi 🤯 Tanpa pemanggilan fungsi, tanpa tabel \u003Cem>method\u003C\u002Fem>, tanpa jejak \u003Ccode>A\u003C\u002Fcode> atau \u003Ccode>B\u003C\u002Fcode>. Kompiler sudah menghitung semuanya di \u003Cem>compile-time\u003C\u002Fem> dan menyisakan jawabannya saja.\u003C\u002Fp>\n\u003Cp>Sekarang versi \u003Ccode>&dyn\u003C\u002Fcode>, satu-satunya cara Rust memaksa \u003Cem>dynamic dispatch\u003C\u002Fem>:\u003C\u002Fp>\n\n\u003Cdiv class=\"code-block-wrapper my-6 not-prose rounded-xl border-2 border-black dark:border-gray-600 shadow-neo overflow-hidden bg-[#24292e] text-[#e1e4e8] transition-all\">\n  \u003Cdiv class=\"code-block-header flex items-center justify-between px-4 py-2.5 bg-[#1f2428] border-b-2 border-black dark:border-gray-600 font-mono text-xs font-bold text-gray-300 select-none\">\n    \u003Cdiv class=\"flex items-center gap-2\">\n      \u003Cspan class=\"w-3 h-3 rounded-full bg-[#ff5f56] border border-black\u002F40 inline-block\">\u003C\u002Fspan>\n      \u003Cspan class=\"w-3 h-3 rounded-full bg-[#ffbd2e] border border-black\u002F40 inline-block\">\u003C\u002Fspan>\n      \u003Cspan class=\"w-3 h-3 rounded-full bg-[#27c93f] border border-black\u002F40 inline-block\">\u003C\u002Fspan>\n      \u003Cspan class=\"ml-2 font-mono font-bold text-xs uppercase tracking-wider text-gray-300\">ASM\u003C\u002Fspan>\n    \u003C\u002Fdiv>\n    \u003Cbutton type=\"button\" class=\"copy-code-btn flex items-center gap-1.5 px-3 py-1 text-xs font-bold bg-[#2f363d] text-gray-200 border-2 border-black dark:border-gray-500 rounded-lg shadow-neo-sm hover:translate-x-0.5 hover:translate-y-0.5 hover:shadow-none hover:bg-gray-700 transition-all cursor-pointer\" data-code=\"dinamis%3A%0A%20%20%20%20jmp%20%20%20%20%20qword%20ptr%20%5Brsi%20%2B%2024%5D\" title=\"Salin kode\">\n      \u003Csvg class=\"w-3.5 h-3.5 copy-icon-svg\" fill=\"none\" stroke=\"currentColor\" viewBox=\"0 0 24 24\">\n        \u003Cpath stroke-linecap=\"round\" stroke-linejoin=\"round\" stroke-width=\"2\" d=\"M8 16H6a2 2 0 01-2-2V6a2 2 0 012-2h8a2 2 0 012 2v2m-6 12h8a2 2 0 002-2v-8a2 2 0 00-2-2h-8a2 2 0 00-2 2v8a2 2 0 002 2z\">\u003C\u002Fpath>\n      \u003C\u002Fsvg>\n      \u003Cspan class=\"copy-text\">Copy\u003C\u002Fspan>\n    \u003C\u002Fbutton>\n  \u003C\u002Fdiv>\n  \u003Cdiv class=\"code-block-content p-4 overflow-x-auto text-sm font-mono leading-relaxed bg-[#24292e]\">\n    \u003Cpre class=\"shiki github-dark\" style=\"background-color:#24292e;color:#e1e4e8\">\u003Ccode>dinamis:\n    jmp     qword ptr [rsi + 24]\u003C\u002Fcode>\u003C\u002Fpre>\n  \u003C\u002Fdiv>\n\u003C\u002Fdiv>\u003Cp>Satu instruksi, tapi isinya lompat ke alamat yang baru diketahui saat program jalan, dibaca dari \u003Cem>vtable\u003C\u002Fem> pada offset 24. Kompiler berhenti di situ: dia nggak tahu fungsi apa yang bakal dipanggil, jadi nggak ada yang bisa di-\u003Cem>inline\u003C\u002Fem>.\u003C\u002Fp>\n\u003Cp>Proses penyalinan inilah yang disebut \u003Cem>monomorphization\u003C\u002Fem>. Waktu kamu menulis \u003Ccode>pakai::<A>()\u003C\u002Fcode> dan \u003Ccode>pakai::<B>()\u003C\u002Fcode>, Rust benar-benar membuat dua fungsi berbeda di berkas biner, satu untuk \u003Ccode>A\u003C\u002Fcode> dan satu untuk \u003Ccode>B\u003C\u002Fcode>. Kamu tetap bisa memaksa \u003Cem>dynamic dispatch\u003C\u002Fem> kapan pun kamu mau, dan kadang itu memang keputusan yang benar. Bedanya, di Rust itu pilihan, bukan satu-satunya jalan.\u003C\u002Fp>\n\u003Ch2 id=\"rahasia-2-iterator-secepat-loop-manual\">Rahasia 2: iterator secepat \u003Cem>loop\u003C\u002Fem> manual\u003C\u002Fh2>\n\u003Cp>Balik ke masalah di pembuka: rantai \u003Ccode>.filter().map().sum()\u003C\u002Fcode> di Rust.\u003C\u002Fp>\n\n\u003Cdiv class=\"code-block-wrapper my-6 not-prose rounded-xl border-2 border-black dark:border-gray-600 shadow-neo overflow-hidden bg-[#24292e] text-[#e1e4e8] transition-all\">\n  \u003Cdiv class=\"code-block-header flex items-center justify-between px-4 py-2.5 bg-[#1f2428] border-b-2 border-black dark:border-gray-600 font-mono text-xs font-bold text-gray-300 select-none\">\n    \u003Cdiv class=\"flex items-center gap-2\">\n      \u003Cspan class=\"w-3 h-3 rounded-full bg-[#ff5f56] border border-black\u002F40 inline-block\">\u003C\u002Fspan>\n      \u003Cspan class=\"w-3 h-3 rounded-full bg-[#ffbd2e] border border-black\u002F40 inline-block\">\u003C\u002Fspan>\n      \u003Cspan class=\"w-3 h-3 rounded-full bg-[#27c93f] border border-black\u002F40 inline-block\">\u003C\u002Fspan>\n      \u003Cspan class=\"ml-2 font-mono font-bold text-xs uppercase tracking-wider text-gray-300\">RUST\u003C\u002Fspan>\n    \u003C\u002Fdiv>\n    \u003Cbutton type=\"button\" class=\"copy-code-btn flex items-center gap-1.5 px-3 py-1 text-xs font-bold bg-[#2f363d] text-gray-200 border-2 border-black dark:border-gray-500 rounded-lg shadow-neo-sm hover:translate-x-0.5 hover:translate-y-0.5 hover:shadow-none hover:bg-gray-700 transition-all cursor-pointer\" data-code=\"let%20numbers%3A%20Vec%3Ci32%3E%20%3D%20(1..%3D10).collect()%3B%0A%0Alet%20functional%3A%20i32%20%3D%20numbers%0A%20%20%20%20.iter()%0A%20%20%20%20.filter(%7C%26%26x%7C%20x%20%25%202%20%3D%3D%200)%0A%20%20%20%20.map(%7C%26x%7C%20x%20*%202)%0A%20%20%20%20.sum()%3B%0A%0Alet%20mut%20manual%20%3D%200%3B%0Afor%20%26x%20in%20%26numbers%20%7B%0A%20%20%20%20if%20x%20%25%202%20%3D%3D%200%20%7B%0A%20%20%20%20%20%20%20%20manual%20%2B%3D%20x%20*%202%3B%0A%20%20%20%20%7D%0A%7D%0A%0Aprintln!(%22iterator%20%3D%20%7Bfunctional%7D%2C%20for%20loop%20%3D%20%7Bmanual%7D%22)%3B\" title=\"Salin kode\">\n      \u003Csvg class=\"w-3.5 h-3.5 copy-icon-svg\" fill=\"none\" stroke=\"currentColor\" viewBox=\"0 0 24 24\">\n        \u003Cpath stroke-linecap=\"round\" stroke-linejoin=\"round\" stroke-width=\"2\" d=\"M8 16H6a2 2 0 01-2-2V6a2 2 0 012-2h8a2 2 0 012 2v2m-6 12h8a2 2 0 002-2v-8a2 2 0 00-2-2h-8a2 2 0 00-2 2v8a2 2 0 002 2z\">\u003C\u002Fpath>\n      \u003C\u002Fsvg>\n      \u003Cspan class=\"copy-text\">Copy\u003C\u002Fspan>\n    \u003C\u002Fbutton>\n  \u003C\u002Fdiv>\n  \u003Cdiv class=\"code-block-content p-4 overflow-x-auto text-sm font-mono leading-relaxed bg-[#24292e]\">\n    \u003Cpre class=\"shiki github-dark\" style=\"background-color:#24292e;color:#e1e4e8\" tabindex=\"0\">\u003Ccode>\u003Cspan class=\"line\">\u003Cspan style=\"color:#F97583\">let\u003C\u002Fspan>\u003Cspan style=\"color:#E1E4E8\"> numbers\u003C\u002Fspan>\u003Cspan style=\"color:#F97583\">:\u003C\u002Fspan>\u003Cspan style=\"color:#B392F0\"> Vec\u003C\u002Fspan>\u003Cspan style=\"color:#E1E4E8\"><\u003C\u002Fspan>\u003Cspan style=\"color:#B392F0\">i32\u003C\u002Fspan>\u003Cspan style=\"color:#E1E4E8\">> \u003C\u002Fspan>\u003Cspan style=\"color:#F97583\">=\u003C\u002Fspan>\u003Cspan style=\"color:#E1E4E8\"> (\u003C\u002Fspan>\u003Cspan style=\"color:#79B8FF\">1\u003C\u002Fspan>\u003Cspan style=\"color:#F97583\">..=\u003C\u002Fspan>\u003Cspan style=\"color:#79B8FF\">10\u003C\u002Fspan>\u003Cspan style=\"color:#E1E4E8\">)\u003C\u002Fspan>\u003Cspan style=\"color:#F97583\">.\u003C\u002Fspan>\u003Cspan style=\"color:#B392F0\">collect\u003C\u002Fspan>\u003Cspan style=\"color:#E1E4E8\">();\u003C\u002Fspan>\u003C\u002Fspan>\n\u003Cspan class=\"line\">\u003C\u002Fspan>\n\u003Cspan class=\"line\">\u003Cspan style=\"color:#F97583\">let\u003C\u002Fspan>\u003Cspan style=\"color:#E1E4E8\"> functional\u003C\u002Fspan>\u003Cspan style=\"color:#F97583\">:\u003C\u002Fspan>\u003Cspan style=\"color:#B392F0\"> i32\u003C\u002Fspan>\u003Cspan style=\"color:#F97583\"> =\u003C\u002Fspan>\u003Cspan style=\"color:#E1E4E8\"> numbers\u003C\u002Fspan>\u003C\u002Fspan>\n\u003Cspan class=\"line\">\u003Cspan style=\"color:#F97583\">    .\u003C\u002Fspan>\u003Cspan style=\"color:#B392F0\">iter\u003C\u002Fspan>\u003Cspan style=\"color:#E1E4E8\">()\u003C\u002Fspan>\u003C\u002Fspan>\n\u003Cspan class=\"line\">\u003Cspan style=\"color:#F97583\">    .\u003C\u002Fspan>\u003Cspan style=\"color:#B392F0\">filter\u003C\u002Fspan>\u003Cspan style=\"color:#E1E4E8\">(\u003C\u002Fspan>\u003Cspan style=\"color:#F97583\">|&&\u003C\u002Fspan>\u003Cspan style=\"color:#E1E4E8\">x\u003C\u002Fspan>\u003Cspan style=\"color:#F97583\">|\u003C\u002Fspan>\u003Cspan style=\"color:#E1E4E8\"> x \u003C\u002Fspan>\u003Cspan style=\"color:#F97583\">%\u003C\u002Fspan>\u003Cspan style=\"color:#79B8FF\"> 2\u003C\u002Fspan>\u003Cspan style=\"color:#F97583\"> ==\u003C\u002Fspan>\u003Cspan style=\"color:#79B8FF\"> 0\u003C\u002Fspan>\u003Cspan style=\"color:#E1E4E8\">)\u003C\u002Fspan>\u003C\u002Fspan>\n\u003Cspan class=\"line\">\u003Cspan style=\"color:#F97583\">    .\u003C\u002Fspan>\u003Cspan style=\"color:#B392F0\">map\u003C\u002Fspan>\u003Cspan style=\"color:#E1E4E8\">(\u003C\u002Fspan>\u003Cspan style=\"color:#F97583\">|&\u003C\u002Fspan>\u003Cspan style=\"color:#E1E4E8\">x\u003C\u002Fspan>\u003Cspan style=\"color:#F97583\">|\u003C\u002Fspan>\u003Cspan style=\"color:#E1E4E8\"> x \u003C\u002Fspan>\u003Cspan style=\"color:#F97583\">*\u003C\u002Fspan>\u003Cspan style=\"color:#79B8FF\"> 2\u003C\u002Fspan>\u003Cspan style=\"color:#E1E4E8\">)\u003C\u002Fspan>\u003C\u002Fspan>\n\u003Cspan class=\"line\">\u003Cspan style=\"color:#F97583\">    .\u003C\u002Fspan>\u003Cspan style=\"color:#B392F0\">sum\u003C\u002Fspan>\u003Cspan style=\"color:#E1E4E8\">();\u003C\u002Fspan>\u003C\u002Fspan>\n\u003Cspan class=\"line\">\u003C\u002Fspan>\n\u003Cspan class=\"line\">\u003Cspan style=\"color:#F97583\">let\u003C\u002Fspan>\u003Cspan style=\"color:#F97583\"> mut\u003C\u002Fspan>\u003Cspan style=\"color:#E1E4E8\"> manual \u003C\u002Fspan>\u003Cspan style=\"color:#F97583\">=\u003C\u002Fspan>\u003Cspan style=\"color:#79B8FF\"> 0\u003C\u002Fspan>\u003Cspan style=\"color:#E1E4E8\">;\u003C\u002Fspan>\u003C\u002Fspan>\n\u003Cspan class=\"line\">\u003Cspan style=\"color:#F97583\">for\u003C\u002Fspan>\u003Cspan style=\"color:#F97583\"> &\u003C\u002Fspan>\u003Cspan style=\"color:#E1E4E8\">x \u003C\u002Fspan>\u003Cspan style=\"color:#F97583\">in\u003C\u002Fspan>\u003Cspan style=\"color:#F97583\"> &\u003C\u002Fspan>\u003Cspan style=\"color:#E1E4E8\">numbers {\u003C\u002Fspan>\u003C\u002Fspan>\n\u003Cspan class=\"line\">\u003Cspan style=\"color:#F97583\">    if\u003C\u002Fspan>\u003Cspan style=\"color:#E1E4E8\"> x \u003C\u002Fspan>\u003Cspan style=\"color:#F97583\">%\u003C\u002Fspan>\u003Cspan style=\"color:#79B8FF\"> 2\u003C\u002Fspan>\u003Cspan style=\"color:#F97583\"> ==\u003C\u002Fspan>\u003Cspan style=\"color:#79B8FF\"> 0\u003C\u002Fspan>\u003Cspan style=\"color:#E1E4E8\"> {\u003C\u002Fspan>\u003C\u002Fspan>\n\u003Cspan class=\"line\">\u003Cspan style=\"color:#E1E4E8\">        manual \u003C\u002Fspan>\u003Cspan style=\"color:#F97583\">+=\u003C\u002Fspan>\u003Cspan style=\"color:#E1E4E8\"> x \u003C\u002Fspan>\u003Cspan style=\"color:#F97583\">*\u003C\u002Fspan>\u003Cspan style=\"color:#79B8FF\"> 2\u003C\u002Fspan>\u003Cspan style=\"color:#E1E4E8\">;\u003C\u002Fspan>\u003C\u002Fspan>\n\u003Cspan class=\"line\">\u003Cspan style=\"color:#E1E4E8\">    }\u003C\u002Fspan>\u003C\u002Fspan>\n\u003Cspan class=\"line\">\u003Cspan style=\"color:#E1E4E8\">}\u003C\u002Fspan>\u003C\u002Fspan>\n\u003Cspan class=\"line\">\u003C\u002Fspan>\n\u003Cspan class=\"line\">\u003Cspan style=\"color:#B392F0\">println!\u003C\u002Fspan>\u003Cspan style=\"color:#E1E4E8\">(\u003C\u002Fspan>\u003Cspan style=\"color:#9ECBFF\">\"iterator = {functional}, for loop = {manual}\"\u003C\u002Fspan>\u003Cspan style=\"color:#E1E4E8\">);\u003C\u002Fspan>\u003C\u002Fspan>\u003C\u002Fcode>\u003C\u002Fpre>\n  \u003C\u002Fdiv>\n\u003C\u002Fdiv>\u003Cp>Dijalankan, hasilnya \u003Ccode>iterator = 60, for loop = 60\u003C\u002Fcode>, sama seperti yang kita harapkan.\u003C\u002Fp>\n\u003Cp>Yang menarik bukan hasilnya, tapi apa yang terjadi setelah kompilasi. Dua fungsi itu dikompilasi terpisah dengan \u003Ccode>rustc -O -C panic=abort\u003C\u002Fcode>, lalu instruksinya dihitung satu per satu:\u003C\u002Fp>\n\u003Cul>\n\u003Cli>Versi \u003Cem>iterator\u003C\u002Fem>: 53 instruksi, nol instruksi \u003Ccode>call\u003C\u002Fcode>.\u003C\u002Fli>\n\u003Cli>Versi \u003Cem>loop\u003C\u002Fem> manual: 57 instruksi, nol instruksi \u003Ccode>call\u003C\u002Fcode>.\u003C\u002Fli>\n\u003C\u002Ful>\n\u003Cp>Versi iterator malah punya empat instruksi lebih sedikit, bukan lebih banyak. Dua-duanya juga berisi instruksi vektor yang sama: \u003Ccode>movdqu\u003C\u002Fcode>, \u003Ccode>pand\u003C\u002Fcode>, \u003Ccode>paddd\u003C\u002Fcode>, dan \u003Ccode>pcmpeqd\u003C\u002Fcode>. Artinya \u003Cem>loop\u003C\u002Fem>-nya diubah jadi SIMD 128-bit yang memproses empat bilangan \u003Ccode>i32\u003C\u002Fcode> sekaligus. Kalau \u003Ccode>-C target-feature=+avx2\u003C\u002Fcode> ditambahkan, keduanya naik ke instruksi \u003Ccode>ymm\u003C\u002Fcode> dan jumlahnya jadi 103 lawan 107, dengan pola yang sama.\u003C\u002Fp>\n\u003Cp>Gimana kompiler bisa sejauh itu? Tiga hal:\u003C\u002Fp>\n\u003Col>\n\u003Cli>\u003Cstrong>Tanpa alokasi di \u003Cem>heap\u003C\u002Fem>.\u003C\u002Fstrong> Iterator Rust tuh \u003Cem>struct\u003C\u002Fem> kecil di \u003Cem>stack\u003C\u002Fem> yang cuma menyimpan posisi penelusuran. Nggak ada objek baru yang dibuat di tengah rantai.\u003C\u002Fli>\n\u003Cli>\u003Cstrong>Pengecekan batas ikut hilang.\u003C\u002Fstrong> Waktu kamu menulis \u003Ccode>array[i]\u003C\u002Fcode>, kompiler wajib menyisipkan pemeriksaan \u003Ccode>i < len\u003C\u002Fcode> di \u003Cem>runtime\u003C\u002Fem> supaya akses di luar batas bisa dicegah. Lewat iterator, panjang dan arah penelusurannya bisa dibuktikan di \u003Cem>compile-time\u003C\u002Fem>, jadi pengecekan per elemen itu nggak perlu ada lagi. Di \u003Cem>assembly\u003C\u002Fem> di atas, yang tersisa cuma penambahan pointer biasa.\u003C\u002Fli>\n\u003Cli>\u003Cstrong>Hasilnya jadi ramah vektorisasi.\u003C\u002Fstrong> Rantai iterator adalah mesin status yang bersih dan tanpa efek samping, jadi LLVM gampang mengenalinya sebagai pola \u003Cem>map-filter-reduce\u003C\u002Fem> dan menggantinya dengan instruksi SIMD.\u003C\u002Fli>\n\u003C\u002Fol>\n\u003Cp>Ini bukan cuma teori di kertas. Buku resmi \u003Cem>The Rust Programming Language\u003C\u002Fem> pernah mengukur dua versi fungsi pencarian kata di teks \u003Cem>Sherlock Holmes\u003C\u002Fem>: versi \u003Cem>loop\u003C\u002Fem> 19.620.300 ns per iterasi, versi iterator 19.234.900 ns. Versi iterator sedikit lebih cepat. Angka itu dari mesin penulis buku di edisi pertama, jadi anggap petunjuk arah, bukan patokan mutlak.\u003C\u002Fp>\n\u003Ch2 id=\"rahasia-3-closure-itu-cuma-struct-anonim\">Rahasia 3: closure itu cuma \u003Cem>struct\u003C\u002Fem> anonim\u003C\u002Fh2>\n\u003Cp>Di bahasa ber-\u003Cem>Garbage Collector\u003C\u002Fem>, \u003Cem>closure\u003C\u002Fem> yang menangkap variabel dari luar biasanya butuh alokasi di \u003Cem>heap\u003C\u002Fem>: nilai yang ditangkap dibungkus jadi objek supaya umurnya lebih panjang dari fungsi asalnya.\u003C\u002Fp>\n\u003Cp>Di Rust caranya beda. \u003Cem>Closure\u003C\u002Fem> diterjemahkan jadi \u003Cem>struct\u003C\u002Fem> anonim yang isinya variabel yang ditangkap, dan disimpan di \u003Cem>stack\u003C\u002Fem> seperti nilai biasa:\u003C\u002Fp>\n\n\u003Cdiv class=\"code-block-wrapper my-6 not-prose rounded-xl border-2 border-black dark:border-gray-600 shadow-neo overflow-hidden bg-[#24292e] text-[#e1e4e8] transition-all\">\n  \u003Cdiv class=\"code-block-header flex items-center justify-between px-4 py-2.5 bg-[#1f2428] border-b-2 border-black dark:border-gray-600 font-mono text-xs font-bold text-gray-300 select-none\">\n    \u003Cdiv class=\"flex items-center gap-2\">\n      \u003Cspan class=\"w-3 h-3 rounded-full bg-[#ff5f56] border border-black\u002F40 inline-block\">\u003C\u002Fspan>\n      \u003Cspan class=\"w-3 h-3 rounded-full bg-[#ffbd2e] border border-black\u002F40 inline-block\">\u003C\u002Fspan>\n      \u003Cspan class=\"w-3 h-3 rounded-full bg-[#27c93f] border border-black\u002F40 inline-block\">\u003C\u002Fspan>\n      \u003Cspan class=\"ml-2 font-mono font-bold text-xs uppercase tracking-wider text-gray-300\">RUST\u003C\u002Fspan>\n    \u003C\u002Fdiv>\n    \u003Cbutton type=\"button\" class=\"copy-code-btn flex items-center gap-1.5 px-3 py-1 text-xs font-bold bg-[#2f363d] text-gray-200 border-2 border-black dark:border-gray-500 rounded-lg shadow-neo-sm hover:translate-x-0.5 hover:translate-y-0.5 hover:shadow-none hover:bg-gray-700 transition-all cursor-pointer\" data-code=\"let%20batas%20%3D%205%3B%0Alet%20dibaca%20%3D%20%7Cx%3A%20i32%7C%20x%20%3E%20batas%3B%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%2F%2F%20cuma%20membaca%20%20-%3E%20Fn%0Alet%20mut%20hitungan%20%3D%200%3B%0Alet%20mut%20menambah%20%3D%20%7Cx%3A%20i32%7C%20%7B%20hitungan%20%2B%3D%20x%3B%20%7D%3B%20%20%2F%2F%20mengubah%20%20%20%20%20%20-%3E%20FnMut%0Alet%20pemilik%20%3D%20String%3A%3Afrom(%22halo%22)%3B%0Alet%20memindah%20%3D%20move%20%7C%7C%20pemilik.len()%3B%20%20%20%20%20%20%20%20%20%20%20%20%2F%2F%20memindahkan%20%20%20-%3E%20FnOnce\" title=\"Salin kode\">\n      \u003Csvg class=\"w-3.5 h-3.5 copy-icon-svg\" fill=\"none\" stroke=\"currentColor\" viewBox=\"0 0 24 24\">\n        \u003Cpath stroke-linecap=\"round\" stroke-linejoin=\"round\" stroke-width=\"2\" d=\"M8 16H6a2 2 0 01-2-2V6a2 2 0 012-2h8a2 2 0 012 2v2m-6 12h8a2 2 0 002-2v-8a2 2 0 00-2-2h-8a2 2 0 00-2 2v8a2 2 0 002 2z\">\u003C\u002Fpath>\n      \u003C\u002Fsvg>\n      \u003Cspan class=\"copy-text\">Copy\u003C\u002Fspan>\n    \u003C\u002Fbutton>\n  \u003C\u002Fdiv>\n  \u003Cdiv class=\"code-block-content p-4 overflow-x-auto text-sm font-mono leading-relaxed bg-[#24292e]\">\n    \u003Cpre class=\"shiki github-dark\" style=\"background-color:#24292e;color:#e1e4e8\" tabindex=\"0\">\u003Ccode>\u003Cspan class=\"line\">\u003Cspan style=\"color:#F97583\">let\u003C\u002Fspan>\u003Cspan style=\"color:#E1E4E8\"> batas \u003C\u002Fspan>\u003Cspan style=\"color:#F97583\">=\u003C\u002Fspan>\u003Cspan style=\"color:#79B8FF\"> 5\u003C\u002Fspan>\u003Cspan style=\"color:#E1E4E8\">;\u003C\u002Fspan>\u003C\u002Fspan>\n\u003Cspan class=\"line\">\u003Cspan style=\"color:#F97583\">let\u003C\u002Fspan>\u003Cspan style=\"color:#E1E4E8\"> dibaca \u003C\u002Fspan>\u003Cspan style=\"color:#F97583\">=\u003C\u002Fspan>\u003Cspan style=\"color:#F97583\"> |\u003C\u002Fspan>\u003Cspan style=\"color:#E1E4E8\">x\u003C\u002Fspan>\u003Cspan style=\"color:#F97583\">:\u003C\u002Fspan>\u003Cspan style=\"color:#B392F0\"> i32\u003C\u002Fspan>\u003Cspan style=\"color:#F97583\">|\u003C\u002Fspan>\u003Cspan style=\"color:#E1E4E8\"> x \u003C\u002Fspan>\u003Cspan style=\"color:#F97583\">>\u003C\u002Fspan>\u003Cspan style=\"color:#E1E4E8\"> batas;                 \u003C\u002Fspan>\u003Cspan style=\"color:#6A737D\">\u002F\u002F cuma membaca  -> Fn\u003C\u002Fspan>\u003C\u002Fspan>\n\u003Cspan class=\"line\">\u003Cspan style=\"color:#F97583\">let\u003C\u002Fspan>\u003Cspan style=\"color:#F97583\"> mut\u003C\u002Fspan>\u003Cspan style=\"color:#E1E4E8\"> hitungan \u003C\u002Fspan>\u003Cspan style=\"color:#F97583\">=\u003C\u002Fspan>\u003Cspan style=\"color:#79B8FF\"> 0\u003C\u002Fspan>\u003Cspan style=\"color:#E1E4E8\">;\u003C\u002Fspan>\u003C\u002Fspan>\n\u003Cspan class=\"line\">\u003Cspan style=\"color:#F97583\">let\u003C\u002Fspan>\u003Cspan style=\"color:#F97583\"> mut\u003C\u002Fspan>\u003Cspan style=\"color:#E1E4E8\"> menambah \u003C\u002Fspan>\u003Cspan style=\"color:#F97583\">=\u003C\u002Fspan>\u003Cspan style=\"color:#F97583\"> |\u003C\u002Fspan>\u003Cspan style=\"color:#E1E4E8\">x\u003C\u002Fspan>\u003Cspan style=\"color:#F97583\">:\u003C\u002Fspan>\u003Cspan style=\"color:#B392F0\"> i32\u003C\u002Fspan>\u003Cspan style=\"color:#F97583\">|\u003C\u002Fspan>\u003Cspan style=\"color:#E1E4E8\"> { hitungan \u003C\u002Fspan>\u003Cspan style=\"color:#F97583\">+=\u003C\u002Fspan>\u003Cspan style=\"color:#E1E4E8\"> x; };  \u003C\u002Fspan>\u003Cspan style=\"color:#6A737D\">\u002F\u002F mengubah      -> FnMut\u003C\u002Fspan>\u003C\u002Fspan>\n\u003Cspan class=\"line\">\u003Cspan style=\"color:#F97583\">let\u003C\u002Fspan>\u003Cspan style=\"color:#E1E4E8\"> pemilik \u003C\u002Fspan>\u003Cspan style=\"color:#F97583\">=\u003C\u002Fspan>\u003Cspan style=\"color:#B392F0\"> String\u003C\u002Fspan>\u003Cspan style=\"color:#F97583\">::\u003C\u002Fspan>\u003Cspan style=\"color:#B392F0\">from\u003C\u002Fspan>\u003Cspan style=\"color:#E1E4E8\">(\u003C\u002Fspan>\u003Cspan style=\"color:#9ECBFF\">\"halo\"\u003C\u002Fspan>\u003Cspan style=\"color:#E1E4E8\">);\u003C\u002Fspan>\u003C\u002Fspan>\n\u003Cspan class=\"line\">\u003Cspan style=\"color:#F97583\">let\u003C\u002Fspan>\u003Cspan style=\"color:#E1E4E8\"> memindah \u003C\u002Fspan>\u003Cspan style=\"color:#F97583\">=\u003C\u002Fspan>\u003Cspan style=\"color:#F97583\"> move\u003C\u002Fspan>\u003Cspan style=\"color:#F97583\"> ||\u003C\u002Fspan>\u003Cspan style=\"color:#E1E4E8\"> pemilik\u003C\u002Fspan>\u003Cspan style=\"color:#F97583\">.\u003C\u002Fspan>\u003Cspan style=\"color:#B392F0\">len\u003C\u002Fspan>\u003Cspan style=\"color:#E1E4E8\">();            \u003C\u002Fspan>\u003Cspan style=\"color:#6A737D\">\u002F\u002F memindahkan   -> FnOnce\u003C\u002Fspan>\u003C\u002Fspan>\u003C\u002Fcode>\u003C\u002Fpre>\n  \u003C\u002Fdiv>\n\u003C\u002Fdiv>\u003Cp>Bedanya cuma soal apa yang dilakukan \u003Cem>closure\u003C\u002Fem> itu ke variabel di sekitarnya, dan kompiler yang menentukannya:\u003C\u002Fp>\n\u003Cul>\n\u003Cli>Kalau \u003Cem>closure\u003C\u002Fem>-nya cuma membaca, dia meminjam referensi biasa dan mengimplementasikan \u003Cem>trait\u003C\u002Fem> \u003Ccode>Fn\u003C\u002Fcode>.\u003C\u002Fli>\n\u003Cli>Kalau dia mengubah nilainya, pinjamannya jadi \u003Ccode>&mut\u003C\u002Fcode> dan \u003Cem>trait\u003C\u002Fem>-nya \u003Ccode>FnMut\u003C\u002Fcode>.\u003C\u002Fli>\n\u003Cli>Kalau dia mengambil kepemilikannya, nilainya pindah ke dalam \u003Cem>struct\u003C\u002Fem>, dan \u003Cem>trait\u003C\u002Fem>-nya \u003Ccode>FnOnce\u003C\u002Fcode>.\u003C\u002Fli>\n\u003C\u002Ful>\n\u003Cp>Nggak ada \u003Cem>allocator\u003C\u002Fem> yang dilibatkan, karena semuanya hidup di \u003Cem>stack\u003C\u002Fem>. Dijalankan, outputnya: \u003Ccode>dibaca(7)\u003C\u002Fcode> balik \u003Ccode>true\u003C\u002Fcode>, \u003Ccode>hitungan\u003C\u002Fcode> berakhir di \u003Ccode>7\u003C\u002Fcode>, dan panjang \u003Ccode>pemilik\u003C\u002Fcode> tetap \u003Ccode>4\u003C\u002Fcode> walaupun isinya sudah dipindah masuk ke dalam \u003Cem>closure\u003C\u002Fem>.\u003C\u002Fp>\n\u003Ch2 id=\"pajak-yang-tetap-harus-dibayar\">Pajak yang tetap harus dibayar\u003C\u002Fh2>\n\u003Cp>Kalau abstraksinya benar-benar nol ongkos, kenapa nggak semua bahasa begitu? Karena ongkosnya nggak hilang, cuma pindah tempat.\u003C\u002Fp>\n\u003Cp>\u003Cstrong>Waktu \u003Cem>build\u003C\u002Fem> lebih lama.\u003C\u002Fstrong> Analisis \u003Cem>borrow checker\u003C\u002Fem>, \u003Cem>monomorphization\u003C\u002Fem>, dan optimasi agresif memang kerja berat. Tapi hati-hati dengan penjelasan populer yang menyalahkan \u003Cem>monomorphization\u003C\u002Fem> sendirian: salah satu pengembang kompiler Rust pernah bilang eksperimen di masa awal Rust menunjukkan \u003Cem>monomorphization\u003C\u002Fem> bukan penyebab utamanya, karena versi dinamis pun butuh banyak kode pembukuan yang harus dioptimasi. Penyebab sebenarnya tersebar, dari pohon dependensi yang besar sampai tahap optimasi LLVM itu sendiri.\u003C\u002Fp>\n\u003Cp>\u003Cstrong>Ukuran biner bisa membengkak.\u003C\u002Fstrong> Setiap tipe konkret menghasilkan salinan fungsinya sendiri. Pakai \u003Ccode>Vec<i32>\u003C\u002Fcode>, \u003Ccode>Vec<u64>\u003C\u002Fcode>, dan \u003Ccode>Vec<String>\u003C\u002Fcode> di satu program, kamu dapat tiga salinan kode yang mirip. Di program kecil efeknya tipis; di proyek besar, \u003Cem>code bloat\u003C\u002Fem> itu nyata. Salah satu obatnya: pakai \u003Ccode>&dyn Trait\u003C\u002Fcode> untuk kode yang dipanggil jarang dan nggak butuh cepat. Seperti yang kita lihat di atas, itu memang benar-benar menghemat kode.\u003C\u002Fp>\n\u003Cp>Jadi harga \u003Cem>zero-cost abstraction\u003C\u002Fem> bukan nol. Yang berubah cuma siapa yang membayarnya: mesin \u003Cem>build\u003C\u002Fem> kamu dan pembaca kodenya nanti, bukan CPU pengguna.\u003C\u002Fp>\n\u003Ch2 id=\"penutup\">Penutup\u003C\u002Fh2>\n\u003Cp>Yang bikin prinsip ini menarik bukan sekadar performanya, tapi izin yang dia berikan: kamu nggak perlu merasa bersalah nulis iterator berantai, nyusun \u003Cem>trait\u003C\u002Fem> modular, atau bikin \u003Cem>closure\u003C\u002Fem> di kode yang kritis secara performa. Kalau memang ada biayanya, biaya itu ditaruh di tempat yang jauh lebih murah buat kamu bayar.\u003C\u002Fp>\n\u003Cp>Kalau kamu mau lihat sendiri \u003Cem>assembly\u003C\u002Fem>-nya, tempel kode di atas ke \u003Ca href=\"https:\u002F\u002Fgodbolt.org\u002F\">Compiler Explorer\u003C\u002Fa>, pilih \u003Ccode>rustc\u003C\u002Fcode> versi stabil, lalu tambahkan \u003Ccode>-O -C panic=abort\u003C\u002Fcode> di kolom argumen. Cara paling cepat buat berhenti percaya dan mulai memeriksa. Selamat ber-\u003Cem>systems programming\u003C\u002Fem> ria! 🦀\u003C\u002Fp>\n","\u003Cul>\n\u003Cli>Zero-cost abstraction bukan berarti bebas biaya, tapi memindahkan biaya itu ke tahap kompilasi supaya runtime-nya bersih.\u003C\u002Fli>\n\u003Cli>Monomorphization menyalin fungsi generik untuk tiap tipe konkret, jadi kompiler bisa membuang lapisan abstraksinya sepenuhnya. Fungsi yang isinya dua pemanggilan trait menyusut jadi \u003Ccode>mov eax, 8\u003C\u002Fcode> dan \u003Ccode>ret\u003C\u002Fcode>.\u003C\u002Fli>\n\u003Cli>Rantai iterator di Rust terukur secepat loop manual karena nggak ada alokasi heap, pengecekan batas hilang, dan loop-nya berubah jadi instruksi SIMD.\u003C\u002Fli>\n\u003Cli>Closure diterjemahkan jadi struct anonim di stack, dan trait Fn, FnMut, atau FnOnce yang dipilih kompiler menunjukkan cara dia memakai variabel di sekitarnya.\u003C\u002Fli>\n\u003Cli>Yang tetap dibayar: waktu build lebih lama dan ukuran biner yang bisa membengkak akibat duplikasi fungsi untuk tiap tipe konkret.\u003C\u002Fli>\n\u003C\u002Ful>\n",[712,729,742,755,768,788],{"id":713,"title":714,"title_en":21,"slug":715,"excerpt":716,"excerpt_en":21,"has_translation":15,"published_at":717,"reading_time":81,"hidden_from_listing":15,"tags":718,"thumbnail_image":21,"og_image":720,"series":721,"authors":726},133,"Python Strings: the Badge That Only Worked for One Name","python-strings","The badge script printed the right name for the person who wrote it and the wrong name for everybody else. Slicing counts characters, and a name is words.","2026-10-28T13:00:00.000Z",[260,719],"string","\u002Fog\u002Fpython-strings.png",{"id":722,"title":723,"title_en":724,"slug":725},30,"Koleksi dan String","Collections and Strings","python-collections",[727],{"authors_id":728},{"id":308,"name":309,"slug":310,"role":272,"profile_picture":21},{"id":730,"title":731,"title_en":21,"slug":732,"excerpt":733,"excerpt_en":21,"has_translation":15,"published_at":734,"reading_time":81,"hidden_from_listing":15,"tags":735,"thumbnail_image":21,"og_image":737,"series":738,"authors":739},132,"Python Tuples: Why All Three Points Are the Same Point","python-tuples","Three points walk into a loop and come out identical. The list was never copied three times; the name was. A tuple makes that bug impossible.","2026-10-28T12:00:00.000Z",[260,736],"tuple","\u002Fog\u002Fpython-tuples.png",{"id":722,"title":723,"title_en":724,"slug":725},[740],{"authors_id":741},{"id":308,"name":309,"slug":310,"role":272,"profile_picture":21},{"id":743,"title":744,"title_en":21,"slug":745,"excerpt":746,"excerpt_en":21,"has_translation":15,"published_at":747,"reading_time":81,"hidden_from_listing":15,"tags":748,"thumbnail_image":21,"og_image":750,"series":751,"authors":752},131,"Python Sets: the Duplicate That Keeps Coming Back","python-sets","A de-duplication loop that works on clean data leaves four tags where there should be two. The bug is case, and the fix is a `set`.","2026-10-28T11:00:00.000Z",[260,749],"set","\u002Fog\u002Fpython-sets.png",{"id":722,"title":723,"title_en":724,"slug":725},[753],{"authors_id":754},{"id":308,"name":309,"slug":310,"role":272,"profile_picture":21},{"id":756,"title":757,"title_en":21,"slug":758,"excerpt":759,"excerpt_en":21,"has_translation":15,"published_at":760,"reading_time":81,"hidden_from_listing":15,"tags":761,"thumbnail_image":21,"og_image":763,"series":764,"authors":765},130,"Python Dictionaries: the Key That Isn't There","python-dictionary","A word counter dies the first time it meets a word twice. The fix is one line; what takes longer is knowing which of a dict's three lookups to reach for.","2026-10-28T10:00:00.000Z",[260,762],"dictionary","\u002Fog\u002Fpython-dictionary.png",{"id":722,"title":723,"title_en":724,"slug":725},[766],{"authors_id":767},{"id":308,"name":309,"slug":310,"role":272,"profile_picture":21},{"id":769,"title":770,"title_en":771,"slug":772,"excerpt":773,"excerpt_en":774,"has_translation":12,"published_at":775,"reading_time":14,"hidden_from_listing":15,"tags":776,"thumbnail_image":21,"og_image":783,"series":784,"authors":785},129,"Biar RAG nggak kena 504: pisahin jalur query dan ingestion","So Your RAG Stops Hitting 504: Split the Query Path From Ingestion","rag-pisah-jalur-query-dan-ingestion","Satu service RAG yang merangkap parsing dan menjawab kueri bakal tumbang pas ada yang upload PDF 200 halaman. Obatnya dua jalur dan satu queue.","One RAG service that both parses uploads and answers queries will fall over the moment someone uploads a 200-page PDF. The cure is two paths and one queue.","2026-10-22T01:30:00.000Z",[777,778,779,780,781,782],"rag","cloud-run","cloud-tasks","gcp","serverless","arsitektur","\u002Fog\u002Frag-pisah-jalur-query-dan-ingestion.png",{"id":694,"title":35,"title_en":36,"slug":37},[786],{"authors_id":787},{"id":308,"name":309,"slug":310,"role":272,"profile_picture":21},{"id":789,"title":790,"title_en":791,"slug":792,"excerpt":793,"excerpt_en":794,"has_translation":12,"published_at":795,"reading_time":81,"hidden_from_listing":15,"tags":796,"thumbnail_image":21,"og_image":803,"series":804,"authors":805},128,"Linear atau graf: cara mengatur banyak agent tanpa loop abadi","Linear or Graph: How to Run Many Agents Without an Eternal Loop","multi-agen-linear-atau-grafik","Satu agent dengan dua puluh tool gampang kacau. Begitu beberapa agent saling revisi, kamu butuh graf yang mendukung cycle dan angka yang membuatnya berhenti.","One agent with twenty tools gets messy fast. Once several agents revise each other, you need a graph that allows cycles and a number that makes it stop.","2026-10-21T16:05:00.000Z",[797,798,799,800,801,802],"multi-agent","langgraph","autogen","orkestrasi","checkpoint","llm","\u002Fog\u002Fmulti-agen-linear-atau-grafik.png",{"id":694,"title":35,"title_en":36,"slug":37},[806],{"authors_id":807},{"id":308,"name":309,"slug":310,"role":272,"profile_picture":21},[809,812,815,818,821,824],{"text":810,"depth":269,"id":811},"Jadi apa sih \"zero-cost\" itu?","jadi-apa-sih-zero-cost-itu",{"text":813,"depth":269,"id":814},"Rahasia 1: monomorphization, polimorfisme tanpa lompatan runtime","rahasia-1-monomorphization-polimorfisme-tanpa-lompatan-runtime",{"text":816,"depth":269,"id":817},"Rahasia 2: iterator secepat loop manual","rahasia-2-iterator-secepat-loop-manual",{"text":819,"depth":269,"id":820},"Rahasia 3: closure itu cuma struct anonim","rahasia-3-closure-itu-cuma-struct-anonim",{"text":822,"depth":269,"id":823},"Pajak yang tetap harus dibayar","pajak-yang-tetap-harus-dibayar",{"text":825,"depth":269,"id":826},"Penutup","penutup",1793295835096]