X-Git-Url: https://jxself.org/git/?a=blobdiff_plain;f=main.c;h=374df37c49c38d57dd8e9a7e4a61ce0e6f51cdba;hb=b373ba447d3954d150ca1148725623e3f271b597;hp=75f646e4c0efa415d226c9f660d98a77b1eabb2d;hpb=169c683e458507d4419c909c82cc64eb3ae7c946;p=open-adventure.git

diff --git a/main.c b/main.c
index 75f646e..374df37 100644
--- a/main.c
+++ b/main.c
@@ -8,7 +8,7 @@
  * Now that the code has been restructured into something much closer
  * to idiomatic C, the following is more appropriate:
  *
- * ESR apologizes for the remaing gotos (now confined to two functions
+ * ESR apologizes for the remaing gotos (now confined to one function
  * in this file - there used to be over 350 of them, *everywhere*),
  * and for the offensive globals.  Applying the Structured Program
  * Theorem can be hard.
@@ -308,11 +308,8 @@ bool spotted_by_pirate(int i)
 	    game.dloc[PIRATE]=game.chloc;
 	    game.odloc[PIRATE]=game.chloc;
 	    game.dseen[PIRATE]=false;
-	    /* C doesn't have what the Structured rogramming
-	     * Theorem says we need here - multi-level loop
-	     * breakout. We simulate with a goto. Irreducible, alas.
-	     */
-	    return true; //goto jumpout;
+
+	    return true;
 	}
 	if (HERE(j))
 	    k=1;