Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.lang.c > #392008 > unrolled thread
| Started by | Thiago Adams <thiago.adams@gmail.com> |
|---|---|
| First post | 2025-04-04 16:23 -0300 |
| Last post | 2025-10-16 00:43 +0100 |
| Articles | 20 on this page of 698 — 31 participants |
Back to article view | Back to comp.lang.c
do { quit; } else { } Thiago Adams <thiago.adams@gmail.com> - 2025-04-04 16:23 -0300
Re: do { quit; } else { } bart <bc@freeuk.com> - 2025-04-04 21:18 +0100
Re: do { quit; } else { } Thiago Adams <thiago.adams@gmail.com> - 2025-04-04 17:31 -0300
Re: do { quit; } else { } Kaz Kylheku <643-408-1753@kylheku.com> - 2025-04-04 20:34 +0000
Re: do { quit; } else { } Thiago Adams <thiago.adams@gmail.com> - 2025-04-04 17:37 -0300
Re: do { quit; } else { } Kaz Kylheku <643-408-1753@kylheku.com> - 2025-04-04 21:01 +0000
Re: do { quit; } else { } "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2025-04-04 14:36 -0700
Re: do { quit; } else { } Kaz Kylheku <643-408-1753@kylheku.com> - 2025-04-04 20:39 +0000
Re: do { quit; } else { } Thiago Adams <thiago.adams@gmail.com> - 2025-04-04 17:43 -0300
Re: do { quit; } else { } Thiago Adams <thiago.adams@gmail.com> - 2025-04-04 17:46 -0300
Re: do { quit; } else { } candycanearter07 <candycanearter07@candycanearter07.nomail.afraid> - 2025-04-08 19:00 +0000
Re: do { quit; } else { } scott@slp53.sl.home (Scott Lurndal) - 2025-04-05 14:54 +0000
Re: do { quit; } else { } Janis Papanagnou <janis_papanagnou+ng@hotmail.com> - 2025-04-05 17:54 +0200
Re: do { quit; } else { } scott@slp53.sl.home (Scott Lurndal) - 2025-04-05 16:10 +0000
Re: do { quit; } else { } Janis Papanagnou <janis_papanagnou+ng@hotmail.com> - 2025-04-05 23:37 +0200
Re: do { quit; } else { } scott@slp53.sl.home (Scott Lurndal) - 2025-04-06 14:41 +0000
Re: do { quit; } else { } Michael S <already5chosen@yahoo.com> - 2025-04-06 10:52 +0300
Re: do { quit; } else { } scott@slp53.sl.home (Scott Lurndal) - 2025-04-06 14:45 +0000
Re: do { quit; } else { } Tim Rentsch <tr.17687@z991.linuxsc.com> - 2025-04-04 13:48 -0700
Re: do { quit; } else { } Thiago Adams <thiago.adams@gmail.com> - 2025-04-04 17:58 -0300
Re: do { quit; } else { } Tim Rentsch <tr.17687@z991.linuxsc.com> - 2025-04-06 05:47 -0700
Re: do { quit; } else { } Michael S <already5chosen@yahoo.com> - 2025-04-06 16:13 +0300
Re: do { quit; } else { } Tim Rentsch <tr.17687@z991.linuxsc.com> - 2025-04-06 07:32 -0700
Re: do { quit; } else { } Michael S <already5chosen@yahoo.com> - 2025-04-06 19:03 +0300
Re: do { quit; } else { } Tim Rentsch <tr.17687@z991.linuxsc.com> - 2025-04-07 05:45 -0700
Re: do { quit; } else { } Michael S <already5chosen@yahoo.com> - 2025-04-07 21:02 +0300
Re: do { quit; } else { } bart <bc@freeuk.com> - 2025-04-07 19:31 +0100
Re: do { quit; } else { } David Brown <david.brown@hesbynett.no> - 2025-04-08 10:12 +0200
Re: do { quit; } else { } bart <bc@freeuk.com> - 2025-04-08 12:35 +0100
Re: do { quit; } else { } David Brown <david.brown@hesbynett.no> - 2025-04-08 16:50 +0200
Re: do { quit; } else { } bart <bc@freeuk.com> - 2025-04-08 17:28 +0100
Re: do { quit; } else { } Tim Rentsch <tr.17687@z991.linuxsc.com> - 2025-04-08 10:32 -0700
Re: do { quit; } else { } bart <bc@freeuk.com> - 2025-04-08 19:04 +0100
Re: do { quit; } else { } Tim Rentsch <tr.17687@z991.linuxsc.com> - 2025-04-08 14:18 -0700
Re: do { quit; } else { } bart <bc@freeuk.com> - 2025-04-08 23:38 +0100
Re: do { quit; } else { } Tim Rentsch <tr.17687@z991.linuxsc.com> - 2025-04-08 16:27 -0700
Re: do { quit; } else { } bart <bc@freeuk.com> - 2025-04-09 01:02 +0100
Re: do { quit; } else { } "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2025-04-08 22:55 -0700
Re: do { quit; } else { } "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2025-04-08 22:56 -0700
Re: do { quit; } else { } Tim Rentsch <tr.17687@z991.linuxsc.com> - 2025-04-09 15:07 -0700
Re: do { quit; } else { } bart <bc@freeuk.com> - 2025-04-10 00:49 +0100
Re: do { quit; } else { } Kaz Kylheku <643-408-1753@kylheku.com> - 2025-04-10 00:20 +0000
Re: do { quit; } else { } Michael S <already5chosen@yahoo.com> - 2025-04-10 12:08 +0300
Re: do { quit; } else { } Kaz Kylheku <643-408-1753@kylheku.com> - 2025-04-10 16:23 +0000
Re: do { quit; } else { } bart <bc@freeuk.com> - 2025-04-10 12:00 +0100
Re: do { quit; } else { } Keith Thompson <Keith.S.Thompson+u@gmail.com> - 2025-04-10 04:28 -0700
Re: do { quit; } else { } bart <bc@freeuk.com> - 2025-04-10 14:34 +0100
Endless complaints [was Re: do { quit; } else { }] scott@slp53.sl.home (Scott Lurndal) - 2025-04-10 14:33 +0000
Re: Endless complaints [was Re: do { quit; } else { }] bart <bc@freeuk.com> - 2025-04-10 16:12 +0100
Re: Endless complaints [was Re: do { quit; } else { }] Janis Papanagnou <janis_papanagnou+ng@hotmail.com> - 2025-04-11 00:18 +0200
Re: Endless complaints [was Re: do { quit; } else { }] bart <bc@freeuk.com> - 2025-04-11 00:10 +0100
Re: Endless complaints [was Re: do { quit; } else { }] Keith Thompson <Keith.S.Thompson+u@gmail.com> - 2025-04-10 17:41 -0700
Re: Endless complaints [was Re: do { quit; } else { }] Kaz Kylheku <643-408-1753@kylheku.com> - 2025-04-11 02:45 +0000
Re: Endless complaints [was Re: do { quit; } else { }] David Brown <david.brown@hesbynett.no> - 2025-04-11 10:14 +0200
Re: Endless complaints [was Re: do { quit; } else { }] bart <bc@freeuk.com> - 2025-04-11 12:32 +0100
Re: Endless complaints [was Re: do { quit; } else { }] Michael S <already5chosen@yahoo.com> - 2025-04-11 14:50 +0300
Re: Endless complaints [was Re: do { quit; } else { }] bart <bc@freeuk.com> - 2025-04-11 12:56 +0100
Re: Endless complaints [was Re: do { quit; } else { }] Michael S <already5chosen@yahoo.com> - 2025-04-11 15:12 +0300
Re: Endless complaints [was Re: do { quit; } else { }] Janis Papanagnou <janis_papanagnou+ng@hotmail.com> - 2025-04-11 15:12 +0200
Re: Endless complaints [was Re: do { quit; } else { }] bart <bc@freeuk.com> - 2025-04-11 15:55 +0100
Re: Endless complaints [was Re: do { quit; } else { }] David Brown <david.brown@hesbynett.no> - 2025-04-11 15:02 +0200
Re: Endless complaints Tim Rentsch <tr.17687@z991.linuxsc.com> - 2025-04-11 10:03 -0700
Re: Endless complaints [was Re: do { quit; } else { }] Keith Thompson <Keith.S.Thompson+u@gmail.com> - 2025-04-11 12:26 -0700
Re: Endless complaints [was Re: do { quit; } else { }] Keith Thompson <Keith.S.Thompson+u@gmail.com> - 2025-04-10 15:27 -0700
Re: do { quit; } else { } Keith Thompson <Keith.S.Thompson+u@gmail.com> - 2025-04-10 15:23 -0700
Re: do { quit; } else { } bart <bc@freeuk.com> - 2025-04-11 00:49 +0100
Re: do { quit; } else { } Keith Thompson <Keith.S.Thompson+u@gmail.com> - 2025-04-10 17:59 -0700
Re: do { quit; } else { } Michael S <already5chosen@yahoo.com> - 2025-04-11 14:26 +0300
Re: do { quit; } else { } David Brown <david.brown@hesbynett.no> - 2025-04-11 16:11 +0200
Re: do { quit; } else { } Kaz Kylheku <643-408-1753@kylheku.com> - 2025-04-11 17:22 +0000
Re: do { quit; } else { } bart <bc@freeuk.com> - 2025-04-11 20:46 +0100
Re: do { quit; } else { } Keith Thompson <Keith.S.Thompson+u@gmail.com> - 2025-04-11 14:10 -0700
Re: do { quit; } else { } Michael S <already5chosen@yahoo.com> - 2025-04-13 20:45 +0300
Re: do { quit; } else { } Tim Rentsch <tr.17687@z991.linuxsc.com> - 2025-05-11 19:05 -0700
Re: do { quit; } else { } David Brown <david.brown@hesbynett.no> - 2025-05-12 16:37 +0200
Re: do { quit; } else { } Keith Thompson <Keith.S.Thompson+u@gmail.com> - 2025-05-12 13:25 -0700
Re: do { quit; } else { } David Brown <david.brown@hesbynett.no> - 2025-05-13 11:40 +0200
Re: do { quit; } else { } James Kuyper <jameskuyper@alumni.caltech.edu> - 2025-05-13 20:17 -0400
Re: do { quit; } else { } Keith Thompson <Keith.S.Thompson+u@gmail.com> - 2025-05-13 17:51 -0700
Re: do { quit; } else { } James Kuyper <jameskuyper@alumni.caltech.edu> - 2025-05-13 22:23 -0400
Re: do { quit; } else { } David Brown <david.brown@hesbynett.no> - 2025-05-14 11:07 +0200
Re: do { quit; } else { } Kaz Kylheku <643-408-1753@kylheku.com> - 2025-05-14 15:03 +0000
Re: do { quit; } else { } James Kuyper <jameskuyper@alumni.caltech.edu> - 2025-05-14 23:17 -0400
Re: do { quit; } else { } David Brown <david.brown@hesbynett.no> - 2025-05-14 11:22 +0200
Re: do { quit; } else { } Tim Rentsch <tr.17687@z991.linuxsc.com> - 2025-05-13 18:15 -0700
Re: do { quit; } else { } Keith Thompson <Keith.S.Thompson+u@gmail.com> - 2025-04-11 11:20 -0700
Re: do { quit; } else { } Tim Rentsch <tr.17687@z991.linuxsc.com> - 2025-05-05 16:12 -0700
Re: do { quit; } else { } Keith Thompson <Keith.S.Thompson+u@gmail.com> - 2025-05-05 16:36 -0700
Re: do { quit; } else { } Tim Rentsch <tr.17687@z991.linuxsc.com> - 2025-05-05 17:01 -0700
Re: do { quit; } else { } Kaz Kylheku <643-408-1753@kylheku.com> - 2025-04-10 16:51 +0000
Re: do { quit; } else { } scott@slp53.sl.home (Scott Lurndal) - 2025-04-10 18:31 +0000
Re: do { quit; } else { } Kaz Kylheku <643-408-1753@kylheku.com> - 2025-04-10 19:14 +0000
Re: do { quit; } else { } bart <bc@freeuk.com> - 2025-04-10 19:36 +0100
Re: do { quit; } else { } Kaz Kylheku <643-408-1753@kylheku.com> - 2025-04-10 19:29 +0000
Re: do { quit; } else { } bart <bc@freeuk.com> - 2025-04-11 00:02 +0100
Re: do { quit; } else { } Tim Rentsch <tr.17687@z991.linuxsc.com> - 2025-04-10 18:52 -0700
Re: do { quit; } else { } Keith Thompson <Keith.S.Thompson+u@gmail.com> - 2025-04-10 20:51 -0700
Re: do { quit; } else { } Tim Rentsch <tr.17687@z991.linuxsc.com> - 2025-04-10 22:55 -0700
Re: do { quit; } else { } Keith Thompson <Keith.S.Thompson+u@gmail.com> - 2025-04-10 23:00 -0700
Re: do { quit; } else { } bart <bc@freeuk.com> - 2025-04-11 12:14 +0100
Re: do { quit; } else { } Tim Rentsch <tr.17687@z991.linuxsc.com> - 2025-05-04 22:01 -0700
Re: do { quit; } else { } Keith Thompson <Keith.S.Thompson+u@gmail.com> - 2025-04-10 21:20 -0700
Re: do { quit; } else { } Keith Thompson <Keith.S.Thompson+u@gmail.com> - 2025-04-10 21:22 -0700
Re: do { quit; } else { } Keith Thompson <Keith.S.Thompson+u@gmail.com> - 2025-04-10 21:24 -0700
Re: do { quit; } else { } bart <bc@freeuk.com> - 2025-04-10 20:11 +0100
Re: do { quit; } else { } Tim Rentsch <tr.17687@z991.linuxsc.com> - 2025-04-11 10:07 -0700
Re: do { quit; } else { } Bonita Montero <Bonita.Montero@gmail.com> - 2025-05-09 16:25 +0200
Re: do { quit; } else { } Richard Heathfield <rjh@cpax.org.uk> - 2025-05-09 15:38 +0100
Re: do { quit; } else { } Bonita Montero <Bonita.Montero@gmail.com> - 2025-05-09 16:42 +0200
Re: do { quit; } else { } David Brown <david.brown@hesbynett.no> - 2025-05-09 17:43 +0200
Re: do { quit; } else { } Tim Rentsch <tr.17687@z991.linuxsc.com> - 2025-05-13 19:34 -0700
Re: do { quit; } else { } Richard Damon <richard@damon-family.org> - 2025-04-09 07:15 -0400
Re: do { quit; } else { } David Brown <david.brown@hesbynett.no> - 2025-04-09 13:51 +0200
Re: do { quit; } else { } David Brown <david.brown@hesbynett.no> - 2025-04-09 11:42 +0200
Re: do { quit; } else { } Michael S <already5chosen@yahoo.com> - 2025-04-09 13:04 +0300
Re: do { quit; } else { } David Brown <david.brown@hesbynett.no> - 2025-04-09 14:06 +0200
Re: do { quit; } else { } James Kuyper <jameskuyper@alumni.caltech.edu> - 2025-04-11 12:27 -0400
Re: do { quit; } else { } Michael S <already5chosen@yahoo.com> - 2025-04-09 13:11 +0300
Re: do { quit; } else { } David Brown <david.brown@hesbynett.no> - 2025-04-09 14:11 +0200
Re: do { quit; } else { } Michael S <already5chosen@yahoo.com> - 2025-04-09 13:16 +0300
Re: do { quit; } else { } David Brown <david.brown@hesbynett.no> - 2025-04-09 14:24 +0200
Re: do { quit; } else { } bart <bc@freeuk.com> - 2025-04-09 11:51 +0100
Re: do { quit; } else { } David Brown <david.brown@hesbynett.no> - 2025-04-09 14:36 +0200
Re: do { quit; } else { } bart <bc@freeuk.com> - 2025-04-09 14:13 +0100
Re: do { quit; } else { } David Brown <david.brown@hesbynett.no> - 2025-04-09 16:00 +0200
Re: do { quit; } else { } bart <bc@freeuk.com> - 2025-04-09 16:37 +0100
Re: do { quit; } else { } James Kuyper <jameskuyper@alumni.caltech.edu> - 2025-04-10 20:40 -0400
Re: do { quit; } else { } James Kuyper <jameskuyper@alumni.caltech.edu> - 2025-04-11 12:20 -0400
Re: do { quit; } else { } scott@slp53.sl.home (Scott Lurndal) - 2025-04-11 17:30 +0000
Re: do { quit; } else { } Janis Papanagnou <janis_papanagnou+ng@hotmail.com> - 2025-04-09 12:58 +0200
Re: do { quit; } else { } Michael S <already5chosen@yahoo.com> - 2025-04-09 14:23 +0300
Re: do { quit; } else { } Tim Rentsch <tr.17687@z991.linuxsc.com> - 2025-04-09 12:50 -0700
Re: do { quit; } else { } Keith Thompson <Keith.S.Thompson+u@gmail.com> - 2025-04-09 14:44 -0700
Re: do { quit; } else { } Michael S <already5chosen@yahoo.com> - 2025-04-10 11:55 +0300
Re: do { quit; } else { } David Brown <david.brown@hesbynett.no> - 2025-04-10 14:46 +0200
Re: do { quit; } else { } Kaz Kylheku <643-408-1753@kylheku.com> - 2025-04-10 15:41 +0000
Re: do { quit; } else { } David Brown <david.brown@hesbynett.no> - 2025-04-10 21:05 +0200
Re: do { quit; } else { } bart <bc@freeuk.com> - 2025-04-10 20:27 +0100
Re: do { quit; } else { } Kaz Kylheku <643-408-1753@kylheku.com> - 2025-04-10 20:57 +0000
Re: do { quit; } else { } David Brown <david.brown@hesbynett.no> - 2025-04-11 11:17 +0200
Re: do { quit; } else { } bart <bc@freeuk.com> - 2025-04-11 12:51 +0100
Re: do { quit; } else { } David Brown <david.brown@hesbynett.no> - 2025-04-11 16:25 +0200
Re: do { quit; } else { } bart <bc@freeuk.com> - 2025-04-11 15:50 +0100
Re: do { quit; } else { } David Brown <david.brown@hesbynett.no> - 2025-04-11 17:24 +0200
Re: do { quit; } else { } bart <bc@freeuk.com> - 2025-04-11 17:56 +0100
Re: do { quit; } else { } David Brown <david.brown@hesbynett.no> - 2025-04-11 20:29 +0200
Re: do { quit; } else { } Keith Thompson <Keith.S.Thompson+u@gmail.com> - 2025-04-11 13:58 -0700
Re: do { quit; } else { } bart <bc@freeuk.com> - 2025-04-11 22:24 +0100
Re: do { quit; } else { } Keith Thompson <Keith.S.Thompson+u@gmail.com> - 2025-04-11 14:36 -0700
Re: do { quit; } else { } bart <bc@freeuk.com> - 2025-04-12 00:13 +0100
Re: do { quit; } else { } Keith Thompson <Keith.S.Thompson+u@gmail.com> - 2025-04-11 16:59 -0700
Re: do { quit; } else { } bart <bc@freeuk.com> - 2025-04-12 02:27 +0100
Re: do { quit; } else { } Keith Thompson <Keith.S.Thompson+u@gmail.com> - 2025-04-11 18:53 -0700
Re: do { quit; } else { } Kaz Kylheku <643-408-1753@kylheku.com> - 2025-04-12 02:43 +0000
Re: do { quit; } else { } bart <bc@freeuk.com> - 2025-04-12 12:50 +0100
Re: do { quit; } else { } Kaz Kylheku <643-408-1753@kylheku.com> - 2025-04-12 12:57 +0000
Re: do { quit; } else { } bart <bc@freeuk.com> - 2025-04-12 14:33 +0100
Re: do { quit; } else { } Janis Papanagnou <janis_papanagnou+ng@hotmail.com> - 2025-04-13 04:53 +0200
Re: do { quit; } else { } David Brown <david.brown@hesbynett.no> - 2025-04-12 15:43 +0200
Re: do { quit; } else { } bart <bc@freeuk.com> - 2025-04-12 17:52 +0100
Re: do { quit; } else { } Kaz Kylheku <643-408-1753@kylheku.com> - 2025-04-12 17:40 +0000
Re: do { quit; } else { } bart <bc@freeuk.com> - 2025-04-13 00:09 +0100
Re: do { quit; } else { } Michael S <already5chosen@yahoo.com> - 2025-04-13 21:40 +0300
Re: do { quit; } else { } Kaz Kylheku <643-408-1753@kylheku.com> - 2025-04-13 20:08 +0000
Re: do { quit; } else { } Michael S <already5chosen@yahoo.com> - 2025-04-14 00:30 +0300
Re: do { quit; } else { } James Kuyper <jameskuyper@alumni.caltech.edu> - 2025-04-13 21:07 -0400
Re: do { quit; } else { } Keith Thompson <Keith.S.Thompson+u@gmail.com> - 2025-04-13 18:33 -0700
Re: do { quit; } else { } James Kuyper <jameskuyper@alumni.caltech.edu> - 2025-04-13 22:57 -0400
Re: do { quit; } else { } Keith Thompson <Keith.S.Thompson+u@gmail.com> - 2025-04-13 20:26 -0700
Re: do { quit; } else { } Keith Thompson <Keith.S.Thompson+u@gmail.com> - 2025-04-13 14:58 -0700
Re: do { quit; } else { } Thiago Adams <thiago.adams@gmail.com> - 2025-04-13 21:58 -0300
Re: do { quit; } else { } Keith Thompson <Keith.S.Thompson+u@gmail.com> - 2025-04-13 18:22 -0700
Re: do { quit; } else { } Keith Thompson <Keith.S.Thompson+u@gmail.com> - 2025-04-13 14:52 -0700
Re: do { quit; } else { } James Kuyper <jameskuyper@alumni.caltech.edu> - 2025-04-13 20:50 -0400
Re: do { quit; } else { } bart <bc@freeuk.com> - 2025-04-12 19:17 +0100
Re: do { quit; } else { } James Kuyper <jameskuyper@alumni.caltech.edu> - 2025-04-12 09:59 -0400
Re: do { quit; } else { } bart <bc@freeuk.com> - 2025-04-12 15:15 +0100
Re: do { quit; } else { } Janis Papanagnou <janis_papanagnou+ng@hotmail.com> - 2025-04-12 06:33 +0200
Re: do { quit; } else { } bart <bc@freeuk.com> - 2025-04-12 12:00 +0100
Re: do { quit; } else { } Janis Papanagnou <janis_papanagnou+ng@hotmail.com> - 2025-04-13 04:27 +0200
Re: do { quit; } else { } bart <bc@freeuk.com> - 2025-04-13 12:33 +0100
Re: do { quit; } else { } bart <bc@freeuk.com> - 2025-04-13 12:36 +0100
Re: do { quit; } else { } scott@slp53.sl.home (Scott Lurndal) - 2025-04-13 14:54 +0000
Re: do { quit; } else { } bart <bc@freeuk.com> - 2025-04-13 17:48 +0100
Re: do { quit; } else { } Janis Papanagnou <janis_papanagnou+ng@hotmail.com> - 2025-04-14 05:59 +0200
Re: do { quit; } else { } scott@slp53.sl.home (Scott Lurndal) - 2025-04-14 14:11 +0000
Re: do { quit; } else { } bart <bc@freeuk.com> - 2025-04-13 14:58 +0100
Re: do { quit; } else { } Kaz Kylheku <643-408-1753@kylheku.com> - 2025-04-13 14:34 +0000
Re: do { quit; } else { } bart <bc@freeuk.com> - 2025-04-13 17:39 +0100
Re: do { quit; } else { } Janis Papanagnou <janis_papanagnou+ng@hotmail.com> - 2025-04-14 06:23 +0200
Re: do { quit; } else { } bart <bc@freeuk.com> - 2025-04-14 11:16 +0100
Re: do { quit; } else { } tTh <tth@none.invalid> - 2025-04-14 12:51 +0200
Re: do { quit; } else { } bart <bc@freeuk.com> - 2025-04-14 12:12 +0100
Loops (was Re: do { quit; } else { }) Janis Papanagnou <janis_papanagnou+ng@hotmail.com> - 2025-04-14 14:18 +0200
Re: Loops (was Re: do { quit; } else { }) Michael S <already5chosen@yahoo.com> - 2025-04-14 15:33 +0300
Re: Loops (was Re: do { quit; } else { }) bart <bc@freeuk.com> - 2025-04-14 16:22 +0100
Re: Loops (was Re: do { quit; } else { }) Janis Papanagnou <janis_papanagnou+ng@hotmail.com> - 2025-04-15 09:17 +0200
Re: Loops (was Re: do { quit; } else { }) bart <bc@freeuk.com> - 2025-04-15 11:30 +0100
Re: Loops (was Re: do { quit; } else { }) Michael S <already5chosen@yahoo.com> - 2025-04-15 15:34 +0300
Re: Loops (was Re: do { quit; } else { }) Richard Heathfield <rjh@cpax.org.uk> - 2025-04-15 13:51 +0100
Re: Loops (was Re: do { quit; } else { }) Tim Rentsch <tr.17687@z991.linuxsc.com> - 2025-05-04 07:40 -0700
Re: Loops (was Re: do { quit; } else { }) Tim Rentsch <tr.17687@z991.linuxsc.com> - 2025-05-04 07:31 -0700
Re: Loops (was Re: do { quit; } else { }) Michael S <already5chosen@yahoo.com> - 2025-05-04 18:08 +0300
Re: Loops (was Re: do { quit; } else { }) Michael S <already5chosen@yahoo.com> - 2025-05-05 10:42 +0300
Re: Loops (was Re: do { quit; } else { }) Tim Rentsch <tr.17687@z991.linuxsc.com> - 2025-05-10 06:43 -0700
Re: Loops (was Re: do { quit; } else { }) Muttley@dastardlyhq.com - 2025-05-10 15:56 +0000
Re: Loops (was Re: do { quit; } else { }) scott@slp53.sl.home (Scott Lurndal) - 2025-05-10 17:48 +0000
Re: Loops (was Re: do { quit; } else { }) Muttley@dastardlyhq.com - 2025-05-11 08:20 +0000
Re: Loops (was Re: do { quit; } else { }) Tim Rentsch <tr.17687@z991.linuxsc.com> - 2025-05-10 14:29 -0700
Re: Loops (was Re: do { quit; } else { }) Muttley@dastardlyhq.com - 2025-05-11 08:21 +0000
Re: Loops (was Re: do { quit; } else { }) David Brown <david.brown@hesbynett.no> - 2025-05-11 12:02 +0200
Re: Loops (was Re: do { quit; } else { }) Muttley@dastardlyhq.com - 2025-05-11 15:30 +0000
Re: Loops (was Re: do { quit; } else { }) scott@slp53.sl.home (Scott Lurndal) - 2025-05-11 16:29 +0000
Re: Loops (was Re: do { quit; } else { }) David Brown <david.brown@hesbynett.no> - 2025-05-11 18:49 +0200
Re: Loops (was Re: do { quit; } else { }) Keith Thompson <Keith.S.Thompson+u@gmail.com> - 2025-05-11 14:41 -0700
Re: Loops (was Re: do { quit; } else { }) James Kuyper <jameskuyper@alumni.caltech.edu> - 2025-05-11 17:43 -0400
Re: Loops (was Re: do { quit; } else { }) Keith Thompson <Keith.S.Thompson+u@gmail.com> - 2025-05-11 15:06 -0700
Re: Loops (was Re: do { quit; } else { }) James Kuyper <jameskuyper@alumni.caltech.edu> - 2025-05-11 18:30 -0400
Re: Loops (was Re: do { quit; } else { }) Tim Rentsch <tr.17687@z991.linuxsc.com> - 2025-05-11 18:15 -0700
Re: Loops (was Re: do { quit; } else { }) Keith Thompson <Keith.S.Thompson+u@gmail.com> - 2025-05-11 19:09 -0700
Re: Loops (was Re: do { quit; } else { }) Tim Rentsch <tr.17687@z991.linuxsc.com> - 2025-05-12 00:16 -0700
Re: Loops (was Re: do { quit; } else { }) Keith Thompson <Keith.S.Thompson+u@gmail.com> - 2025-05-12 02:23 -0700
Re: Loops (was Re: do { quit; } else { }) Tim Rentsch <tr.17687@z991.linuxsc.com> - 2025-05-12 07:19 -0700
Re: Loops (was Re: do { quit; } else { }) Richard Heathfield <rjh@cpax.org.uk> - 2025-05-12 15:34 +0100
Re: Loops (was Re: do { quit; } else { }) Tim Rentsch <tr.17687@z991.linuxsc.com> - 2025-05-12 22:42 -0700
Re: Loops (was Re: do { quit; } else { }) Richard Heathfield <rjh@cpax.org.uk> - 2025-05-13 07:31 +0100
Re: Loops (was Re: do { quit; } else { }) Tim Rentsch <tr.17687@z991.linuxsc.com> - 2025-05-14 21:12 -0700
Re: Loops (was Re: do { quit; } else { }) Tim Rentsch <tr.17687@z991.linuxsc.com> - 2025-05-13 09:30 -0700
Re: Loops (was Re: do { quit; } else { }) Janis Papanagnou <janis_papanagnou+ng@hotmail.com> - 2025-05-13 22:28 +0200
Re: Loops (was Re: do { quit; } else { }) Keith Thompson <Keith.S.Thompson+u@gmail.com> - 2025-05-12 13:31 -0700
Re: Loops (was Re: do { quit; } else { }) Tim Rentsch <tr.17687@z991.linuxsc.com> - 2025-05-14 20:44 -0700
Re: Loops (was Re: do { quit; } else { }) Keith Thompson <Keith.S.Thompson+u@gmail.com> - 2025-05-14 21:45 -0700
Re: Loops (was Re: do { quit; } else { }) David Brown <david.brown@hesbynett.no> - 2025-05-12 17:24 +0200
Re: Loops (was Re: do { quit; } else { }) James Kuyper <jameskuyper@alumni.caltech.edu> - 2025-05-12 00:07 -0400
Re: Loops (was Re: do { quit; } else { }) Tim Rentsch <tr.17687@z991.linuxsc.com> - 2025-05-12 00:43 -0700
Re: Loops (was Re: do { quit; } else { }) Keith Thompson <Keith.S.Thompson+u@gmail.com> - 2025-05-12 02:27 -0700
Re: Loops (was Re: do { quit; } else { }) David Brown <david.brown@hesbynett.no> - 2025-05-12 17:18 +0200
Re: Loops (was Re: do { quit; } else { }) Tim Rentsch <tr.17687@z991.linuxsc.com> - 2026-01-28 09:54 -0800
Re: Loops (was Re: do { quit; } else { }) Keith Thompson <Keith.S.Thompson+u@gmail.com> - 2026-01-28 16:42 -0800
Re: Loops (was Re: do { quit; } else { }) Tristan Wibberley <tristan.wibberley+netnews2@alumni.manchester.ac.uk> - 2026-01-31 07:03 +0000
Re: Loops (was Re: do { quit; } else { }) Tristan Wibberley <tristan.wibberley+netnews2@alumni.manchester.ac.uk> - 2026-01-31 03:53 +0000
Re: Loops (was Re: do { quit; } else { }) Michael S <already5chosen@yahoo.com> - 2026-01-31 18:26 +0200
Re: Loops (was Re: do { quit; } else { }) scott@slp53.sl.home (Scott Lurndal) - 2026-01-31 18:33 +0000
Re: Loops (was Re: do { quit; } else { }) Michael S <already5chosen@yahoo.com> - 2026-01-31 21:02 +0200
Re: Loops (was Re: do { quit; } else { }) James Kuyper <jameskuyper@alumni.caltech.edu> - 2025-05-12 19:53 -0400
Re: Loops (was Re: do { quit; } else { }) Tim Rentsch <tr.17687@z991.linuxsc.com> - 2025-05-12 23:03 -0700
Re: Loops (was Re: do { quit; } else { }) Tim Rentsch <tr.17687@z991.linuxsc.com> - 2025-05-12 19:04 -0700
Re: Loops (was Re: do { quit; } else { }) David Brown <david.brown@hesbynett.no> - 2025-05-12 17:08 +0200
Re: Loops (was Re: do { quit; } else { }) Keith Thompson <Keith.S.Thompson+u@gmail.com> - 2025-05-12 13:38 -0700
Re: Loops (was Re: do { quit; } else { }) David Brown <david.brown@hesbynett.no> - 2025-05-13 12:41 +0200
Re: Loops (was Re: do { quit; } else { }) Janis Papanagnou <janis_papanagnou+ng@hotmail.com> - 2025-05-13 23:16 +0200
Re: Loops (was Re: do { quit; } else { }) Keith Thompson <Keith.S.Thompson+u@gmail.com> - 2025-05-13 14:35 -0700
Re: Loops (was Re: do { quit; } else { }) Tim Rentsch <tr.17687@z991.linuxsc.com> - 2025-05-13 15:10 -0700
Re: Loops (was Re: do { quit; } else { }) Keith Thompson <Keith.S.Thompson+u@gmail.com> - 2025-05-13 15:41 -0700
Re: Loops (was Re: do { quit; } else { }) Tim Rentsch <tr.17687@z991.linuxsc.com> - 2025-05-13 18:38 -0700
Re: Loops (was Re: do { quit; } else { }) Keith Thompson <Keith.S.Thompson+u@gmail.com> - 2025-05-13 19:37 -0700
Re: Loops (was Re: do { quit; } else { }) James Kuyper <jameskuyper@alumni.caltech.edu> - 2025-05-13 23:54 -0400
Re: Loops (was Re: do { quit; } else { }) Tim Rentsch <tr.17687@z991.linuxsc.com> - 2025-05-13 21:19 -0700
Re: Loops (was Re: do { quit; } else { }) Tim Rentsch <tr.17687@z991.linuxsc.com> - 2025-05-13 21:12 -0700
Re: Loops (was Re: do { quit; } else { }) Keith Thompson <Keith.S.Thompson+u@gmail.com> - 2025-05-13 22:38 -0700
Re: Loops (was Re: do { quit; } else { }) Tim Rentsch <tr.17687@z991.linuxsc.com> - 2026-03-01 21:55 -0800
Re: Loops (was Re: do { quit; } else { }) Keith Thompson <Keith.S.Thompson+u@gmail.com> - 2026-03-01 23:37 -0800
Re: Loops (was Re: do { quit; } else { }) Kaz Kylheku <643-408-1753@kylheku.com> - 2025-05-14 03:35 +0000
Re: Loops (was Re: do { quit; } else { }) Keith Thompson <Keith.S.Thompson+u@gmail.com> - 2025-05-13 21:54 -0700
Re: Loops (was Re: do { quit; } else { }) Kaz Kylheku <643-408-1753@kylheku.com> - 2025-05-14 06:31 +0000
Re: Loops (was Re: do { quit; } else { }) Tim Rentsch <tr.17687@z991.linuxsc.com> - 2025-06-10 06:01 -0700
Re: Loops (was Re: do { quit; } else { }) Bonita Montero <Bonita.Montero@gmail.com> - 2025-06-14 12:24 +0200
Re: Loops (was Re: do { quit; } else { }) scott@slp53.sl.home (Scott Lurndal) - 2025-06-14 13:57 +0000
Re: Loops (was Re: do { quit; } else { }) Michael S <already5chosen@yahoo.com> - 2025-06-14 22:27 +0300
Re: Loops (was Re: do { quit; } else { }) Bonita Montero <Bonita.Montero@gmail.com> - 2025-06-15 09:32 +0200
Re: Loops (was Re: do { quit; } else { }) David Brown <david.brown@hesbynett.no> - 2025-05-14 13:00 +0200
Re: Loops (was Re: do { quit; } else { }) Janis Papanagnou <janis_papanagnou+ng@hotmail.com> - 2025-05-14 13:20 +0200
Re: Loops (was Re: do { quit; } else { }) James Kuyper <jameskuyper@alumni.caltech.edu> - 2025-05-14 23:20 -0400
Re: Loops (was Re: do { quit; } else { }) David Brown <david.brown@hesbynett.no> - 2025-05-15 11:23 +0200
Re: Loops (was Re: do { quit; } else { }) Tim Rentsch <tr.17687@z991.linuxsc.com> - 2026-01-06 13:55 -0800
Re: Loops (was Re: do { quit; } else { }) Tim Rentsch <tr.17687@z991.linuxsc.com> - 2025-05-11 17:59 -0700
Re: Loops (was Re: do { quit; } else { }) Muttley@DastardlyHQ.org - 2025-05-12 10:11 +0000
Re: Loops (was Re: do { quit; } else { }) Michael S <already5chosen@yahoo.com> - 2025-05-12 17:09 +0300
Re: Loops (was Re: do { quit; } else { }) Michael S <already5chosen@yahoo.com> - 2025-05-11 01:09 +0300
Re: Loops (was Re: do { quit; } else { }) Tim Rentsch <tr.17687@z991.linuxsc.com> - 2025-05-11 17:30 -0700
Re: Loops (was Re: do { quit; } else { }) Michael S <already5chosen@yahoo.com> - 2025-05-12 16:18 +0300
Re: Loops (was Re: do { quit; } else { }) Tim Rentsch <tr.17687@z991.linuxsc.com> - 2025-05-14 11:09 -0700
Re: Loops (was Re: do { quit; } else { }) Janis Papanagnou <janis_papanagnou+ng@hotmail.com> - 2025-05-13 15:57 +0200
Re: Loops (was Re: do { quit; } else { }) Keith Thompson <Keith.S.Thompson+u@gmail.com> - 2025-05-04 13:52 -0700
Re: Loops (was Re: do { quit; } else { }) Kaz Kylheku <643-408-1753@kylheku.com> - 2025-04-15 13:19 +0000
Re: Loops (was Re: do { quit; } else { }) bart <bc@freeuk.com> - 2025-04-15 18:17 +0100
Re: Loops (was Re: do { quit; } else { }) scott@slp53.sl.home (Scott Lurndal) - 2025-04-15 19:07 +0000
Re: Loops (was Re: do { quit; } else { }) bart <bc@freeuk.com> - 2025-04-15 21:46 +0100
Re: Loops (was Re: do { quit; } else { }) Kaz Kylheku <643-408-1753@kylheku.com> - 2025-04-16 01:41 +0000
Re: Loops (was Re: do { quit; } else { }) James Kuyper <jameskuyper@alumni.caltech.edu> - 2025-04-15 22:37 -0400
Re: Loops (was Re: do { quit; } else { }) Kaz Kylheku <643-408-1753@kylheku.com> - 2025-04-16 03:30 +0000
Re: Loops (was Re: do { quit; } else { }) Keith Thompson <Keith.S.Thompson+u@gmail.com> - 2025-04-15 20:50 -0700
Re: Loops (was Re: do { quit; } else { }) Kaz Kylheku <643-408-1753@kylheku.com> - 2025-04-16 18:11 +0000
Re: Loops (was Re: do { quit; } else { }) Kaz Kylheku <643-408-1753@kylheku.com> - 2025-04-16 18:43 +0000
Re: Loops (was Re: do { quit; } else { }) Richard Heathfield <rjh@cpax.org.uk> - 2025-04-16 20:05 +0100
Re: Loops (was Re: do { quit; } else { }) Tim Rentsch <tr.17687@z991.linuxsc.com> - 2026-02-03 03:47 -0800
Re: Loops (was Re: do { quit; } else { }) Keith Thompson <Keith.S.Thompson+u@gmail.com> - 2026-02-03 04:21 -0800
Re: Loops (was Re: do { quit; } else { }) Tristan Wibberley <tristan.wibberley+netnews2@alumni.manchester.ac.uk> - 2026-02-04 23:40 +0000
Re: Loops (was Re: do { quit; } else { }) Janis Papanagnou <janis_papanagnou+ng@hotmail.com> - 2026-02-05 08:10 +0100
Re: Loops (was Re: do { quit; } else { }) Michael S <already5chosen@yahoo.com> - 2026-02-05 11:30 +0200
Re: Loops (was Re: do { quit; } else { }) Lew Pitcher <lew.pitcher@digitalfreehold.ca> - 2026-02-05 15:21 +0000
Re: Loops (was Re: do { quit; } else { }) scott@slp53.sl.home (Scott Lurndal) - 2025-04-16 14:12 +0000
Re: Loops (was Re: do { quit; } else { }) Janis Papanagnou <janis_papanagnou+ng@hotmail.com> - 2025-04-16 07:35 +0200
Re: Loops (was Re: do { quit; } else { }) bart <bc@freeuk.com> - 2025-04-16 12:32 +0100
Re: Loops (was Re: do { quit; } else { }) Michael S <already5chosen@yahoo.com> - 2025-04-16 15:08 +0300
Re: Loops (was Re: do { quit; } else { }) scott@slp53.sl.home (Scott Lurndal) - 2025-04-16 14:23 +0000
Re: Loops (was Re: do { quit; } else { }) Tim Rentsch <tr.17687@z991.linuxsc.com> - 2025-05-04 21:32 -0700
Re: Loops (was Re: do { quit; } else { }) bart <bc@freeuk.com> - 2025-04-16 15:31 +0100
Re: Loops (was Re: do { quit; } else { }) Janis Papanagnou <janis_papanagnou+ng@hotmail.com> - 2025-04-18 15:01 +0200
Re: Loops (was Re: do { quit; } else { }) bart <bc@freeuk.com> - 2025-04-18 15:34 +0100
Re: Loops (was Re: do { quit; } else { }) Alexis <flexibeast@gmail.com> - 2025-04-19 11:01 +1000
Re: Loops (was Re: do { quit; } else { }) Janis Papanagnou <janis_papanagnou+ng@hotmail.com> - 2025-04-19 09:20 +0200
Re: Loops (was Re: do { quit; } else { }) scott@slp53.sl.home (Scott Lurndal) - 2025-04-16 14:21 +0000
Re: Loops (was Re: do { quit; } else { }) Janis Papanagnou <janis_papanagnou+ng@hotmail.com> - 2025-04-18 15:06 +0200
Re: Loops (was Re: do { quit; } else { }) James Kuyper <jameskuyper@alumni.caltech.edu> - 2025-04-16 10:47 -0400
Re: Loops (was Re: do { quit; } else { }) bart <bc@freeuk.com> - 2025-04-16 16:14 +0100
Re: Loops (was Re: do { quit; } else { }) Michael S <already5chosen@yahoo.com> - 2025-04-16 18:18 +0300
Re: Loops (was Re: do { quit; } else { }) James Kuyper <jameskuyper@alumni.caltech.edu> - 2025-04-16 12:28 -0400
Re: Loops (was Re: do { quit; } else { }) Keith Thompson <Keith.S.Thompson+u@gmail.com> - 2025-04-16 13:03 -0700
Re: Loops (was Re: do { quit; } else { }) bart <bc@freeuk.com> - 2025-04-16 23:14 +0100
Re: Loops (was Re: do { quit; } else { }) Keith Thompson <Keith.S.Thompson+u@gmail.com> - 2025-04-16 17:26 -0700
Re: Loops (was Re: do { quit; } else { }) bart <bc@freeuk.com> - 2025-04-17 02:26 +0100
Re: Loops (was Re: do { quit; } else { }) Keith Thompson <Keith.S.Thompson+u@gmail.com> - 2025-04-16 20:14 -0700
Re: Loops (was Re: do { quit; } else { }) Janis Papanagnou <janis_papanagnou+ng@hotmail.com> - 2025-04-18 15:37 +0200
Re: Loops (was Re: do { quit; } else { }) bart <bc@freeuk.com> - 2025-04-18 15:19 +0100
Re: Loops (was Re: do { quit; } else { }) scott@slp53.sl.home (Scott Lurndal) - 2025-04-18 16:58 +0000
Re: Loops (was Re: do { quit; } else { }) bart <bc@freeuk.com> - 2025-04-18 18:27 +0100
Re: Loops (was Re: do { quit; } else { }) Janis Papanagnou <janis_papanagnou+ng@hotmail.com> - 2025-04-19 09:09 +0200
Re: Loops (was Re: do { quit; } else { }) scott@slp53.sl.home (Scott Lurndal) - 2025-04-17 00:59 +0000
Re: Loops (was Re: do { quit; } else { }) bart <bc@freeuk.com> - 2025-04-17 02:09 +0100
Re: Loops (was Re: do { quit; } else { }) Kaz Kylheku <643-408-1753@kylheku.com> - 2025-04-16 21:43 +0000
Re: Loops (was Re: do { quit; } else { }) bart <bc@freeuk.com> - 2025-04-16 23:42 +0100
Re: Loops (was Re: do { quit; } else { }) Kaz Kylheku <643-408-1753@kylheku.com> - 2025-04-16 23:49 +0000
Re: Loops (was Re: do { quit; } else { }) bart <bc@freeuk.com> - 2025-04-17 01:48 +0100
Re: Loops (was Re: do { quit; } else { }) Keith Thompson <Keith.S.Thompson+u@gmail.com> - 2025-04-16 19:18 -0700
Re: Loops (was Re: do { quit; } else { }) bart <bc@freeuk.com> - 2025-04-17 12:16 +0100
Re: Loops (was Re: do { quit; } else { }) bart <bc@freeuk.com> - 2025-04-17 14:36 +0100
Re: Loops (was Re: do { quit; } else { }) Keith Thompson <Keith.S.Thompson+u@gmail.com> - 2025-04-17 11:47 -0700
Re: Loops (was Re: do { quit; } else { }) bart <bc@freeuk.com> - 2025-04-17 20:18 +0100
Re: Loops (was Re: do { quit; } else { }) Keith Thompson <Keith.S.Thompson+u@gmail.com> - 2025-04-17 12:55 -0700
Re: Loops (was Re: do { quit; } else { }) bart <bc@freeuk.com> - 2025-04-17 21:44 +0100
Re: Loops (was Re: do { quit; } else { }) Keith Thompson <Keith.S.Thompson+u@gmail.com> - 2025-04-17 15:32 -0700
Checking the loop variable after the loop has ended (Was: Loops (was Re: do { quit; } else { })) gazelle@shell.xmission.com (Kenny McCormack) - 2025-04-17 21:21 +0000
Re: Checking the loop variable after the loop has ended (Was: Loops (was Re: do { quit; } else { })) Lew Pitcher <lew.pitcher@digitalfreehold.ca> - 2025-04-17 22:29 +0000
Re: Checking the loop variable after the loop has ended (Was: Loops (was Re: do { quit; } else { })) gazelle@shell.xmission.com (Kenny McCormack) - 2025-04-18 13:58 +0000
Re: Checking the loop variable after the loop has ended (Was: Loops (was Re: do { quit; } else { })) Lew Pitcher <lew.pitcher@digitalfreehold.ca> - 2025-04-18 18:33 +0000
Re: Checking the loop variable after the loop has ended (Was: Loops (was Re: do { quit; } else { })) bart <bc@freeuk.com> - 2025-04-18 20:10 +0100
Re: Checking the loop variable after the loop has ended (Was: Loops (was Re: do { quit; } else { })) bart <bc@freeuk.com> - 2025-04-18 16:07 +0100
Re: Checking the loop variable after the loop has ended (Was: Loops (was Re: do { quit; } else { })) scott@slp53.sl.home (Scott Lurndal) - 2025-04-18 16:52 +0000
Re: Checking the loop variable after the loop has ended (Was: Loops (was Re: do { quit; } else { })) Rosario19 <Ros@invalid.invalid> - 2025-04-24 22:43 +0200
Re: Checking the loop variable after the loop has ended (Was: Loops (was Re: do { quit; } else { })) Janis Papanagnou <janis_papanagnou+ng@hotmail.com> - 2025-04-25 07:50 +0200
Re: Checking the loop variable after the loop has ended (Was: Loops (was Re: do { quit; } else { })) Richard Harnden <richard.nospam@gmail.invalid> - 2025-04-25 07:04 +0100
Re: Checking the loop variable after the loop has ended (Was: Loops (was Re: do { quit; } else { })) Rosario19 <Ros@invalid.invalid> - 2025-04-25 10:38 +0200
Re: Checking the loop variable after the loop has ended (Was: Loops (was Re: do { quit; } else { })) Rosario19 <Ros@invalid.invalid> - 2025-04-25 10:42 +0200
Re: Checking the loop variable after the loop has ended (Was: Loops (was Re: do { quit; } else { })) Kaz Kylheku <643-408-1753@kylheku.com> - 2025-04-18 15:24 +0000
Re: Checking the loop variable after the loop has ended (Was: Loops (was Re: do { quit; } else { })) Lew Pitcher <lew.pitcher@digitalfreehold.ca> - 2025-04-18 15:48 +0000
Re: Checking the loop variable after the loop has ended (Was: Loops (was Re: do { quit; } else { })) bart <bc@freeuk.com> - 2025-04-18 16:57 +0100
Re: Checking the loop variable after the loop has ended (Was: Loops (was Re: do { quit; } else { })) Janis Papanagnou <janis_papanagnou+ng@hotmail.com> - 2025-04-18 18:46 +0200
Re: Checking the loop variable after the loop has ended (Was: Loops (was Re: do { quit; } else { })) bart <bc@freeuk.com> - 2025-04-18 18:40 +0100
Re: Checking the loop variable after the loop has ended (Was: Loops (was Re: do { quit; } else { })) Janis Papanagnou <janis_papanagnou+ng@hotmail.com> - 2025-04-19 08:36 +0200
Re: Checking the loop variable after the loop has ended (Was: Loops (was Re: do { quit; } else { })) Janis Papanagnou <janis_papanagnou+ng@hotmail.com> - 2025-04-18 17:49 +0200
Re: Loops (was Re: do { quit; } else { }) bart <bc@freeuk.com> - 2025-04-17 02:19 +0100
Re: Loops (was Re: do { quit; } else { }) Keith Thompson <Keith.S.Thompson+u@gmail.com> - 2025-04-16 17:47 -0700
Re: Loops (was Re: do { quit; } else { }) Janis Papanagnou <janis_papanagnou+ng@hotmail.com> - 2025-04-18 14:41 +0200
Re: Loops (was Re: do { quit; } else { }) scott@slp53.sl.home (Scott Lurndal) - 2025-04-16 14:09 +0000
Re: Loops (was Re: do { quit; } else { }) Michael S <already5chosen@yahoo.com> - 2025-04-16 17:37 +0300
Re: Loops (was Re: do { quit; } else { }) Tim Rentsch <tr.17687@z991.linuxsc.com> - 2025-05-06 05:59 -0700
Re: Loops (was Re: do { quit; } else { }) Michael S <already5chosen@yahoo.com> - 2025-05-07 12:32 +0300
Re: Loops (was Re: do { quit; } else { }) Janis Papanagnou <janis_papanagnou+ng@hotmail.com> - 2025-05-07 14:54 +0200
Re: Loops (was Re: do { quit; } else { }) scott@slp53.sl.home (Scott Lurndal) - 2025-05-07 13:50 +0000
Re: Loops (was Re: do { quit; } else { }) Tim Rentsch <tr.17687@z991.linuxsc.com> - 2025-05-11 23:48 -0700
Re: Loops (was Re: do { quit; } else { }) bart <bc@freeuk.com> - 2025-04-16 15:45 +0100
Re: Loops (was Re: do { quit; } else { }) scott@slp53.sl.home (Scott Lurndal) - 2025-04-16 15:44 +0000
Re: Loops (was Re: do { quit; } else { }) Keith Thompson <Keith.S.Thompson+u@gmail.com> - 2025-04-16 13:18 -0700
Re: Loops (was Re: do { quit; } else { }) Kaz Kylheku <643-408-1753@kylheku.com> - 2025-04-15 19:55 +0000
Re: Loops (was Re: do { quit; } else { }) Janis Papanagnou <janis_papanagnou+ng@hotmail.com> - 2025-04-16 07:19 +0200
Re: Loops (was Re: do { quit; } else { }) Janis Papanagnou <janis_papanagnou+ng@hotmail.com> - 2025-04-16 07:44 +0200
Re: Loops (was Re: do { quit; } else { }) bart <bc@freeuk.com> - 2025-04-16 12:01 +0100
Re: Loops (was Re: do { quit; } else { }) Janis Papanagnou <janis_papanagnou+ng@hotmail.com> - 2025-04-18 16:40 +0200
Re: Loops (was Re: do { quit; } else { }) James Kuyper <jameskuyper@alumni.caltech.edu> - 2025-04-18 14:10 -0400
Re: Loops (was Re: do { quit; } else { }) bart <bc@freeuk.com> - 2025-04-18 23:27 +0100
Re: Loops (was Re: do { quit; } else { }) Janis Papanagnou <janis_papanagnou+ng@hotmail.com> - 2025-04-19 08:27 +0200
Re: Loops (was Re: do { quit; } else { }) bart <bc@freeuk.com> - 2025-04-19 11:26 +0100
Re: Loops (was Re: do { quit; } else { }) Janis Papanagnou <janis_papanagnou+ng@hotmail.com> - 2025-04-19 13:32 +0200
Re: Loops (was Re: do { quit; } else { }) bart <bc@freeuk.com> - 2025-04-19 14:05 +0100
Re: Loops (was Re: do { quit; } else { }) Keith Thompson <Keith.S.Thompson+u@gmail.com> - 2025-04-19 12:54 -0700
Re: Loops (was Re: do { quit; } else { }) bart <bc@freeuk.com> - 2025-04-19 20:57 +0100
Re: Loops (was Re: do { quit; } else { }) Keith Thompson <Keith.S.Thompson+u@gmail.com> - 2025-04-19 14:07 -0700
Re: Loops (was Re: do { quit; } else { }) bart <bc@freeuk.com> - 2025-04-20 00:34 +0100
Re: Loops (was Re: do { quit; } else { }) Janis Papanagnou <janis_papanagnou+ng@hotmail.com> - 2025-04-20 12:18 +0200
Re: Loops (was Re: do { quit; } else { }) bart <bc@freeuk.com> - 2025-04-20 12:43 +0100
Re: Loops (was Re: do { quit; } else { }) Janis Papanagnou <janis_papanagnou+ng@hotmail.com> - 2025-04-20 18:46 +0200
Re: Loops (was Re: do { quit; } else { }) bart <bc@freeuk.com> - 2025-04-20 20:51 +0100
Re: Loops (was Re: do { quit; } else { }) Keith Thompson <Keith.S.Thompson+u@gmail.com> - 2025-04-20 15:36 -0700
Re: Loops (was Re: do { quit; } else { }) bart <bc@freeuk.com> - 2025-04-21 00:29 +0100
Re: Loops (was Re: do { quit; } else { }) Keith Thompson <Keith.S.Thompson+u@gmail.com> - 2025-04-20 19:08 -0700
Re: Loops (was Re: do { quit; } else { }) bart <bc@freeuk.com> - 2025-04-21 12:26 +0100
Re: Loops (was Re: do { quit; } else { }) Kaz Kylheku <643-408-1753@kylheku.com> - 2025-04-21 03:16 +0000
Re: Loops (was Re: do { quit; } else { }) bart <bc@freeuk.com> - 2025-04-21 12:57 +0100
Re: Loops (was Re: do { quit; } else { }) Kaz Kylheku <643-408-1753@kylheku.com> - 2025-04-21 18:43 +0000
Re: Loops (was Re: do { quit; } else { }) bart <bc@freeuk.com> - 2025-04-21 20:57 +0100
Re: Loops (was Re: do { quit; } else { }) Kaz Kylheku <643-408-1753@kylheku.com> - 2025-04-21 20:25 +0000
Re: Loops (was Re: do { quit; } else { }) bart <bc@freeuk.com> - 2025-04-22 00:33 +0100
Re: Loops (was Re: do { quit; } else { }) scott@slp53.sl.home (Scott Lurndal) - 2025-04-21 23:46 +0000
Re: Loops (was Re: do { quit; } else { }) Janis Papanagnou <janis_papanagnou+ng@hotmail.com> - 2025-04-22 10:32 +0200
Re: Loops (was Re: do { quit; } else { }) antispam@fricas.org (Waldek Hebisch) - 2025-04-22 01:06 +0000
Re: Loops (was Re: do { quit; } else { }) bart <bc@freeuk.com> - 2025-04-22 02:24 +0100
Re: Loops (was Re: do { quit; } else { }) Janis Papanagnou <janis_papanagnou+ng@hotmail.com> - 2025-04-22 10:47 +0200
Re: Loops (was Re: do { quit; } else { }) bart <bc@freeuk.com> - 2025-04-22 11:28 +0100
Re: Loops (was Re: do { quit; } else { }) David Brown <david.brown@hesbynett.no> - 2025-04-22 19:19 +0200
Re: Loops (was Re: do { quit; } else { }) Kaz Kylheku <643-408-1753@kylheku.com> - 2025-04-22 19:26 +0000
Re: Loops (was Re: do { quit; } else { }) bart <bc@freeuk.com> - 2025-04-22 21:03 +0100
Re: Loops (was Re: do { quit; } else { }) Kaz Kylheku <643-408-1753@kylheku.com> - 2025-04-22 21:40 +0000
Re: Loops (was Re: do { quit; } else { }) bart <bc@freeuk.com> - 2025-04-23 00:43 +0100
Re: Loops (was Re: do { quit; } else { }) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2025-04-22 16:59 -0700
Re: Loops (was Re: do { quit; } else { }) Kaz Kylheku <643-408-1753@kylheku.com> - 2025-04-23 00:01 +0000
Re: Loops (was Re: do { quit; } else { }) bart <bc@freeuk.com> - 2025-04-23 11:15 +0100
Re: Loops (was Re: do { quit; } else { }) Muttley@DastardlyHQ.org - 2025-04-23 10:58 +0000
Re: Loops (was Re: do { quit; } else { }) bart <bc@freeuk.com> - 2025-04-23 14:50 +0100
Re: Loops (was Re: do { quit; } else { }) Muttley@DastardlyHQ.org - 2025-04-23 16:00 +0000
Re: Loops (was Re: do { quit; } else { }) bart <bc@freeuk.com> - 2025-04-23 17:39 +0100
Re: Loops (was Re: do { quit; } else { }) Muttley@DastardlyHQ.org - 2025-04-24 07:41 +0000
Re: Loops (was Re: do { quit; } else { }) bart <bc@freeuk.com> - 2025-04-24 09:31 +0100
Re: Loops (was Re: do { quit; } else { }) David Brown <david.brown@hesbynett.no> - 2025-04-23 17:31 +0200
Re: Loops (was Re: do { quit; } else { }) bart <bc@freeuk.com> - 2025-04-23 18:43 +0100
Re: Loops (was Re: do { quit; } else { }) Kaz Kylheku <643-408-1753@kylheku.com> - 2025-04-23 18:43 +0000
Re: Loops (was Re: do { quit; } else { }) bart <bc@freeuk.com> - 2025-04-23 21:49 +0100
Re: Loops (was Re: do { quit; } else { }) David Brown <david.brown@hesbynett.no> - 2025-04-24 15:12 +0200
Re: Loops (was Re: do { quit; } else { }) bart <bc@freeuk.com> - 2025-04-24 15:28 +0100
Re: Loops (was Re: do { quit; } else { }) David Brown <david.brown@hesbynett.no> - 2025-04-24 17:21 +0200
Re: Loops (was Re: do { quit; } else { }) bart <bc@freeuk.com> - 2025-04-24 18:30 +0100
Re: Loops (was Re: do { quit; } else { }) Muttley@DastardlyHQ.org - 2025-04-24 17:59 +0000
Re: Loops (was Re: do { quit; } else { }) David Brown <david.brown@hesbynett.no> - 2025-04-25 15:19 +0200
Re: Loops (was Re: do { quit; } else { }) Muttley@DastardlyHQ.org - 2025-04-24 07:40 +0000
Re: Loops (was Re: do { quit; } else { }) bart <bc@freeuk.com> - 2025-04-24 09:26 +0100
Re: Loops (was Re: do { quit; } else { }) Muttley@DastardlyHQ.org - 2025-04-24 10:52 +0000
Re: Loops (was Re: do { quit; } else { }) bart <bc@freeuk.com> - 2025-04-24 12:44 +0100
Re: Loops (was Re: do { quit; } else { }) Muttley@DastardlyHQ.org - 2025-04-24 14:31 +0000
Re: Loops (was Re: do { quit; } else { }) David Brown <david.brown@hesbynett.no> - 2025-04-24 14:25 +0200
Re: Loops (was Re: do { quit; } else { }) bart <bc@freeuk.com> - 2025-04-24 14:51 +0100
Re: Loops (was Re: do { quit; } else { }) scott@slp53.sl.home (Scott Lurndal) - 2025-04-24 15:32 +0000
Re: Loops (was Re: do { quit; } else { }) bart <bc@freeuk.com> - 2025-04-24 18:49 +0100
Re: Loops (was Re: do { quit; } else { }) Muttley@DastardlyHQ.org - 2025-04-24 18:03 +0000
Re: Loops (was Re: do { quit; } else { }) Keith Thompson <Keith.S.Thompson+u@gmail.com> - 2025-04-24 18:26 -0700
Re: Loops (was Re: do { quit; } else { }) Muttley@DastardlyHQ.org - 2025-04-25 08:53 +0000
Re: Loops (was Re: do { quit; } else { }) Tim Rentsch <tr.17687@z991.linuxsc.com> - 2025-05-04 22:17 -0700
Re: Loops (was Re: do { quit; } else { }) bart <bc@freeuk.com> - 2025-09-26 02:00 +0100
Re: Loops (was Re: do { quit; } else { }) Kaz Kylheku <643-408-1753@kylheku.com> - 2025-04-25 02:56 +0000
Re: Loops (was Re: do { quit; } else { }) Rosario19 <Ros@invalid.invalid> - 2025-04-25 13:48 +0200
Re: Loops (was Re: do { quit; } else { }) David Brown <david.brown@hesbynett.no> - 2025-04-25 17:51 +0200
Re: Loops (was Re: do { quit; } else { }) David Brown <david.brown@hesbynett.no> - 2025-04-25 17:48 +0200
Re: Loops (was Re: do { quit; } else { }) Janis Papanagnou <janis_papanagnou+ng@hotmail.com> - 2025-04-24 18:51 +0200
Re: Loops (was Re: do { quit; } else { }) David Brown <david.brown@hesbynett.no> - 2025-04-23 09:01 +0200
Re: Loops (was Re: do { quit; } else { }) Janis Papanagnou <janis_papanagnou+ng@hotmail.com> - 2025-04-22 09:32 +0200
Re: Loops (was Re: do { quit; } else { }) Janis Papanagnou <janis_papanagnou+ng@hotmail.com> - 2025-04-22 09:14 +0200
Re: Loops (was Re: do { quit; } else { }) Keith Thompson <Keith.S.Thompson+u@gmail.com> - 2025-04-20 15:07 -0700
Re: Loops (was Re: do { quit; } else { }) gazelle@shell.xmission.com (Kenny McCormack) - 2025-04-20 23:19 +0000
Re: Loops (was Re: do { quit; } else { }) antispam@fricas.org (Waldek Hebisch) - 2025-04-21 13:51 +0000
Re: Loops (was Re: do { quit; } else { }) bart <bc@freeuk.com> - 2025-04-21 16:36 +0100
Re: Loops (was Re: do { quit; } else { }) antispam@fricas.org (Waldek Hebisch) - 2025-04-21 21:06 +0000
Re: Loops (was Re: do { quit; } else { }) bart <bc@freeuk.com> - 2025-04-21 23:54 +0100
Re: Loops (was Re: do { quit; } else { }) Keith Thompson <Keith.S.Thompson+u@gmail.com> - 2025-04-21 16:12 -0700
Re: Loops (was Re: do { quit; } else { }) bart <bc@freeuk.com> - 2025-04-22 01:26 +0100
Re: Loops (was Re: do { quit; } else { }) Keith Thompson <Keith.S.Thompson+u@gmail.com> - 2025-04-21 18:22 -0700
Re: Loops (was Re: do { quit; } else { }) bart <bc@freeuk.com> - 2025-04-22 11:43 +0100
Re: Loops (was Re: do { quit; } else { }) Keith Thompson <Keith.S.Thompson+u@gmail.com> - 2025-04-22 14:15 -0700
Re: Loops (was Re: do { quit; } else { }) bart <bc@freeuk.com> - 2025-04-22 23:52 +0100
Re: Loops (was Re: do { quit; } else { }) Keith Thompson <Keith.S.Thompson+u@gmail.com> - 2025-04-22 16:22 -0700
Re: Loops (was Re: do { quit; } else { }) Janis Papanagnou <janis_papanagnou+ng@hotmail.com> - 2025-04-22 10:40 +0200
Re: Loops (was Re: do { quit; } else { }) Keith Thompson <Keith.S.Thompson+u@gmail.com> - 2025-04-21 18:25 -0700
Re: Loops (was Re: do { quit; } else { }) Janis Papanagnou <janis_papanagnou+ng@hotmail.com> - 2025-04-22 10:19 +0200
Re: Loops (was Re: do { quit; } else { }) bart <bc@freeuk.com> - 2025-04-22 12:39 +0100
Re: Loops (was Re: do { quit; } else { }) bart <bc@freeuk.com> - 2025-04-22 02:21 +0100
Re: Loops (was Re: do { quit; } else { }) Janis Papanagnou <janis_papanagnou+ng@hotmail.com> - 2025-04-22 09:54 +0200
Re: Loops (was Re: do { quit; } else { }) David Brown <david.brown@hesbynett.no> - 2025-04-22 20:16 +0200
Re: Loops (was Re: do { quit; } else { }) bart <bc@freeuk.com> - 2025-04-22 19:54 +0100
Re: Loops (was Re: do { quit; } else { }) David Brown <david.brown@hesbynett.no> - 2025-04-22 21:11 +0200
Re: Loops (was Re: do { quit; } else { }) bart <bc@freeuk.com> - 2025-04-22 20:43 +0100
Re: Loops (was Re: do { quit; } else { }) David Brown <david.brown@hesbynett.no> - 2025-04-23 17:41 +0200
Re: Loops (was Re: do { quit; } else { }) Kaz Kylheku <643-408-1753@kylheku.com> - 2025-04-19 16:28 +0000
Re: Loops (was Re: do { quit; } else { }) bart <bc@freeuk.com> - 2025-04-19 19:59 +0100
Re: Loops (was Re: do { quit; } else { }) bart <bc@freeuk.com> - 2025-04-19 20:15 +0100
Re: Loops (was Re: do { quit; } else { }) Janis Papanagnou <janis_papanagnou+ng@hotmail.com> - 2025-04-20 12:41 +0200
Re: Loops (was Re: do { quit; } else { }) Janis Papanagnou <janis_papanagnou+ng@hotmail.com> - 2025-04-20 12:34 +0200
Re: Loops (was Re: do { quit; } else { }) scott@slp53.sl.home (Scott Lurndal) - 2025-04-19 14:35 +0000
Re: Loops (was Re: do { quit; } else { }) bart <bc@freeuk.com> - 2025-04-19 16:24 +0100
Re: Loops (was Re: do { quit; } else { }) Kaz Kylheku <643-408-1753@kylheku.com> - 2025-04-19 16:36 +0000
Re: Loops (was Re: do { quit; } else { }) James Kuyper <jameskuyper@alumni.caltech.edu> - 2025-04-19 15:22 -0400
Re: Loops (was Re: do { quit; } else { }) bart <bc@freeuk.com> - 2025-04-19 20:55 +0100
Re: Loops (was Re: do { quit; } else { }) Keith Thompson <Keith.S.Thompson+u@gmail.com> - 2025-04-19 13:55 -0700
Re: Loops (was Re: do { quit; } else { }) Michael S <already5chosen@yahoo.com> - 2025-04-20 00:52 +0300
Re: Loops (was Re: do { quit; } else { }) Janis Papanagnou <janis_papanagnou+ng@hotmail.com> - 2025-04-20 13:00 +0200
Re: Loops (was Re: do { quit; } else { }) bart <bc@freeuk.com> - 2025-04-20 14:53 +0100
Re: Loops (was Re: do { quit; } else { }) Michael S <already5chosen@yahoo.com> - 2025-04-20 17:34 +0300
Re: Loops (was Re: do { quit; } else { }) bart <bc@freeuk.com> - 2025-04-20 16:25 +0100
Re: Loops (was Re: do { quit; } else { }) Michael S <already5chosen@yahoo.com> - 2025-04-20 19:01 +0300
Re: Loops (was Re: do { quit; } else { }) Janis Papanagnou <janis_papanagnou+ng@hotmail.com> - 2025-04-20 18:10 +0200
Re: Loops (was Re: do { quit; } else { }) Janis Papanagnou <janis_papanagnou+ng@hotmail.com> - 2025-04-20 18:07 +0200
Re: Loops (was Re: do { quit; } else { }) Janis Papanagnou <janis_papanagnou+ng@hotmail.com> - 2025-04-20 17:55 +0200
Re: Loops (was Re: do { quit; } else { }) bart <bc@freeuk.com> - 2025-04-20 17:28 +0100
Re: Loops (was Re: do { quit; } else { }) antispam@fricas.org (Waldek Hebisch) - 2025-04-21 03:07 +0000
Re: Loops (was Re: do { quit; } else { }) bart <bc@freeuk.com> - 2025-04-21 13:46 +0100
Re: Loops (was Re: do { quit; } else { }) Keith Thompson <Keith.S.Thompson+u@gmail.com> - 2025-04-21 14:21 -0700
Re: Loops (was Re: do { quit; } else { }) Janis Papanagnou <janis_papanagnou+ng@hotmail.com> - 2025-04-22 00:14 +0200
Re: Loops (was Re: do { quit; } else { }) Janis Papanagnou <janis_papanagnou+ng@hotmail.com> - 2025-04-22 00:19 +0200
Re: Loops (was Re: do { quit; } else { }) Keith Thompson <Keith.S.Thompson+u@gmail.com> - 2025-04-21 15:39 -0700
Re: Loops (was Re: do { quit; } else { }) Janis Papanagnou <janis_papanagnou+ng@hotmail.com> - 2025-04-22 10:12 +0200
Re: Loops (was Re: do { quit; } else { }) Kaz Kylheku <643-408-1753@kylheku.com> - 2025-04-21 22:16 +0000
Re: Loops (was Re: do { quit; } else { }) bart <bc@freeuk.com> - 2025-04-22 01:12 +0100
Re: Loops (was Re: do { quit; } else { }) Kaz Kylheku <643-408-1753@kylheku.com> - 2025-04-22 03:31 +0000
Re: Loops (was Re: do { quit; } else { }) bart <bc@freeuk.com> - 2025-04-22 12:33 +0100
Re: Loops (was Re: do { quit; } else { }) Kaz Kylheku <643-408-1753@kylheku.com> - 2025-04-22 14:36 +0000
Re: Loops (was Re: do { quit; } else { }) scott@slp53.sl.home (Scott Lurndal) - 2025-04-22 16:10 +0000
Re: Loops (was Re: do { quit; } else { }) bart <bc@freeuk.com> - 2025-04-22 17:27 +0100
Re: Loops (was Re: do { quit; } else { }) scott@slp53.sl.home (Scott Lurndal) - 2025-04-22 17:48 +0000
Re: Loops (was Re: do { quit; } else { }) Keith Thompson <Keith.S.Thompson+u@gmail.com> - 2025-04-22 14:31 -0700
Re: Loops (was Re: do { quit; } else { }) scott@slp53.sl.home (Scott Lurndal) - 2025-04-22 22:39 +0000
Re: Loops (was Re: do { quit; } else { }) David Brown <david.brown@hesbynett.no> - 2025-04-22 17:53 +0200
Re: Loops (was Re: do { quit; } else { }) Keith Thompson <Keith.S.Thompson+u@gmail.com> - 2025-04-22 15:02 -0700
Re: Loops (was Re: do { quit; } else { }) David Brown <david.brown@hesbynett.no> - 2025-04-23 19:05 +0200
Re: Loops (was Re: do { quit; } else { }) bart <bc@freeuk.com> - 2025-04-23 18:52 +0100
Re: Loops (was Re: do { quit; } else { }) Keith Thompson <Keith.S.Thompson+u@gmail.com> - 2025-04-23 13:22 -0700
Re: Loops (was Re: do { quit; } else { }) James Kuyper <jameskuyper@alumni.caltech.edu> - 2025-04-21 07:34 -0400
Re: Loops (was Re: do { quit; } else { }) bart <bc@freeuk.com> - 2025-04-21 13:26 +0100
Re: Loops (was Re: do { quit; } else { }) Keith Thompson <Keith.S.Thompson+u@gmail.com> - 2025-04-21 13:39 -0700
Re: Loops (was Re: do { quit; } else { }) Tim Rentsch <tr.17687@z991.linuxsc.com> - 2025-05-04 21:35 -0700
Re: Loops (was Re: do { quit; } else { }) James Kuyper <jameskuyper@alumni.caltech.edu> - 2025-04-19 15:15 -0400
Re: Loops (was Re: do { quit; } else { }) bart <bc@freeuk.com> - 2025-04-19 20:36 +0100
Re: Loops (was Re: do { quit; } else { }) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2025-04-19 19:43 -0700
Re: Loops (was Re: do { quit; } else { }) Janis Papanagnou <janis_papanagnou+ng@hotmail.com> - 2025-04-20 11:27 +0200
Re: Loops (was Re: do { quit; } else { }) Janis Papanagnou <janis_papanagnou+ng@hotmail.com> - 2025-04-20 11:25 +0200
Re: Loops (was Re: do { quit; } else { }) James Kuyper <jameskuyper@alumni.caltech.edu> - 2025-04-20 11:25 -0400
Re: Loops (was Re: do { quit; } else { }) bart <bc@freeuk.com> - 2025-04-20 16:53 +0100
Re: Loops (was Re: do { quit; } else { }) Rosario19 <Ros@invalid.invalid> - 2025-04-16 12:29 +0200
Re: Loops (was Re: do { quit; } else { }) bart <bc@freeuk.com> - 2025-04-16 12:38 +0100
Re: Loops (was Re: do { quit; } else { }) Rosario19 <Ros@invalid.invalid> - 2025-04-16 19:15 +0200
Re: Loops (was Re: do { quit; } else { }) bart <bc@freeuk.com> - 2025-04-15 15:28 +0100
Re: Loops (was Re: do { quit; } else { }) Keith Thompson <Keith.S.Thompson+u@gmail.com> - 2025-04-14 14:44 -0700
Re: Loops (was Re: do { quit; } else { }) Janis Papanagnou <janis_papanagnou+ng@hotmail.com> - 2025-04-15 06:14 +0200
Re: Loops (was Re: do { quit; } else { }) Rosario19 <Ros@invalid.invalid> - 2025-04-15 06:57 +0200
Re: Loops (was Re: do { quit; } else { }) Janis Papanagnou <janis_papanagnou+ng@hotmail.com> - 2025-04-15 09:25 +0200
Re: Loops (was Re: do { quit; } else { }) Rosario19 <Ros@invalid.invalid> - 2025-04-16 11:45 +0200
Re: Loops (was Re: do { quit; } else { }) Janis Papanagnou <janis_papanagnou+ng@hotmail.com> - 2025-04-18 16:57 +0200
Re: Loops (was Re: do { quit; } else { }) Michael S <already5chosen@yahoo.com> - 2025-04-20 15:00 +0300
Re: Loops (was Re: do { quit; } else { }) Janis Papanagnou <janis_papanagnou+ng@hotmail.com> - 2025-04-20 17:45 +0200
Re: Loops (was Re: do { quit; } else { }) Rosario19 <Ros@invalid.invalid> - 2025-04-24 22:35 +0200
Re: Loops (was Re: do { quit; } else { }) Janis Papanagnou <janis_papanagnou+ng@hotmail.com> - 2025-04-25 07:46 +0200
Re: Loops (was Re: do { quit; } else { }) Rosario19 <Ros@invalid.invalid> - 2025-04-25 10:29 +0200
Re: Loops (was Re: do { quit; } else { }) Janis Papanagnou <janis_papanagnou+ng@hotmail.com> - 2025-04-25 14:22 +0200
Re: Loops (was Re: do { quit; } else { }) bart <bc@freeuk.com> - 2025-04-15 11:15 +0100
Re: Loops (was Re: do { quit; } else { }) Michael S <already5chosen@yahoo.com> - 2025-04-15 15:25 +0300
Re: Loops (was Re: do { quit; } else { }) bart <bc@freeuk.com> - 2025-04-15 13:55 +0100
Re: Loops (was Re: do { quit; } else { }) Kaz Kylheku <643-408-1753@kylheku.com> - 2025-04-15 13:33 +0000
Re: Loops (was Re: do { quit; } else { }) bart <bc@freeuk.com> - 2025-04-15 15:30 +0100
Re: Loops (was Re: do { quit; } else { }) Janis Papanagnou <janis_papanagnou+ng@hotmail.com> - 2025-04-15 18:22 +0200
Re: Loops (was Re: do { quit; } else { }) bart <bc@freeuk.com> - 2025-04-15 17:42 +0100
Re: Loops (was Re: do { quit; } else { }) Michael S <already5chosen@yahoo.com> - 2025-04-15 20:14 +0300
Re: Loops (was Re: do { quit; } else { }) Janis Papanagnou <janis_papanagnou+ng@hotmail.com> - 2025-04-16 07:39 +0200
Re: Loops (was Re: do { quit; } else { }) Kaz Kylheku <643-408-1753@kylheku.com> - 2025-04-15 20:37 +0000
Re: Loops (was Re: do { quit; } else { }) Rosario19 <Ros@invalid.invalid> - 2025-04-16 12:09 +0200
Re: Loops (was Re: do { quit; } else { }) Rosario19 <Ros@invalid.invalid> - 2025-04-16 12:04 +0200
Re: Loops (was Re: do { quit; } else { }) scott@slp53.sl.home (Scott Lurndal) - 2025-04-15 14:13 +0000
Re: Loops (was Re: do { quit; } else { }) bart <bc@freeuk.com> - 2025-04-15 15:41 +0100
Re: Loops (was Re: do { quit; } else { }) Rosario19 <Ros@invalid.invalid> - 2025-04-16 11:58 +0200
Re: do { quit; } else { } Keith Thompson <Keith.S.Thompson+u@gmail.com> - 2025-04-14 15:07 -0700
Re: do { quit; } else { } Kaz Kylheku <643-408-1753@kylheku.com> - 2025-04-14 23:12 +0000
Re: do { quit; } else { } bart <bc@freeuk.com> - 2025-04-15 01:35 +0100
Re: do { quit; } else { } scott@slp53.sl.home (Scott Lurndal) - 2025-04-15 14:05 +0000
Re: do { quit; } else { } bart <bc@freeuk.com> - 2025-04-15 15:44 +0100
Re: do { quit; } else { } scott@slp53.sl.home (Scott Lurndal) - 2025-04-15 15:31 +0000
Re: do { quit; } else { } bart <bc@freeuk.com> - 2025-04-15 17:38 +0100
Re: do { quit; } else { } David Brown <david.brown@hesbynett.no> - 2025-04-12 14:39 +0200
Re: do { quit; } else { } Richard Heathfield <rjh@cpax.org.uk> - 2025-04-12 14:21 +0100
Re: do { quit; } else { } David Brown <david.brown@hesbynett.no> - 2025-04-12 15:52 +0200
Re: do { quit; } else { } Richard Heathfield <rjh@cpax.org.uk> - 2025-04-12 16:32 +0100
Re: do { quit; } else { } David Brown <david.brown@hesbynett.no> - 2025-04-13 16:26 +0200
Re: do { quit; } else { } Kaz Kylheku <643-408-1753@kylheku.com> - 2025-04-13 14:48 +0000
Re: do { quit; } else { } bart <bc@freeuk.com> - 2025-04-12 15:01 +0100
Re: do { quit; } else { } James Kuyper <jameskuyper@alumni.caltech.edu> - 2025-04-11 18:24 -0400
Re: do { quit; } else { } Michael S <already5chosen@yahoo.com> - 2025-04-13 21:03 +0300
Re: do { quit; } else { } James Kuyper <jameskuyper@alumni.caltech.edu> - 2025-04-13 20:56 -0400
Re: do { quit; } else { } Keith Thompson <Keith.S.Thompson+u@gmail.com> - 2025-04-11 11:24 -0700
Re: do { quit; } else { } Tim Rentsch <tr.17687@z991.linuxsc.com> - 2025-05-12 01:30 -0700
Re: do { quit; } else { } Keith Thompson <Keith.S.Thompson+u@gmail.com> - 2025-05-12 02:35 -0700
Re: do { quit; } else { } Tim Rentsch <tr.17687@z991.linuxsc.com> - 2026-01-27 09:17 -0800
Re: do { quit; } else { } Keith Thompson <Keith.S.Thompson+u@gmail.com> - 2026-01-27 15:28 -0800
Re: do { quit; } else { } Keith Thompson <Keith.S.Thompson+u@gmail.com> - 2025-04-11 11:15 -0700
Re: do { quit; } else { } Michael S <already5chosen@yahoo.com> - 2025-04-13 20:57 +0300
Re: do { quit; } else { } David Brown <david.brown@hesbynett.no> - 2025-04-13 20:53 +0200
Re: do { quit; } else { } Michael S <already5chosen@yahoo.com> - 2025-04-13 22:14 +0300
Re: do { quit; } else { } James Kuyper <jameskuyper@alumni.caltech.edu> - 2025-04-13 21:03 -0400
Re: do { quit; } else { } Janis Papanagnou <janis_papanagnou+ng@hotmail.com> - 2025-04-14 06:43 +0200
Re: do { quit; } else { } James Kuyper <jameskuyper@alumni.caltech.edu> - 2025-04-14 09:00 -0400
Re: do { quit; } else { } Janis Papanagnou <janis_papanagnou+ng@hotmail.com> - 2025-04-15 09:40 +0200
Re: do { quit; } else { } Richard Heathfield <rjh@cpax.org.uk> - 2025-04-15 09:18 +0100
Re: do { quit; } else { } James Kuyper <jameskuyper@alumni.caltech.edu> - 2025-04-15 10:39 -0400
Re: do { quit; } else { } David Brown <david.brown@hesbynett.no> - 2025-04-14 08:44 +0200
Re: do { quit; } else { } Ike Naar <ike@sdf.org> - 2025-04-11 19:45 +0000
Re: do { quit; } else { } James Kuyper <jameskuyper@alumni.caltech.edu> - 2025-04-11 16:00 -0400
Re: do { quit; } else { } antispam@fricas.org (Waldek Hebisch) - 2025-04-15 15:44 +0000
Re: do { quit; } else { } Kaz Kylheku <643-408-1753@kylheku.com> - 2025-04-10 20:21 +0000
Re: do { quit; } else { } Keith Thompson <Keith.S.Thompson+u@gmail.com> - 2025-04-10 15:43 -0700
Re: do { quit; } else { } Kaz Kylheku <643-408-1753@kylheku.com> - 2025-04-11 02:12 +0000
Re: do { quit; } else { } Keith Thompson <Keith.S.Thompson+u@gmail.com> - 2025-04-10 20:44 -0700
Re: do { quit; } else { } David Brown <david.brown@hesbynett.no> - 2025-04-11 11:33 +0200
Re: do { quit; } else { } James Kuyper <jameskuyper@alumni.caltech.edu> - 2025-04-10 15:14 -0400
Re: do { quit; } else { } James Kuyper <jameskuyper@alumni.caltech.edu> - 2025-04-10 16:25 -0400
Re: do { quit; } else { } Richard Heathfield <rjh@cpax.org.uk> - 2025-04-10 21:42 +0100
Re: do { quit; } else { } David Brown <david.brown@hesbynett.no> - 2025-04-11 11:35 +0200
Re: do { quit; } else { } Keith Thompson <Keith.S.Thompson+u@gmail.com> - 2025-04-10 15:49 -0700
Re: do { quit; } else { } James Kuyper <jameskuyper@alumni.caltech.edu> - 2025-04-10 20:57 -0400
Re: do { quit; } else { } Michael S <already5chosen@yahoo.com> - 2025-04-11 14:37 +0300
Re: do { quit; } else { } James Kuyper <jameskuyper@alumni.caltech.edu> - 2025-04-11 11:16 -0400
Re: do { quit; } else { } Michael S <already5chosen@yahoo.com> - 2025-04-11 18:31 +0300
Re: do { quit; } else { } Keith Thompson <Keith.S.Thompson+u@gmail.com> - 2025-04-11 11:10 -0700
Re: do { quit; } else { } scott@slp53.sl.home (Scott Lurndal) - 2025-04-11 14:02 +0000
Re: do { quit; } else { } scott@slp53.sl.home (Scott Lurndal) - 2025-04-11 15:24 +0000
Re: do { quit; } else { } Michael S <already5chosen@yahoo.com> - 2025-04-11 18:46 +0300
Re: do { quit; } else { } Keith Thompson <Keith.S.Thompson+u@gmail.com> - 2025-04-11 12:01 -0700
Re: do { quit; } else { } Tim Rentsch <tr.17687@z991.linuxsc.com> - 2025-04-08 10:47 -0700
Re: do { quit; } else { } Ike Naar <ike@sdf.org> - 2025-04-09 09:00 +0000
Re: do { quit; } else { } bart <bc@freeuk.com> - 2025-04-09 11:36 +0100
Re: do { quit; } else { } David Brown <david.brown@hesbynett.no> - 2025-04-09 14:54 +0200
Re: do { quit; } else { } Tim Rentsch <tr.17687@z991.linuxsc.com> - 2025-04-08 10:59 -0700
Re: do { quit; } else { } Michael S <already5chosen@yahoo.com> - 2025-04-09 11:51 +0300
Re: do { quit; } else { } Tim Rentsch <tr.17687@z991.linuxsc.com> - 2025-04-09 12:56 -0700
Re: do { quit; } else { } Michael S <already5chosen@yahoo.com> - 2025-04-06 16:26 +0300
Re: do { quit; } else { } David Brown <david.brown@hesbynett.no> - 2025-04-06 16:02 +0200
Re: do { quit; } else { } Thiago Adams <thiago.adams@gmail.com> - 2025-04-06 16:53 -0300
Re: do { quit; } else { } Bonita Montero <Bonita.Montero@gmail.com> - 2025-05-09 19:45 +0200
Re: do { quit; } else { } Thiago Adams <thiago.adams@gmail.com> - 2025-05-09 15:23 -0300
Re: do { quit; } else { } Thiago Adams <thiago.adams@gmail.com> - 2025-05-09 15:35 -0300
Re: do { quit; } else { } yeti <yeti@tilde.institute> - 2025-04-07 03:56 +0042
Re: do { quit; } else { } David Brown <david.brown@hesbynett.no> - 2025-04-07 09:16 +0200
Re: do { quit; } else { } gazelle@shell.xmission.com (Kenny McCormack) - 2025-04-06 14:18 +0000
Re: do { quit; } else { } David Brown <david.brown@hesbynett.no> - 2025-04-06 17:08 +0200
Beyond the pale... (Was: do { quit; } else { }) gazelle@shell.xmission.com (Kenny McCormack) - 2025-04-07 16:08 +0000
Re: Beyond the pale... (Was: do { quit; } else { }) David Brown <david.brown@hesbynett.no> - 2025-04-07 18:39 +0200
Re: Beyond the pale... (Was: do { quit; } else { }) Kaz Kylheku <643-408-1753@kylheku.com> - 2025-04-07 23:30 +0000
Re: Beyond the pale... (Was: do { quit; } else { }) Michael S <already5chosen@yahoo.com> - 2025-04-08 12:39 +0300
Re: Beyond the pale... (Was: do { quit; } else { }) Kaz Kylheku <643-408-1753@kylheku.com> - 2025-04-08 16:57 +0000
Re: do { quit; } else { } Tim Rentsch <tr.17687@z991.linuxsc.com> - 2025-04-07 08:06 -0700
Re: do { quit; } else { } Tim Rentsch <tr.17687@z991.linuxsc.com> - 2025-04-06 08:14 -0700
Re: do { quit; } else { } Michael S <already5chosen@yahoo.com> - 2025-04-06 23:48 +0300
Re: do { quit; } else { } David Brown <david.brown@hesbynett.no> - 2025-04-07 09:21 +0200
Re: do { quit; } else { } Tim Rentsch <tr.17687@z991.linuxsc.com> - 2025-04-07 04:50 -0700
Re: do { quit; } else { } Bonita Montero <Bonita.Montero@gmail.com> - 2025-05-09 16:40 +0200
Re: do { quit; } else { } scott@slp53.sl.home (Scott Lurndal) - 2025-05-09 15:01 +0000
Re: do { quit; } else { } Bonita Montero <Bonita.Montero@gmail.com> - 2025-05-09 17:04 +0200
Re: do { quit; } else { } Richard Heathfield <rjh@cpax.org.uk> - 2025-05-09 16:26 +0100
Re: do { quit; } else { } Janis Papanagnou <janis_papanagnou+ng@hotmail.com> - 2025-05-09 17:54 +0200
Re: do { quit; } else { } Richard Heathfield <rjh@cpax.org.uk> - 2025-05-09 17:26 +0100
Re: do { quit; } else { } scott@slp53.sl.home (Scott Lurndal) - 2025-05-09 17:07 +0000
Re: do { quit; } else { } Richard Heathfield <rjh@cpax.org.uk> - 2025-05-09 19:11 +0100
Re: do { quit; } else { } Bonita Montero <Bonita.Montero@gmail.com> - 2025-05-09 20:21 +0200
Re: do { quit; } else { } Richard Heathfield <rjh@cpax.org.uk> - 2025-05-09 19:35 +0100
Re: do { quit; } else { } Bonita Montero <Bonita.Montero@gmail.com> - 2025-05-09 19:09 +0200
Re: do { quit; } else { } Richard Heathfield <rjh@cpax.org.uk> - 2025-05-09 19:29 +0100
Re: do { quit; } else { } Janis Papanagnou <janis_papanagnou+ng@hotmail.com> - 2025-05-13 14:55 +0200
Re: do { quit; } else { } Richard Heathfield <rjh@cpax.org.uk> - 2025-05-13 14:35 +0100
Re: do { quit; } else { } Janis Papanagnou <janis_papanagnou+ng@hotmail.com> - 2025-05-14 11:22 +0200
Re: do { quit; } else { } Richard Heathfield <rjh@cpax.org.uk> - 2025-05-14 10:34 +0100
Re: do { quit; } else { } David Brown <david.brown@hesbynett.no> - 2025-05-09 19:09 +0200
Re: do { quit; } else { } Bonita Montero <Bonita.Montero@gmail.com> - 2025-05-09 19:11 +0200
Re: do { quit; } else { } David Brown <david.brown@hesbynett.no> - 2025-05-09 19:18 +0200
Re: do { quit; } else { } Janis Papanagnou <janis_papanagnou+ng@hotmail.com> - 2025-05-13 14:54 +0200
Re: do { quit; } else { } David Brown <david.brown@hesbynett.no> - 2025-05-13 15:36 +0200
Re: do { quit; } else { } Janis Papanagnou <janis_papanagnou+ng@hotmail.com> - 2025-05-14 11:19 +0200
Re: do { quit; } else { } Tim Rentsch <tr.17687@z991.linuxsc.com> - 2025-05-12 11:44 -0700
Re: do { quit; } else { } Janis Papanagnou <janis_papanagnou+ng@hotmail.com> - 2025-05-13 15:13 +0200
Re: do { quit; } else { } Richard Heathfield <rjh@cpax.org.uk> - 2025-05-13 14:46 +0100
Re: do { quit; } else { } David Brown <david.brown@hesbynett.no> - 2025-05-13 16:07 +0200
Re: do { quit; } else { } Keith Thompson <Keith.S.Thompson+u@gmail.com> - 2025-05-13 14:05 -0700
Re: do { quit; } else { } Janis Papanagnou <janis_papanagnou+ng@hotmail.com> - 2025-05-14 11:31 +0200
Re: do { quit; } else { } Richard Heathfield <rjh@cpax.org.uk> - 2025-05-14 10:37 +0100
Re: do { quit; } else { } Kaz Kylheku <643-408-1753@kylheku.com> - 2025-05-09 15:31 +0000
Re: do { quit; } else { } Bonita Montero <Bonita.Montero@gmail.com> - 2025-05-09 19:07 +0200
Re: do { quit; } else { } Wuns Haerst <Wuns.Haerst@wurstfabrik.at> - 2025-05-07 06:56 +0200
Re: do { quit; } else { } Richard Heathfield <rjh@cpax.org.uk> - 2025-05-07 06:52 +0100
Re: do { quit; } else { } Wuns Haerst <Wuns.Haerst@wurstfabrik.at> - 2025-05-07 15:46 +0200
Re: do { quit; } else { } Tim Rentsch <tr.17687@z991.linuxsc.com> - 2025-05-08 06:04 -0700
Re: do { quit; } else { } Keith Thompson <Keith.S.Thompson+u@gmail.com> - 2025-05-08 14:24 -0700
Re: do { quit; } else { } Tim Rentsch <tr.17687@z991.linuxsc.com> - 2026-01-27 09:15 -0800
Re: do { quit; } else { } Keith Thompson <Keith.S.Thompson+u@gmail.com> - 2026-01-27 15:36 -0800
Re: do { quit; } else { } Bonita Montero <Bonita.Montero@gmail.com> - 2025-05-09 11:09 +0200
Re: do { quit; } else { } Lawrence D'Oliveiro <ldo@nz.invalid> - 2025-04-06 02:58 +0000
Re: do { quit; } else { } David Brown <david.brown@hesbynett.no> - 2025-04-06 12:05 +0200
Re: do { quit; } else { } Mikko <mikko.levanto@iki.fi> - 2025-04-18 10:30 +0300
Re: do { quit; } else { } Anton Shepelev <anton.txt@g{oogle}mail.com> - 2025-10-08 14:14 +0300
Re: do { quit; } else { } Thiago Adams <thiago.adams@gmail.com> - 2025-10-08 09:59 -0300
Re: do { quit; } else { } Janis Papanagnou <janis_papanagnou+ng@hotmail.com> - 2025-10-08 16:05 +0200
Re: do { quit; } else { } Anton Shepelev <anton.txt@g{oogle}mail.com> - 2025-10-08 17:08 +0300
Re: do { quit; } else { } Janis Papanagnou <janis_papanagnou+ng@hotmail.com> - 2025-10-08 16:35 +0200
Re: do { quit; } else { } Thiago Adams <thiago.adams@gmail.com> - 2025-10-15 16:04 -0300
Re: do { quit; } else { } Janis Papanagnou <janis_papanagnou+ng@hotmail.com> - 2025-10-08 16:06 +0200
Re: do { quit; } else { } Bonita Montero <Bonita.Montero@gmail.com> - 2025-10-15 23:04 +0200
Re: do { quit; } else { } Thiago Adams <thiago.adams@gmail.com> - 2025-10-15 20:41 -0300
Re: do { quit; } else { } Richard Heathfield <rjh@cpax.org.uk> - 2025-10-16 00:43 +0100
Page 17 of 35 — ← Prev page 1 … 15 16 [17] 18 19 … 35 Next page →
| From | Keith Thompson <Keith.S.Thompson+u@gmail.com> |
|---|---|
| Date | 2025-04-16 17:26 -0700 |
| Subject | Re: Loops (was Re: do { quit; } else { }) |
| Message-ID | <87r01rzl89.fsf@nosuchdomain.example.com> |
| In reply to | #392632 |
bart <bc@freeuk.com> writes:
> On 16/04/2025 21:03, Keith Thompson wrote:
>> bart <bc@freeuk.com> writes:
>>> On 16/04/2025 06:35, Janis Papanagnou wrote:
>>>> On 15.04.2025 22:46, bart wrote:
>>>>> On 15/04/2025 20:07, Scott Lurndal wrote:
>>>>>> [...]
>>>>>> Real for loops _are_ a three-way construct.
>>>>>>
>>>>>> [...]
>>>>>
>>>>> Any step other than 1 is unusual. [...]
>>>
>>>> Nonsense. Arithmetic loop steps other than one are noting unusual
>>>> and been supported by programming languages (and also been used)
>>>> since decades in programming.
>>>
>>> So what are you claiming, that the majority of loops in any given
>>> program will have steps other than +1 or -1?
>> Exactly, because "unusual" and "the majority" are the only
>> possibilities.
>
> I'm not sure what you're getting at.
I think the misunderstanding is over the meaning of the rather
vague word "unusual".
Did you really think that Janis was claiming that "the majority of
loops in any given program will have steps other than +1 or -1"?
If not (and I don't believe you did), why did you ask that question?
Were you being sarcastic? (If so, I can see how my responding
to your sarcastic remark with one of my own might have been
inappropriate.)
I recognize that sarcasm isn't always obvious in writing. I find it
particularly difficult to recognize sarcasm from someone with whom
I have strong disagreements; it can be difficult to distinguish
between seemingly absurd statements that are sarcastic and ones
that are actual statements of belief or opinion.
I assumed that you would recognize that my statement about "unusual"
and "the majority" would be recognized as sarcasm. Was it not?
I speculate that the disagreement was over the meaning of "unusual"
(something that I suggest is not useful to debate here). Certainly
increment values other than +1 and -1 are less common (and -1 is
less common than +1), and saying that such values are "unusual"
is not unreasonable, but to some the word "unusual" might carry
more negative implications.
[...]
So what is your point?
You clearly would prefer a for loop that iterates over a range of
discrete values rather than C's far more general for statement.
I'm not sure I'd even object to adding such a statement to C in
a future standard, though I don't think it's likely to happen.
But if it did, would you want support for incrementing by +1,
incrementing by either +1 or -1 (Pascal uses "downto" and Ada uses
"reverse" for this), or for incrementing by any arbitrary value
(Modula-2 uses "by" for this with "by -1" to iterate in reverse)?
--
Keith Thompson (The_Other_Keith) Keith.S.Thompson+u@gmail.com
void Void(void) { Void(); } /* The recursive call of the void */
[toc] | [prev] | [next] | [standalone]
| From | bart <bc@freeuk.com> |
|---|---|
| Date | 2025-04-17 02:26 +0100 |
| Subject | Re: Loops (was Re: do { quit; } else { }) |
| Message-ID | <vtplcf$3duft$4@dont-email.me> |
| In reply to | #392638 |
On 17/04/2025 01:26, Keith Thompson wrote: > bart <bc@freeuk.com> writes: >> On 16/04/2025 21:03, Keith Thompson wrote: >>> bart <bc@freeuk.com> writes: >>>> On 16/04/2025 06:35, Janis Papanagnou wrote: >>>>> On 15.04.2025 22:46, bart wrote: >>>>>> On 15/04/2025 20:07, Scott Lurndal wrote: >>>>>>> [...] >>>>>>> Real for loops _are_ a three-way construct. >>>>>>> >>>>>>> [...] >>>>>> >>>>>> Any step other than 1 is unusual. [...] >>>> >>>>> Nonsense. Arithmetic loop steps other than one are noting unusual >>>>> and been supported by programming languages (and also been used) >>>>> since decades in programming. >>>> >>>> So what are you claiming, that the majority of loops in any given >>>> program will have steps other than +1 or -1? >>> Exactly, because "unusual" and "the majority" are the only >>> possibilities. >> >> I'm not sure what you're getting at. > > I think the misunderstanding is over the meaning of the rather > vague word "unusual". It seems to be happening a lot! SL is now claiming he never said what he did in fact say. JP has their own 'misunderstanding'. All trying to score some minor victory. Would it kill anybody here to admit I might be right about something or that I have a point? > > Did you really think that Janis was claiming that "the majority of > loops in any given program will have steps other than +1 or -1"? Why don't you ask them to clarify?
[toc] | [prev] | [next] | [standalone]
| From | Keith Thompson <Keith.S.Thompson+u@gmail.com> |
|---|---|
| Date | 2025-04-16 20:14 -0700 |
| Subject | Re: Loops (was Re: do { quit; } else { }) |
| Message-ID | <87ecxrzdgn.fsf@nosuchdomain.example.com> |
| In reply to | #392645 |
bart <bc@freeuk.com> writes:
> On 17/04/2025 01:26, Keith Thompson wrote:
[...]
>> I think the misunderstanding is over the meaning of the rather
>> vague word "unusual".
>
> It seems to be happening a lot! SL is now claiming he never said what
> he did in fact say. JP has their own 'misunderstanding'. All trying to
> score some minor victory.
>
> Would it kill anybody here to admit I might be right about something
> or that I have a point?
I have done so. It did not kill me.
>> Did you really think that Janis was claiming that "the majority of
>> loops in any given program will have steps other than +1 or -1"?
>
> Why don't you ask them to clarify?
Because I believed that I understood what was written well enough that
asking for clarification would have been noise. Because I am very
nearly certain that Janis does not believe, and did not claim, that "the
majority of loops in any given program will have steps other than +1 or
-1". I needed no clarification.
I've answered your question. Will you answer mine?
Or feel free to drop it and not reply at all.
--
Keith Thompson (The_Other_Keith) Keith.S.Thompson+u@gmail.com
void Void(void) { Void(); } /* The recursive call of the void */
[toc] | [prev] | [next] | [standalone]
| From | Janis Papanagnou <janis_papanagnou+ng@hotmail.com> |
|---|---|
| Date | 2025-04-18 15:37 +0200 |
| Subject | Re: Loops (was Re: do { quit; } else { }) |
| Message-ID | <vttkio$34as4$1@dont-email.me> |
| In reply to | #392638 |
On 17.04.2025 02:26, Keith Thompson wrote: > bart <bc@freeuk.com> writes: >> On 16/04/2025 21:03, Keith Thompson wrote: >>> bart <bc@freeuk.com> writes: >>>> On 16/04/2025 06:35, Janis Papanagnou wrote: >>>>> On 15.04.2025 22:46, bart wrote: >>>>>> On 15/04/2025 20:07, Scott Lurndal wrote: >>>>>>> [...] >>>>>>> Real for loops _are_ a three-way construct. >>>>>>> >>>>>>> [...] >>>>>> >>>>>> Any step other than 1 is unusual. [...] >>>> >>>>> Nonsense. Arithmetic loop steps other than one are noting unusual >>>>> and been supported by programming languages (and also been used) >>>>> since decades in programming. >>>> >>>> So what are you claiming, that the majority of loops in any given >>>> program will have steps other than +1 or -1? >>> Exactly, because "unusual" and "the majority" are the only >>> possibilities. >> >> I'm not sure what you're getting at. > > I think the misunderstanding is over the meaning of the rather > vague word "unusual". > > Did you really think that Janis was claiming that "the majority of > loops in any given program will have steps other than +1 or -1"? The "majority" is as a typical phrase introduced by bart as sort of substitute for an argument. (I usually avoid claims about presumed "majorities", about what "all" or "most" people here or everywhere else do.) It can be easily looked up what I wrote; but bart regularly just moves goalposts when he's lost, instead of accepting the obvious facts (or other opinions based on experiences or else). To reformulate (from memory) some basics I actually said... Statistics of 98% for simple loops are close to reality, IMO. Increments of +1/-1 were the rationale for Pascal's decision to support just such primitive loops.[*] You are lacking flexibility with only such primitive loops. Many language provided support more more types of useful loops. "C" loops have a flexibility that I appreciate and that I use. Statistical numbers have obviously changed for non-simple loops for languages that allow such usages. (...and maybe some more that I don't recall any more.) Janis [*] I'd like to take the opportunity to say that Pascal supports more than just simple "counted" loops; you can also iterate over any "scalar"[**], say, if you have an 'enum' type "red,blue,green" you can iterate from "red" to "green". [**] "Scalar" with non-mathematical meaning; every countable type. > [...]
[toc] | [prev] | [next] | [standalone]
| From | bart <bc@freeuk.com> |
|---|---|
| Date | 2025-04-18 15:19 +0100 |
| Subject | Re: Loops (was Re: do { quit; } else { }) |
| Message-ID | <vttn1n$3468v$1@dont-email.me> |
| In reply to | #392675 |
On 18/04/2025 14:37, Janis Papanagnou wrote:
> On 17.04.2025 02:26, Keith Thompson wrote:
>> bart <bc@freeuk.com> writes:
>>> On 16/04/2025 21:03, Keith Thompson wrote:
>>>> bart <bc@freeuk.com> writes:
>>>>> On 16/04/2025 06:35, Janis Papanagnou wrote:
>>>>>> On 15.04.2025 22:46, bart wrote:
>>>>>>> On 15/04/2025 20:07, Scott Lurndal wrote:
>>>>>>>> [...]
>>>>>>>> Real for loops _are_ a three-way construct.
>>>>>>>>
>>>>>>>> [...]
>>>>>>>
>>>>>>> Any step other than 1 is unusual. [...]
>>>>>
>>>>>> Nonsense. Arithmetic loop steps other than one are noting unusual
>>>>>> and been supported by programming languages (and also been used)
>>>>>> since decades in programming.
>>>>>
>>>>> So what are you claiming, that the majority of loops in any given
>>>>> program will have steps other than +1 or -1?
>>>> Exactly, because "unusual" and "the majority" are the only
>>>> possibilities.
>>>
>>> I'm not sure what you're getting at.
>>
>> I think the misunderstanding is over the meaning of the rather
>> vague word "unusual".
>>
>> Did you really think that Janis was claiming that "the majority of
>> loops in any given program will have steps other than +1 or -1"?
>
> The "majority" is as a typical phrase introduced by bart as sort of
> substitute for an argument. (I usually avoid claims about presumed
> "majorities", about what "all" or "most" people here or everywhere
> else do.)
>
> It can be easily looked up what I wrote; but bart regularly just
> moves goalposts when he's lost, instead of accepting the obvious
> facts (or other opinions based on experiences or else).
>
> To reformulate (from memory) some basics I actually said...
>
> Statistics of 98% for simple loops are close to reality,
I haven't been able to find that post. In any case, it was not in the
sequence of posts stemming from this one:
* Scott Lurndal (SL) makes a claim that all 'real' for-loops have 3
parts, like C's for(A; B; C) [point 1]
* He gave example of such loops in C, Basic and Fortran ...
* ... but used a step of +2 in those Basic and Fortran examples in
order to contrive to give them a third part [point 2]
This is where I complained that such a step in Basic and Fortran was
'unusual' (in fact it's so rare then I wasn't even sure of the syntax),
and which you called out as 'Nonsense'.
Later on:
* SL posts an example of 2-part C for-loop, which contradicts his claim
of all 'real' for loops having 3 parts [point 3] ...
* ... which also turns out to be highly incorrect [point 4]
What's puzzling me is this: why are letting those Points 1, 2, 3 and 4
go, but aiming all of your criticisms at me?
In fact you're still at it! Eg: "but bart regularly just moves
goalposts". So SL didn't move goalposts?
Regarding Point 4, nobody picked up on it except for Michael S.
Not you, nor KT or JK who are usually pedantic about such matters.
Yet I state something which is actually correct, you call that nonsense,
and everybody defends you and slams me!
Clear persecution, gaslighting, or both?
Please take a close look at your posting decisions: why you consistently
attack my posts, but let dubious posts from others slide.
> IMO.
> Increments of +1/-1 were the rationale for Pascal's decision to
> support just such primitive loops.[*]
> You are lacking flexibility with only such primitive loops.
> Many language provided support more more types of useful loops.
> "C" loops have a flexibility that I appreciate and that I use.
> Statistical numbers have obviously changed for non-simple loops
> for languages that allow such usages.
This is 'my' flexible loop:
do
....
od
Add whatever you like in place of ....
C doesn't have a dedicated endless loop; it has to be either while(1) or
(again!) for(;;). It might seem a small point, but it means I
acknowledge the importance of such a fundamental construct. It also
shows I don't don't consider it either a 'while' loop, or a 'for'.
[toc] | [prev] | [next] | [standalone]
| From | scott@slp53.sl.home (Scott Lurndal) |
|---|---|
| Date | 2025-04-18 16:58 +0000 |
| Subject | Re: Loops (was Re: do { quit; } else { }) |
| Message-ID | <TwvMP.2107973$eNx6.755301@fx14.iad> |
| In reply to | #392677 |
bart <bc@freeuk.com> writes: >On 18/04/2025 14:37, Janis Papanagnou wrote: > >* Scott Lurndal (SL) makes a claim that all 'real' for-loops have 3 > parts, like C's for(A; B; C) [point 1] Again you mischaracterize what was stated. I simply pointed out that most major programming languages have three component looping constructs using the 'for' keyword, including C. I made no claim about which percentage of real-world uses of the 'for' construct used all three parts. I do think your constant harping on a well-established and widely-used language that will never change to satisfy your personal idiosyncrocies is rather pointless, other than simple trolling.
[toc] | [prev] | [next] | [standalone]
| From | bart <bc@freeuk.com> |
|---|---|
| Date | 2025-04-18 18:27 +0100 |
| Subject | Re: Loops (was Re: do { quit; } else { }) |
| Message-ID | <vtu22g$3f353$1@dont-email.me> |
| In reply to | #392691 |
On 18/04/2025 17:58, Scott Lurndal wrote:
> bart <bc@freeuk.com> writes:
>> On 18/04/2025 14:37, Janis Papanagnou wrote:
>
>>
>> * Scott Lurndal (SL) makes a claim that all 'real' for-loops have 3
>> parts, like C's for(A; B; C) [point 1]
>
> Again you mischaracterize what was stated. I simply
> pointed out that most major programming languages have three component
> looping constructs using the 'for' keyword, including C.
Apart from C, simple iteration via a loop index has 4 things that need
to be denoted:
- Some keyword to say this is such a loop
- The loop index variable
- The start value
- The end value
Many can have an /optional/ step (or means to reverse the order) in the
odd cases where that is necessary, making 4/5 if you want to be formal.
C is quite different; it is merely 3 arbitrary expressions, the middle
one of which is used as a loop terminating condition (tested notionally
at the start of the loop).
But in cases where it is used to emulate the kind of loop described
above, then the same applies, except that:
- It will always be 5 parts (the step always has to be accounted for)
- Nearly everthing about how it works has to be imparted to the
compiler:
- The actual expression to initialise the variable
- The exact expression used for the terminating condition
- The exact expression used for incrementing to loop index
- The end value that appears in the terminating condition is
frequently offset (also can also be the case in real for-loops
used in 0-based languages)
- A loop which counts down may well have a quite different pattern
from an upward counting one
So a comparison between C for-loops and more formal ones is not that
meaningful.
[toc] | [prev] | [next] | [standalone]
| From | Janis Papanagnou <janis_papanagnou+ng@hotmail.com> |
|---|---|
| Date | 2025-04-19 09:09 +0200 |
| Subject | Re: Loops (was Re: do { quit; } else { }) |
| Message-ID | <vtvi6d$tm6c$1@dont-email.me> |
| In reply to | #392692 |
On 18.04.2025 19:27, bart wrote:
> [...]
>
> C is quite different; it is merely 3 arbitrary expressions, the middle
> one of which is used as a loop terminating condition (tested notionally
> at the start of the loop).
They're not "arbitrary".
They are chosen by the software designer to fulfill the demands.
You've already and often demonstrated that you have problems to
grok non-trivial loops. But I'll anyway support you with another
example (here from C++, but the principle is the same)
for (unsigned int i = 0; aa.notEmpty(); i++)
for (Arabic a = a2r_tab[i].arabic;
aa.contains(a);
aa.remove(a))
r += a2r_tab[i].roman;
for (unsigned int i = 0; rr.notEmpty(); i++)
for (Roman r = r2a_tab[i].roman;
rr.contains(r);
rr.remove (r))
a += r2a_tab[i].arabic;
All elements in the nested loops are algorithmically connected,
they are not "arbitrary". - I don't expect that (without context
or comments) anyone understands that; the point is that you just
cannot formulate the algorithm with primitive loops. And another
point is that these algorithms are using these _equivalent_ loop
hierarchies despite working on completely different data types,
so the (for you probably perceived as unrelated) interconnection
of the loop elements in the loop hierarchy is meaningful.
So I think above you meant to say that the loop expressions are
not "tightly coupled". - Yes, they are not, and thus can be used
in more advanced algorithmic contexts.
Janis
> [...]
[toc] | [prev] | [next] | [standalone]
| From | scott@slp53.sl.home (Scott Lurndal) |
|---|---|
| Date | 2025-04-17 00:59 +0000 |
| Subject | Re: Loops (was Re: do { quit; } else { }) |
| Message-ID | <NnYLP.249407$bYQ4.50060@fx41.iad> |
| In reply to | #392632 |
bart <bc@freeuk.com> writes: >On 16/04/2025 21:03, Keith Thompson wrote: >> bart <bc@freeuk.com> writes: >If you go back a few posts, Scott Lurndal was (1) trying to make out >that all for loops consist of 3 elements like C; You again resort to misleading summaries. Classic Troll.
[toc] | [prev] | [next] | [standalone]
| From | bart <bc@freeuk.com> |
|---|---|
| Date | 2025-04-17 02:09 +0100 |
| Subject | Re: Loops (was Re: do { quit; } else { }) |
| Message-ID | <vtpkc9$3duft$2@dont-email.me> |
| In reply to | #392641 |
On 17/04/2025 01:59, Scott Lurndal wrote: > bart <bc@freeuk.com> writes: >> On 16/04/2025 21:03, Keith Thompson wrote: >>> bart <bc@freeuk.com> writes: > >> If you go back a few posts, Scott Lurndal was (1) trying to make out >> that all for loops consist of 3 elements like C; > > You again resort to misleading summaries. Classic Troll. You said exactly that: SL: > Real for loops _are_ a three-way construct. You gave examples of BASIC and FORTRAN with 3 parts and compared to C with three parts. You're the fucking troll, mate.
[toc] | [prev] | [next] | [standalone]
| From | Kaz Kylheku <643-408-1753@kylheku.com> |
|---|---|
| Date | 2025-04-16 21:43 +0000 |
| Subject | Re: Loops (was Re: do { quit; } else { }) |
| Message-ID | <20250416142925.663@kylheku.com> |
| In reply to | #392605 |
On 2025-04-16, bart <bc@freeuk.com> wrote: > On 16/04/2025 06:35, Janis Papanagnou wrote: >> On 15.04.2025 22:46, bart wrote: >>> On 15/04/2025 20:07, Scott Lurndal wrote: >>>> [...] >>>> Real for loops _are_ a three-way construct. >>>> >>>> [...] >>> >>> Any step other than 1 is unusual. [...] > >> Nonsense. Arithmetic loop steps other than one are noting unusual >> and been supported by programming languages (and also been used) >> since decades in programming. > > So what are you claiming, that the majority of loops in any given > program will have steps other than +1 or -1? Hey Bart, how would you handle a loop like do x = m to n ... where m and n are not known until run time, and may be the extreme values of the type? Like C's INT_MIN and INT_MAX, respectively, where x is of type int. Because in this loop, x takes on every possible value of the type, we cannot have a loop guard which prevents entry of the loop body based on solely the value of x. The compilaton strategy we will likely pursue for this will be a bottom-of-the-loop test. That is to say, after executing an iteration, if x has the value n, then the loop terminates. Unfortunately, this pattern doesn't lend itself well to the for(;;) construct n C. The idiom for (x = m; x <= n; x++) only works when x may be incremented even when it is already equal to n. If the type is singned, like int, and n is INT_MAX, x++ is undefined behavior after the last iteration. So this is part of the reason why for leaves everything open; the C programmer can hand-wave away these issues based on the specific use case of the loop, whose details are in the open, making it obvious that the idiom doesn't fully generalize to every corner case. The for construct could use a way of indicating a bottom test, like, oh, I don't know: for (decl/expr; : expr ; expr) // or some better way Here, the : means, jump unconditionally into the first iteration, and test expr after each iteration, before doing the increment. Then we can do for (int i = INT_MIN; : i < INT_MAX; i++) After the last iteration, i is INT_MAX, and so the test fails. The loop terminates without performing i++. -- TXR Programming Language: http://nongnu.org/txr Cygnal: Cygwin Native Application Library: http://kylheku.com/cygnal Mastodon: @Kazinator@mstdn.ca
[toc] | [prev] | [next] | [standalone]
| From | bart <bc@freeuk.com> |
|---|---|
| Date | 2025-04-16 23:42 +0100 |
| Subject | Re: Loops (was Re: do { quit; } else { }) |
| Message-ID | <vtpbnm$357ma$2@dont-email.me> |
| In reply to | #392630 |
On 16/04/2025 22:43, Kaz Kylheku wrote:
> On 2025-04-16, bart <bc@freeuk.com> wrote:
>> On 16/04/2025 06:35, Janis Papanagnou wrote:
>>> On 15.04.2025 22:46, bart wrote:
>>>> On 15/04/2025 20:07, Scott Lurndal wrote:
>>>>> [...]
>>>>> Real for loops _are_ a three-way construct.
>>>>>
>>>>> [...]
>>>>
>>>> Any step other than 1 is unusual. [...]
>>
>>> Nonsense. Arithmetic loop steps other than one are noting unusual
>>> and been supported by programming languages (and also been used)
>>> since decades in programming.
>>
>> So what are you claiming, that the majority of loops in any given
>> program will have steps other than +1 or -1?
>
> Hey Bart, how would you handle a loop like
>
> do x = m to n ...
>
> where m and n are not known until run time, and may be the
> extreme values of the type? Like C's INT_MIN and INT_MAX, respectively,
> where x is of type int.
>
> Because in this loop, x takes on every possible value of the type,
> we cannot have a loop guard which prevents entry of the loop body
> based on solely the value of x.
I'm not exactly sure what you are asking. Is it a loop like this, here
in my language:
int n:=0
for i in i32.bounds do # ie. i32.min .. i32.max
++n
od
println n
This works fine; after a second or so it displays 4294967296.
However, this languages evaluates using 64 bits. Perhaps this loop may
demonstrate the issues better:
for i in i64.bounds do
However, I would estimate it would take 190 years to finish.
I assume you're thinking of C which uses i32 and where comparisons near
the extreme values of the type are problemetical. Or this line in my
language:
for i in i64.max-10 .. i64.max do println i
which doesn't stop (u64 is OK however). That doesn't worry me too much,
I can just add a Note to the language spec warning of UB when a for-loop
bound is at the limits of the type. Where all sorts of other stuff can
happen because of how values wrap.
Then workarounds are needed, for example:
i := a := i64.max-10
b := i64.max
to b-a+1 do
println i++
od
> The compilaton strategy we will likely pursue for this will be
> a bottom-of-the-loop test. That is to say, after executing
> an iteration, if x has the value n, then the loop terminates.
>
> Unfortunately, this pattern doesn't lend itself well to the
> for(;;) construct n C.
>
> The idiom for (x = m; x <= n; x++) only works when x may be
> incremented even when it is already equal to n.
>
> If the type is singned, like int, and n is INT_MAX, x++
> is undefined behavior after the last iteration.
>
> So this is part of the reason why for leaves everything open; the C
> programmer can hand-wave away these issues based on the specific use
> case of the loop, whose details are in the open, making it obvious that
> the idiom doesn't fully generalize to every corner case.
>
> The for construct could use a way of indicating a bottom test,
> like, oh, I don't know:
>
> for (decl/expr; : expr ; expr) // or some better way
>
> Here, the : means, jump unconditionally into the first iteration,
> and test expr after each iteration, before doing the increment.
>
> Then we can do
>
> for (int i = INT_MIN; : i < INT_MAX; i++)
>
> After the last iteration, i is INT_MAX, and so the test fails.
> The loop terminates without performing i++.
>
You're trying too hard. I don't think the language needs to bother
providing solutions, it just needs to specify the limitations.
If the user needs to know about, and remember in the rare instance it
comes up, dedicated language features, then the user can also come up
with their own workarounds as I showed. Eg. in C:
long long int i, a=INT_MIN, b=INT_MAX, n=0;
for (i = a; i<=b; ++i) ++n;
printf("%lld\n", n);
[toc] | [prev] | [next] | [standalone]
| From | Kaz Kylheku <643-408-1753@kylheku.com> |
|---|---|
| Date | 2025-04-16 23:49 +0000 |
| Subject | Re: Loops (was Re: do { quit; } else { }) |
| Message-ID | <20250416164536.110@kylheku.com> |
| In reply to | #392633 |
On 2025-04-16, bart <bc@freeuk.com> wrote: > On 16/04/2025 22:43, Kaz Kylheku wrote: >> On 2025-04-16, bart <bc@freeuk.com> wrote: >>> On 16/04/2025 06:35, Janis Papanagnou wrote: >>>> On 15.04.2025 22:46, bart wrote: >>>>> On 15/04/2025 20:07, Scott Lurndal wrote: >>>>>> [...] >>>>>> Real for loops _are_ a three-way construct. >>>>>> >>>>>> [...] >>>>> >>>>> Any step other than 1 is unusual. [...] >>> >>>> Nonsense. Arithmetic loop steps other than one are noting unusual >>>> and been supported by programming languages (and also been used) >>>> since decades in programming. >>> >>> So what are you claiming, that the majority of loops in any given >>> program will have steps other than +1 or -1? >> >> Hey Bart, how would you handle a loop like >> >> do x = m to n ... >> >> where m and n are not known until run time, and may be the >> extreme values of the type? Like C's INT_MIN and INT_MAX, respectively, >> where x is of type int. >> >> Because in this loop, x takes on every possible value of the type, >> we cannot have a loop guard which prevents entry of the loop body >> based on solely the value of x. > > I'm not exactly sure what you are asking. Is it a loop like this, here > in my language: > > int n:=0 > > for i in i32.bounds do # ie. i32.min .. i32.max > ++n > od > > println n > > This works fine; after a second or so it displays 4294967296. > > However, this languages evaluates using 64 bits. Perhaps this loop may > demonstrate the issues better: > > for i in i64.bounds do > > However, I would estimate it would take 190 years to finish. Sure, but you could have a loop that goes over the last n values of the range of i64, for a reasonably small n. > I assume you're thinking of C which uses i32 and where comparisons near > the extreme values of the type are problemetical. Or this line in my Comparisons aren't; gratuitous increments or displacements are. > language: > > for i in i64.max-10 .. i64.max do println i Exactly, small n. > which doesn't stop (u64 is OK however). What? That's a boogy bug. > That doesn't worry me too much, > I can just add a Note to the language spec warning of UB when a for-loop > bound is at the limits of the type. I will frame these words next time you cricize C of taking some easy way out and shirking doing the Right Thing with UB. > Where all sorts of other stuff can > happen because of how values wrap. You can fix all the other stuff at the language level also. >> Then we can do >> >> for (int i = INT_MIN; : i < INT_MAX; i++) >> >> After the last iteration, i is INT_MAX, and so the test fails. >> The loop terminates without performing i++. >> > > You're trying too hard. I don't think the language needs to bother > providing solutions, it just needs to specify the limitations. I don't understand why you're not in the C camp with these words. -- TXR Programming Language: http://nongnu.org/txr Cygnal: Cygwin Native Application Library: http://kylheku.com/cygnal Mastodon: @Kazinator@mstdn.ca
[toc] | [prev] | [next] | [standalone]
| From | bart <bc@freeuk.com> |
|---|---|
| Date | 2025-04-17 01:48 +0100 |
| Subject | Re: Loops (was Re: do { quit; } else { }) |
| Message-ID | <vtpj5h$3duft$1@dont-email.me> |
| In reply to | #392636 |
On 17/04/2025 00:49, Kaz Kylheku wrote: > On 2025-04-16, bart <bc@freeuk.com> wrote: >> language: >> >> for i in i64.max-10 .. i64.max do println i > > Exactly, small n. > >> which doesn't stop (u64 is OK however). > > What? That's a boogy bug. (Yeah. Backend problem which hardcoded signed compared. 'for' iteration has its own IL instruction.) > >> That doesn't worry me too much, >> I can just add a Note to the language spec warning of UB when a for-loop >> bound is at the limits of the type. > > I will frame these words next time you cricize C of taking some > easy way out and shirking doing the Right Thing with UB. I can make it implementation-defined since the behaviour can be predicted on the targets I will use. But in the language, if the natural wrap on overflow gives unexpected results, then you have a program bug. I think what you were alluding to was the implicit increment used to implement for-loops. Well this is the IL instruction for FOR that I mentioned above: (kforup, ..), # B+:=n; goto L when B<=C The increment is part of its behaviour. At the language level, I could explain how FOR is implemented, but I'd rather not do that. A note that upper and lower limits must be in the range i64.min + s .. i64.max - s (where s is the step size) can suffice. What's far more useful is that it naturally works with i64 so has limits 4 billion times bigger than you get with C's default 'int' type. >> Where all sorts of other stuff can >> happen because of how values wrap. > > You can fix all the other stuff at the language level also. How do you fix overflow of A * B? >>> Then we can do >>> >>> for (int i = INT_MIN; : i < INT_MAX; i++) >>> >>> After the last iteration, i is INT_MAX, and so the test fails. >>> The loop terminates without performing i++. >>> >> >> You're trying too hard. I don't think the language needs to bother >> providing solutions, it just needs to specify the limitations. > > I don't understand why you're not in the C camp with these words. I am in the C camp (I said exactly that a few days ago). I just don't like the way the visible language was designed, and think there are too many unreasonable UBs. There are plenty of higher level languages that can deal with this properly (I guess; I haven't tried them). Although those that have copied C's 'for'-loop syntax are likely to be using the same kind of loop iteration that can cause a problem. Maybe the language can detect overflow, but it won't help, as you want to loop to stop not abort the program. So it is not a solution.
[toc] | [prev] | [next] | [standalone]
| From | Keith Thompson <Keith.S.Thompson+u@gmail.com> |
|---|---|
| Date | 2025-04-16 19:18 -0700 |
| Subject | Re: Loops (was Re: do { quit; } else { }) |
| Message-ID | <87ikn3zg18.fsf@nosuchdomain.example.com> |
| In reply to | #392640 |
bart <bc@freeuk.com> writes:
[...]
> The increment is part of its behaviour. At the language level, I could
> explain how FOR is implemented, but I'd rather not do that.
Whereas for a language like C which is defined by a written standard,
the standard *must* specify the behavior at the language level
(not in terms of generated intermediate or machine code).
The fact that
for (int i = INT_MAX-1; i <= INT_MAX; i++);
has undefined behavior can be rigorously inferred from the language
definition.
> A note that upper and lower limits must be in the range i64.min + s
> .. i64.max - s (where s is the step size) can suffice.
>
> What's far more useful is that it naturally works with i64 so has
> limits 4 billion times bigger than you get with C's default 'int'
> type.
You know, of course, that C's int type is not necessarily 32 bits.
There is no "default" for the width of int. If you had written "with
32-bit int", that would have been clear and correct.
[...]
> Maybe the language can detect overflow, but it won't help, as you want
> to loop to stop not abort the program. So it is not a solution.
If you want to implement, say, an Ada-style for loop, detecting
overflow is not an issue at the language level. The issue is that
for the following (I think the Ada syntax is clear enough):
for I in Integer'Last-1 .. Integer'Last loop
// whatever
end loop;
the language semantics specify that the body of the loop must be
executed with I equal to Integer'Last-1, and then with I equal to
Integer'Last. It's the compiler's job to figure out how to do that,
either without triggering an overflow or by handling it cleanly enough
that it doesn't change the behavior.
C's for loop, which is both lower level and more flexible, does not
impose that particular burden on the compiler. It's up to the
programmer to ensure that a given for loop behaves as desired.
--
Keith Thompson (The_Other_Keith) Keith.S.Thompson+u@gmail.com
void Void(void) { Void(); } /* The recursive call of the void */
[toc] | [prev] | [next] | [standalone]
| From | bart <bc@freeuk.com> |
|---|---|
| Date | 2025-04-17 12:16 +0100 |
| Subject | Re: Loops (was Re: do { quit; } else { }) |
| Message-ID | <vtqnv9$hf83$1@dont-email.me> |
| In reply to | #392646 |
On 17/04/2025 03:18, Keith Thompson wrote: > bart <bc@freeuk.com> writes: > [...] >> The increment is part of its behaviour. At the language level, I could >> explain how FOR is implemented, but I'd rather not do that. > > Whereas for a language like C which is defined by a written standard, > the standard *must* specify the behavior at the language level > (not in terms of generated intermediate or machine code). At the language level, the behaviour of FOR loop variable iterating over A to B inclusive, simply has the variable assuming each of those values in turn. It doesn't say how it does that. However, it becomes more important if the language has anything to say about the value of the loop variable after the loop terminates (when its scope is not limited to the loop body as is the case in my language). Then the value might be B + step or B - step, depending on which way it iterates, using the current implementation. > The fact that > for (int i = INT_MAX-1; i <= INT_MAX; i++); > has undefined behavior can be rigorously inferred from the language > definition. > >> A note that upper and lower limits must be in the range i64.min + s >> .. i64.max - s (where s is the step size) can suffice. >> >> What's far more useful is that it naturally works with i64 so has >> limits 4 billion times bigger than you get with C's default 'int' >> type. > > You know, of course, that C's int type is not necessarily 32 bits. > There is no "default" for the width of int. If you had written "with > 32-bit int", that would have been clear and correct. I think it's perfectly reasonable for such discussions to assume 'int' is 32 bits. And to only qualify it only when it can matter. For computers in general, that assumption is likely to have held for at least 20 years, possible even 30. Or maybe you can tell me where I can buy a computer (not some board with an embedded microcontroller) where a C compiler for it has an 'int' type other than 32 bits (with either fewer bits, or more!). At present it only seems to bother you. Since if it REALLY bothered anyone here, nobody would be using 'int'; they'd be using int32_t or long, unless they're happy that their int values and intermediate calculations would be using only 16 bits. > [...] > >> Maybe the language can detect overflow, but it won't help, as you want >> to loop to stop not abort the program. So it is not a solution. > > If you want to implement, say, an Ada-style for loop, detecting > overflow is not an issue at the language level. The issue is that > for the following (I think the Ada syntax is clear enough): > > for I in Integer'Last-1 .. Integer'Last loop > // whatever > end loop; > > the language semantics specify that the body of the loop must be > executed with I equal to Integer'Last-1, and then with I equal to > Integer'Last. It's the compiler's job to figure out how to do that, > either without triggering an overflow or by handling it cleanly enough > that it doesn't change the behavior. Does it define what value I has when the loop terminates, or is the scope of I local to the loop body? > C's for loop, which is both lower level and more flexible, does not > impose that particular burden on the compiler. It's up to the > programmer to ensure that a given for loop behaves as desired. > My post a few hours ago said I'd found a way of getting better-defined behaviour, but I wasn't going to implement it. Well, I have done that test now. It replaces a "<=" compare with "==", and does the test before any incrementing. It seems to work. *But* it requires the loop variable to either be immutable (which it usually is in my language) or not be modified to have a value above B (for an A to B loop incrementing by +1). It also affects the value of the loop index after normal termination, since it will always be B, rather than B+1 etc. It's workable, but I'm a little happier with the way it was so that option is disabled.
[toc] | [prev] | [next] | [standalone]
| From | bart <bc@freeuk.com> |
|---|---|
| Date | 2025-04-17 14:36 +0100 |
| Subject | Re: Loops (was Re: do { quit; } else { }) |
| Message-ID | <vtr04m$m6l8$1@dont-email.me> |
| In reply to | #392651 |
On 17/04/2025 12:16, bart wrote: > On 17/04/2025 03:18, Keith Thompson wrote: >> If you want to implement, say, an Ada-style for loop, detecting >> overflow is not an issue at the language level. The issue is that >> for the following (I think the Ada syntax is clear enough): >> >> for I in Integer'Last-1 .. Integer'Last loop >> // whatever >> end loop; >> >> the language semantics specify that the body of the loop must be >> executed with I equal to Integer'Last-1, and then with I equal to >> Integer'Last. It's the compiler's job to figure out how to do that, >> either without triggering an overflow or by handling it cleanly enough >> that it doesn't change the behavior. > > Does it define what value I has when the loop terminates, or is the > scope of I local to the loop body? My experiments show that: (1) Loop variables only have scope within the loop (2) Loop variables are read-only; they cannot be modified by user code This makes it much simpler to get the desired behaviour of a loop index iterating up to the maximum value of the type. So a comparison with other languages (either C or mine) is not that fair. Mine can be more restrictive, and I can make it more so (eg. restrict the scope of loop variables), but I have no interest in reimplementing Ada.
[toc] | [prev] | [next] | [standalone]
| From | Keith Thompson <Keith.S.Thompson+u@gmail.com> |
|---|---|
| Date | 2025-04-17 11:47 -0700 |
| Subject | Re: Loops (was Re: do { quit; } else { }) |
| Message-ID | <87fri68w2c.fsf@nosuchdomain.example.com> |
| In reply to | #392651 |
bart <bc@freeuk.com> writes:
> On 17/04/2025 03:18, Keith Thompson wrote:
>> bart <bc@freeuk.com> writes:
>> [...]
>>> The increment is part of its behaviour. At the language level, I could
>>> explain how FOR is implemented, but I'd rather not do that.
>> Whereas for a language like C which is defined by a written
>> standard,
>> the standard *must* specify the behavior at the language level
>> (not in terms of generated intermediate or machine code).
>
> At the language level, the behaviour of FOR loop variable iterating
> over A to B inclusive, simply has the variable assuming each of those
> values in turn. It doesn't say how it does that.
Does this refer to your own language? I thought you said it had issues
when the upper bound is the maximum value of the type. If that's the
case, then either the language-level description has to describe the
behavior in that case, or you don't have an accurate language-level
description.
> However, it becomes more important if the language has anything to say
> about the value of the loop variable after the loop terminates (when
> its scope is not limited to the loop body as is the case in my
> language).
>
> Then the value might be B + step or B - step, depending on which way
> it iterates, using the current implementation.
C doesn't cover that explicitly because it doesn't need to. Formally,
there's no such thing as a "loop variable".
Ada doesn't need to, because the loop variable is local to the loop (and
read-only within it).
Pascal says the value of the control variable is undefined after the
loop.
IMHO it doesn't much matter what the value is after the loop ends, but
any standard for a language with such a feature should either restrict
the scope to the loop, specify the value the variable has after the
loop, or explicitly say that it's unspecified or undefined.
>> The fact that
>> for (int i = INT_MAX-1; i <= INT_MAX; i++);
>> has undefined behavior can be rigorously inferred from the language
>> definition.
>>
>>> A note that upper and lower limits must be in the range i64.min + s
>>> .. i64.max - s (where s is the step size) can suffice.
>>>
>>> What's far more useful is that it naturally works with i64 so has
>>> limits 4 billion times bigger than you get with C's default 'int'
>>> type.
>> You know, of course, that C's int type is not necessarily 32 bits.
>> There is no "default" for the width of int. If you had written "with
>> 32-bit int", that would have been clear and correct.
>
> I think it's perfectly reasonable for such discussions to assume 'int'
> is 32 bits. And to only qualify it only when it can matter.
I don't.
> For computers in general, that assumption is likely to have held for
> at least 20 years, possible even 30.
>
> Or maybe you can tell me where I can buy a computer (not some board
> with an embedded microcontroller) where a C compiler for it has an
> 'int' type other than 32 bits (with either fewer bits, or more!).
Not the point. It's about what "int" *means*. It doesn't mean "a
32-bit integer".
> At present it only seems to bother you. Since if it REALLY bothered
> anyone here, nobody would be using 'int'; they'd be using int32_t or
> long, unless they're happy that their int values and intermediate
> calculations would be using only 16 bits.
POSIX and Windows both guarantee that int is at least 32 bits wide, and
it's perfectly reasonable to rely on those guarantees on those platforms.
It would be so easy for you to get this right, but you don't even
acknowledge the possibility that I might have a valid point.
[...]
--
Keith Thompson (The_Other_Keith) Keith.S.Thompson+u@gmail.com
void Void(void) { Void(); } /* The recursive call of the void */
[toc] | [prev] | [next] | [standalone]
| From | bart <bc@freeuk.com> |
|---|---|
| Date | 2025-04-17 20:18 +0100 |
| Subject | Re: Loops (was Re: do { quit; } else { }) |
| Message-ID | <vtrk73$19iev$1@dont-email.me> |
| In reply to | #392657 |
On 17/04/2025 19:47, Keith Thompson wrote: > bart <bc@freeuk.com> writes: >> Or maybe you can tell me where I can buy a computer (not some board >> with an embedded microcontroller) where a C compiler for it has an >> 'int' type other than 32 bits (with either fewer bits, or more!). > > Not the point. It's about what "int" *means*. It doesn't mean "a > 32-bit integer". > >> At present it only seems to bother you. Since if it REALLY bothered >> anyone here, nobody would be using 'int'; they'd be using int32_t or >> long, unless they're happy that their int values and intermediate >> calculations would be using only 16 bits. > > POSIX and Windows both guarantee that int is at least 32 bits wide, and > it's perfectly reasonable to rely on those guarantees on those platforms. > > It would be so easy for you to get this right, but you don't even > acknowledge the possibility that I might have a valid point. It's an obscure, pedantic point. A better one is that if considering only Windows and POSIX (what about MacOS or Android?), then you admit int will be 32 bits (at least, but I'm not holding my breath for 64). That means that if either of those OSes are implied, then we can assume that 'int' means a 32-byte to near 100% likelihood. That saves thousands of posters having to qualify every reference to 'int' with '[on POSIX or Windows]' or 'when it is exactly 32 bits'. That would be ironic if they have been making that assumption in their source code for years and decades, where it would be critical, but are not allowed to do so on long-running Usenet discusssions where it doesn't really matter. So, like you get tired of my keeping on defending my stances from attacks on multiple fronts, I get tired of having remember that some specialised hardware that runs C may have a 16-bit int or something equally unusual. In that case, why don't I save time by stating: * Whenever I mention 'int' type in the context of C, it means the 32-bit type * If I intend it to mean anything other than that, I will say so.
[toc] | [prev] | [next] | [standalone]
| From | Keith Thompson <Keith.S.Thompson+u@gmail.com> |
|---|---|
| Date | 2025-04-17 12:55 -0700 |
| Subject | Re: Loops (was Re: do { quit; } else { }) |
| Message-ID | <87fri6pnpo.fsf@nosuchdomain.example.com> |
| In reply to | #392658 |
bart <bc@freeuk.com> writes:
> On 17/04/2025 19:47, Keith Thompson wrote:
>> bart <bc@freeuk.com> writes:
>
>>> Or maybe you can tell me where I can buy a computer (not some board
>>> with an embedded microcontroller) where a C compiler for it has an
>>> 'int' type other than 32 bits (with either fewer bits, or more!).
>> Not the point. It's about what "int" *means*. It doesn't mean "a
>> 32-bit integer".
>>
>>> At present it only seems to bother you. Since if it REALLY bothered
>>> anyone here, nobody would be using 'int'; they'd be using int32_t or
>>> long, unless they're happy that their int values and intermediate
>>> calculations would be using only 16 bits.
>> POSIX and Windows both guarantee that int is at least 32 bits wide,
>> and
>> it's perfectly reasonable to rely on those guarantees on those platforms.
>> It would be so easy for you to get this right, but you don't even
>> acknowledge the possibility that I might have a valid point.
>
> It's an obscure, pedantic point.
I'd say that I disagree, but I don't feel the need to make the same
point repeatedly.
> A better one is that if considering only Windows and POSIX (what about
> MacOS or Android?), then you admit int will be 32 bits (at least, but
> I'm not holding my breath for 64).
MacOS and Android are both POSIX-based systems.
> That means that if either of those OSes are implied, then we can
> assume that 'int' means a 32-byte to near 100% likelihood.
In this context, neither of those OSes was implied. The discussion was
about the semantics of for loops, applicable to all C implementations
(and all implementations of the other languages that crept into the
discussion).
And POSIX requires int to be *at least* 32 bits wide, though systems with
int wider than 32 bits are rare.
> That saves thousands of posters having to qualify every reference to
> 'int' with '[on POSIX or Windows]' or 'when it is exactly 32 bits'.
Most references to int do not depend on its width. For contexts where
it does matter, like the remark that has triggered this subthread, you
can just say "32-bit int".
Here's what you wrote upthread:
What's far more useful is that it naturally works with i64 so has
limits 4 billion times bigger than you get with C's default 'int'
type.
Here's what you could have written:
What's far more useful is that it naturally works with i64 so has
limits 4 billion times bigger than you get with 32-bit int.
That's clearer, shorter, and correct, and would have avoided this
entire subthread. I would not have commented on it.
> That would be ironic if they have been making that assumption in their
> source code for years and decades, where it would be critical, but are
> not allowed to do so on long-running Usenet discusssions where it
> doesn't really matter.
>
> So, like you get tired of my keeping on defending my stances from
> attacks on multiple fronts, I get tired of having remember that some
> specialised hardware that runs C may have a 16-bit int or something
> equally unusual.
All you have to remember is what C says about int.
You already knew that C only requires to be at least 16 bits. I do not
believe for a moment that you weren't aware of that.
> In that case, why don't I save time by stating:
>
> * Whenever I mention 'int' type in the context of C, it means the
> 32-bit type
>
> * If I intend it to mean anything other than that, I will say so.
Again, if you had just said "32-bit int", there wouldn't have been
a problem.
And again, you refuse to acknowledge that I might have a valid point,
something you've repeatedly demanded from others (and failed to
acknowledge when it actually happens).
"int" is a technical term defined by the C standard. If you
deliberately use it incorrectly, you're going to get some pushback.
It's difficult to avoid the conclusion that that's exactly what
you want.
--
Keith Thompson (The_Other_Keith) Keith.S.Thompson+u@gmail.com
void Void(void) { Void(); } /* The recursive call of the void */
[toc] | [prev] | [next] | [standalone]
Page 17 of 35 — ← Prev page 1 … 15 16 [17] 18 19 … 35 Next page →
Back to top | Article view | comp.lang.c
csiph-web