Categories
Tags
algorithms APIT arm assembly asynchronous base64 Blogging box c clang-format cmake compiler concurrency const_fn contravariant cos covariant cpp Customization cybersecurity DataStructure db Demo deserialization discrete doc DP Dynamic Example FFI flat_map FP Functional functions futures Fuwari GATs gccrs generics gitignore GUI hacking hashmap haskell heap interop invariant iterator justfile kernel LaTeX LFU linux MachineLearning Markdown math ML OnceLock optimization OS parallels perf physics pin postgresql release RPIT rust science Science serialization shift sin SmallProjects std String surrealdb swisstable synchronous tan traits triangulation utf16 utf8 Video x86_64 xilem zig
412 words
2 minutes
260108_traits05_iterator_reduce_fold
link
Summary
- traits의 Iterator 기능 중 fold와 reduce를 알아보자 & Iterator 활용
trait.Iterator
array.map
fold & reduce 활용
https://doc.rust-lang.org/stable/std/iter/trait.Iterator.html#method.fold
https://doc.rust-lang.org/stable/std/iter/trait.Iterator.html#method.reduce
둘다 타입 변환 가능
fold는 리턴값이 직접 값이 나온다fold- Uses*xasu32to cast each&i32tou32before adding- 접기 -
*x를u32로 사용하여 각&i32를u32로 캐스팅한 후 추가합니다
reduce는Option<T>가 나옴reduce- First mapsi32tou32, then reduces (returnsOption)- 축소 - 먼저
i32를u32로 매핑한 다음 축소((옵션)Option반환)합니다
⏺ Fixed. The key difference between fold and reduce for type conversion:
| Method | Initial Value | Return Type | Use Case |
|---|---|---|---|
| fold | Required (specifies output type) | Direct value | When you want to control the accumulator type 누산기 유형을 제어하고 싶을 때 |
| reduce | Not needed | Option<T> | When the iterator may be empty, type inferred from elements 반복자가 비어 있을 수 있는 경우 요소에서 추론된 유형을 입력합니다 |
Summary of changes:
Line 82: fold - Uses *x as u32 to cast each &i32 to u32 before adding
Line 86: reduce - First maps i32 to u32, then reduces (returns Option
)
let my_arr: [i32, 4] = [10, 20, 30, 40];
// Fold : Reduce to single value (i32 -> u32 conversion)
let my_fold_arr: u32 = my_arr
.iter()
.fold(0u32, |acc, x| acc + *x as u32);
println!("arr fold (i32->u32) :{my_fold_arr}");
// Reduce : Alternative without initial value (returns Option)
let my_reduce_arr: Option<u32> = my_arr
.iter()
.map(|x| *x as u32)
.reduce(|acc, x| acc + x);
println!("arr reduce (i32->u32) :{my_reduce_arr:?}");- result
arr fold (i32->u32) :100
arr reduce (i32->u32) :Some(100)Iterator추가
trait MySumExt: Sized {
fn my_sum(self) -> i32;
fn my_product(self) -> i32;
}
// impl<T: Iterator<Item = i32>> MySumExt for T
impl<T> MySumExt for T
where
T: Iterator<Item = i32>,
{
fn my_sum(self) -> i32 {
let mut total = 0;
for num in self {
total += num;
}
total
}
fn my_product(self) -> i32 {
let mut my_total = 1;
for num in self {
my_total *= num;
}
my_total
}
}
fn main() {
let my_arr = [10, 20, 30, 40];
// my_sum() custom method
let sum_arr: i32 = my_arr.iter().copied().my_sum();
// my_fn "my_product"
let my_product_arr = my_arr.iter().copied().my_product();
println!("arr product :{my_product_arr:?}");260108_traits05_iterator_reduce_fold
https://younghakim7.github.io/blog/posts/260108_traits05_iterator_reduce_fold/