This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#[allow(dead_code)] | |
fn main() { | |
let file = std::fs::File::open("./file_chunker.rs").unwrap(); | |
let chunker = FileChunker::new(&file).unwrap(); | |
chunker | |
.chunks(1024, Some('\n')) | |
.unwrap() | |
.iter() | |
.for_each(|chunk| { |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
fn main() { | |
let mut numbers = vec![1, 2, 3, 4, 5, 6, 7, 8, 9, 10]; | |
println!(" 0 1 (2 3 4 5]"); | |
println!("Original vector: {:?}", numbers); | |
#[allow(unused_variables)] | |
for num in numbers.clone() { | |
//print!("{} ", num); | |
} | |
//println!(); | |
// We want to drain elements from |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
fn calculate_pi_vieta(iterations: u32) -> f64 { | |
if iterations == 0 { | |
return 0.0; // Or handle as an error/special case | |
} | |
let mut current_sqrt_term = 0.0f64; // Represents the nested sqrt part (e.g., sqrt(2), sqrt(2+sqrt(2))) | |
let mut pi_approximation = 2.0f64; // Initialize with the leading '2' in the formula | |
for i in 0..iterations { | |
if i == 0 { |
OlderNewer