016

exercises/016_for2.zig

@@ -15,26 +15,26 @@
 //
 const std = @import("std");
 
-pub fn main() void {
-    // Let's store the bits of binary number 1101 in
-    // 'little-endian' order (least significant byte or bit first):
-    const bits = [_]u8{ 1, 0, 1, 1 };
-    var value: u32 = 0;
-
-    // Now we'll convert the binary bits to a number value by adding
-    // the value of the place as a power of two for each bit.
-    //
-    // See if you can figure out the missing pieces:
-    for (bits, ???) |bit, ???| {
-        // Note that we convert the usize i to a u32 with
-        // @intCast(), a builtin function just like @import().
-        // We'll learn about these properly in a later exercise.
-        const i_u32: u32 = @intCast(i);
-        const place_value = std.math.pow(u32, 2, i_u32);
-        value += place_value * bit;
-    }
-
-    std.debug.print("The value of bits '1101': {}.\n", .{value});
+pub fn main() void{
+  // Let's store the bits of binary number 1101 in
+  // 'little-endian' order (least significant byte or bit first):
+  const bits = [_]u8{ 1, 0, 1, 1 };
+  var value: u32 = 0;
+  
+  // Now we'll convert the binary bits to a number value by adding
+  // the value of the place as a power of two for each bit.
+  //
+  // See if you can figure out the missing pieces:
+  for(bits, 0..) |bit, i|{
+    // Note that we convert the usize i to a u32 with
+    // @intCast(), a builtin function just like @import().
+    // We'll learn about these properly in a later exercise.
+    const i_u32: u32 = @intCast(i);
+    const place_value = std.math.pow(u32, 2, i_u32);
+    value += place_value * bit;
+  }
+  
+  std.debug.print("The value of bits '1101': {}.\n", .{value});
 }
 //
 // As mentioned in the previous exercise, 'for' loops have gained
@@ -42,3 +42,4 @@ pub fn main() void {
 // written. As we'll see in later exercises, the above syntax for
 // capturing the index is part of a more general ability. Hang in
 // there!
+