mirror of
https://github.com/ratfactor/ziglings
synced 2024-05-05 01:56:03 +02:00
6ad9774189
When I hit 999 exercises, I will finally have reached the ultimate state of soteriological release and no more exercises will be needed. The cycle will be complete. All that will be left is perfect quietude, freedom, and highest happiness.
48 lines
1.2 KiB
Zig
48 lines
1.2 KiB
Zig
//
|
|
// "Elephants walking
|
|
// Along the trails
|
|
//
|
|
// Are holding hands
|
|
// By holding tails."
|
|
//
|
|
// from Holding Hands
|
|
// by Lenore M. Link
|
|
//
|
|
const std = @import("std");
|
|
|
|
const Elephant = struct {
|
|
letter: u8,
|
|
tail: *Elephant = undefined,
|
|
visited: bool = false,
|
|
};
|
|
|
|
pub fn main() void {
|
|
var elephantA = Elephant{ .letter = 'A' };
|
|
// (Please add Elephant B here!)
|
|
var elephantC = Elephant{ .letter = 'C' };
|
|
|
|
// Link the elephants so that each tail "points" to the next elephant.
|
|
// They make a circle: A->B->C->A...
|
|
elephantA.tail = &elephantB;
|
|
// (Please link Elephant B's tail to Elephant C here!)
|
|
elephantC.tail = &elephantA;
|
|
|
|
visitElephants(&elephantA);
|
|
|
|
std.debug.print("\n", .{});
|
|
}
|
|
|
|
// This function visits all elephants once, starting with the
|
|
// first elephant and following the tails to the next elephant.
|
|
// If we did not "mark" the elephants as visited (by setting
|
|
// visited=true), then this would loop infinitely!
|
|
fn visitElephants(first_elephant: *Elephant) void {
|
|
var e = first_elephant;
|
|
|
|
while (!e.visited) {
|
|
std.debug.print("Elephant {u}. ", .{e.letter});
|
|
e.visited = true;
|
|
e = e.tail;
|
|
}
|
|
}
|