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 2 of 12 — ← Prev page 1 [2] 3 4 … 12 Next page →
| From | "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> |
|---|---|
| Date | 2026-03-13 01:48 -0700 |
| Subject | Re: Isn't that beauty ? (no it's not) |
| Message-ID | <10p0j0e$2u5c5$1@dont-email.me> |
| In reply to | #396952 |
On 3/12/2026 10:14 PM, Bonita Montero wrote: > Am 13.03.2026 um 02:19 schrieb Janis Papanagnou: > >> This is an interesting statement. - I first saw the typical >> "Max Mustermann" that is in our country the prototype of an >> artificial test entry with obvious test number 0123-4567890. >> Then I picked an arbitrary entry and looked it up; I found >> that person with exactly the associated telephone number. - >> Where did you get these real names from? > > The list was generated with ChatGpt. Oh my. Beware, and always double, and triple, check its reams of code.
[toc] | [prev] | [next] | [standalone]
| From | Bonita Montero <Bonita.Montero@gmail.com> |
|---|---|
| Date | 2026-03-13 09:49 +0100 |
| Subject | Re: Isn't that beauty ? (no it's not) |
| Message-ID | <10p0j3f$2u9vs$1@raubtier-asyl.eternal-september.org> |
| In reply to | #396960 |
Am 13.03.2026 um 09:48 schrieb Chris M. Thomasson: > On 3/12/2026 10:14 PM, Bonita Montero wrote: >> Am 13.03.2026 um 02:19 schrieb Janis Papanagnou: >> >>> This is an interesting statement. - I first saw the typical >>> "Max Mustermann" that is in our country the prototype of an >>> artificial test entry with obvious test number 0123-4567890. >>> Then I picked an arbitrary entry and looked it up; I found >>> that person with exactly the associated telephone number. - >>> Where did you get these real names from? >> >> The list was generated with ChatGpt. > > Oh my. Beware, and always double, and triple, check its reams of code. It's only word / telephone number tuples as .txt.
[toc] | [prev] | [next] | [standalone]
| From | Janis Papanagnou <janis_papanagnou+ng@hotmail.com> |
|---|---|
| Date | 2026-03-13 10:27 +0100 |
| Subject | [OT] AI - questions and answers (was Re: Isn't that beauty ? (no it's not)) |
| Message-ID | <10p0l9r$2v9md$1@dont-email.me> |
| In reply to | #396961 |
On 3/13/26 09:49, Bonita Montero wrote: > Am 13.03.2026 um 09:48 schrieb Chris M. Thomasson: >> On 3/12/2026 10:14 PM, Bonita Montero wrote: >>> >>> The list was generated with ChatGpt. >> >> Oh my. Beware, and always double, and triple, check its reams of code. > > It's only word / telephone number tuples as .txt. The AI strikes back! First, my apologies; I was mistakenly assuming real people. What I did was to search for name and number (without area code). That was answered by the search engine by "missing area code". So I added it and got a complete record of some doctor of medicine. But then I noticed too late that I had inadvertently got into some AI query mode of the search engine. So I repeated my query in ordinary mode and got nothing as result. Then I repeated my query once again in that AI mode with the same data and got again a complete data record, but of *another* doctor. These inquiries just made-up those entries on the fly. - Scary! There's a small note at the bottom that AI-results may contain errors. But these replies are not "errors"; they are completely made-up statements out of thin air! Do AI inquiries for *random* test data create not only the list of test data but also "create" the data entries as *real* in the AI's memory for later responses to other queries? Where AI-dreams come true... You can of course then ask that AI whether that answer is correct, whether that person is actually existing. - And then the AI will willingly tell you that there's many indicators that her response is most likely wrong, and she is enumerating all the issues (that her original reply had)! (I thought it's bad. But it's worse than I thought.) Janis
[toc] | [prev] | [next] | [standalone]
| From | "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> |
|---|---|
| Date | 2026-03-13 11:59 -0700 |
| Subject | Re: Isn't that beauty ? (no it's not) |
| Message-ID | <10p1mr4$3fsme$7@dont-email.me> |
| In reply to | #396961 |
On 3/13/2026 1:49 AM, Bonita Montero wrote: > Am 13.03.2026 um 09:48 schrieb Chris M. Thomasson: >> On 3/12/2026 10:14 PM, Bonita Montero wrote: >>> Am 13.03.2026 um 02:19 schrieb Janis Papanagnou: >>> >>>> This is an interesting statement. - I first saw the typical >>>> "Max Mustermann" that is in our country the prototype of an >>>> artificial test entry with obvious test number 0123-4567890. >>>> Then I picked an arbitrary entry and looked it up; I found >>>> that person with exactly the associated telephone number. - >>>> Where did you get these real names from? >>> >>> The list was generated with ChatGpt. >> >> Oh my. Beware, and always double, and triple, check its reams of code. > > It's only word / telephone number tuples as .txt. > Fine. But, think if real names leaked? Oh shit, sorry. But shit can happen. ;^)
[toc] | [prev] | [next] | [standalone]
| From | DFS <nospam@dfs.com> |
|---|---|
| Date | 2026-03-12 21:22 -0400 |
| Subject | Re: Isn't that beauty ? (no it's not) |
| Message-ID | <10ovot3$2jr7n$5@dont-email.me> |
| In reply to | #396936 |
On 3/12/2026 11:48 AM, Bonita Montero wrote: > Am 12.03.2026 um 16:22 schrieb DFS: > >> Give me the file you used. > > Better take this: That's 50 in and 50 out. So what's the RegEx for?
[toc] | [prev] | [next] | [standalone]
| From | Bonita Montero <Bonita.Montero@gmail.com> |
|---|---|
| Date | 2026-03-13 06:15 +0100 |
| Subject | Re: Isn't that beauty ? (no it's not) |
| Message-ID | <10p06i9$2p29v$3@raubtier-asyl.eternal-september.org> |
| In reply to | #396950 |
Am 13.03.2026 um 02:22 schrieb DFS: > That's 50 in and 50 out. Yes, but sorted. > So what's the RegEx for? Learn Regex !
[toc] | [prev] | [next] | [standalone]
| From | Bonita Montero <Bonita.Montero@gmail.com> |
|---|---|
| Date | 2026-03-14 06:48 +0100 |
| Subject | Re: Isn't that beauty ? (no it's not) |
| Message-ID | <10p2ss7$3vm5f$1@raubtier-asyl.eternal-september.org> |
| In reply to | #396950 |
Am 13.03.2026 um 02:22 schrieb DFS: > On 3/12/2026 11:48 AM, Bonita Montero wrote: >> Am 12.03.2026 um 16:22 schrieb DFS: >> >>> Give me the file you used. >> >> Better take this: > > That's 50 in and 50 out. > > So what's the RegEx for? For each line: 1. Skip as many whitespace as possible. 2. Match '"'. 3. Read name until a '"' comes. 4. Match '"'. 5. Skip as many whitespace as possible. 6. Repeat step 1 to 5 for the telephone number. 7. Match line end. 7. Store name and telephone number in a list. 8. Sort the list according to the name. 9. Print each entry.
[toc] | [prev] | [next] | [standalone]
| From | DFS <nospam@dfs.com> |
|---|---|
| Date | 2026-03-14 03:29 -0400 |
| Subject | Re: Isn't that beauty ? (no it's not) |
| Message-ID | <10p32pd$utg$6@dont-email.me> |
| In reply to | #396987 |
On 3/14/2026 1:48 AM, Bonita Montero wrote: > Am 13.03.2026 um 02:22 schrieb DFS: >> On 3/12/2026 11:48 AM, Bonita Montero wrote: >>> Am 12.03.2026 um 16:22 schrieb DFS: >>> >>>> Give me the file you used. >>> >>> Better take this: >> >> That's 50 in and 50 out. >> >> So what's the RegEx for? > > For each line: > 1. Skip as many whitespace as possible. > 2. Match '"'. > 3. Read name until a '"' comes. > 4. Match '"'. > 5. Skip as many whitespace as possible. > 6. Repeat step 1 to 5 for the telephone number. > 7. Match line end. > 7. Store name and telephone number in a list. > 8. Sort the list according to the name. > 9. Print each entry. Thanks.
[toc] | [prev] | [next] | [standalone]
| From | Bonita Montero <Bonita.Montero@gmail.com> |
|---|---|
| Date | 2026-03-12 16:44 +0100 |
| Subject | Re: Isn't that beauty ? (no it's not) |
| Message-ID | <10oun00$24r9s$1@raubtier-asyl.eternal-september.org> |
| In reply to | #396929 |
Am 12.03.2026 um 16:10 schrieb Bonita Montero: > static regex rxNameTel( "^\\s*\"([^\"]*)\"\\s*\"([^\"]*)\"\\s*$" ); Easier to read as a C++ raw string: R"~(^\s*"([^"]*)"\s*"([^"]*)"\s*$)~" The regex is between ~( and )~.
[toc] | [prev] | [next] | [standalone]
| From | scott@slp53.sl.home (Scott Lurndal) |
|---|---|
| Date | 2026-03-12 17:32 +0000 |
| Subject | Re: Isn't that beauty ? (no it's not) |
| Message-ID | <sMCsR.184733$4t2.151351@fx14.iad> |
| In reply to | #396929 |
Bonita Montero <Bonita.Montero@gmail.com> writes:
>Am 12.03.2026 um 15:43 schrieb DFS:
>> On 3/12/2026 10:13 AM, Bonita Montero wrote:
>>> Here, do that in C:
>>>
>>> static optional<size_t> parse( const char *str )
>>> {
>>> size_t ret;
>>> if( from_chars_result fcr = from_chars( str, str + strlen( str ),
>>> ret ); (bool)fcr.ec || *fcr.ptr )
>>> return nullopt;
>>> return ret;
>>> }
>>
>>
>> Explain in detail what it does.
>
>If that isn't self-explanatory stick with C.
>
>I've got a task for you: Do the same in C:
>
>#include <iostream>
>#include <regex>
>#include <fstream>
>#include <vector>
>#include <algorithm>
>#include <vector>
>
>using namespace std;
>
>int main( int argc, char **argv )
>{
> if( argc < 2 )
> return EXIT_FAILURE;
A silent failure implies to the interactive user
that the command succeeded. You should print
a responsive message before returning a failure code.
cerr << "Usage: " << argv[0] << " " <phonelist>" << eol;
(although I would prefer fprintf(stderr, ...)).
> ifstream ifs( argv[1] );
You didn't bother to check if the file was opened.
You should print a responsive message and exit if the streams
failbit is set.
> static regex rxNameTel( "^\\s*\"([^\"]*)\"\\s*\"([^\"]*)\"\\s*$" );
> struct name_tel { string name, tel; };
> vector<name_tel> phoneList;
> while( !ifs.eof() )
> {
> string line;
> getline( ifs, line );
> match_results<string::const_iterator> sm;
> if( regex_match( line, sm, rxNameTel ) )
> phoneList.emplace_back( string( sm[1].first, sm[1].second ), string(
>sm[2].first, sm[2].second ) );
> }
> sort( phoneList.begin(), phoneList.end(),
> []( const name_tel &left, const name_tel &right ) { return left.name <
>right.name; } );
> for( name_tel &phone : phoneList )
> cout << "\"" << phone.name << "\"\t\"" << phone.tel << "\"" << endl;
>}
>
>1. Read a file and parse it with ne mentioned regex-pattern.
>2. Split both parts of every line in two strings.
>3. Sort the "vector" according to the first string.
>4. Print it.
This is certainly a task that can be done simply using a shell
script and the standard POSIX utility set. awk(1) would be
a good starting point; it's possible that it can be done with
a single invocation of the posix 'sort' utility.
Of course, the lack of any in-line documentation (e.g. comments) is
a typical defect in your C++ code.
[toc] | [prev] | [next] | [standalone]
| From | Bonita Montero <Bonita.Montero@gmail.com> |
|---|---|
| Date | 2026-03-13 00:56 +0100 |
| Subject | Re: Isn't that beauty ? (no it's not) |
| Message-ID | <10ovjr4$2hpj4$1@raubtier-asyl.eternal-september.org> |
| In reply to | #396938 |
Am 12.03.2026 um 18:32 schrieb Scott Lurndal: > You didn't bother to check if the file was opened. That's not necessary to compare it against a equal solution in C. > This is certainly a task that can be done simply using a shell > script and the standard POSIX utility set. awk(1) would be > a good starting point; it's possible that it can be done with > a single invocation of the posix 'sort' utility. It's comparison of C against C++. > Of course, the lack of any in-line documentation (e.g. comments) is > a typical defect in your C++ code. Complete idiot.
[toc] | [prev] | [next] | [standalone]
| From | "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> |
|---|---|
| Date | 2026-03-13 11:54 -0700 |
| Subject | Re: Isn't that beauty ? (no it's not) |
| Message-ID | <10p1mh0$3fsme$4@dont-email.me> |
| In reply to | #396943 |
On 3/12/2026 4:56 PM, Bonita Montero wrote: > Am 12.03.2026 um 18:32 schrieb Scott Lurndal: > >> You didn't bother to check if the file was opened. > > That's not necessary to compare it against a equal solution in C. > > >> This is certainly a task that can be done simply using a shell >> script and the standard POSIX utility set. awk(1) would be >> a good starting point; it's possible that it can be done with >> a single invocation of the posix 'sort' utility. > > It's comparison of C against C++. > >> Of course, the lack of any in-line documentation (e.g. comments) is >> a typical defect in your C++ code. > > Complete idiot. > Scott is the opposite of idiot.
[toc] | [prev] | [next] | [standalone]
| From | Bonita Montero <Bonita.Montero@gmail.com> |
|---|---|
| Date | 2026-03-13 01:14 +0100 |
| Subject | Re: Isn't that beauty ? (no it's not) |
| Message-ID | <10ovks7$2i9jd$1@raubtier-asyl.eternal-september.org> |
| In reply to | #396938 |
Am 12.03.2026 um 18:32 schrieb Scott Lurndal: > You didn't bother to check if the file was opened. If the file couldn't been opened nothing happens. No difference to a check.
[toc] | [prev] | [next] | [standalone]
| From | DFS <nospam@dfs.com> |
|---|---|
| Date | 2026-03-12 16:18 -0400 |
| Subject | Re: Isn't that beauty ? (no it's not) |
| Message-ID | <10ov73a$2bugo$3@dont-email.me> |
| In reply to | #396929 |
On 3/12/2026 11:10 AM, Bonita Montero wrote:
> I've got a task for you: Do the same in C:
>
> #include <iostream>
> #include <regex>
> #include <fstream>
> #include <vector>
> #include <algorithm>
> #include <vector>
>
> using namespace std;
>
> int main( int argc, char **argv )
> {
> if( argc < 2 )
> return EXIT_FAILURE;
> ifstream ifs( argv[1] );
> static regex rxNameTel( "^\\s*\"([^\"]*)\"\\s*\"([^\"]*)\"\\s*$" );
> struct name_tel { string name, tel; };
> vector<name_tel> phoneList;
> while( !ifs.eof() )
> {
> string line;
> getline( ifs, line );
> match_results<string::const_iterator> sm;
> if( regex_match( line, sm, rxNameTel ) )
> phoneList.emplace_back( string( sm[1].first, sm[1].second
> ), string( sm[2].first, sm[2].second ) );
> }
> sort( phoneList.begin(), phoneList.end(),
> []( const name_tel &left, const name_tel &right ) { return
> left.name < right.name; } );
> for( name_tel &phone : phoneList )
> cout << "\"" << phone.name << "\"\t\"" << phone.tel << "\"" <<
> endl;
> }
>
> 1. Read a file and parse it with ne mentioned regex-pattern.
> 2. Split both parts of every line in two strings.
> 3. Sort the "vector" according to the first string.
> 4. Print it.
>
> I guess you don't manage to do that with less than five times the work.
> Every external lib allowed.
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
--------------------------------------------------------------------------
//public domain code to read a list of words in and print N
//random words in sorted order
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <time.h>
#include <unistd.h>
int compare(const void *a, const void *b) {
const char* ca = *(const char**)a;
const char* cb = *(const char**)b;
return strcmp(ca,cb);
}
int main(int argc, char *argv[]) {
if (argc != 3) {
printf("Enter file name and a number:\n$./prog file.txt 200\n");
return 0;
}
int i = 0;
int lines = 0;
char line[35] = "";
int N = atoi(argv[2]);
int randnbr, randnbr2;
FILE *fin = fopen(argv[1],"r");
while (fgets(line,sizeof line, fin) != NULL) {lines++;}
if (N > lines) {
printf("Enter a value < %d\n", lines);
exit(0);
}
rewind(fin);
char **wordlist = malloc(sizeof(char*) * lines);
while (fgets(line,sizeof line, fin) != NULL) {
int datalen = strlen(line);
wordlist[i] = malloc(datalen + 1);
strncpy(wordlist[i], line, datalen);
wordlist[i][datalen] = '\0';
i++;
}
char **wordrand = malloc(sizeof(char*) * N);
srand(time(NULL) + getpid());
for (i = 0; i < N; i++) {
int randnbr = (rand() % lines) + 1;
int datalen = strlen(wordlist[randnbr]);
wordrand[i] = malloc(datalen + 1);
strncpy(wordrand[i], wordlist[randnbr], datalen);
wordrand[i][datalen] = '\0';
}
qsort(wordrand, N, sizeof(char*), compare);
printf("%d words read in\n", lines);
printf("%d random words extracted\n",N);
int currletter = wordrand[0][0];
for (i = 0; i < N; i++) {
if ((wordrand[i][0] != currletter) && (i > 0)) {
printf("\n");
}
currletter = wordrand[i][0];
printf("%d. %s",i+1, wordrand[i]);
}
printf("\n");
free(wordrand);
free(wordlist);
return 0;
}
--------------------------------------------------------------------------
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
...
[toc] | [prev] | [next] | [standalone]
| From | Bonita Montero <Bonita.Montero@gmail.com> |
|---|---|
| Date | 2026-03-13 01:06 +0100 |
| Subject | Re: Isn't that beauty ? (no it's not) |
| Message-ID | <10ovkd9$2hpj4$4@raubtier-asyl.eternal-september.org> |
| In reply to | #396941 |
Failed ... You're parsing a completely different type of file. And with 2.5 times the source length.
[toc] | [prev] | [next] | [standalone]
| From | Bonita Montero <Bonita.Montero@gmail.com> |
|---|---|
| Date | 2026-03-13 01:27 +0100 |
| Subject | Re: Isn't that beauty ? (no it's not) |
| Message-ID | <10ovlm7$2ijcp$1@raubtier-asyl.eternal-september.org> |
| In reply to | #396941 |
I shortened my code a bit.
Do that:
#include <iostream>
#include <regex>
#include <fstream>
#include <vector>
#include <algorithm>
using namespace std;
int main( int argc, char **argv )
{
if( argc < 2 )
return EXIT_FAILURE;
ifstream ifs( argv[1] );
static regex rxNameTel( R"~(^\s*"([^"]*)"\s*"([^"]*)"\s*$)~" );
struct name_tel { string name, tel; };
vector<name_tel> phoneList;
smatch sm;
for( string line; getline( ifs, line ); )
if( regex_match( line, sm, rxNameTel ) )
phoneList.emplace_back( sm[1].str(), sm[2].str() );
sort( phoneList.begin(), phoneList.end(),
[]( name_tel &left, name_tel &right ) { return left.name < right.name;
} );
for( name_tel &phone : phoneList )
cout << "\"" << phone.name << "\"\t\"" << phone.tel << "\"" << endl;
}
Have a closer look at the regex.
[toc] | [prev] | [next] | [standalone]
| From | DFS <nospam@dfs.com> |
|---|---|
| Date | 2026-03-13 16:11 -0400 |
| Subject | Re: Isn't that beauty ? (no it's not) |
| Message-ID | <10p1r1q$3hfeq$1@dont-email.me> |
| In reply to | #396947 |
On 3/12/2026 8:27 PM, Bonita Montero wrote:
> I shortened my code a bit.
> Do that:
>
> #include <iostream>
> #include <regex>
> #include <fstream>
> #include <vector>
> #include <algorithm>
>
> using namespace std;
>
> int main( int argc, char **argv )
> {
> if( argc < 2 )
> return EXIT_FAILURE;
> ifstream ifs( argv[1] );
> static regex rxNameTel( R"~(^\s*"([^"]*)"\s*"([^"]*)"\s*$)~" );
> struct name_tel { string name, tel; };
> vector<name_tel> phoneList;
> smatch sm;
> for( string line; getline( ifs, line ); )
> if( regex_match( line, sm, rxNameTel ) )
> phoneList.emplace_back( sm[1].str(), sm[2].str() );
> sort( phoneList.begin(), phoneList.end(),
> []( name_tel &left, name_tel &right ) { return left.name <
> right.name; } );
> for( name_tel &phone : phoneList )
> cout << "\"" << phone.name << "\"\t\"" << phone.tel << "\"" <<
> endl;
> }
>
> Have a closer look at the regex.
Got a massive set of compile errors:
$ g++ montero-sort2.cpp -o montero
In file included from
/usr/include/x86_64-linux-gnu/c++/11/bits/c++allocator.h:33,
from /usr/include/c++/11/bits/allocator.h:46,
from /usr/include/c++/11/string:41,
from /usr/include/c++/11/bits/locale_classes.h:40,
from /usr/include/c++/11/bits/ios_base.h:41,
from /usr/include/c++/11/ios:42,
from /usr/include/c++/11/ostream:38,
from /usr/include/c++/11/iostream:39,
from montero-sort2.cpp:1:
/usr/include/c++/11/ext/new_allocator.h: In instantiation of ‘void
__gnu_cxx::new_allocator<_Tp>::construct(_Up*, _Args&& ...) [with _Up =
main(int, char**)::name_tel; _Args = {std::__cxx11::basic_string<char,
std::char_traits<char>, std::allocator<char> >,
std::__cxx11::basic_string<char, std::char_traits<char>,
std::allocator<char> >}; _Tp = main(int, char**)::name_tel]’:
/usr/include/c++/11/bits/alloc_traits.h:516:17: required from ‘static
void std::allocator_traits<std::allocator<_CharT>
>::construct(std::allocator_traits<std::allocator<_CharT>
>::allocator_type&, _Up*, _Args&& ...) [with _Up = main(int,
char**)::name_tel; _Args = {std::__cxx11::basic_string<char,
std::char_traits<char>, std::allocator<char> >,
std::__cxx11::basic_string<char, std::char_traits<char>,
std::allocator<char> >}; _Tp = main(int, char**)::name_tel;
std::allocator_traits<std::allocator<_CharT> >::allocator_type =
std::allocator<main(int, char**)::name_tel>]’
/usr/include/c++/11/bits/vector.tcc:115:30: required from
‘std::vector<_Tp, _Alloc>::reference std::vector<_Tp,
_Alloc>::emplace_back(_Args&& ...) [with _Args =
{std::__cxx11::basic_string<char, std::char_traits<char>,
std::allocator<char> >, std::__cxx11::basic_string<char,
std::char_traits<char>, std::allocator<char> >}; _Tp = main(int,
char**)::name_tel; _Alloc = std::allocator<main(int, char**)::name_tel>;
std::vector<_Tp, _Alloc>::reference = main(int, char**)::name_tel&]’
montero-sort2.cpp:20:35: required from here
/usr/include/c++/11/ext/new_allocator.h:162:11: error: no matching
function for call to ‘main(int,
char**)::name_tel::name_tel(std::__cxx11::basic_string<char>,
std::__cxx11::basic_string<char>)’
162 | { ::new((void *)__p) _Up(std::forward<_Args>(__args)...); }
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
montero-sort2.cpp:15:16: note: candidate: ‘main(int,
char**)::name_tel::name_tel()’
15 | struct name_tel { string name, tel; };
| ^~~~~~~~
montero-sort2.cpp:15:16: note: candidate expects 0 arguments, 2 provided
montero-sort2.cpp:15:16: note: candidate: ‘main(int,
char**)::name_tel::name_tel(const main(int, char**)::name_tel&)’
montero-sort2.cpp:15:16: note: candidate expects 1 argument, 2 provided
montero-sort2.cpp:15:16: note: candidate: ‘main(int,
char**)::name_tel::name_tel(main(int, char**)::name_tel&&)’
montero-sort2.cpp:15:16: note: candidate expects 1 argument, 2 provided
[toc] | [prev] | [next] | [standalone]
| From | Bonita Montero <Bonita.Montero@gmail.com> |
|---|---|
| Date | 2026-03-14 06:01 +0100 |
| Subject | Re: Isn't that beauty ? (no it's not) |
| Message-ID | <10p2q41$3umkh$1@raubtier-asyl.eternal-september.org> |
| In reply to | #396982 |
Am 13.03.2026 um 21:11 schrieb DFS:
> On 3/12/2026 8:27 PM, Bonita Montero wrote:
>> I shortened my code a bit.
>> Do that:
>>
>> #include <iostream>
>> #include <regex>
>> #include <fstream>
>> #include <vector>
>> #include <algorithm>
>>
>> using namespace std;
>>
>> int main( int argc, char **argv )
>> {
>> if( argc < 2 )
>> return EXIT_FAILURE;
>> ifstream ifs( argv[1] );
>> static regex rxNameTel( R"~(^\s*"([^"]*)"\s*"([^"]*)"\s*$)~" );
>> struct name_tel { string name, tel; };
>> vector<name_tel> phoneList;
>> smatch sm;
>> for( string line; getline( ifs, line ); )
>> if( regex_match( line, sm, rxNameTel ) )
>> phoneList.emplace_back( sm[1].str(), sm[2].str() );
>> sort( phoneList.begin(), phoneList.end(),
>> []( name_tel &left, name_tel &right ) { return left.name <
>> right.name; } );
>> for( name_tel &phone : phoneList )
>> cout << "\"" << phone.name << "\"\t\"" << phone.tel << "\""
>> << endl;
>> }
>>
>> Have a closer look at the regex.
>
>
> Got a massive set of compile errors:
>= -std=c++20
[toc] | [prev] | [next] | [standalone]
| From | DFS <nospam@dfs.com> |
|---|---|
| Date | 2026-03-14 01:49 -0400 |
| Subject | Re: Isn't that beauty ? (no it's not) |
| Message-ID | <10p2ssl$3ven8$1@dont-email.me> |
| In reply to | #396985 |
On 3/14/2026 1:01 AM, Bonita Montero wrote:
> Am 13.03.2026 um 21:11 schrieb DFS:
>> On 3/12/2026 8:27 PM, Bonita Montero wrote:
>>> I shortened my code a bit.
>>> Do that:
>>>
>>> #include <iostream>
>>> #include <regex>
>>> #include <fstream>
>>> #include <vector>
>>> #include <algorithm>
>>>
>>> using namespace std;
>>>
>>> int main( int argc, char **argv )
>>> {
>>> if( argc < 2 )
>>> return EXIT_FAILURE;
>>> ifstream ifs( argv[1] );
>>> static regex rxNameTel( R"~(^\s*"([^"]*)"\s*"([^"]*)"\s*$)~" );
>>> struct name_tel { string name, tel; };
>>> vector<name_tel> phoneList;
>>> smatch sm;
>>> for( string line; getline( ifs, line ); )
>>> if( regex_match( line, sm, rxNameTel ) )
>>> phoneList.emplace_back( sm[1].str(), sm[2].str() );
>>> sort( phoneList.begin(), phoneList.end(),
>>> []( name_tel &left, name_tel &right ) { return left.name <
>>> right.name; } );
>>> for( name_tel &phone : phoneList )
>>> cout << "\"" << phone.name << "\"\t\"" << phone.tel << "\""
>>> << endl;
>>> }
>>>
>>> Have a closer look at the regex.
>>
>>
>> Got a massive set of compile errors:
>
> >= -std=c++20
Got it.
Your output is messy. What you want to do is iterate the data and find
the longest name, then pad spaces after the name so the phone numbers
line up.
See at the bottom how it should look.
===========================================================
// read in a Montero file of names and phone numbers
// trim spaces, align data, sort, print
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <ctype.h>
#include <wchar.h> //to handle multibyte characters
//compare function for qsort
int compare(const void *a, const void *b) {
return strcmp(*(const char**)a, *(const char**)b);
}
//replace character in a string
void replace(char *str, char from, char to) {
int i=0;
while(str[i] != '\0'){
if(str[i] == from){
str[i] = to;
} i++;
}
}
//remove leading and trailing spaces
void trim(char *str) {
int i=0, j=0, start=0, end=strlen(str)-1;
for (i = 0; i < strlen(str); i++) {if (isspace(str[i])) {start++;}
else {break;}}
for (i = strlen(str) - 1; i > 0; i--) {if (isspace(str[i])) {end--; }
else {break;}}
for (i = start; i <= end; i++) {str[j++] = str[i];}
str[j] = '\0';
}
//align name and phone, and handle multibyte characters like ü
char setspacing(char *str, int longname)
{
char *token;
char name[50] = {0};
char spaces[] = " ";
token = strtok(str," ");
int i = 0;
while(token != NULL && i < 3) {
strncat(name, token, strlen(token));
if (i==0) {strncat(name, spaces, 1);}
int namesize = strlen(name);
int mbsize = mbstowcs(NULL, name, 0);
if (mbsize < 0) {namesize += mbsize;}
if (i==1) {strncat(name, spaces, longname - namesize + 3);}
token = strtok(NULL, " ");
i++;
}
strncpy(str,name,strlen(name));
str[strlen(str)] = '\0';
}
int main(int argc, char *argv[]) {
int i = 0;
int names = 0;
char name[100] = "";
int longname = 0;
//count names, and determine longest name
FILE *fin = fopen(argv[1],"r");
while (fgets(name,sizeof name, fin) != NULL) {
names++;
trim(name);
for (i = 1; i < strlen(name); i++) {
if (name[i] == '"') {
if (i > longname) {
longname = i;
}
break;
}
}
}
//add names to array, also trim spaces, remove
//quote marks and align name/phone
rewind(fin);
i = 0;
char **namelist = malloc(sizeof(char*) * names);
while (fgets(name,sizeof name, fin) != NULL) {
trim(name);
replace(name,'"',' ');
char *dupename = strdup(name);
setspacing(dupename, longname);
int datalen = strlen(dupename);
namelist[i] = malloc(datalen + 1);
strncpy(namelist[i], dupename, datalen);
i++;
}
fclose(fin);
//sort and print names
qsort(namelist, names, sizeof(char*), compare);
for (i = 0; i < names; i++) {
printf("%2d. %s\n",i+1, namelist[i]);
}
printf("\n");
free(namelist);
return 0;
}
===========================================================
88 LOC
16.84MB executable
perfect output
$ ./dfs names-numbers-unsorted-montero.txt
1. Anna Becker 0170-2233445
2. Anna Fischer 0341-9988776
3. Anna Müller 0987-6543210
4. Ben Meier 0341-5566778
5. Ben Richter 069-3344556
6. Clara Hofmann 0157-2233445
7. Clara Zimmermann 040-55667788
8. David Schulz 030-9988776
9. Emma Bauer 0157-9988776
10. Emma Wolf 040-5566778
11. Felix Hoffmann 0711-5566778
12. Felix Neumann 0170-2233445
13. Hannah Wagner 0221-5566778
14. Jan Hoffmann 0711-3344556
15. Jana Zimmer 030-6677889
16. Jonas Klein 0171-4455667
17. Jonas Klein 030-4455667
18. Julia Neumann 0221-3344556
19. Julia Schulz 0228-4455667
20. Laura Fischer 040-98765433
21. Laura Schulze 0228-1122334
22. Lea Richter 0341-1122334
23. Lea Wagner 0151-3344556
24. Lena Fischer 0151-6677889
25. Leon Krause 089-1122334
26. Leon Zimmermann 0711-1122445
27. Leonie Klein 0341-5566778
28. Lukas Hofmann 089-6677889
29. Lukas König 069-7788990
30. Marie Becker 040-4455667
31. Marie Richter 0221-7788990
32. Max Mustermann 0123-4567890
33. Maximilian Keller 030-1122334
34. Mia Keller 089-6677889
35. Michael Braun 0170-9988776
36. Moritz Wolf 0157-4455667
37. Nina Krause 0341-4455667
38. Paul Schäfer 0228-3344556
39. Paul Wolf 030-2233445
40. Peter Schmidt 030-1234567
41. Philipp König 089-9988776
42. Sarah Braun 040-7788990
43. Sarah Lehmann 040-2233445
44. Simon Meier 030-7788990
45. Sophie Neumann 0711-3344556
46. Sophie Wagner 089-2233445
47. Tim Becker 0151-1112223
48. Tim Richter 030-6677889
49. Tim Schäfer 0711-5566778
50. Tom Bauer 0171-1122334
[toc] | [prev] | [next] | [standalone]
| From | Bonita Montero <Bonita.Montero@gmail.com> |
|---|---|
| Date | 2026-03-14 07:23 +0100 |
| Subject | Re: Isn't that beauty ? (no it's not) |
| Message-ID | <10p2uth$gpk$2@raubtier-asyl.eternal-september.org> |
| In reply to | #396988 |
Am 14.03.2026 um 06:49 schrieb DFS: > Your output is messy. What you want to do is iterate the data and find > the longest name, then pad spaces after the name so the phone numbers > line up. No, alphabetically ordered. My code exactly does that. > 88 LOC > 16.84MB executable > perfect output > > > $ ./dfs names-numbers-unsorted-montero.txt > 1. Anna Becker 0170-2233445 > ... My output is the same without line numbers: "Anna Becker" "0170-2233445" "Anna Fischer" "0341-9988776" "Anna Müller" "0987-6543210" "Ben Meier" "0341-5566778" "Ben Richter" "069-3344556" "Clara Hofmann" "0157-2233445" "Clara Zimmermann" "040-5566778" "David Schulz" "030-9988776" "Emma Bauer" "0157-9988776" "Emma Wolf" "040-5566778" "Felix Hoffmann" "0711-5566778" "Felix Neumann" "0170-2233445" "Hannah Wagner" "0221-5566778" "Jan Hoffmann" "0711-3344556" "Jana Zimmer" "030-6677889" "Jonas Klein" "0171-4455667" "Jonas Klein" "030-4455667" "Julia Neumann" "0221-3344556" "Julia Schulz" "0228-4455667" "Laura Fischer" "040-9876543" "Laura Schulze" "0228-1122334" "Lea Richter" "0341-1122334" "Lea Wagner" "0151-3344556" "Lena Fischer" "0151-6677889" "Leon Krause" "089-1122334" "Leon Zimmermann" "0711-1122445" "Leonie Klein" "0341-5566778" "Lukas Hofmann" "089-6677889" "Lukas König" "069-7788990" "Marie Becker" "040-4455667" "Marie Richter" "0221-7788990" "Max Mustermann" "0123-4567890" "Maximilian Keller" "030-1122334" "Mia Keller" "089-6677889" "Michael Braun" "0170-9988776" "Moritz Wolf" "0157-4455667" "Nina Krause" "0341-4455667" "Paul Schäfer" "0228-3344556" "Paul Wolf" "030-2233445" "Peter Schmidt" "030-1234567" "Philipp König" "089-9988776" "Sarah Braun" "040-7788990" "Sarah Lehmann" "040-2233445" "Simon Meier" "030-7788990" "Sophie Neumann" "0711-3344556" "Sophie Wagner" "089-2233445" "Tim Becker" "0151-1112223" "Tim Richter" "030-6677889" "Tim Schäfer" "0711-5566778" "Tom Bauer" "0171-1122334" But your code is 101 lines of code, my 25. C really sucks.
[toc] | [prev] | [next] | [standalone]
Page 2 of 12 — ← Prev page 1 [2] 3 4 … 12 Next page →
Back to top | Article view | comp.lang.c
csiph-web