Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.lang.c > #396916 > unrolled thread
| Started by | Bonita Montero <Bonita.Montero@gmail.com> |
|---|---|
| First post | 2026-03-12 07:24 +0100 |
| Last post | 2026-03-27 17:03 +0000 |
| Articles | 20 on this page of 231 — 18 participants |
Back to article view | Back to comp.lang.c
Isn't that beauty ? Bonita Montero <Bonita.Montero@gmail.com> - 2026-03-12 07:24 +0100
Re: Isn't that beauty ? Bonita Montero <Bonita.Montero@gmail.com> - 2026-03-12 07:26 +0100
Re: Isn't that beauty ? Janis Papanagnou <janis_papanagnou+ng@hotmail.com> - 2026-03-12 09:32 +0100
Re: Isn't that beauty ? Bonita Montero <Bonita.Montero@gmail.com> - 2026-03-12 11:36 +0100
Re: Isn't that beauty ? Janis Papanagnou <janis_papanagnou@hotmail.com> - 2026-03-12 20:15 +0100
Re: Isn't that beauty ? (no it's not) DFS <nospam@dfs.com> - 2026-03-12 10:00 -0400
Re: Isn't that beauty ? (no it's not) Bonita Montero <Bonita.Montero@gmail.com> - 2026-03-12 15:03 +0100
Re: Isn't that beauty ? (no it's not) tTh <tth@none.invalid> - 2026-03-12 15:27 +0100
Re: Isn't that beauty ? (no it's not) Bonita Montero <Bonita.Montero@gmail.com> - 2026-03-12 15:34 +0100
Re: Isn't that beauty ? (no it's not) Bonita Montero <Bonita.Montero@gmail.com> - 2026-03-12 15:13 +0100
Re: Isn't that beauty ? (no it's not) DFS <nospam@dfs.com> - 2026-03-12 10:43 -0400
Re: Isn't that beauty ? (no it's not) Bonita Montero <Bonita.Montero@gmail.com> - 2026-03-12 16:10 +0100
Re: Isn't that beauty ? (no it's not) DFS <nospam@dfs.com> - 2026-03-12 11:22 -0400
Re: Isn't that beauty ? (no it's not) Bonita Montero <Bonita.Montero@gmail.com> - 2026-03-12 16:25 +0100
Re: Isn't that beauty ? (no it's not) Bonita Montero <Bonita.Montero@gmail.com> - 2026-03-12 16:25 +0100
Re: Isn't that beauty ? (no it's not) Bonita Montero <Bonita.Montero@gmail.com> - 2026-03-12 16:48 +0100
Re: Isn't that beauty ? (no it's not) Janis Papanagnou <janis_papanagnou@hotmail.com> - 2026-03-12 20:25 +0100
Re: Isn't that beauty ? (no it's not) Bonita Montero <Bonita.Montero@gmail.com> - 2026-03-13 00:57 +0100
Re: Isn't that beauty ? (no it's not) Janis Papanagnou <janis_papanagnou@hotmail.com> - 2026-03-13 02:19 +0100
Re: Isn't that beauty ? (no it's not) Bonita Montero <Bonita.Montero@gmail.com> - 2026-03-13 06:14 +0100
Re: Isn't that beauty ? (no it's not) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2026-03-13 01:48 -0700
Re: Isn't that beauty ? (no it's not) Bonita Montero <Bonita.Montero@gmail.com> - 2026-03-13 09:49 +0100
[OT] AI - questions and answers (was Re: Isn't that beauty ? (no it's not)) Janis Papanagnou <janis_papanagnou+ng@hotmail.com> - 2026-03-13 10:27 +0100
Re: Isn't that beauty ? (no it's not) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2026-03-13 11:59 -0700
Re: Isn't that beauty ? (no it's not) DFS <nospam@dfs.com> - 2026-03-12 21:22 -0400
Re: Isn't that beauty ? (no it's not) Bonita Montero <Bonita.Montero@gmail.com> - 2026-03-13 06:15 +0100
Re: Isn't that beauty ? (no it's not) Bonita Montero <Bonita.Montero@gmail.com> - 2026-03-14 06:48 +0100
Re: Isn't that beauty ? (no it's not) DFS <nospam@dfs.com> - 2026-03-14 03:29 -0400
Re: Isn't that beauty ? (no it's not) Bonita Montero <Bonita.Montero@gmail.com> - 2026-03-12 16:44 +0100
Re: Isn't that beauty ? (no it's not) scott@slp53.sl.home (Scott Lurndal) - 2026-03-12 17:32 +0000
Re: Isn't that beauty ? (no it's not) Bonita Montero <Bonita.Montero@gmail.com> - 2026-03-13 00:56 +0100
Re: Isn't that beauty ? (no it's not) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2026-03-13 11:54 -0700
Re: Isn't that beauty ? (no it's not) Bonita Montero <Bonita.Montero@gmail.com> - 2026-03-13 01:14 +0100
Re: Isn't that beauty ? (no it's not) DFS <nospam@dfs.com> - 2026-03-12 16:18 -0400
Re: Isn't that beauty ? (no it's not) Bonita Montero <Bonita.Montero@gmail.com> - 2026-03-13 01:06 +0100
Re: Isn't that beauty ? (no it's not) Bonita Montero <Bonita.Montero@gmail.com> - 2026-03-13 01:27 +0100
Re: Isn't that beauty ? (no it's not) DFS <nospam@dfs.com> - 2026-03-13 16:11 -0400
Re: Isn't that beauty ? (no it's not) Bonita Montero <Bonita.Montero@gmail.com> - 2026-03-14 06:01 +0100
Re: Isn't that beauty ? (no it's not) DFS <nospam@dfs.com> - 2026-03-14 01:49 -0400
Re: Isn't that beauty ? (no it's not) Bonita Montero <Bonita.Montero@gmail.com> - 2026-03-14 07:23 +0100
Re: Isn't that beauty ? (no it's not) DFS <nospam@dfs.com> - 2026-03-14 02:58 -0400
Re: Isn't that beauty ? (no it's not) Bonita Montero <Bonita.Montero@gmail.com> - 2026-03-14 07:52 +0100
Re: Isn't that beauty ? (no it's not) Bonita Montero <Bonita.Montero@gmail.com> - 2026-03-14 07:53 +0100
Re: Isn't that beauty ? (no it's not) DFS <nospam@dfs.com> - 2026-03-14 03:05 -0400
Re: Isn't that beauty ? (no it's not) Bonita Montero <Bonita.Montero@gmail.com> - 2026-03-14 08:10 +0100
Re: Isn't that beauty ? (no it's not) DFS <nospam@dfs.com> - 2026-03-14 03:17 -0400
Re: Isn't that beauty ? (no it's not) Bonita Montero <Bonita.Montero@gmail.com> - 2026-03-14 08:59 +0100
Re: Isn't that beauty ? (no it's not) Bonita Montero <Bonita.Montero@gmail.com> - 2026-03-14 09:12 +0100
Re: Isn't that beauty ? (no it's not) Bart <bc@freeuk.com> - 2026-03-14 12:15 +0000
Re: Isn't that beauty ? (no it's not) Bonita Montero <Bonita.Montero@gmail.com> - 2026-03-14 14:00 +0100
Re: Isn't that beauty ? (no it's not) DFS <nospam@dfs.com> - 2026-03-16 16:43 -0400
Re: Isn't that beauty ? (no it's not) scott@slp53.sl.home (Scott Lurndal) - 2026-03-16 20:57 +0000
Re: Isn't that beauty ? (no it's not) DFS <nospam@dfs.com> - 2026-03-16 19:07 -0400
Re: Isn't that beauty ? (no it's not) Tristan Wibberley <tristan.wibberley+netnews2@alumni.manchester.ac.uk> - 2026-03-17 00:49 +0000
Re: Isn't that beauty ? (no it's not) Janis Papanagnou <janis_papanagnou+ng@hotmail.com> - 2026-03-17 05:21 +0100
Re: Isn't that beauty ? (no it's not) DFS <nospam@dfs.com> - 2026-03-18 12:40 -0400
Re: Isn't that beauty ? (no it's not) Bart <bc@freeuk.com> - 2026-03-18 17:06 +0000
Re: Isn't that beauty ? (no it's not) DFS <nospam@dfs.com> - 2026-03-18 15:46 -0400
Re: Isn't that beauty ? (no it's not) Bart <bc@freeuk.com> - 2026-03-18 22:14 +0000
Re: Isn't that beauty ? (no it's not) Tristan Wibberley <tristan.wibberley+netnews2@alumni.manchester.ac.uk> - 2026-03-19 22:39 +0000
Re: Isn't that beauty ? (no it's not) DFS <nospam@dfs.com> - 2026-03-18 16:14 -0400
Re: Isn't that beauty ? (no it's not) Tristan Wibberley <tristan.wibberley+netnews2@alumni.manchester.ac.uk> - 2026-03-19 22:42 +0000
Re: Isn't that beauty ? (no it's not) scott@slp53.sl.home (Scott Lurndal) - 2026-03-17 14:46 +0000
Re: Isn't that beauty ? (no it's not) Richard Harnden <richard.nospam@gmail.invalid> - 2026-03-16 22:26 +0000
Re: Isn't that beauty ? (no it's not) Bart <bc@freeuk.com> - 2026-03-16 22:35 +0000
Re: Isn't that beauty ? (no it's not) DFS <nospam@dfs.com> - 2026-03-16 19:09 -0400
Re: Isn't that beauty ? (no it's not) Richard Harnden <richard.nospam@gmail.invalid> - 2026-03-16 23:17 +0000
Re: Isn't that beauty ? (no it's not) DFS <nospam@dfs.com> - 2026-03-16 19:21 -0400
Re: Isn't that beauty ? (no it's not) Richard Harnden <richard.nospam@gmail.invalid> - 2026-03-16 23:34 +0000
Re: Isn't that beauty ? (no it's not) Richard Harnden <richard.nospam@gmail.invalid> - 2026-03-17 00:09 +0000
Re: Isn't that beauty ? (no it's not) DFS <nospam@dfs.com> - 2026-03-16 21:45 -0400
Re: Isn't that beauty ? (no it's not) Richard Harnden <richard.nospam@gmail.invalid> - 2026-03-17 10:42 +0000
Re: Isn't that beauty ? (no it's not) Janis Papanagnou <janis_papanagnou+ng@hotmail.com> - 2026-03-17 13:04 +0100
Re: Isn't that beauty ? (no it's not) Richard Harnden <richard.nospam@gmail.invalid> - 2026-03-17 12:17 +0000
Re: Isn't that beauty ? (no it's not) Bart <bc@freeuk.com> - 2026-03-17 12:31 +0000
Re: Isn't that beauty ? (no it's not) DFS <nospam@dfs.com> - 2026-03-16 21:27 -0400
Re: Isn't that beauty ? (no it's not) Bart <bc@freeuk.com> - 2026-03-16 22:26 +0000
Re: Isn't that beauty ? (no it's not) DFS <nospam@dfs.com> - 2026-03-16 19:41 -0400
Re: Isn't that beauty ? (no it's not) Bart <bc@freeuk.com> - 2026-03-17 00:29 +0000
Re: Isn't that beauty ? (no it's not) Janis Papanagnou <janis_papanagnou+ng@hotmail.com> - 2026-03-17 05:38 +0100
Re: Isn't that beauty ? (no it's not) Bart <bc@freeuk.com> - 2026-03-17 11:47 +0000
Re: Isn't that beauty ? (no it's not) Janis Papanagnou <janis_papanagnou+ng@hotmail.com> - 2026-03-17 13:08 +0100
Re: Isn't that beauty ? (no it's not) Bart <bc@freeuk.com> - 2026-03-17 12:37 +0000
Re: Isn't that beauty ? (no it's not) Janis Papanagnou <janis_papanagnou+ng@hotmail.com> - 2026-03-18 02:40 +0100
Re: Isn't that beauty ? (no it's not) Michael S <already5chosen@yahoo.com> - 2026-03-18 11:21 +0200
Re: Isn't that beauty ? (no it's not) Janis Papanagnou <janis_papanagnou+ng@hotmail.com> - 2026-03-18 10:49 +0100
Re: Isn't that beauty ? (no it's not) Bart <bc@freeuk.com> - 2026-03-18 15:10 +0000
Re: Isn't that beauty ? (no it's not) antispam@fricas.org (Waldek Hebisch) - 2026-03-18 21:20 +0000
Re: Isn't that beauty ? (no it's not) Bart <bc@freeuk.com> - 2026-03-18 23:13 +0000
Re: Isn't that beauty ? (no it's not) Tim Rentsch <tr.17687@z991.linuxsc.com> - 2026-04-06 13:23 -0700
Re: Isn't that beauty ? (no it's not) David Brown <david.brown@hesbynett.no> - 2026-03-18 11:20 +0100
Re: Isn't that beauty ? (no it's not) Janis Papanagnou <janis_papanagnou+ng@hotmail.com> - 2026-03-18 21:57 +0100
Re: Isn't that beauty ? (no it's not) Janis Papanagnou <janis_papanagnou+ng@hotmail.com> - 2026-03-18 22:01 +0100
Re: Isn't that beauty ? (no it's not) David Brown <david.brown@hesbynett.no> - 2026-03-19 10:43 +0100
Re: Isn't that beauty ? (no it's not) Michael S <already5chosen@yahoo.com> - 2026-03-19 12:23 +0200
Re: Isn't that beauty ? (no it's not) David Brown <david.brown@hesbynett.no> - 2026-03-19 15:22 +0100
Re: Isn't that beauty ? (no it's not) scott@slp53.sl.home (Scott Lurndal) - 2026-03-19 15:07 +0000
Re: Isn't that beauty ? (no it's not) Janis Papanagnou <janis_papanagnou+ng@hotmail.com> - 2026-03-20 04:16 +0100
Re: Isn't that beauty ? (no it's not) Keith Thompson <Keith.S.Thompson+u@gmail.com> - 2026-03-20 02:14 -0700
Re: Isn't that beauty ? (no it's not) Janis Papanagnou <janis_papanagnou+ng@hotmail.com> - 2026-03-20 12:38 +0100
Re: Isn't that beauty ? (no it's not) Bonita Montero <Bonita.Montero@gmail.com> - 2026-03-20 13:06 +0100
Re: Isn't that beauty ? (no it's not) Janis Papanagnou <janis_papanagnou+ng@hotmail.com> - 2026-03-20 13:27 +0100
Re: Isn't that beauty ? (no it's not) Keith Thompson <Keith.S.Thompson+u@gmail.com> - 2026-03-20 13:22 -0700
Re: Isn't that beauty ? (no it's not) Janis Papanagnou <janis_papanagnou+ng@hotmail.com> - 2026-03-21 02:25 +0100
Re: Isn't that beauty ? (no it's not) Bonita Montero <Bonita.Montero@gmail.com> - 2026-03-19 16:13 +0100
Re: Isn't that beauty ? (no it's not) Michael S <already5chosen@yahoo.com> - 2026-03-19 17:41 +0200
Re: Isn't that beauty ? (no it's not) Janis Papanagnou <janis_papanagnou+ng@hotmail.com> - 2026-03-20 04:01 +0100
Re: Isn't that beauty ? (no it's not) David Brown <david.brown@hesbynett.no> - 2026-03-20 08:35 +0100
Re: Isn't that beauty ? (no it's not) Janis Papanagnou <janis_papanagnou+ng@hotmail.com> - 2026-03-20 12:47 +0100
Re: Isn't that beauty ? (no it's not) Michael S <already5chosen@yahoo.com> - 2026-03-20 14:42 +0200
Re: Isn't that beauty ? (no it's not) Janis Papanagnou <janis_papanagnou+ng@hotmail.com> - 2026-03-22 04:39 +0100
Re: Isn't that beauty ? (no it's not) Michael S <already5chosen@yahoo.com> - 2026-03-22 08:33 +0200
Re: Isn't that beauty ? (no it's not) DFS <nospam@dfs.com> - 2026-03-20 17:10 -0400
Re: Isn't that beauty ? (no it's not) Janis Papanagnou <janis_papanagnou+ng@hotmail.com> - 2026-03-21 02:53 +0100
Re: Isn't that beauty ? (no it's not) DFS <nospam@dfs.com> - 2026-03-20 22:35 -0400
Re: Isn't that beauty ? (no it's not) Bart <bc@freeuk.com> - 2026-03-21 14:42 +0000
Re: Isn't that beauty ? (no it's not) Janis Papanagnou <janis_papanagnou+ng@hotmail.com> - 2026-03-22 04:57 +0100
Re: Isn't that beauty ? (no it's not) Tim Rentsch <tr.17687@z991.linuxsc.com> - 2026-04-06 12:32 -0700
Re: Isn't that beauty ? (no it's not) Janis Papanagnou <janis_papanagnou+ng@hotmail.com> - 2026-03-22 04:50 +0100
Re: Isn't that beauty ? (no it's not) David Brown <david.brown@hesbynett.no> - 2026-03-21 15:39 +0100
Re: Isn't that beauty ? (no it's not) DFS <nospam@dfs.com> - 2026-03-22 15:48 -0400
Re: Isn't that beauty ? (no it's not) David Brown <david.brown@hesbynett.no> - 2026-03-22 23:04 +0100
Re: Isn't that beauty ? (no it's not) antispam@fricas.org (Waldek Hebisch) - 2026-03-19 13:28 +0000
Re: Isn't that beauty ? (no it's not) Janis Papanagnou <janis_papanagnou+ng@hotmail.com> - 2026-03-20 03:45 +0100
Re: Isn't that beauty ? (no it's not) Michael S <already5chosen@yahoo.com> - 2026-03-19 11:19 +0200
Re: Isn't that beauty ? (no it's not) David Brown <david.brown@hesbynett.no> - 2026-03-19 10:49 +0100
Re: Isn't that beauty ? (no it's not) antispam@fricas.org (Waldek Hebisch) - 2026-03-19 14:09 +0000
Re: Isn't that beauty ? (no it's not) Bart <bc@freeuk.com> - 2026-03-19 14:49 +0000
Re: Isn't that beauty ? (no it's not) Michael S <already5chosen@yahoo.com> - 2026-03-19 17:09 +0200
sorting Was: Isn't that beauty ? (no it's not) Michael S <already5chosen@yahoo.com> - 2026-03-19 17:29 +0200
Re: sorting Was: Isn't that beauty ? (no it's not) Bart <bc@freeuk.com> - 2026-03-19 18:33 +0000
Re: sorting Was: Isn't that beauty ? (no it's not) Michael S <already5chosen@yahoo.com> - 2026-03-19 21:40 +0200
Re: sorting Was: Isn't that beauty ? (no it's not) Bart <bc@freeuk.com> - 2026-03-19 23:53 +0000
Re: sorting Was: Isn't that beauty ? (no it's not) Bart <bc@freeuk.com> - 2026-03-20 00:15 +0000
Re: sorting Was: Isn't that beauty ? (no it's not) Janis Papanagnou <janis_papanagnou+ng@hotmail.com> - 2026-03-20 05:05 +0100
Re: sorting Was: Isn't that beauty ? (no it's not) Michael S <already5chosen@yahoo.com> - 2026-03-20 12:58 +0200
Re: sorting Was: Isn't that beauty ? (no it's not) Janis Papanagnou <janis_papanagnou+ng@hotmail.com> - 2026-03-20 12:53 +0100
Re: sorting Was: Isn't that beauty ? (no it's not) Janis Papanagnou <janis_papanagnou+ng@hotmail.com> - 2026-03-20 13:13 +0100
Re: sorting Was: Isn't that beauty ? (no it's not) David Brown <david.brown@hesbynett.no> - 2026-03-20 13:26 +0100
Re: sorting Was: Isn't that beauty ? (no it's not) Michael S <already5chosen@yahoo.com> - 2026-03-20 15:08 +0200
Re: sorting Was: Isn't that beauty ? (no it's not) Bart <bc@freeuk.com> - 2026-03-20 13:43 +0000
Re: sorting Was: Isn't that beauty ? (no it's not) Michael S <already5chosen@yahoo.com> - 2026-03-20 15:51 +0200
Re: sorting Was: Isn't that beauty ? (no it's not) David Brown <david.brown@hesbynett.no> - 2026-03-20 14:47 +0100
Re: sorting Was: Isn't that beauty ? (no it's not) Michael S <already5chosen@yahoo.com> - 2026-03-22 02:03 +0200
Re: sorting Was: Isn't that beauty ? (no it's not) Janis Papanagnou <janis_papanagnou+ng@hotmail.com> - 2026-03-22 04:03 +0100
Re: sorting Was: Isn't that beauty ? (no it's not) Tim Rentsch <tr.17687@z991.linuxsc.com> - 2026-04-06 15:13 -0700
Re: sorting Was: Isn't that beauty ? (no it's not) Michael S <already5chosen@yahoo.com> - 2026-04-07 02:22 +0300
Re: sorting Was: Isn't that beauty ? (no it's not) Tim Rentsch <tr.17687@z991.linuxsc.com> - 2026-04-06 21:00 -0700
Re: sorting Was: Isn't that beauty ? (no it's not) Michael S <already5chosen@yahoo.com> - 2026-04-07 09:37 +0300
Re: sorting Was: Isn't that beauty ? (no it's not) Tim Rentsch <tr.17687@z991.linuxsc.com> - 2026-04-07 21:54 -0700
Re: sorting Was: Isn't that beauty ? (no it's not) cross@spitfire.i.gajendra.net (Dan Cross) - 2026-04-09 16:06 +0000
Re: sorting Was: Isn't that beauty ? (no it's not) Tim Rentsch <tr.17687@z991.linuxsc.com> - 2026-04-11 09:04 -0700
Re: sorting Was: Isn't that beauty ? (no it's not) cross@spitfire.i.gajendra.net (Dan Cross) - 2026-04-11 19:55 +0000
Re: sorting Was: Isn't that beauty ? (no it's not) antispam@fricas.org (Waldek Hebisch) - 2026-04-07 14:46 +0000
Re: sorting Was: Isn't that beauty ? (no it's not) Tim Rentsch <tr.17687@z991.linuxsc.com> - 2026-04-07 20:04 -0700
Re: sorting Was: Isn't that beauty ? (no it's not) cross@spitfire.i.gajendra.net (Dan Cross) - 2026-04-09 21:15 +0000
Re: sorting Was: Isn't that beauty ? (no it's not) Michael S <already5chosen@yahoo.com> - 2026-04-10 01:31 +0300
Re: sorting Was: Isn't that beauty ? (no it's not) Tim Rentsch <tr.17687@z991.linuxsc.com> - 2026-04-12 06:17 -0700
Re: sorting Was: Isn't that beauty ? (no it's not) Tim Rentsch <tr.17687@z991.linuxsc.com> - 2026-04-11 21:32 -0700
Re: sorting Was: Isn't that beauty ? (no it's not) cross@spitfire.i.gajendra.net (Dan Cross) - 2026-04-12 04:59 +0000
Re: sorting Was: Isn't that beauty ? (no it's not) Tim Rentsch <tr.17687@z991.linuxsc.com> - 2026-04-26 07:29 -0700
Re: sorting Was: Isn't that beauty ? (no it's not) antispam@fricas.org (Waldek Hebisch) - 2026-04-09 23:33 +0000
Re: sorting Was: Isn't that beauty ? (no it's not) cross@spitfire.i.gajendra.net (Dan Cross) - 2026-04-10 11:35 +0000
Re: sorting Was: Isn't that beauty ? (no it's not) Tim Rentsch <tr.17687@z991.linuxsc.com> - 2026-04-12 07:13 -0700
Re: sorting Was: Isn't that beauty ? (no it's not) cross@spitfire.i.gajendra.net (Dan Cross) - 2026-04-13 20:44 +0000
Re: sorting Was: Isn't that beauty ? (no it's not) Tim Rentsch <tr.17687@z991.linuxsc.com> - 2026-04-25 15:47 -0700
Re: sorting Was: Isn't that beauty ? (no it's not) cross@spitfire.i.gajendra.net (Dan Cross) - 2026-04-27 02:04 +0000
Re: sorting Was: Isn't that beauty ? (no it's not) Tim Rentsch <tr.17687@z991.linuxsc.com> - 2026-04-26 22:27 -0700
Re: sorting Was: Isn't that beauty ? (no it's not) cross@spitfire.i.gajendra.net (Dan Cross) - 2026-04-27 14:41 +0000
Re: sorting Was: Isn't that beauty ? (no it's not) Michael S <already5chosen@yahoo.com> - 2026-03-20 14:01 +0200
Re: sorting Was: Isn't that beauty ? (no it's not) Tim Rentsch <tr.17687@z991.linuxsc.com> - 2026-04-06 13:48 -0700
Re: sorting Was: Isn't that beauty ? (no it's not) Michael S <already5chosen@yahoo.com> - 2026-04-07 01:58 +0300
Re: sorting Was: Isn't that beauty ? (no it's not) Bart <bc@freeuk.com> - 2026-04-07 01:02 +0100
Re: sorting Was: Isn't that beauty ? (no it's not) Tim Rentsch <tr.17687@z991.linuxsc.com> - 2026-04-07 08:01 -0700
Re: sorting Was: Isn't that beauty ? (no it's not) antispam@fricas.org (Waldek Hebisch) - 2026-03-19 23:21 +0000
Re: sorting Was: Isn't that beauty ? (no it's not) Tim Rentsch <tr.17687@z991.linuxsc.com> - 2026-04-06 18:37 -0700
Re: Isn't that beauty ? (no it's not) Janis Papanagnou <janis_papanagnou+ng@hotmail.com> - 2026-03-20 04:33 +0100
Re: Isn't that beauty ? (no it's not) Michael S <already5chosen@yahoo.com> - 2026-03-20 14:24 +0200
Re: Isn't that beauty ? (no it's not) Janis Papanagnou <janis_papanagnou+ng@hotmail.com> - 2026-03-22 05:06 +0100
Re: Isn't that beauty ? (no it's not) Michael S <already5chosen@yahoo.com> - 2026-03-22 09:30 +0200
Re: Isn't that beauty ? (no it's not) Tim Rentsch <tr.17687@z991.linuxsc.com> - 2026-04-07 02:12 -0700
Re: Isn't that beauty ? (no it's not) Michael S <already5chosen@yahoo.com> - 2026-04-07 14:00 +0300
Re: Isn't that beauty ? (no it's not) Tim Rentsch <tr.17687@z991.linuxsc.com> - 2026-04-16 10:23 -0700
Re: Isn't that beauty ? (no it's not) DFS <nospam@dfs.com> - 2026-04-07 16:39 -0400
Re: Isn't that beauty ? (no it's not) Tim Rentsch <tr.17687@z991.linuxsc.com> - 2026-04-12 11:16 -0700
Re: Isn't that beauty ? (no it's not) Tristan Wibberley <tristan.wibberley+netnews2@alumni.manchester.ac.uk> - 2026-03-25 00:45 +0000
Re: Isn't that beauty ? (no it's not) Bonita Montero <Bonita.Montero@gmail.com> - 2026-03-17 06:25 +0100
Re: Isn't that beauty ? (no it's not) Tristan Wibberley <tristan.wibberley+netnews2@alumni.manchester.ac.uk> - 2026-03-20 01:33 +0000
Re: Isn't that beauty ? (no it's not) Bonita Montero <Bonita.Montero@gmail.com> - 2026-03-20 07:42 +0100
Re: Isn't that beauty ? (no it's not) Tristan Wibberley <tristan.wibberley+netnews2@alumni.manchester.ac.uk> - 2026-03-20 12:16 +0000
Re: Isn't that beauty ? (no it's not) Bart <bc@freeuk.com> - 2026-03-14 16:22 +0000
Re: Isn't that beauty ? (no it's not) Bonita Montero <Bonita.Montero@gmail.com> - 2026-03-14 18:04 +0100
Re: Isn't that beauty ? (no it's not) Bart <bc@freeuk.com> - 2026-03-14 17:39 +0000
Re: Isn't that beauty ? (no it's not) Bonita Montero <Bonita.Montero@gmail.com> - 2026-03-14 19:25 +0100
Re: Isn't that beauty ? (no it's not) scott@slp53.sl.home (Scott Lurndal) - 2026-03-13 00:54 +0000
Re: Isn't that beauty ? (no it's not) DFS <nospam@dfs.com> - 2026-03-13 00:31 -0400
Re: Isn't that beauty ? (no it's not) Bonita Montero <Bonita.Montero@gmail.com> - 2026-03-13 06:24 +0100
Re: Isn't that beauty ? (no it's not) DFS <nospam@dfs.com> - 2026-03-13 01:40 -0400
Re: Isn't that beauty ? (no it's not) DFS <nospam@dfs.com> - 2026-03-13 01:34 -0400
Re: Isn't that beauty ? (no it's not) scott@slp53.sl.home (Scott Lurndal) - 2026-03-13 14:38 +0000
Re: Isn't that beauty ? (no it's not) scott@slp53.sl.home (Scott Lurndal) - 2026-03-13 15:31 +0000
Re: Isn't that beauty ? (no it's not) Tim Rentsch <tr.17687@z991.linuxsc.com> - 2026-03-15 13:15 -0700
Re: Isn't that beauty ? (no it's not) scott@slp53.sl.home (Scott Lurndal) - 2026-03-16 15:18 +0000
Re: Isn't that beauty ? (no it's not) Tim Rentsch <tr.17687@z991.linuxsc.com> - 2026-03-23 21:23 -0700
Re: Isn't that beauty ? (no it's not) James Kuyper <jameskuyper@alumni.caltech.edu> - 2026-03-13 18:47 -0400
Re: Isn't that beauty ? (no it's not) Tim Rentsch <tr.17687@z991.linuxsc.com> - 2026-03-15 14:38 -0700
Re: Isn't that beauty ? (no it's not) Bonita Montero <Bonita.Montero@gmail.com> - 2026-03-13 07:24 +0100
Re: Isn't that beauty ? (no it's not) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2026-03-13 01:51 -0700
Re: Isn't that beauty ? (no it's not) Bonita Montero <Bonita.Montero@gmail.com> - 2026-03-13 09:54 +0100
Re: Isn't that beauty ? (no it's not) Janis Papanagnou <janis_papanagnou+ng@hotmail.com> - 2026-03-13 10:29 +0100
Re: Isn't that beauty ? (no it's not) Bonita Montero <Bonita.Montero@gmail.com> - 2026-03-13 10:33 +0100
Re: Isn't that beauty ? (no it's not) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2026-03-13 11:57 -0700
Re: Isn't that beauty ? (no it's not) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2026-03-13 11:58 -0700
Re: Isn't that beauty ? (no it's not) scott@slp53.sl.home (Scott Lurndal) - 2026-03-13 14:29 +0000
Re: Isn't that beauty ? (no it's not) Bonita Montero <Bonita.Montero@gmail.com> - 2026-03-13 08:08 +0100
Re: Isn't that beauty ? (no it's not) DFS <nospam@dfs.com> - 2026-03-13 04:19 -0400
Re: Isn't that beauty ? (no it's not) Bonita Montero <Bonita.Montero@gmail.com> - 2026-03-13 09:53 +0100
Re: Isn't that beauty ? (no it's not) Bonita Montero <Bonita.Montero@gmail.com> - 2026-03-13 09:56 +0100
Re: Isn't that beauty ? (no it's not) DFS <nospam@dfs.com> - 2026-03-13 05:10 -0400
Re: Isn't that beauty ? (no it's not) Bonita Montero <Bonita.Montero@gmail.com> - 2026-03-13 10:14 +0100
Re: Isn't that beauty ? (no it's not) Bart <bc@freeuk.com> - 2026-03-13 17:32 +0000
Re: Isn't that beauty ? (no it's not) Bonita Montero <Bonita.Montero@gmail.com> - 2026-03-13 18:44 +0100
Re: Isn't that beauty ? (no it's not) Bart <bc@freeuk.com> - 2026-03-13 19:36 +0000
Re: Isn't that beauty ? (no it's not) Bonita Montero <Bonita.Montero@gmail.com> - 2026-03-14 06:03 +0100
Re: Isn't that beauty ? (no it's not) scott@slp53.sl.home (Scott Lurndal) - 2026-03-12 16:56 +0000
Re: Isn't that beauty ? (no it's not) Tim Rentsch <tr.17687@z991.linuxsc.com> - 2026-03-20 23:07 -0700
Re: Isn't that beauty ? (no it's not) DFS <nospam@dfs.com> - 2026-03-22 16:55 -0400
Re: Isn't that beauty ? (no it's not) Tim Rentsch <tr.17687@z991.linuxsc.com> - 2026-03-26 20:08 -0700
Re: Isn't that beauty ? (no it's not) DFS <nospam@dfs.com> - 2026-03-27 00:35 -0400
Re: Isn't that beauty ? (no it's not) Keith Thompson <Keith.S.Thompson+u@gmail.com> - 2026-03-26 21:53 -0700
Re: Isn't that beauty ? (no it's not) gazelle@shell.xmission.com (Kenny McCormack) - 2026-03-27 17:03 +0000
Page 11 of 12 — ← Prev page 1 … 9 10 [11] 12 Next page →
| From | scott@slp53.sl.home (Scott Lurndal) |
|---|---|
| Date | 2026-03-13 15:31 +0000 |
| Subject | Re: Isn't that beauty ? (no it's not) |
| Message-ID | <e5WsR.421207$wcP9.124315@fx24.iad> |
| In reply to | #396973 |
scott@slp53.sl.home (Scott Lurndal) writes: >DFS <nospam@dfs.com> writes: >>On 3/13/2026 12:31 AM, DFS wrote: >>> On 3/12/2026 8:54 PM, Scott Lurndal wrote: >>>> DFS <nospam@dfs.com> writes: >> >> >> >>> I took out all 7 instances of error trapping, and it throws: >>> Floating point exception (core dumped) >>> at line 61 or 62 >> >> >>Put back in just the stat() call >> >>stat(argv[1], &st); >> >>and the program works again. > >Yes, you can't willy-nilly remove lines from a program. > > >> >>Question: wordlist was malloced with a size of 0: >> >> wordlist = malloc(wordcount * sizeof(const char *)); >> >>Why are you allowed to malloc size 0? > > "If the size of the space requested is 0, the behavior is > implementation-defined: either a null pointer shall be returned, > or the behavior shall be as if the size were some non-zero value, > except that the behavior is undefined if the returned pointer is > used to access an object." > >https://pubs.opengroup.org/onlinepubs/9799919799/functions/malloc.html > IIRC, this caveat was added due to differences in the malloc(3) implementations for System V Unix and BSD Unix.
[toc] | [prev] | [next] | [standalone]
| From | Tim Rentsch <tr.17687@z991.linuxsc.com> |
|---|---|
| Date | 2026-03-15 13:15 -0700 |
| Subject | Re: Isn't that beauty ? (no it's not) |
| Message-ID | <8634207ssj.fsf@linuxsc.com> |
| In reply to | #396974 |
scott@slp53.sl.home (Scott Lurndal) writes: > scott@slp53.sl.home (Scott Lurndal) writes: > >> DFS <nospam@dfs.com> writes: >> >>> On 3/13/2026 12:31 AM, DFS wrote: >>> >>>> On 3/12/2026 8:54 PM, Scott Lurndal wrote: >>>> >>>>> DFS <nospam@dfs.com> writes: >>> >>> >>> >>>> I took out all 7 instances of error trapping, and it throws: >>>> Floating point exception (core dumped) >>>> at line 61 or 62 >>> >>> Put back in just the stat() call >>> >>> stat(argv[1], &st); >>> >>> and the program works again. >> >> Yes, you can't willy-nilly remove lines from a program. >> >> >>> Question: wordlist was malloced with a size of 0: >>> >>> wordlist = malloc(wordcount * sizeof(const char *)); >>> >>> Why are you allowed to malloc size 0? >> >> "If the size of the space requested is 0, the behavior is >> implementation-defined: either a null pointer shall be returned, >> or the behavior shall be as if the size were some non-zero value, >> except that the behavior is undefined if the returned pointer is >> used to access an object." >> >> https://pubs.opengroup.org/onlinepubs/9799919799/functions/malloc.html > > IIRC, this caveat was added due to differences in the malloc(3) > implementations for System V Unix and BSD Unix. That sounds right, except I might say "put in" rather than "added" since as best I can determine that allowance was present in the earliest drafts of the C standard and POSIX discussions. Note that malloc() is not mentioned in K&R, and apparently was added to AT&T Unix in Unix V7. The timing on that was about the same time as the first BSD Unix.
[toc] | [prev] | [next] | [standalone]
| From | scott@slp53.sl.home (Scott Lurndal) |
|---|---|
| Date | 2026-03-16 15:18 +0000 |
| Subject | Re: Isn't that beauty ? (no it's not) |
| Message-ID | <qbVtR.549127$wcP9.297230@fx24.iad> |
| In reply to | #397006 |
Tim Rentsch <tr.17687@z991.linuxsc.com> writes: >scott@slp53.sl.home (Scott Lurndal) writes: > >> scott@slp53.sl.home (Scott Lurndal) writes: >> >>> DFS <nospam@dfs.com> writes: >>> >>>> On 3/13/2026 12:31 AM, DFS wrote: >>>> >>>>> On 3/12/2026 8:54 PM, Scott Lurndal wrote: >>>>> >>>>>> DFS <nospam@dfs.com> writes: >>>> >>>> >>>> >>>>> I took out all 7 instances of error trapping, and it throws: >>>>> Floating point exception (core dumped) >>>>> at line 61 or 62 >>>> >>>> Put back in just the stat() call >>>> >>>> stat(argv[1], &st); >>>> >>>> and the program works again. >>> >>> Yes, you can't willy-nilly remove lines from a program. >>> >>> >>>> Question: wordlist was malloced with a size of 0: >>>> >>>> wordlist = malloc(wordcount * sizeof(const char *)); >>>> >>>> Why are you allowed to malloc size 0? >>> >>> "If the size of the space requested is 0, the behavior is >>> implementation-defined: either a null pointer shall be returned, >>> or the behavior shall be as if the size were some non-zero value, >>> except that the behavior is undefined if the returned pointer is >>> used to access an object." >>> >>> https://pubs.opengroup.org/onlinepubs/9799919799/functions/malloc.html >> >> IIRC, this caveat was added due to differences in the malloc(3) >> implementations for System V Unix and BSD Unix. > >That sounds right, except I might say "put in" rather than "added" >since as best I can determine that allowance was present in the >earliest drafts of the C standard and POSIX discussions. > >Note that malloc() is not mentioned in K&R, and apparently was >added to AT&T Unix in Unix V7. The timing on that was about the >same time as the first BSD Unix. Right. K&R 1st Ed. defined a 'morecore' function based on sbrk. K&R 2nd Ed. (ANSI) added malloc.
[toc] | [prev] | [next] | [standalone]
| From | Tim Rentsch <tr.17687@z991.linuxsc.com> |
|---|---|
| Date | 2026-03-23 21:23 -0700 |
| Subject | Re: Isn't that beauty ? (no it's not) |
| Message-ID | <86ecl94zzg.fsf@linuxsc.com> |
| In reply to | #397013 |
scott@slp53.sl.home (Scott Lurndal) writes: > Tim Rentsch <tr.17687@z991.linuxsc.com> writes: >> scott@slp53.sl.home (Scott Lurndal) writes: >>> scott@slp53.sl.home (Scott Lurndal) writes: >>>> DFS <nospam@dfs.com> writes: [...] >>>>> Why are you allowed to malloc size 0? >>>> >>>> "If the size of the space requested is 0, the behavior is >>>> implementation-defined: either a null pointer shall be returned, >>>> or the behavior shall be as if the size were some non-zero value, >>>> except that the behavior is undefined if the returned pointer is >>>> used to access an object." >>>> >>>> https://pubs.opengroup.org/onlinepubs/9799919799/functions/malloc.html >>> >>> IIRC, this caveat was added due to differences in the malloc(3) >>> implementations for System V Unix and BSD Unix. >> >> That sounds right, except I might say "put in" rather than "added" >> since as best I can determine that allowance was present in the >> earliest drafts of the C standard and POSIX discussions. >> >> Note that malloc() is not mentioned in K&R, and apparently was >> added to AT&T Unix in Unix V7. The timing on that was about the >> same time as the first BSD Unix. > > Right. K&R 1st Ed. defined a 'morecore' function based on sbrk. Ahh, I missed that. So it does. > K&R 2nd Ed. (ANSI) added malloc. Presumably malloc() was included in the early standard efforts well before K&R 2, which came out in 1988 IIRC. The early standardization work started in 1982 or 1983 IIANM, and malloc() had already been available since 1979, as both AT&T Unix V7 and BSD Unix were available at that time.
[toc] | [prev] | [next] | [standalone]
| From | James Kuyper <jameskuyper@alumni.caltech.edu> |
|---|---|
| Date | 2026-03-13 18:47 -0400 |
| Subject | Re: Isn't that beauty ? (no it's not) |
| Message-ID | <10p246s$30r9e$1@dont-email.me> |
| In reply to | #396955 |
DFS <nospam@dfs.com> writes: ... >Question: wordlist was malloced with a size of 0: > > wordlist = malloc(wordcount * sizeof(const char *)); > >Why are you allowed to malloc size 0? Because, in some contexts, it's convenient to allow a mixture of 0-sized and non-zero sized allocations, depending upon the value of a variable, so some pre-standard versions of malloc() supported malloc(0) returning a unique pointer to memory that could not be accessed. The uniqueness of the pointer allowed the value of the pointer to be used as an identifier for the thing that might or might not have been allocated. This was a sufficiently common feature that the C committee decided to allow it, but sufficiently rare that the C committee decided not to mandate it.
[toc] | [prev] | [next] | [standalone]
| From | Tim Rentsch <tr.17687@z991.linuxsc.com> |
|---|---|
| Date | 2026-03-15 14:38 -0700 |
| Subject | Re: Isn't that beauty ? (no it's not) |
| Message-ID | <86tsug6af5.fsf@linuxsc.com> |
| In reply to | #396983 |
James Kuyper <jameskuyper@alumni.caltech.edu> writes: > DFS <nospam@dfs.com> writes: > ... > >> Question: wordlist was malloced with a size of 0: >> >> wordlist = malloc(wordcount * sizeof(const char *)); >> >> Why are you allowed to malloc size 0? > > Because, in some contexts, it's convenient to allow a mixture of > 0-sized and non-zero sized allocations, depending upon the value of > a variable, so some pre-standard versions of malloc() supported > malloc(0) returning a unique pointer to memory that could not be > accessed. The uniqueness of the pointer allowed the value of the > pointer to be used as an identifier for the thing that might or > might not have been allocated. > This was a sufficiently common feature that the C committee decided > to allow it, but sufficiently rare that the C committee decided not > to mandate it. The explanation offered by Scott Lurndal is more convincing. The rule was put in to accommodate both AT&T Unix and BSD Unix. There is no reason in evidence to suggest there was any evaluation by the C committee; they allowed both behaviors because the two main branches of Unix at the time had made different decisions.
[toc] | [prev] | [next] | [standalone]
| From | Bonita Montero <Bonita.Montero@gmail.com> |
|---|---|
| Date | 2026-03-13 07:24 +0100 |
| Subject | Re: Isn't that beauty ? (no it's not) |
| Message-ID | <10p0ai9$2qfsp$1@raubtier-asyl.eternal-september.org> |
| In reply to | #396951 |
Am 13.03.2026 um 05:31 schrieb DFS:
> I took out all 7 instances of error trapping, and it throws:
> Floating point exception (core dumped)
> at line 61 or 62
Take my signal_scope<> class, it makes signals thread-specific:
thread_local jmp_buf jb;
signal_scope<SIGFPE> fpeExc( +[]( int, siginfo_t *, void * )
{
static const char PrintThis[] = "caught!\n";
(void)write( 1, PrintThis, sizeof PrintThis - 1 );
siglongjmp( jb, 1 );
} );
if( int ret = sigsetjmp( jb, 1 ); !ret )
...
else
...
Here's the source of the signal_scope class:
#pragma once
#include <cstdlib>
#include <variant>
#include <mutex>
#include <cassert>
#include <unistd.h>
#include <signal.h>
#include <setjmp.h>
template<int SigNo>
struct signal_scope
{
static_assert(SigNo == SIGILL || SigNo == SIGFPE || SigNo == SIGSEGV ||
SigNo == SIGBUS || SigNo == SIGTRAP, "only sychronous signals");
using handler_fn = bool (*)( int );
using siginfo_handler_fn = bool (*)( int, siginfo_t *, void * );
using handler_variant = std::variant<int, handler_fn, siginfo_handler_fn>;
signal_scope( handler_variant handler = handler_variant() ) noexcept;
~signal_scope();
void operator =( handler_variant handler ) noexcept;
static void fallback( handler_variant handler ) noexcept;
static void re_init( const sigset_t *pSet, int flags );
private:
inline static std::mutex g_mtxFallback;
inline static handler_variant g_fallback = handler_variant();
inline static thread_local handler_variant t_handler = handler_variant();
handler_variant m_handlerBefore;
inline static struct init
{
init();
~init();
void reset( const sigset_t *pSet, int flags, bool old );
void dummy() {}
struct sigaction m_saBefore;
} g_init;
static void action( int sig, siginfo_t *info, void *uContext ) noexcept;
static bool callHandler( const handler_variant &handler, int sig,
siginfo_t *info, void *uContext );
};
template<int SigNo>
signal_scope<SigNo>::signal_scope( handler_variant handler ) noexcept :
m_handlerBefore( t_handler )
{
(void)g_init;
t_handler = handler;
}
template<int SigNo>
inline signal_scope<SigNo>::~signal_scope()
{
t_handler = m_handlerBefore;
}
template<int SigNo>
inline void signal_scope<SigNo>::operator =( handler_variant handler )
noexcept
{
t_handler = handler;
}
template<int SigNo>
void signal_scope<SigNo>::fallback( handler_variant handler ) noexcept
{
using namespace std;
lock_guard lock( g_mtxFallback );
g_fallback = handler;
}
template<int SigNo>
void signal_scope<SigNo>::re_init( const sigset_t *pSet, int flags )
{
g_init.reset( pSet, flags, false );
}
template<int SigNo>
signal_scope<SigNo>::init::init()
{
reset( nullptr, 0, true );
}
template<int SigNo>
signal_scope<SigNo>::init::~init()
{
sigaction( SigNo, &m_saBefore, nullptr );
}
template<int SigNo>
void signal_scope<SigNo>::init::reset( const sigset_t *pSet, int flags,
bool old )
{
struct sigaction sa;
sa.sa_sigaction = action;
if( pSet )
sa.sa_mask = *pSet;
else
sigfillset( &sa.sa_mask );
sa.sa_flags = flags | SA_SIGINFO;
sigaction( SigNo, &sa, old ? &m_saBefore : nullptr );
}
template<int SigNo>
void signal_scope<SigNo>::action( int sig, siginfo_t *info, void
*uContext ) noexcept
{
using namespace std;
if( callHandler( t_handler, sig, info, uContext ) ) [[likely]]
return;
handler_variant fallback;
{
lock_guard lock( g_mtxFallback );
fallback = g_fallback;
}
callHandler( fallback, sig, info, uContext );
}
template<int SigNo>
bool signal_scope<SigNo>::callHandler( const handler_variant &handler,
int sig, siginfo_t *info, void *uContext )
{
if( holds_alternative<handler_fn>( handler ) ) [[likely]]
return get<handler_fn>( handler )( sig );
if( holds_alternative<siginfo_handler_fn>( handler ) ) [[likely]]
return get<siginfo_handler_fn>( handler )( sig, info, uContext );
return false;
}
[toc] | [prev] | [next] | [standalone]
| From | "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> |
|---|---|
| Date | 2026-03-13 01:51 -0700 |
| Subject | Re: Isn't that beauty ? (no it's not) |
| Message-ID | <10p0j6k$2u5c5$2@dont-email.me> |
| In reply to | #396957 |
On 3/12/2026 11:24 PM, Bonita Montero wrote:
> Am 13.03.2026 um 05:31 schrieb DFS:
>
>> I took out all 7 instances of error trapping, and it throws:
>> Floating point exception (core dumped)
>> at line 61 or 62
>
> Take my signal_scope<> class, it makes signals thread-specific:
>
> thread_local jmp_buf jb;
> signal_scope<SIGFPE> fpeExc( +[]( int, siginfo_t *, void * )
> {
> static const char PrintThis[] = "caught!\n";
> (void)write( 1, PrintThis, sizeof PrintThis - 1 );
> siglongjmp( jb, 1 );
> } );
> if( int ret = sigsetjmp( jb, 1 ); !ret )
> ...
> else
> ...
>
> Here's the source of the signal_scope class:
>
> #pragma once
> #include <cstdlib>
> #include <variant>
> #include <mutex>
> #include <cassert>
> #include <unistd.h>
> #include <signal.h>
> #include <setjmp.h>
>
> template<int SigNo>
> struct signal_scope
> {
> static_assert(SigNo == SIGILL || SigNo == SIGFPE || SigNo ==
> SIGSEGV || SigNo == SIGBUS || SigNo == SIGTRAP, "only sychronous signals");
> using handler_fn = bool (*)( int );
> using siginfo_handler_fn = bool (*)( int, siginfo_t *, void * );
> using handler_variant = std::variant<int, handler_fn,
> siginfo_handler_fn>;
> signal_scope( handler_variant handler = handler_variant() ) noexcept;
> ~signal_scope();
> void operator =( handler_variant handler ) noexcept;
> static void fallback( handler_variant handler ) noexcept;
> static void re_init( const sigset_t *pSet, int flags );
> private:
> inline static std::mutex g_mtxFallback;
> inline static handler_variant g_fallback = handler_variant();
> inline static thread_local handler_variant t_handler =
> handler_variant();
> handler_variant m_handlerBefore;
> inline static struct init
> {
> init();
> ~init();
> void reset( const sigset_t *pSet, int flags, bool old );
> void dummy() {}
> struct sigaction m_saBefore;
> } g_init;
> static void action( int sig, siginfo_t *info, void *uContext )
> noexcept;
> static bool callHandler( const handler_variant &handler, int sig,
> siginfo_t *info, void *uContext );
> };
>
> template<int SigNo>
> signal_scope<SigNo>::signal_scope( handler_variant handler ) noexcept :
> m_handlerBefore( t_handler )
> {
> (void)g_init;
> t_handler = handler;
> }
>
> template<int SigNo>
> inline signal_scope<SigNo>::~signal_scope()
> {
> t_handler = m_handlerBefore;
> }
>
> template<int SigNo>
> inline void signal_scope<SigNo>::operator =( handler_variant handler )
> noexcept
> {
> t_handler = handler;
> }
>
> template<int SigNo>
> void signal_scope<SigNo>::fallback( handler_variant handler ) noexcept
> {
> using namespace std;
> lock_guard lock( g_mtxFallback );
> g_fallback = handler;
> }
>
> template<int SigNo>
> void signal_scope<SigNo>::re_init( const sigset_t *pSet, int flags )
> {
> g_init.reset( pSet, flags, false );
> }
>
> template<int SigNo>
> signal_scope<SigNo>::init::init()
> {
> reset( nullptr, 0, true );
> }
>
> template<int SigNo>
> signal_scope<SigNo>::init::~init()
> {
> sigaction( SigNo, &m_saBefore, nullptr );
> }
>
> template<int SigNo>
> void signal_scope<SigNo>::init::reset( const sigset_t *pSet, int flags,
> bool old )
> {
> struct sigaction sa;
> sa.sa_sigaction = action;
> if( pSet )
> sa.sa_mask = *pSet;
> else
> sigfillset( &sa.sa_mask );
> sa.sa_flags = flags | SA_SIGINFO;
> sigaction( SigNo, &sa, old ? &m_saBefore : nullptr );
> }
>
> template<int SigNo>
> void signal_scope<SigNo>::action( int sig, siginfo_t *info, void
> *uContext ) noexcept
> {
> using namespace std;
> if( callHandler( t_handler, sig, info, uContext ) ) [[likely]]
> return;
> handler_variant fallback;
> {
> lock_guard lock( g_mtxFallback );
> fallback = g_fallback;
> }
> callHandler( fallback, sig, info, uContext );
> }
>
> template<int SigNo>
> bool signal_scope<SigNo>::callHandler( const handler_variant &handler,
> int sig, siginfo_t *info, void *uContext )
> {
> if( holds_alternative<handler_fn>( handler ) ) [[likely]]
> return get<handler_fn>( handler )( sig );
> if( holds_alternative<siginfo_handler_fn>( handler ) ) [[likely]]
> return get<siginfo_handler_fn>( handler )( sig, info, uContext );
> return false;
> }
>
well, is that your code? Or the AI's code? Need to kick that AI to the
curb from time to time. Right?
[toc] | [prev] | [next] | [standalone]
| From | Bonita Montero <Bonita.Montero@gmail.com> |
|---|---|
| Date | 2026-03-13 09:54 +0100 |
| Subject | Re: Isn't that beauty ? (no it's not) |
| Message-ID | <10p0jbt$2u9vs$3@raubtier-asyl.eternal-september.org> |
| In reply to | #396962 |
Am 13.03.2026 um 09:51 schrieb Chris M. Thomasson: > well, is that your code? Or the AI's code? Need to kick that AI to the > curb from time to time. Right? AI never generates such dodgy ideas.
[toc] | [prev] | [next] | [standalone]
| From | Janis Papanagnou <janis_papanagnou+ng@hotmail.com> |
|---|---|
| Date | 2026-03-13 10:29 +0100 |
| Subject | Re: Isn't that beauty ? (no it's not) |
| Message-ID | <10p0le9$2v9md$2@dont-email.me> |
| In reply to | #396964 |
On 3/13/26 09:54, Bonita Montero wrote: > Am 13.03.2026 um 09:51 schrieb Chris M. Thomasson: > >> well, is that your code? Or the AI's code? Need to kick that AI to the >> curb from time to time. Right? > > AI never generates such dodgy ideas. It does. Even worse. See my most recent post. Janis
[toc] | [prev] | [next] | [standalone]
| From | Bonita Montero <Bonita.Montero@gmail.com> |
|---|---|
| Date | 2026-03-13 10:33 +0100 |
| Subject | Re: Isn't that beauty ? (no it's not) |
| Message-ID | <10p0ll9$2vdpi$1@raubtier-asyl.eternal-september.org> |
| In reply to | #396969 |
Am 13.03.2026 um 10:29 schrieb Janis Papanagnou: > On 3/13/26 09:54, Bonita Montero wrote: >> Am 13.03.2026 um 09:51 schrieb Chris M. Thomasson: >> >>> well, is that your code? Or the AI's code? Need to kick that AI to >>> the curb from time to time. Right? >> >> AI never generates such dodgy ideas. > > It does. ... No, AI doesn't even understand what I did there so that I had to correct the code while reviewing it through AI. Redirecting signals to threads is really uncommon.
[toc] | [prev] | [next] | [standalone]
| From | "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> |
|---|---|
| Date | 2026-03-13 11:57 -0700 |
| Subject | Re: Isn't that beauty ? (no it's not) |
| Message-ID | <10p1mm7$3fsme$5@dont-email.me> |
| In reply to | #396970 |
On 3/13/2026 2:33 AM, Bonita Montero wrote: > Am 13.03.2026 um 10:29 schrieb Janis Papanagnou: >> On 3/13/26 09:54, Bonita Montero wrote: >>> Am 13.03.2026 um 09:51 schrieb Chris M. Thomasson: >>> >>>> well, is that your code? Or the AI's code? Need to kick that AI to >>>> the curb from time to time. Right? >>> >>> AI never generates such dodgy ideas. >> >> It does. ... > > No, AI doesn't even understand what I did there so that I had to correct > the code while reviewing it through AI. Redirecting signals to threads > is really uncommon. At least you can take a look at the AI reams o' code, and correct it.
[toc] | [prev] | [next] | [standalone]
| From | "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> |
|---|---|
| Date | 2026-03-13 11:58 -0700 |
| Subject | Re: Isn't that beauty ? (no it's not) |
| Message-ID | <10p1moo$3fsme$6@dont-email.me> |
| In reply to | #396978 |
On 3/13/2026 11:57 AM, Chris M. Thomasson wrote: > On 3/13/2026 2:33 AM, Bonita Montero wrote: >> Am 13.03.2026 um 10:29 schrieb Janis Papanagnou: >>> On 3/13/26 09:54, Bonita Montero wrote: >>>> Am 13.03.2026 um 09:51 schrieb Chris M. Thomasson: >>>> >>>>> well, is that your code? Or the AI's code? Need to kick that AI to >>>>> the curb from time to time. Right? >>>> >>>> AI never generates such dodgy ideas. >>> >>> It does. ... >> >> No, AI doesn't even understand what I did there so that I had to correct >> the code while reviewing it through AI. Redirecting signals to threads >> is really uncommon. > > At least you can take a look at the AI reams o' code, and correct it. Also, be weary of correcting the AI, the little shit will learn and then you made it smarter? Uggg...
[toc] | [prev] | [next] | [standalone]
| From | scott@slp53.sl.home (Scott Lurndal) |
|---|---|
| Date | 2026-03-13 14:29 +0000 |
| Subject | Re: Isn't that beauty ? (no it's not) |
| Message-ID | <sbVsR.21461$_l2.20929@fx40.iad> |
| In reply to | #396951 |
DFS <nospam@dfs.com> writes: >On 3/12/2026 8:54 PM, Scott Lurndal wrote: >> DFS <nospam@dfs.com> writes: >> >>> I'll try that in C if you commit to trying the following in C++. Deal? >>> >>> -------------------------------------------------------------------------- >>> * read in a list of words from a file here: >>> https://people.sc.fsu.edu/~jburkardt/datasets/words/words.html >>> >>> * pick N random words from that list and put them in an array (OK if >>> there are a few dupes - if you can get no dupes that's better) >>> >>> * sort and print the array of randoms, adding a blank line each time the >>> 1st letter changes >>> >>> (note: I just now wrote this. It's not old code.) >>> >>> usage is >>> $./randwords filename N >>> $./randwords special_english.txt 200 >>> >>> -------------------------------------------------------------------------- >> >> A POSIX version: > > >I took out all 7 instances of error trapping, and it throws: Why on earth did you remove the error checks? They're there for a reason. You don't say how you invoked the executable.
[toc] | [prev] | [next] | [standalone]
| From | Bonita Montero <Bonita.Montero@gmail.com> |
|---|---|
| Date | 2026-03-13 08:08 +0100 |
| Subject | Re: Isn't that beauty ? (no it's not) |
| Message-ID | <10p0d5v$2rluf$1@raubtier-asyl.eternal-september.org> |
| In reply to | #396941 |
Am 12.03.2026 um 21:18 schrieb DFS: > output is something like: > $ ./randwords special_english.txt 200 > 1477 words read in > 200 random words extracted > 1. above > 2. accept > 3. after > 4. against > 5. agency > 6. ammunition > 7. anger > 8. anniversary > 9. army > 10. arrive > 11. art > 12. artillery > 13. automobile > 14. autumn > > 15. bed > 16. below > 17. bleed > 18. blow > 19. blue > 20. boat > 21. boil > 22. bread > 23. bridge > 24. brown > 25. business > > 26. cancer > 27. claim > 28. clean > 29. cloud > 30. cloud > 31. cloud > 32. combine > 33. compare > 34. conflict > 35. consider > 36. contain > 37. correct > 38. credit > 39. criticize > 40. cross > 41. crowd > 42. customs > > 43. decide > 44. demand > ... What's the format of the input file ? Also numbered lines ?
[toc] | [prev] | [next] | [standalone]
| From | DFS <nospam@dfs.com> |
|---|---|
| Date | 2026-03-13 04:19 -0400 |
| Subject | Re: Isn't that beauty ? (no it's not) |
| Message-ID | <10p0hb4$2tgo1$1@dont-email.me> |
| In reply to | #396958 |
On 3/13/2026 3:08 AM, Bonita Montero wrote: > Am 12.03.2026 um 21:18 schrieb DFS: > >> output is something like: >> $ ./randwords special_english.txt 200 >> 1477 words read in >> 200 random words extracted >> 1. above >> 2. accept >> 3. after >> ... > > What's the format of the input file ? Also numbered lines ? not numbered * read in a list of words from a file here: https://people.sc.fsu.edu/~jburkardt/datasets/words/words.html
[toc] | [prev] | [next] | [standalone]
| From | Bonita Montero <Bonita.Montero@gmail.com> |
|---|---|
| Date | 2026-03-13 09:53 +0100 |
| Subject | Re: Isn't that beauty ? (no it's not) |
| Message-ID | <10p0ja3$2u9vs$2@raubtier-asyl.eternal-september.org> |
| In reply to | #396941 |
Am 12.03.2026 um 21:18 schrieb DFS:
> * read in a list of words from a file here:
> https://people.sc.fsu.edu/~jburkardt/datasets/words/words.html
> * pick N random words from that list and put them in an array (OK if
> there are a few dupes - if you can get no dupes that's better)
> * sort and print the array of randoms, adding a blank line each time the
> 1st letter changes
#include <iostream>
#include <fstream>
#include <string>
#include <vector>
#include <sstream>
#include <algorithm>
#include <random>
using namespace std;
int main( int argc, char **argv )
{
if( argc < 2 )
return EXIT_FAILURE;
size_t nLines;
if( argc < 3 || !(istringstream( argv[2] ) >> nLines) )
nLines = 200;
ifstream ifs( argv[1] );
vector<string> lines;
size_t iLine = 0;
for( string line; iLine < nLines && !ifs.eof(); ++iLine )
if( getline( ifs, line ) )
lines.emplace_back( line );
vector<string> rndLines;
mt19937_64 mt;
for( size_t n = 0; n < nLines; ++n )
if( size_t i = mt() % nLines; lines[i].size() )
rndLines.emplace_back( move( lines[i] ) );
sort( rndLines.begin(), rndLines.end() );
iLine = 0;
string *pPrev = nullptr;
for( string &rndLine : rndLines )
{
if( pPrev && tolower( rndLine[0] ) != tolower( pPrev->front() ) )
cout << endl;
cout << ++iLine << ". " << rndLine << endl;
pPrev = &rndLine;
}
}
39 lines vs. 72 lines, and much more readability on my side.
And your code may have duplicates in the random list which
is sorted afterwards.
[toc] | [prev] | [next] | [standalone]
| From | Bonita Montero <Bonita.Montero@gmail.com> |
|---|---|
| Date | 2026-03-13 09:56 +0100 |
| Subject | Re: Isn't that beauty ? (no it's not) |
| Message-ID | <10p0jfn$2u9vs$4@raubtier-asyl.eternal-september.org> |
| In reply to | #396963 |
Am 13.03.2026 um 09:53 schrieb Bonita Montero:
> Am 12.03.2026 um 21:18 schrieb DFS:
>
>> * read in a list of words from a file here:
>> https://people.sc.fsu.edu/~jburkardt/datasets/words/words.html
>> * pick N random words from that list and put them in an array (OK if
>> there are a few dupes - if you can get no dupes that's better)
>> * sort and print the array of randoms, adding a blank line each time the
>> 1st letter changes
>
> #include <iostream>
> #include <fstream>
> #include <string>
> #include <vector>
> #include <sstream>
> #include <algorithm>
> #include <random>
>
> using namespace std;
>
> int main( int argc, char **argv )
> {
> if( argc < 2 )
> return EXIT_FAILURE;
> size_t nLines;
> if( argc < 3 || !(istringstream( argv[2] ) >> nLines) )
> nLines = 200;
> ifstream ifs( argv[1] );
> vector<string> lines;
> size_t iLine = 0;
> for( string line; iLine < nLines && !ifs.eof(); ++iLine )
> if( getline( ifs, line ) )
> lines.emplace_back( line );
> vector<string> rndLines;
> mt19937_64 mt;
> for( size_t n = 0; n < nLines; ++n )
> if( size_t i = mt() % nLines; lines[i].size() )
if( size_t i = mt() % lines.size(); lines[i].size() )
> rndLines.emplace_back( move( lines[i] ) );
> sort( rndLines.begin(), rndLines.end() );
> iLine = 0;
> string *pPrev = nullptr;
> for( string &rndLine : rndLines )
> {
> if( pPrev && tolower( rndLine[0] ) != tolower( pPrev->front() ) )
> cout << endl;
> cout << ++iLine << ". " << rndLine << endl;
> pPrev = &rndLine;
> }
> }
>
> 39 lines vs. 72 lines, and much more readability on my side.
> And your code may have duplicates in the random list which
> is sorted afterwards.
>
[toc] | [prev] | [next] | [standalone]
| From | DFS <nospam@dfs.com> |
|---|---|
| Date | 2026-03-13 05:10 -0400 |
| Subject | Re: Isn't that beauty ? (no it's not) |
| Message-ID | <10p0k9m$2tsm2$1@dont-email.me> |
| In reply to | #396963 |
On 3/13/2026 4:53 AM, Bonita Montero wrote:
> Am 12.03.2026 um 21:18 schrieb DFS:
>
>> * read in a list of words from a file here:
>> https://people.sc.fsu.edu/~jburkardt/datasets/words/words.html
>> * pick N random words from that list and put them in an array (OK if
>> there are a few dupes - if you can get no dupes that's better)
>> * sort and print the array of randoms, adding a blank line each time the
>> 1st letter changes
>
> #include <iostream>
> #include <fstream>
> #include <string>
> #include <vector>
> #include <sstream>
> #include <algorithm>
> #include <random>
>
> using namespace std;
>
> int main( int argc, char **argv )
> {
> if( argc < 2 )
> return EXIT_FAILURE;
> size_t nLines;
> if( argc < 3 || !(istringstream( argv[2] ) >> nLines) )
> nLines = 200;
> ifstream ifs( argv[1] );
> vector<string> lines;
> size_t iLine = 0;
> for( string line; iLine < nLines && !ifs.eof(); ++iLine )
> if( getline( ifs, line ) )
> lines.emplace_back( line );
> vector<string> rndLines;
> mt19937_64 mt;
> for( size_t n = 0; n < nLines; ++n )
> if( size_t i = mt() % nLines; lines[i].size() )
> rndLines.emplace_back( move( lines[i] ) );
> sort( rndLines.begin(), rndLines.end() );
> iLine = 0;
> string *pPrev = nullptr;
> for( string &rndLine : rndLines )
> {
> if( pPrev && tolower( rndLine[0] ) != tolower( pPrev->front() ) )
> cout << endl;
> cout << ++iLine << ". " << rndLine << endl;
> pPrev = &rndLine;
> }
> }
>
> 39 lines vs. 72 lines,
Taking out blank lines
Yours is 37 LOC
Mine is 61 LOC
But your code doesn't work right.
./montero special-english.txt 50
Outputs 35 words, and they're not random. They all begin with a.
> and much more readability on my side.
C++ = gag
> And your code may have duplicates in the random list which
> is sorted afterwards.
My word output definitely does have dupes. C rand() produces tons of
dupe random numbers. I'm working on a method to use only unique randoms.
[toc] | [prev] | [next] | [standalone]
| From | Bonita Montero <Bonita.Montero@gmail.com> |
|---|---|
| Date | 2026-03-13 10:14 +0100 |
| Subject | Re: Isn't that beauty ? (no it's not) |
| Message-ID | <10p0khp$2utkq$1@raubtier-asyl.eternal-september.org> |
| In reply to | #396966 |
I won't test my before code again.
#include <iostream>
#include <fstream>
#include <string>
#include <vector>
#include <sstream>
#include <algorithm>
#include <random>
using namespace std;
int main( int argc, char **argv )
{
if( argc < 2 )
return EXIT_FAILURE;
size_t nLines;
if( argc < 3 || !(istringstream( argv[2] ) >> nLines) )
nLines = 200;
ifstream ifs( argv[1] );
vector<string> lines;
for( string line; !ifs.eof(); )
if( getline( ifs, line ) )
lines.emplace_back( move( line ) );
vector<string> rndLines;
mt19937_64 mt;
for( size_t n = 0; n < nLines; ++n )
{
size_t i = mt() % lines.size();
rndLines.emplace_back( move( lines[i] ) );
lines.erase( lines.begin() + i );
}
sort( rndLines.begin(), rndLines.end() );
size_t iLine = 1;
string *pPrev = nullptr;
for( string &rndLine : rndLines )
{
if( pPrev && tolower( rndLine[0] ) != tolower( pPrev->front() ) )
cout << endl;
cout << iLine++ << ". " << rndLine << endl;
pPrev = &rndLine;
}
}
This is the current version.
If I call it with "test.exe anagram_dictionary.txt 10" it prints:
1. deceived
2. desorption
3. moronic
4. quantitativeness
5. reimpose
6. sleigh
7. tabooing
8. unreconciled
9. waxing
10. woody
C ia a joke, not C++.
[toc] | [prev] | [next] | [standalone]
Page 11 of 12 — ← Prev page 1 … 9 10 [11] 12 Next page →
Back to top | Article view | comp.lang.c
csiph-web