aboutsummaryrefslogtreecommitdiff
path: root/16_for2.zig
diff options
context:
space:
mode:
authorDave Gauer <dave@ratfactor.com>2021-01-18 19:21:18 -0500
committerDave Gauer <dave@ratfactor.com>2021-01-18 19:21:18 -0500
commit2bda44bc586ee16dd3fe0bce1ead9372a83a71f3 (patch)
tree3d0291cd8e3087556094f159243c5ce0fca0cb77 /16_for2.zig
parent483fb97dfccca833457f55798149b68942be6deb (diff)
downloadziglings-2bda44bc586ee16dd3fe0bce1ead9372a83a71f3.tar.gz
ziglings-2bda44bc586ee16dd3fe0bce1ead9372a83a71f3.tar.bz2
ziglings-2bda44bc586ee16dd3fe0bce1ead9372a83a71f3.tar.xz
ziglings-2bda44bc586ee16dd3fe0bce1ead9372a83a71f3.zip
Added ex 15,16 for loops
Diffstat (limited to '16_for2.zig')
-rw-r--r--16_for2.zig27
1 files changed, 27 insertions, 0 deletions
diff --git a/16_for2.zig b/16_for2.zig
new file mode 100644
index 0000000..914d047
--- /dev/null
+++ b/16_for2.zig
@@ -0,0 +1,27 @@
+//
+// For loops also let you store the "index" of the iteration - a
+// number starting with 0 that counts up with each iteration:
+//
+// for (items) |item, index| {
+// // Do something with item and index
+// }
+//
+const std = @import("std");
+
+pub fn main() void {
+ // Let's store the bits of binary number 1101 in
+ // 'little-endian' order (least significant byte 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 piece:
+ //
+ for (bits) |bit, i| {
+ var place_value = std.math.pow(u32, 2, @intCast(u32, i));
+ value += place_value * bit;
+ }
+
+ std.debug.print("The value of bits '1101': {}.\n", .{value});
+}