Bitmap/Bresenham's line algorithm: Difference between revisions

Content added Content deleted

Inline

@@ Line 3,325: / Line 3,325: @@
 fn draw_line(line: std::vec::Vec<Point>, width: i32, height: i32) {
     for col in 0..height {
-        let mut col_as_string: String = "".to_string();
         for row in 0..width {
             let is_point_in_line = line.iter().any(| point| point.x == row && point.y == col);
             match is_point_in_line {
-                true => col_as_string = format!("{}{}", col_as_string, "❖"),
+                true => print!("❖"),
                 _ => {
                     if col == 0 || col == (height - 1) || row == 0 || row == (width - 1) {
-                        col_as_string = format!("{}{}", col_as_string, "☗");
+                        print!("☗");
                     } else {
-                        col_as_string = format!("{}{}", col_as_string, ".");
+                        print!(".");
                     }
                 }
             };
         }
-        println!("{}", col_as_string);
+        print!("\n");
     }
 }