Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.os.linux.misc > #77092 > unrolled thread
| Started by | c186282 <c186282@nnada.net> |
|---|---|
| First post | 2025-11-08 02:01 -0500 |
| Last post | 2025-11-09 19:08 +0000 |
| Articles | 20 on this page of 308 — 33 participants |
Back to article view | Back to comp.os.linux.misc
Python/C/Pascal ... How To Choose ? c186282 <c186282@nnada.net> - 2025-11-08 02:01 -0500
Re: Python/C/Pascal ... How To Choose ? Diego Garcia <dg@linux.rocks> - 2025-11-08 11:31 +0000
Re: Python/C/Pascal ... How To Choose ? Diego Garcia <dg@linux.rocks> - 2025-11-08 12:15 +0000
Re: Python/C/Pascal ... How To Choose ? "Carlos E.R." <robin_listas@es.invalid> - 2025-11-08 13:32 +0100
Re: Python/C/Pascal ... How To Choose ? c186282 <c186282@nnada.net> - 2025-11-09 00:08 -0500
Re: Python/C/Pascal ... How To Choose ? rbowman <bowman@montana.com> - 2025-11-09 19:51 +0000
Re: Python/C/Pascal ... How To Choose ? c186282 <c186282@nnada.net> - 2025-11-10 00:38 -0500
Re: Python/C/Pascal ... How To Choose ? rbowman <bowman@montana.com> - 2025-11-10 07:35 +0000
Re: Python/C/Pascal ... How To Choose ? The Natural Philosopher <tnp@invalid.invalid> - 2025-11-08 12:50 +0000
Re: Python/C/Pascal ... How To Choose ? Diego Garcia <dg@linux.rocks> - 2025-11-08 12:57 +0000
Re: Python/C/Pascal ... How To Choose ? c186282 <c186282@nnada.net> - 2025-11-08 23:58 -0500
Re: Python/C/Pascal ... How To Choose ? Diego Garcia <dg@linux.rocks> - 2025-11-09 11:25 +0000
Re: Python/C/Pascal ... How To Choose ? The Natural Philosopher <tnp@invalid.invalid> - 2025-11-09 12:48 +0000
Re: Python/C/Pascal ... How To Choose ? c186282 <c186282@nnada.net> - 2025-11-09 23:29 -0500
Re: Python/C/Pascal ... How To Choose ? Bobbie Sellers <bliss-sf4ever@dslextreme.com> - 2025-11-09 09:18 -0800
Re: Python/C/Pascal ... How To Choose ? Diego Garcia <dg@linux.rocks> - 2025-11-09 20:13 +0000
Re: Python/C/Pascal ... How To Choose ? rbowman <bowman@montana.com> - 2025-11-10 07:47 +0000
Re: Python/C/Pascal ... How To Choose ? The Natural Philosopher <tnp@invalid.invalid> - 2025-11-10 12:09 +0000
Re: Python/C/Pascal ... How To Choose ? rbowman <bowman@montana.com> - 2025-11-10 20:35 +0000
Re: Python/C/Pascal ... How To Choose ? Charlie Gibbs <cgibbs@kltpzyxm.invalid> - 2025-11-10 21:15 +0000
Re: Python/C/Pascal ... How To Choose ? The Natural Philosopher <tnp@invalid.invalid> - 2025-11-10 23:33 +0000
Re: Python/C/Pascal ... How To Choose ? rbowman <bowman@montana.com> - 2025-11-11 03:23 +0000
Re: Python/C/Pascal ... How To Choose ? c186282 <c186282@nnada.net> - 2025-11-11 01:03 -0500
Re: Python/C/Pascal ... How To Choose ? The Natural Philosopher <tnp@invalid.invalid> - 2025-11-11 10:57 +0000
Re: Python/C/Pascal ... How To Choose ? rbowman <bowman@montana.com> - 2025-11-11 19:36 +0000
Re: Python/C/Pascal ... How To Choose ? "Carlos E.R." <robin_listas@es.invalid> - 2025-11-11 20:50 +0100
Re: Python/C/Pascal ... How To Choose ? The Natural Philosopher <tnp@invalid.invalid> - 2025-11-11 23:44 +0000
Re: Python/C/Pascal ... How To Choose ? c186282 <c186282@nnada.net> - 2025-11-12 01:38 -0500
Re: Python/C/Pascal ... How To Choose ? Charlie Gibbs <cgibbs@kltpzyxm.invalid> - 2025-11-12 20:44 +0000
Re: Python/C/Pascal ... How To Choose ? Bobbie Sellers <bliss-sf4ever@dslextreme.com> - 2025-11-12 16:38 -0800
Re: Python/C/Pascal ... How To Choose ? rbowman <bowman@montana.com> - 2025-11-13 04:29 +0000
Re: Python/C/Pascal ... How To Choose ? Charlie Gibbs <cgibbs@kltpzyxm.invalid> - 2025-11-13 05:07 +0000
Re: Python/C/Pascal ... How To Choose ? c186282 <c186282@nnada.net> - 2025-11-13 01:09 -0500
Re: Python/C/Pascal ... How To Choose ? c186282 <c186282@nnada.net> - 2025-11-13 00:42 -0500
Re: Python/C/Pascal ... How To Choose ? c186282 <c186282@nnada.net> - 2025-11-13 00:37 -0500
Re: Python/C/Pascal ... How To Choose ? c186282 <c186282@nnada.net> - 2025-11-11 23:46 -0500
Re: Python/C/Pascal ... How To Choose ? rbowman <bowman@montana.com> - 2025-11-12 05:31 +0000
Re: Python/C/Pascal ... How To Choose ? Charlie Gibbs <cgibbs@kltpzyxm.invalid> - 2025-11-12 06:00 +0000
Re: Python/C/Pascal ... How To Choose ? c186282 <c186282@nnada.net> - 2025-11-12 02:08 -0500
Re: Python/C/Pascal ... How To Choose ? The Natural Philosopher <tnp@invalid.invalid> - 2025-11-12 10:55 +0000
Re: Python/C/Pascal ... How To Choose ? c186282 <c186282@nnada.net> - 2025-11-12 23:30 -0500
Re: Python/C/Pascal ... How To Choose ? c186282 <c186282@nnada.net> - 2025-11-12 01:56 -0500
Re: Python/C/Pascal ... How To Choose ? The Natural Philosopher <tnp@invalid.invalid> - 2025-11-12 10:54 +0000
Re: Python/C/Pascal ... How To Choose ? c186282 <c186282@nnada.net> - 2025-11-12 23:17 -0500
Re: Python/C/Pascal ... How To Choose ? The Natural Philosopher <tnp@invalid.invalid> - 2025-11-13 10:38 +0000
Re: Python/C/Pascal ... How To Choose ? "Carlos E.R." <robin_listas@es.invalid> - 2025-11-12 12:20 +0100
Re: Python/C/Pascal ... How To Choose ? c186282 <c186282@nnada.net> - 2025-11-12 23:50 -0500
Re: Python/C/Pascal ... How To Choose ? rbowman <bowman@montana.com> - 2025-11-11 03:18 +0000
Re: Python/C/Pascal ... How To Choose ? c186282 <c186282@nnada.net> - 2025-11-11 00:54 -0500
Re: Python/C/Pascal ... How To Choose ? rbowman <bowman@montana.com> - 2025-11-11 19:28 +0000
Re: Python/C/Pascal ... How To Choose ? The Natural Philosopher <tnp@invalid.invalid> - 2025-11-11 23:25 +0000
Re: Python/C/Pascal ... How To Choose ? rbowman <bowman@montana.com> - 2025-11-12 04:35 +0000
Re: Python/C/Pascal ... How To Choose ? c186282 <c186282@nnada.net> - 2025-11-12 01:49 -0500
Re: Python/C/Pascal ... How To Choose ? The Natural Philosopher <tnp@invalid.invalid> - 2025-11-12 10:49 +0000
Re: Python/C/Pascal ... How To Choose ? c186282 <c186282@nnada.net> - 2025-11-12 01:31 -0500
Re: Python/C/Pascal ... How To Choose ? Charlie Gibbs <cgibbs@kltpzyxm.invalid> - 2025-11-12 20:44 +0000
Re: Python/C/Pascal ... How To Choose ? c186282 <c186282@nnada.net> - 2025-11-11 23:33 -0500
Re: Python/C/Pascal ... How To Choose ? Charlie Gibbs <cgibbs@kltpzyxm.invalid> - 2025-11-11 21:07 +0000
Re: Python/C/Pascal ... How To Choose ? c186282 <c186282@nnada.net> - 2025-11-12 01:21 -0500
Re: Python/C/Pascal ... How To Choose ? Charlie Gibbs <cgibbs@kltpzyxm.invalid> - 2025-11-12 20:44 +0000
Re: Python/C/Pascal ... How To Choose ? c186282 <c186282@nnada.net> - 2025-11-13 00:13 -0500
Re: Python/C/Pascal ... How To Choose ? rbowman <bowman@montana.com> - 2025-11-13 05:40 +0000
Re: Python/C/Pascal ... How To Choose ? c186282 <c186282@nnada.net> - 2025-11-13 01:20 -0500
Re: Python/C/Pascal ... How To Choose ? The Natural Philosopher <tnp@invalid.invalid> - 2025-11-10 23:31 +0000
Re: Python/C/Pascal ... How To Choose ? rbowman <bowman@montana.com> - 2025-11-11 03:39 +0000
Re: Python/C/Pascal ... How To Choose ? Charlie Gibbs <cgibbs@kltpzyxm.invalid> - 2025-11-10 19:48 +0000
Re: Python/C/Pascal ... How To Choose ? Diego Garcia <dg@linux.rocks> - 2025-11-10 20:35 +0000
Re: Python/C/Pascal ... How To Choose ? "Carlos E.R." <robin_listas@es.invalid> - 2025-11-10 21:53 +0100
Re: Python/C/Pascal ... How To Choose ? rbowman <bowman@montana.com> - 2025-11-10 20:37 +0000
Re: Python/C/Pascal ... How To Choose ? c186282 <c186282@nnada.net> - 2025-11-10 23:51 -0500
Re: Python/C/Pascal ... How To Choose ? rbowman <bowman@montana.com> - 2025-11-11 19:40 +0000
Re: Python/C/Pascal ... How To Choose ? Nuno Silva <nunojsilva@invalid.invalid> - 2025-11-11 23:01 +0000
Re: Python/C/Pascal ... How To Choose ? rbowman <bowman@montana.com> - 2025-11-12 04:33 +0000
Re: Python/C/Pascal ... How To Choose ? "Carlos E.R." <robin_listas@es.invalid> - 2025-11-12 12:27 +0100
Re: Python/C/Pascal ... How To Choose ? Andy Burns <usenet@andyburns.uk> - 2025-11-12 12:44 +0000
Re: Python/C/Pascal ... How To Choose ? "Carlos E.R." <robin_listas@es.invalid> - 2025-11-12 14:17 +0100
Re: Python/C/Pascal ... How To Choose ? c186282 <c186282@nnada.net> - 2025-11-12 23:51 -0500
Re: Python/C/Pascal ... How To Choose ? "Carlos E.R." <robin_listas@es.invalid> - 2025-11-13 22:38 +0100
Re: Python/C/Pascal ... How To Choose ? c186282 <c186282@nnada.net> - 2025-11-13 21:30 -0500
Re: Python/C/Pascal ... How To Choose ? Charlie Gibbs <cgibbs@kltpzyxm.invalid> - 2025-11-14 04:21 +0000
Re: Python/C/Pascal ... How To Choose ? rbowman <bowman@montana.com> - 2025-11-14 07:10 +0000
Re: Python/C/Pascal ... How To Choose ? c186282 <c186282@nnada.net> - 2025-11-14 02:51 -0500
Re: Python/C/Pascal ... How To Choose ? rbowman <bowman@montana.com> - 2025-11-14 07:08 +0000
Re: Python/C/Pascal ... How To Choose ? "Carlos E.R." <robin_listas@es.invalid> - 2025-11-14 13:40 +0100
Re: Python/C/Pascal ... How To Choose ? Charlie Gibbs <cgibbs@kltpzyxm.invalid> - 2025-11-14 16:26 +0000
Re: Python/C/Pascal ... How To Choose ? rbowman <bowman@montana.com> - 2025-11-14 19:51 +0000
Re: Python/C/Pascal ... How To Choose ? c186282 <c186282@nnada.net> - 2025-11-14 19:22 -0500
Re: Python/C/Pascal ... How To Choose ? vallor <vallor@vallor.earth> - 2025-11-14 17:34 +0000
Re: Python/C/Pascal ... How To Choose ? rbowman <bowman@montana.com> - 2025-11-14 19:54 +0000
Re: Python/C/Pascal ... How To Choose ? "Carlos E.R." <robin_listas@es.invalid> - 2025-11-14 13:37 +0100
Re: Python/C/Pascal ... How To Choose ? c186282 <c186282@nnada.net> - 2025-11-14 16:09 -0500
Re: Python/C/Pascal ... How To Choose ? rbowman <bowman@montana.com> - 2025-11-15 02:05 +0000
Recent history of vi (was: Re: Python/C/Pascal ... How To Choose ?) Nuno Silva <nunojsilva@invalid.invalid> - 2025-11-15 09:59 +0000
Re: Recent history of vi (was: Re: Python/C/Pascal ... How To Choose ?) rbowman <bowman@montana.com> - 2025-11-15 17:32 +0000
Re: Recent history of vi (was: Re: Python/C/Pascal ... How To Choose ?) ted@loft.tnolan.com (Ted Nolan <tednolan>) - 2025-11-15 18:48 +0000
Re: Recent history of vi (was: Re: Python/C/Pascal ... How To Choose ?) rbowman <bowman@montana.com> - 2025-11-15 21:38 +0000
Re: Recent history of vi (was: Re: Python/C/Pascal ... How To Choose?) Eli the Bearded <*@eli.users.panix.com> - 2025-11-15 22:07 +0000
Re: Recent history of vi (was: Re: Python/C/Pascal ... How To Choose?) Lawrence D’Oliveiro <ldo@nz.invalid> - 2025-11-15 22:21 +0000
Re: Recent history of vi (was: Re: Python/C/Pascal ... How To Choose?) Eli the Bearded <*@eli.users.panix.com> - 2025-11-15 23:14 +0000
Re: Recent history of vi (was: Re: Python/C/Pascal ... How To Choose?) Lawrence D’Oliveiro <ldo@nz.invalid> - 2025-11-16 00:29 +0000
Re: Recent history of vi (was: Re: Python/C/Pascal ... How To Choose?) Eli the Bearded <*@eli.users.panix.com> - 2025-11-16 00:43 +0000
Re: Recent history of vi (was: Re: Python/C/Pascal ... How To Choose?) Lawrence D’Oliveiro <ldo@nz.invalid> - 2025-11-16 00:45 +0000
Re: Recent history of vi Pancho <Pancho.Jones@protonmail.com> - 2025-11-16 09:14 +0000
Re: Recent history of vi mechanicjay@sol.smbfc.net (Mechanicjay) - 2025-11-16 15:40 +0000
Re: Recent history of vi Joe Makowiec <makowiec@invalid.invalid> - 2025-11-16 18:38 +0000
Re: Recent history of vi mechanicjay@sol.smbfc.net (Mechanicjay) - 2025-11-18 03:55 +0000
Re: Recent history of vi Joe Makowiec <makowiec@invalid.invalid> - 2025-11-19 13:11 +0000
Re: Recent history of vi Lawrence D’Oliveiro <ldo@nz.invalid> - 2025-11-19 20:12 +0000
Re: Recent history of vi rbowman <bowman@montana.com> - 2025-11-16 19:10 +0000
Re: Recent history of vi Lawrence D’Oliveiro <ldo@nz.invalid> - 2025-11-16 21:01 +0000
Re: Recent history of vi (was: Re: Python/C/Pascal ... How To Choose?) rbowman <bowman@montana.com> - 2025-11-16 03:43 +0000
Re: Recent history of vi Chris Ahlstrom <OFeem1987@teleworm.us> - 2025-11-16 09:35 -0500
Re: Recent history of vi mechanicjay@sol.smbfc.net (Mechanicjay) - 2025-11-16 15:47 +0000
Re: Recent history of vi (was: Re: Python/C/Pascal ... How To Choose ?) ted@loft.tnolan.com (Ted Nolan <tednolan>) - 2025-11-16 05:15 +0000
Re: Recent history of vi (was: Re: Python/C/Pascal ... How To Choose ?) rbowman <bowman@montana.com> - 2025-11-16 19:31 +0000
Re: Recent history of vi (was: Re: Python/C/Pascal ... How To Choose ?) ted@loft.tnolan.com (Ted Nolan <tednolan>) - 2025-11-16 20:27 +0000
Re: Recent history of vi The Natural Philosopher <tnp@invalid.invalid> - 2025-11-16 20:30 +0000
Re: Recent history of vi Lawrence D’Oliveiro <ldo@nz.invalid> - 2025-11-16 21:04 +0000
Re: Recent history of vi rbowman <bowman@montana.com> - 2025-11-17 04:08 +0000
Re: Recent history of vi Chris Ahlstrom <OFeem1987@teleworm.us> - 2025-11-17 11:39 -0500
Re: Recent history of vi Chris Ahlstrom <OFeem1987@teleworm.us> - 2025-11-16 09:31 -0500
Re: Recent history of vi rbowman <bowman@montana.com> - 2025-11-16 19:03 +0000
Re: Recent history of vi Eli the Bearded <*@eli.users.panix.com> - 2025-11-17 02:32 +0000
Re: Recent history of vi (was: Re: Python/C/Pascal ... How To Choose ?) Lawrence D’Oliveiro <ldo@nz.invalid> - 2025-11-15 21:51 +0000
Re: Recent history of vi (was: Re: Python/C/Pascal ... How To Choose ?) ted@loft.tnolan.com (Ted Nolan <tednolan>) - 2025-11-16 05:11 +0000
Re: Recent history of vi (was: Re: Python/C/Pascal ... How To Choose ?) Lawrence D’Oliveiro <ldo@nz.invalid> - 2025-11-16 05:13 +0000
Re: Recent history of vi (was: Re: Python/C/Pascal ... How To Choose ?) Ian <${send-direct-email-to-news1021-at-jusme-dot-com-if-you-must}@jusme.com> - 2025-11-16 12:15 +0000
Re: Recent history of vi (was: Re: Python/C/Pascal ... How To Choose ?) rbowman <bowman@montana.com> - 2025-11-16 19:24 +0000
Re: Recent history of vi (was: Re: Python/C/Pascal ... How To Choose ?) Ian <${send-direct-email-to-news1021-at-jusme-dot-com-if-you-must}@jusme.com> - 2025-11-17 08:24 +0000
Re: Recent history of vi (was: Re: Python/C/Pascal ... How To Choose ?) Lawrence D’Oliveiro <ldo@nz.invalid> - 2025-11-17 19:57 +0000
Re: Recent history of vi (was: Re: Python/C/Pascal ... How To Choose ?) Ian <${send-direct-email-to-news1021-at-jusme-dot-com-if-you-must}@jusme.com> - 2025-11-18 08:02 +0000
Re: Recent history of vi The Natural Philosopher <tnp@invalid.invalid> - 2025-11-18 12:09 +0000
Re: Recent history of vi (was: Re: Python/C/Pascal ... How To Choose ?) Lawrence D’Oliveiro <ldo@nz.invalid> - 2025-11-16 20:56 +0000
Re: Recent history of vi (was: Re: Python/C/Pascal ... How To Choose ?) rbowman <bowman@montana.com> - 2025-11-17 04:01 +0000
Re: Recent history of vi (was: Re: Python/C/Pascal ... How To Choose ?) Ian <${send-direct-email-to-news1021-at-jusme-dot-com-if-you-must}@jusme.com> - 2025-11-17 08:27 +0000
Re: Recent history of vi The Natural Philosopher <tnp@invalid.invalid> - 2025-11-16 10:33 +0000
Re: Recent history of vi Chris Ahlstrom <OFeem1987@teleworm.us> - 2025-11-16 09:49 -0500
Re: Recent history of vi rbowman <bowman@montana.com> - 2025-11-16 19:28 +0000
Re: Recent history of vi ted@loft.tnolan.com (Ted Nolan <tednolan>) - 2025-11-16 20:19 +0000
Re: Recent history of vi Lawrence D’Oliveiro <ldo@nz.invalid> - 2025-11-16 20:59 +0000
Re: Recent history of vi ted@loft.tnolan.com (Ted Nolan <tednolan>) - 2025-11-16 21:04 +0000
Re: Recent history of vi Lawrence D’Oliveiro <ldo@nz.invalid> - 2025-11-16 21:19 +0000
Re: Recent history of vi ted@loft.tnolan.com (Ted Nolan <tednolan>) - 2025-11-16 21:23 +0000
Re: Recent history of vi Nuno Silva <nunojsilva@invalid.invalid> - 2025-11-16 23:13 +0000
Re: Recent history of vi ted@loft.tnolan.com (Ted Nolan <tednolan>) - 2025-11-16 23:18 +0000
Re: Recent history of vi Lawrence D’Oliveiro <ldo@nz.invalid> - 2025-11-17 00:43 +0000
Re: Recent history of vi Stéphane CARPENTIER <sc@fiat-linux.fr> - 2025-11-21 19:55 +0000
Re: Recent history of vi Lawrence D’Oliveiro <ldo@nz.invalid> - 2025-11-21 20:27 +0000
Re: Recent history of vi Eli the Bearded <*@eli.users.panix.com> - 2025-11-22 03:20 +0000
Re: Recent history of vi Lawrence D’Oliveiro <ldo@nz.invalid> - 2025-11-22 05:57 +0000
Re: Recent history of vi Niklas Karlsson <nikke.karlsson@gmail.com> - 2025-11-16 23:51 +0000
Re: Recent history of vi Johnny Billquist <bqt@softjar.se> - 2025-11-18 20:04 +0100
Re: Recent history of vi Eli the Bearded <*@eli.users.panix.com> - 2025-11-18 20:29 +0000
Re: Recent history of vi Richard Kettlewell <invalid@invalid.invalid> - 2025-11-19 08:24 +0000
Re: Recent history of vi Stéphane CARPENTIER <sc@fiat-linux.fr> - 2025-11-21 19:58 +0000
Re: Recent history of vi Niklas Karlsson <nikke.karlsson@gmail.com> - 2025-11-21 21:14 +0000
ISO 8859-1, ISO 8859-15 and their names (was: Re: Recent history of vi) Nuno Silva <nunojsilva@invalid.invalid> - 2025-11-21 23:20 +0000
Re: Recent history of vi Peter Flass <Peter@Iron-Spring.com> - 2025-11-21 19:10 -0700
Re: Recent history of vi Stéphane CARPENTIER <sc@fiat-linux.fr> - 2025-11-22 10:23 +0000
Re: Recent history of vi Johnny Billquist <bqt@softjar.se> - 2025-11-22 17:55 +0100
Re: Recent history of vi Alexander Schreiber <als@usenet.thangorodrim.de> - 2025-11-22 19:20 +0100
Re: Recent history of vi Lawrence D’Oliveiro <ldo@nz.invalid> - 2025-11-22 21:43 +0000
Re: Recent history of vi "Carlos E.R." <robin_listas@es.invalid> - 2025-11-23 00:23 +0100
Re: Recent history of vi rbowman <bowman@montana.com> - 2025-11-23 02:17 +0000
Re: Recent history of vi The Natural Philosopher <tnp@invalid.invalid> - 2025-11-23 09:42 +0000
Re: Recent history of vi "Carlos E.R." <robin_listas@es.invalid> - 2025-11-23 14:59 +0100
Re: Recent history of vi Bobbie Sellers <bliss-sf4ever@dslextreme.com> - 2025-11-23 13:09 -0800
Re: Recent history of vi Lawrence D’Oliveiro <ldo@nz.invalid> - 2025-11-23 22:57 +0000
Re: Recent history of vi Lawrence D’Oliveiro <ldo@nz.invalid> - 2025-11-23 02:56 +0000
Re: Recent history of vi Peter Flass <Peter@Iron-Spring.com> - 2025-11-22 20:18 -0700
Re: typing in the mysterious East, Recent history of vi John Levine <johnl@taugh.com> - 2025-11-24 01:45 +0000
Re: typing in the mysterious East, Recent history of vi Bobbie Sellers <bliss-sf4ever@dslextreme.com> - 2025-11-23 18:06 -0800
Re: typing in the mysterious East, Recent history of vi Lawrence D’Oliveiro <ldo@nz.invalid> - 2025-11-24 02:13 +0000
Re: typing in the mysterious East, Recent history of vi John Levine <johnl@taugh.com> - 2025-11-24 02:23 +0000
Re: Recent history of vi "Carlos E.R." <robin_listas@es.invalid> - 2025-11-22 20:25 +0100
Re: Recent history of vi "Carlos E.R." <robin_listas@es.invalid> - 2025-11-19 02:37 +0100
ISO 8859-1 ("Latin 1") (was: Recent history of vi) Michael Bäuerle <michael.baeuerle@stz-e.de> - 2025-11-19 14:58 +0100
Re: ISO 8859-1 ("Latin 1") (was: Recent history of vi) Eli the Bearded <*@eli.users.panix.com> - 2025-11-20 02:09 +0000
Re: ISO 8859-1 ("Latin 1") Peter Flass <Peter@Iron-Spring.com> - 2025-11-19 20:16 -0700
Re: ISO 8859-1 ("Latin 1") Richard Kettlewell <invalid@invalid.invalid> - 2025-11-20 08:47 +0000
Re: ISO 8859-1 ("Latin 1") The Natural Philosopher <tnp@invalid.invalid> - 2025-11-20 11:10 +0000
Re: ISO 8859-1 ("Latin 1") Charlie Gibbs <cgibbs@kltpzyxm.invalid> - 2025-11-20 17:57 +0000
Re: ISO 8859-1 ("Latin 1") Ralf Fassel <ralfixx@gmx.de> - 2025-11-21 12:24 +0100
Re: Recent history of vi Eric Pozharski <apple.universe@posteo.net> - 2025-11-19 13:02 +0000
Re: Recent history of vi antispam@fricas.org (Waldek Hebisch) - 2025-11-23 16:25 +0000
Re: Recent history of vi Anthk NM <anthk@disroot.org> - 2025-11-23 12:48 +0000
Re: Recent history of vi ted@loft.tnolan.com (Ted Nolan <tednolan>) - 2025-11-23 17:51 +0000
Re: Recent history of vi Lawrence D’Oliveiro <ldo@nz.invalid> - 2025-11-23 20:11 +0000
Re: Recent history of vi The Natural Philosopher <tnp@invalid.invalid> - 2025-11-16 20:26 +0000
Re: Recent history of vi Chris Ahlstrom <OFeem1987@teleworm.us> - 2025-11-17 11:44 -0500
Re: Recent history of vi Lawrence D’Oliveiro <ldo@nz.invalid> - 2025-11-16 20:57 +0000
Re: Recent history of vi antispam@fricas.org (Waldek Hebisch) - 2025-11-15 19:52 +0000
Re: Recent history of vi Chris Ahlstrom <OFeem1987@teleworm.us> - 2025-11-16 09:50 -0500
Re: Recent history of vi rbowman <bowman@montana.com> - 2025-11-16 18:56 +0000
Re: Recent history of vi Chris Ahlstrom <OFeem1987@teleworm.us> - 2025-11-17 11:24 -0500
Re: Recent history of vi Nuno Silva <nunojsilva@invalid.invalid> - 2025-11-16 00:43 +0000
Re: Recent history of vi rbowman <bowman@montana.com> - 2025-11-16 03:20 +0000
Re: Recent history of vi Richard Kettlewell <invalid@invalid.invalid> - 2025-11-16 16:14 +0000
Re: Recent history of vi scott@slp53.sl.home (Scott Lurndal) - 2025-11-17 19:39 +0000
Re: Python/C/Pascal ... How To Choose ? c186282 <c186282@nnada.net> - 2025-11-12 01:24 -0500
Re: Python/C/Pascal ... How To Choose ? rbowman <bowman@montana.com> - 2025-11-12 19:41 +0000
Re: Python/C/Pascal ... How To Choose ? c186282 <c186282@nnada.net> - 2025-11-13 00:00 -0500
Re: Python/C/Pascal ... How To Choose ? Nuno Silva <nunojsilva@invalid.invalid> - 2025-11-13 10:56 +0000
Re: Python/C/Pascal ... How To Choose ? c186282 <c186282@nnada.net> - 2025-11-13 21:25 -0500
Re: Python/C/Pascal ... How To Choose ? Charlie Gibbs <cgibbs@kltpzyxm.invalid> - 2025-11-14 04:21 +0000
Re: Python/C/Pascal ... How To Choose ? c186282 <c186282@nnada.net> - 2025-11-13 23:40 -0500
Re: Python/C/Pascal ... How To Choose ? rbowman <bowman@montana.com> - 2025-11-14 07:05 +0000
Re: Python/C/Pascal ... How To Choose ? c186282 <c186282@nnada.net> - 2025-11-14 02:48 -0500
Re: Python/C/Pascal ... How To Choose ? Rich <rich@example.invalid> - 2025-11-16 03:53 +0000
Re: Python/C/Pascal ... How To Choose ? "Carlos E.R." <robin_listas@es.invalid> - 2025-11-14 13:45 +0100
Re: Python/C/Pascal ... How To Choose ? Lawrence D’Oliveiro <ldo@nz.invalid> - 2025-11-14 19:29 +0000
Re: Python/C/Pascal ... How To Choose ? Nuno Silva <nunojsilva@invalid.invalid> - 2025-11-14 10:22 +0000
Re: Python/C/Pascal ... How To Choose ? Pancho <Pancho.Jones@protonmail.com> - 2025-11-14 10:35 +0000
Re: Python/C/Pascal ... How To Choose ? c186282 <c186282@nnada.net> - 2025-11-14 15:55 -0500
Re: Python/C/Pascal ... How To Choose ? rbowman <bowman@montana.com> - 2025-11-15 02:07 +0000
Re: Python/C/Pascal ... How To Choose ? c186282 <c186282@nnada.net> - 2025-11-14 15:47 -0500
Re: Python/C/Pascal ... How To Choose ? c186282 <c186282@nnada.net> - 2025-11-11 23:36 -0500
Re: Python/C/Pascal ... How To Choose ? rbowman <bowman@montana.com> - 2025-11-12 20:04 +0000
Re: Python/C/Pascal ... How To Choose ? "Carlos E.R." <robin_listas@es.invalid> - 2025-11-10 08:57 +0100
Re: Python/C/Pascal ... How To Choose ? Lawrence D’Oliveiro <ldo@nz.invalid> - 2025-11-10 08:13 +0000
Re: Python/C/Pascal ... How To Choose ? rbowman <bowman@montana.com> - 2025-11-10 20:50 +0000
Re: Python/C/Pascal ... How To Choose ? rbowman <bowman@montana.com> - 2025-11-10 21:01 +0000
Re: Python/C/Pascal ... How To Choose ? "Carlos E.R." <robin_listas@es.invalid> - 2025-11-10 22:40 +0100
Re: Python/C/Pascal ... How To Choose ? "Carlos E.R." <robin_listas@es.invalid> - 2025-11-10 23:14 +0100
Re: Python/C/Pascal ... How To Choose ? Lawrence D’Oliveiro <ldo@nz.invalid> - 2025-11-10 22:21 +0000
Re: Python/C/Pascal ... How To Choose ? Nuno Silva <nunojsilva@invalid.invalid> - 2025-11-11 00:21 +0000
Re: Python/C/Pascal ... How To Choose ? c186282 <c186282@nnada.net> - 2025-11-11 00:43 -0500
Re: Python/C/Pascal ... How To Choose ? Pancho <Pancho.Jones@protonmail.com> - 2025-11-11 00:35 +0000
Re: Python/C/Pascal ... How To Choose ? Lawrence D’Oliveiro <ldo@nz.invalid> - 2025-11-11 01:40 +0000
Re: Python/C/Pascal ... How To Choose ? c186282 <c186282@nnada.net> - 2025-11-11 00:48 -0500
Re: Python/C/Pascal ... How To Choose ? Pancho <Pancho.Jones@protonmail.com> - 2025-11-11 08:53 +0000
Re: Python/C/Pascal ... How To Choose ? Farley Flud <fsquared@fsquared.linux> - 2025-11-11 11:42 +0000
Re: Python/C/Pascal ... How To Choose ? c186282 <c186282@nnada.net> - 2025-11-11 23:25 -0500
Re: Python/C/Pascal ... How To Choose ? c186282 <c186282@nnada.net> - 2025-11-11 23:21 -0500
Re: Python/C/Pascal ... How To Choose ? rbowman <bowman@montana.com> - 2025-11-11 19:56 +0000
Re: Python/C/Pascal ... How To Choose ? Pancho <Pancho.Jones@protonmail.com> - 2025-11-11 08:38 +0000
Re: Python/C/Pascal ... How To Choose ? rbowman <bowman@montana.com> - 2025-11-11 19:43 +0000
Re: Python/C/Pascal ... How To Choose ? c186282 <c186282@nnada.net> - 2025-11-11 23:43 -0500
Re: Python/C/Pascal ... How To Choose ? The Natural Philosopher <tnp@invalid.invalid> - 2025-11-12 10:50 +0000
Re: Python/C/Pascal ... How To Choose ? c186282 <c186282@nnada.net> - 2025-11-12 23:11 -0500
Re: Python/C/Pascal ... How To Choose ? The Natural Philosopher <tnp@invalid.invalid> - 2025-11-13 10:24 +0000
Re: Python/C/Pascal ... How To Choose ? Pancho <Pancho.Jones@protonmail.com> - 2025-11-12 16:22 +0000
Re: Python/C/Pascal ... How To Choose ? The Natural Philosopher <tnp@invalid.invalid> - 2025-11-11 10:59 +0000
Re: Python/C/Pascal ... How To Choose ? vallor <vallor@vallor.earth> - 2025-11-11 17:14 +0000
Re: Python/C/Pascal ... How To Choose ? c186282 <c186282@nnada.net> - 2025-11-11 23:28 -0500
Re: Python/C/Pascal ... How To Choose ? The Natural Philosopher <tnp@invalid.invalid> - 2025-11-12 10:48 +0000
Re: Python/C/Pascal ... How To Choose ? vallor <vallor@vallor.earth> - 2025-11-12 11:20 +0000
Re: Python/C/Pascal ... How To Choose ? c186282 <c186282@nnada.net> - 2025-11-12 23:31 -0500
Re: Python/C/Pascal ... How To Choose ? c186282 <c186282@nnada.net> - 2025-11-12 23:08 -0500
Re: Python/C/Pascal ... How To Choose ? The Natural Philosopher <tnp@invalid.invalid> - 2025-11-13 10:22 +0000
Re: Python/C/Pascal ... How To Choose ? Nuno Silva <nunojsilva@invalid.invalid> - 2025-11-10 09:05 +0000
Re: Python/C/Pascal ... How To Choose ? c186282 <c186282@nnada.net> - 2025-11-10 00:29 -0500
Re: Python/C/Pascal ... How To Choose ? Farley Flud <fsquared@fsquared.linux> - 2025-11-10 11:56 +0000
Re: Python/C/Pascal ... How To Choose ? Lawrence D’Oliveiro <ldo@nz.invalid> - 2025-11-10 22:23 +0000
Re: Python/C/Pascal ... How To Choose ? Diego Garcia <dg@linux.rocks> - 2025-11-10 22:38 +0000
Re: Python/C/Pascal ... How To Choose ? Pancho <Pancho.Jones@protonmail.com> - 2025-11-11 00:07 +0000
Re: Python/C/Pascal ... How To Choose ? Nuno Silva <nunojsilva@invalid.invalid> - 2025-11-13 16:48 +0000
Re: Python/C/Pascal ... How To Choose ? Richard Kettlewell <invalid@invalid.invalid> - 2025-11-10 18:04 +0000
Re: Python/C/Pascal ... How To Choose ? vallor <vallor@vallor.earth> - 2025-11-11 16:52 +0000
Re: Python/C/Pascal ... How To Choose ? Diego Garcia <dg@linux.rocks> - 2025-11-11 20:06 +0000
Re: Python/C/Pascal ... How To Choose ? vallor <vallor@vallor.earth> - 2025-11-11 23:09 +0000
Re: Python/C/Pascal ... How To Choose ? Nuno Silva <nunojsilva@invalid.invalid> - 2025-11-11 23:31 +0000
Re: Python/C/Pascal ... How To Choose ? rbowman <bowman@montana.com> - 2025-11-12 04:50 +0000
Re: Python/C/Pascal ... How To Choose ? vallor <vallor@vallor.earth> - 2025-11-12 06:50 +0000
Re: Python/C/Pascal ... How To Choose ? rbowman <bowman@montana.com> - 2025-11-12 20:05 +0000
Re: Python/C/Pascal ... How To Choose ? Nuno Silva <nunojsilva@invalid.invalid> - 2025-11-15 17:17 +0000
Re: Python/C/Pascal ... How To Choose ? "Carlos E.R." <robin_listas@es.invalid> - 2025-11-12 12:35 +0100
Re: Python/C/Pascal ... How To Choose ? Stéphane CARPENTIER <sc@fiat-linux.fr> - 2025-11-12 21:09 +0000
Re: Python/C/Pascal ... How To Choose ? c186282 <c186282@nnada.net> - 2025-11-13 00:22 -0500
Re: Python/C/Pascal ... How To Choose ? Stéphane CARPENTIER <sc@fiat-linux.fr> - 2025-11-12 21:06 +0000
Re: Python/C/Pascal ... How To Choose ? c186282 <c186282@nnada.net> - 2025-11-12 01:30 -0500
Re: Python/C/Pascal ... How To Choose ? rbowman <bowman@montana.com> - 2025-11-09 19:28 +0000
Re: Python/C/Pascal ... How To Choose ? c186282 <c186282@nnada.net> - 2025-11-10 00:36 -0500
Re: Python/C/Pascal ... How To Choose ? rbowman <bowman@montana.com> - 2025-11-10 07:46 +0000
Re: Python/C/Pascal ... How To Choose ? c186282 <c186282@nnada.net> - 2025-11-10 23:22 -0500
Re: Python/C/Pascal ... How To Choose ? rbowman <bowman@montana.com> - 2025-11-11 20:16 +0000
Re: Python/C/Pascal ... How To Choose ? c186282 <c186282@nnada.net> - 2025-11-12 00:08 -0500
Re: Python/C/Pascal ... How To Choose ? rbowman <bowman@montana.com> - 2025-11-12 19:58 +0000
Re: Python/C/Pascal ... How To Choose ? vallor <vallor@vallor.earth> - 2025-11-12 07:21 +0000
Re: Python/C/Pascal ... How To Choose ? c186282 <c186282@nnada.net> - 2025-11-12 02:26 -0500
Re: Python/C/Pascal ... How To Choose ? vallor <vallor@vallor.earth> - 2025-11-12 08:35 +0000
Re: Python/C/Pascal ... How To Choose ? rbowman <bowman@montana.com> - 2025-11-12 20:29 +0000
Re: Python/C/Pascal ... How To Choose ? c186282 <c186282@nnada.net> - 2025-11-12 23:07 -0500
Re: Python/C/Pascal ... How To Choose ? rbowman <bowman@montana.com> - 2025-11-13 04:59 +0000
Re: Python/C/Pascal ... How To Choose ? c186282 <c186282@nnada.net> - 2025-11-13 00:57 -0500
Re: Python/C/Pascal ... How To Choose ? The Natural Philosopher <tnp@invalid.invalid> - 2025-11-13 10:19 +0000
Re: Python/C/Pascal ... How To Choose ? Lawrence D’Oliveiro <ldo@nz.invalid> - 2025-11-13 20:16 +0000
Re: Python/C/Pascal ... How To Choose ? c186282 <c186282@nnada.net> - 2025-11-13 21:17 -0500
Re: Python/C/Pascal ... How To Choose ? "Carlos E.R." <robin_listas@es.invalid> - 2025-11-14 01:54 +0100
Re: Python/C/Pascal ... How To Choose ? c186282 <c186282@nnada.net> - 2025-11-13 21:33 -0500
Re: Python/C/Pascal ... How To Choose ? "Carlos E.R." <robin_listas@es.invalid> - 2025-11-14 14:04 +0100
Re: Python/C/Pascal ... How To Choose ? c186282 <c186282@nnada.net> - 2025-11-14 16:27 -0500
Re: Python/C/Pascal ... How To Choose ? "Carlos E.R." <robin_listas@es.invalid> - 2025-11-14 22:44 +0100
Re: Python/C/Pascal ... How To Choose ? Andy Burns <usenet@andyburns.uk> - 2025-11-14 13:24 +0000
Re: Python/C/Pascal ... How To Choose ? c186282 <c186282@nnada.net> - 2025-11-14 17:03 -0500
Re: Python/C/Pascal ... How To Choose ? rbowman <bowman@montana.com> - 2025-11-12 20:10 +0000
Re: Python/C/Pascal ... How To Choose ? Charlie Gibbs <cgibbs@kltpzyxm.invalid> - 2025-11-11 21:07 +0000
Re: Python/C/Pascal ... How To Choose ? c186282 <c186282@nnada.net> - 2025-11-12 00:56 -0500
Re: Python/C/Pascal ... How To Choose ? "Carlos E.R." <robin_listas@es.invalid> - 2025-11-08 13:28 +0100
Re: Python/C/Pascal ... How To Choose ? The Natural Philosopher <tnp@invalid.invalid> - 2025-11-08 12:45 +0000
Re: Python/C/Pascal ... How To Choose ? "Carlos E.R." <robin_listas@es.invalid> - 2025-11-08 14:35 +0100
Re: Python/C/Pascal ... How To Choose ? Lawrence D’Oliveiro <ldo@nz.invalid> - 2025-11-08 22:15 +0000
Re: Python/C/Pascal ... How To Choose ? c186282 <c186282@nnada.net> - 2025-11-09 00:28 -0500
Re: Python/C/Pascal ... How To Choose ? rbowman <bowman@montana.com> - 2025-11-08 20:29 +0000
Re: Python/C/Pascal ... How To Choose ? vallor <vallor@vallor.earth> - 2025-11-09 01:11 +0000
Re: Python/C/Pascal ... How To Choose ? rbowman <bowman@montana.com> - 2025-11-09 02:37 +0000
Re: Python/C/Pascal ... How To Choose ? Nuno Silva <nunojsilva@invalid.invalid> - 2025-11-09 09:11 +0000
Re: Python/C/Pascal ... How To Choose ? rbowman <bowman@montana.com> - 2025-11-09 19:08 +0000
Page 12 of 16 — ← Prev page 1 … 10 11 [12] 13 14 … 16 Next page →
| From | rbowman <bowman@montana.com> |
|---|---|
| Date | 2025-11-10 20:50 +0000 |
| Message-ID | <mnf1g6Fit1cU6@mid.individual.net> |
| In reply to | #77244 |
On Mon, 10 Nov 2025 08:13:30 -0000 (UTC), Lawrence D’Oliveiro wrote: > On Mon, 10 Nov 2025 08:57:36 +0100, Carlos E.R. wrote: > >> Having waited hours for an 8086 to process a drawing in Autocad, that a >> video takes a few minutes to process doesn't worry me. > > In my early days of learning Blender 3D, I put together a 10-second > animation, inspired by an old SF series from my younger days. At a > little over 20 minutes for each frame, the whole render took about 4 > days. > > <https://vimeo.com/62401597> For a project in Puerto Rico we had gigabytes of satellite imagery that was in a slightly different projection than the geodata. If you overlaid the imagery on the streets it didn't match up. There was a company, Lizard Tech, that made a tool to do the job. The Esri API would handle small images but iirc if you tried to do more than 5 MB you got a popup that said to call the Lizards. The tool was $5000 and did the job -- in days.
[toc] | [prev] | [next] | [standalone]
| From | rbowman <bowman@montana.com> |
|---|---|
| Date | 2025-11-10 21:01 +0000 |
| Message-ID | <mnf262Fit1cU7@mid.individual.net> |
| In reply to | #77240 |
On Mon, 10 Nov 2025 08:57:36 +0100, Carlos E.R. wrote: > On 2025-11-09 21:13, Diego Garcia wrote: >> On Sun, 9 Nov 2025 09:18:26 -0800, Bobbie Sellers wrote: >> >> >>> But programming being solely about Speed seems a bit off to me. >>> >>> >> All that I can say in response is that you must not do much audio/video >> processing or very large file processing or large software compiling >> because each of these activities can make a person SCREAM for more >> SPEED. > > Not really. > > Having waited hours for an 8086 to process a drawing in Autocad, that a > video takes a few minutes to process doesn't worry me. There was a point, maybe 8 to 10 years ago where most tasks including compiling our entire source tree went from 'go out for lunch' to a few minutes. Since then there have been performance improvements but unless you're timing the operation they really aren't noticeable. There are bottlenecks other than processor speed. Many of our sites used SQL Server for geodata, which meant network calls to the server. Esri came out with a FileGDB system where the geodata was stored on each client machine that was a good deal faster. The trade off in that case was changes to the geodata had to be copied to each machine rather than just in the SQL Server instance. The increasing trend to do everything in the 'cloud' introduces problems.
[toc] | [prev] | [next] | [standalone]
| From | "Carlos E.R." <robin_listas@es.invalid> |
|---|---|
| Date | 2025-11-10 22:40 +0100 |
| Message-ID | <om2aulxqb4.ln2@Telcontar.valinor> |
| In reply to | #77279 |
On 2025-11-10 22:01, rbowman wrote: > On Mon, 10 Nov 2025 08:57:36 +0100, Carlos E.R. wrote: > >> On 2025-11-09 21:13, Diego Garcia wrote: >>> On Sun, 9 Nov 2025 09:18:26 -0800, Bobbie Sellers wrote: >>> >>> >>>> But programming being solely about Speed seems a bit off to me. >>>> >>>> >>> All that I can say in response is that you must not do much audio/video >>> processing or very large file processing or large software compiling >>> because each of these activities can make a person SCREAM for more >>> SPEED. >> >> Not really. >> >> Having waited hours for an 8086 to process a drawing in Autocad, that a >> video takes a few minutes to process doesn't worry me. > > There was a point, maybe 8 to 10 years ago where most tasks including > compiling our entire source tree went from 'go out for lunch' to a few > minutes. Since then there have been performance improvements but unless > you're timing the operation they really aren't noticeable. > > There are bottlenecks other than processor speed. Many of our sites used > SQL Server for geodata, which meant network calls to the server. Esri came > out with a FileGDB system where the geodata was stored on each client > machine that was a good deal faster. The trade off in that case was > changes to the geodata had to be copied to each machine rather than just > in the SQL Server instance. > > The increasing trend to do everything in the 'cloud' introduces problems. Long ago, the first virus were discovered on PCs. There were two types: one altered the boot sector of disks, and another that attached to the end of executables. We had an antivirus for boot sector, running from autoexec.bat, but it was slow. I decided to have a go, using Turbopascal. Basically I loaded the boot sector, the bios file, and compared with a backup. Ie, compare two arrays of bytes. It was even slower than the comercial product. Well, I programmed a buffer compare in assembler (8086). I found that there was a single instruction that would do the buffer or array compare. Just a few lines of assembler. The rest of the program was in TP. My program became faster than the commercial product, several times faster. It even got distributed around a bit. :-) The lesson I learned was that it was sometimes possible to optimize just a small section of code and get a significant speed update. -- Cheers, Carlos. ES🇪🇸, EU🇪🇺;
[toc] | [prev] | [next] | [standalone]
| From | "Carlos E.R." <robin_listas@es.invalid> |
|---|---|
| Date | 2025-11-10 23:14 +0100 |
| Message-ID | <jm4aulx9rk.ln2@Telcontar.valinor> |
| In reply to | #77285 |
On 2025-11-10 22:54, Stefan Ram wrote: > "Carlos E.R." <robin_listas@es.invalid> wrote or quoted: >> My program became faster than the commercial product, several times faster. > > That's what Phil Katz did with Thom Henderson's ARC. > > ARC was written in C, but PKARC was written partially in Assembly > language and much faster. > > Katz had a special flair for optimizing code, but he drank so much > alcohol that he died in 2000 aged 37. Oh :-( -- Cheers, Carlos. ES🇪🇸, EU🇪🇺;
[toc] | [prev] | [next] | [standalone]
| From | Lawrence D’Oliveiro <ldo@nz.invalid> |
|---|---|
| Date | 2025-11-10 22:21 +0000 |
| Message-ID | <10etohi$am09$3@dont-email.me> |
| In reply to | #77285 |
On Mon, 10 Nov 2025 22:40:08 +0100, Carlos E.R. wrote:
> The lesson I learned was that it was sometimes possible to optimize
> just a small section of code and get a significant speed update.
That is usually the case with optimization for speed. Also, you need to do
some actual measurements on your code to figure out where the slow parts
are: it can be quite hard to guess up-front where they are likely to be.
Also:
“Premature optimization is the root of all evil.”
-- variously attributed to Donald Knuth or Tony Hoare
[toc] | [prev] | [next] | [standalone]
| From | Nuno Silva <nunojsilva@invalid.invalid> |
|---|---|
| Date | 2025-11-11 00:21 +0000 |
| Message-ID | <10etviv$bql1$4@dont-email.me> |
| In reply to | #77289 |
On 2025-11-10, Lawrence D’Oliveiro wrote:
> On Mon, 10 Nov 2025 22:40:08 +0100, Carlos E.R. wrote:
>
>> The lesson I learned was that it was sometimes possible to optimize
>> just a small section of code and get a significant speed update.
>
> That is usually the case with optimization for speed. Also, you need to do
> some actual measurements on your code to figure out where the slow parts
> are: it can be quite hard to guess up-front where they are likely to be.
>
> Also:
>
> “Premature optimization is the root of all evil.”
> -- variously attributed to Donald Knuth or Tony Hoare
It's probably relevant to point that Knuth's quote is actually precisely
about finding the spots where it pays off to optimize.
«[...] Programmers waste enormous amounts of time thinking about, or
worrying about, the speed of noncritical parts of their programs,
and these attempts at efficiency actually have a strong negative
impact when debugging and maintenance are considered. We should
forget about small efficiencies, say about 97% of the time:
premature optimization is the root of all evil.
Yet we should not pass up our opportunities in that critical 3%. A
good programmer will not be lulled into complacency by such
reasoning, he will be wise to look carefull at the critical code;
but only after that code has been identified. [...]»
-- Donald E. Knuth, in "Structured Programming with go to
Statements", p268 (or 8),
https://dl.acm.org/doi/10.1145/356635.356640
--
Nuno Silva
[toc] | [prev] | [next] | [standalone]
| From | c186282 <c186282@nnada.net> |
|---|---|
| Date | 2025-11-11 00:43 -0500 |
| Message-ID | <hiGdnUbAoeiPUI_0nZ2dnZfqnPednZ2d@giganews.com> |
| In reply to | #77303 |
On 11/10/25 19:21, Nuno Silva wrote: > On 2025-11-10, Lawrence D’Oliveiro wrote: > >> On Mon, 10 Nov 2025 22:40:08 +0100, Carlos E.R. wrote: >> >>> The lesson I learned was that it was sometimes possible to optimize >>> just a small section of code and get a significant speed update. >> >> That is usually the case with optimization for speed. Also, you need to do >> some actual measurements on your code to figure out where the slow parts >> are: it can be quite hard to guess up-front where they are likely to be. >> >> Also: >> >> “Premature optimization is the root of all evil.” >> -- variously attributed to Donald Knuth or Tony Hoare > > It's probably relevant to point that Knuth's quote is actually precisely > about finding the spots where it pays off to optimize. > > «[...] Programmers waste enormous amounts of time thinking about, or > worrying about, the speed of noncritical parts of their programs, > and these attempts at efficiency actually have a strong negative > impact when debugging and maintenance are considered. We should > forget about small efficiencies, say about 97% of the time: > premature optimization is the root of all evil. > > Yet we should not pass up our opportunities in that critical 3%. A > good programmer will not be lulled into complacency by such > reasoning, he will be wise to look carefull at the critical code; > but only after that code has been identified. [...]» > > -- Donald E. Knuth, in "Structured Programming with go to > Statements", p268 (or 8), > https://dl.acm.org/doi/10.1145/356635.356640 Generally agreed ... you CAN waste vast amounts of time/effort on trying to "perfectly optimize" bits of code that barely ever run or barely count - an intellectual obsession. Maybe good as a theoretical exercise, shit for the 'academics', but Real World not so much. Usually The Boss wants shit to work 'ok' by friday .....
[toc] | [prev] | [next] | [standalone]
| From | Pancho <Pancho.Jones@protonmail.com> |
|---|---|
| Date | 2025-11-11 00:35 +0000 |
| Message-ID | <10eu0da$cjqi$2@dont-email.me> |
| In reply to | #77289 |
On 11/10/25 22:21, Lawrence D’Oliveiro wrote: > On Mon, 10 Nov 2025 22:40:08 +0100, Carlos E.R. wrote: > >> The lesson I learned was that it was sometimes possible to optimize >> just a small section of code and get a significant speed update. > > That is usually the case with optimization for speed. Also, you need to do > some actual measurements on your code to figure out where the slow parts > are: it can be quite hard to guess up-front where they are likely to be. > > Also: > > “Premature optimization is the root of all evil.” > -- variously attributed to Donald Knuth or Tony Hoare A lot of optimisation, isn't about code optimisation, it is about algorithm optimisation. i.e. You need a whole paradigm shift rather than tweaking. As a simple example, a function to check if one word is an anagram of another word. This is a real life interview question I got wrong.
[toc] | [prev] | [next] | [standalone]
| From | Lawrence D’Oliveiro <ldo@nz.invalid> |
|---|---|
| Date | 2025-11-11 01:40 +0000 |
| Message-ID | <10eu474$dvq5$1@dont-email.me> |
| In reply to | #77304 |
On Tue, 11 Nov 2025 00:35:54 +0000, Pancho wrote:
> As a simple example, a function to check if one word is an anagram of
> another word. This is a real life interview question I got wrong.
Python 3.13.9 (main, Oct 15 2025, 14:56:22) [GCC 15.2.0] on linux
Type "help", "copyright", "credits" or "license" for more information.
>>> word1 = "asterisk"
>>> word2 = "seaskirt"
>>> sorted(word1) == sorted(word2)
True
Easy-peasy. ;)
[toc] | [prev] | [next] | [standalone]
| From | c186282 <c186282@nnada.net> |
|---|---|
| Date | 2025-11-11 00:48 -0500 |
| Message-ID | <Nd6dnTLIQ9bLU4_0nZ2dnZfqnPWdnZ2d@giganews.com> |
| In reply to | #77305 |
On 11/10/25 20:40, Lawrence D’Oliveiro wrote: > On Tue, 11 Nov 2025 00:35:54 +0000, Pancho wrote: > >> As a simple example, a function to check if one word is an anagram of >> another word. This is a real life interview question I got wrong. > > Python 3.13.9 (main, Oct 15 2025, 14:56:22) [GCC 15.2.0] on linux > Type "help", "copyright", "credits" or "license" for more information. > >>> word1 = "asterisk" > >>> word2 = "seaskirt" > >>> sorted(word1) == sorted(word2) > True > > Easy-peasy. ;) Ah, but for anagrams you need a HUGE dict of words to compare with. Then you have to search that list semi-efficiently. (Some) human brains do that pretty well, but computers are not that bright - all brute algos.
[toc] | [prev] | [next] | [standalone]
| From | Pancho <Pancho.Jones@protonmail.com> |
|---|---|
| Date | 2025-11-11 08:53 +0000 |
| Message-ID | <10euthl$j4v6$2@dont-email.me> |
| In reply to | #77318 |
On 11/11/25 05:48, c186282 wrote: > On 11/10/25 20:40, Lawrence D’Oliveiro wrote: >> On Tue, 11 Nov 2025 00:35:54 +0000, Pancho wrote: >> >>> As a simple example, a function to check if one word is an anagram of >>> another word. This is a real life interview question I got wrong. >> >> Python 3.13.9 (main, Oct 15 2025, 14:56:22) [GCC 15.2.0] on linux >> Type "help", "copyright", "credits" or "license" for more >> information. >> >>> word1 = "asterisk" >> >>> word2 = "seaskirt" >> >>> sorted(word1) == sorted(word2) >> True >> >> Easy-peasy. ;) > > Ah, but for anagrams you need a HUGE dict of > words to compare with. Then you have to search > that list semi-efficiently. (Some) human brains > do that pretty well, but computers are not that > bright - all brute algos. > It is relatively quick to sort the letters in every word in a dictionary. The number of words in a dictionary is small compared to the permutations of a long word. The number of permutations is approximated by Stirling's approximation, clarifying that growth is worse than exponential.
[toc] | [prev] | [next] | [standalone]
| From | Farley Flud <fsquared@fsquared.linux> |
|---|---|
| Date | 2025-11-11 11:42 +0000 |
| Message-ID | <1876f10fca8b421f$24267$3612999$802601b3@news.usenetexpress.com> |
| In reply to | #77324 |
On Tue, 11 Nov 2025 08:53:09 +0000, Pancho wrote: > On 11/11/25 05:48, c186282 wrote: >> On 11/10/25 20:40, Lawrence D’Oliveiro wrote: >>> On Tue, 11 Nov 2025 00:35:54 +0000, Pancho wrote: >>> >>>> As a simple example, a function to check if one word is an anagram of >>>> another word. This is a real life interview question I got wrong. >>> >>> Python 3.13.9 (main, Oct 15 2025, 14:56:22) [GCC 15.2.0] on linux >>> Type "help", "copyright", "credits" or "license" for more >>> information. >>> >>> word1 = "asterisk" >>> >>> word2 = "seaskirt" >>> >>> sorted(word1) == sorted(word2) >>> True >>> >>> Easy-peasy. ;) >> >> Ah, but for anagrams you need a HUGE dict of >> words to compare with. Then you have to search >> that list semi-efficiently. (Some) human brains >> do that pretty well, but computers are not that >> bright - all brute algos. >> > > It is relatively quick to sort the letters in every word in a > dictionary. The number of words in a dictionary is small compared to the > permutations of a long word. > > The number of permutations is approximated by Stirling's approximation, > clarifying that growth is worse than exponential. > I have already published the FASTEST possible method of finding all of the anagrams of a given word. Feel free to check it out: https://groups.google.com/g/comp.os.linux.advocacy/c/2T0XwOpgpNk/m/fi9cL650AAAJ SPEED is the essence and raison d'etre of all computing.
[toc] | [prev] | [next] | [standalone]
| From | c186282 <c186282@nnada.net> |
|---|---|
| Date | 2025-11-11 23:25 -0500 |
| Message-ID | <ysWdnVu7PO-jkYn0nZ2dnZfqn_WdnZ2d@giganews.com> |
| In reply to | #77328 |
On 11/11/25 06:42, Farley Flud wrote: > On Tue, 11 Nov 2025 08:53:09 +0000, Pancho wrote: > >> On 11/11/25 05:48, c186282 wrote: >>> On 11/10/25 20:40, Lawrence D’Oliveiro wrote: >>>> On Tue, 11 Nov 2025 00:35:54 +0000, Pancho wrote: >>>> >>>>> As a simple example, a function to check if one word is an anagram of >>>>> another word. This is a real life interview question I got wrong. >>>> >>>> Python 3.13.9 (main, Oct 15 2025, 14:56:22) [GCC 15.2.0] on linux >>>> Type "help", "copyright", "credits" or "license" for more >>>> information. >>>> >>> word1 = "asterisk" >>>> >>> word2 = "seaskirt" >>>> >>> sorted(word1) == sorted(word2) >>>> True >>>> >>>> Easy-peasy. ;) >>> >>> Ah, but for anagrams you need a HUGE dict of >>> words to compare with. Then you have to search >>> that list semi-efficiently. (Some) human brains >>> do that pretty well, but computers are not that >>> bright - all brute algos. >>> >> >> It is relatively quick to sort the letters in every word in a >> dictionary. The number of words in a dictionary is small compared to the >> permutations of a long word. >> >> The number of permutations is approximated by Stirling's approximation, >> clarifying that growth is worse than exponential. >> > > I have already published the FASTEST possible method of finding all of the > anagrams of a given word. Feel free to check it out: > > https://groups.google.com/g/comp.os.linux.advocacy/c/2T0XwOpgpNk/m/fi9cL650AAAJ But "all possible" does not = CORRECT. > SPEED is the essence and raison d'etre of all computing. As said, depends on what you mean by "speed" ... An app that takes a month to write is not 'better' than one that takes a day. An app only one person can figure/debug is not 'better'.
[toc] | [prev] | [next] | [standalone]
| From | c186282 <c186282@nnada.net> |
|---|---|
| Date | 2025-11-11 23:21 -0500 |
| Message-ID | <rdmcnd-sdIjGlon0nZ2dnZfqnPadnZ2d@giganews.com> |
| In reply to | #77324 |
On 11/11/25 03:53, Pancho wrote: > On 11/11/25 05:48, c186282 wrote: >> On 11/10/25 20:40, Lawrence D’Oliveiro wrote: >>> On Tue, 11 Nov 2025 00:35:54 +0000, Pancho wrote: >>> >>>> As a simple example, a function to check if one word is an anagram of >>>> another word. This is a real life interview question I got wrong. >>> >>> Python 3.13.9 (main, Oct 15 2025, 14:56:22) [GCC 15.2.0] on linux >>> Type "help", "copyright", "credits" or "license" for more >>> information. >>> >>> word1 = "asterisk" >>> >>> word2 = "seaskirt" >>> >>> sorted(word1) == sorted(word2) >>> True >>> >>> Easy-peasy. ;) >> >> Ah, but for anagrams you need a HUGE dict of >> words to compare with. Then you have to search >> that list semi-efficiently. (Some) human brains >> do that pretty well, but computers are not that >> bright - all brute algos. >> > > It is relatively quick to sort the letters in every word in a > dictionary. The number of words in a dictionary is small compared to the > permutations of a long word. Yes, it's "relatively easy" code ... but you still have to have/search the gigantic database of real words. Will use up a massive number of cycles and many gigs of storage. "Easy" does not always equal "efficient". Humans can sort of 'cheat' anagrams sometimes, find clear or subtle clues about the intent and quickly recognize likely solutions. Even AI can't really do that ... oh, and AIs are NOT 'efficient computing' at all. > The number of permutations is approximated by Stirling's approximation, > clarifying that growth is worse than exponential.
[toc] | [prev] | [next] | [standalone]
| From | rbowman <bowman@montana.com> |
|---|---|
| Date | 2025-11-11 19:56 +0000 |
| Message-ID | <mnhinmF1ld6U3@mid.individual.net> |
| In reply to | #77318 |
On Tue, 11 Nov 2025 00:48:59 -0500, c186282 wrote: > On 11/10/25 20:40, Lawrence D’Oliveiro wrote: >> On Tue, 11 Nov 2025 00:35:54 +0000, Pancho wrote: >> >>> As a simple example, a function to check if one word is an anagram of >>> another word. This is a real life interview question I got wrong. >> >> Python 3.13.9 (main, Oct 15 2025, 14:56:22) [GCC 15.2.0] on linux >> Type "help", "copyright", "credits" or "license" for more >> information. >> >>> word1 = "asterisk" >> >>> word2 = "seaskirt" sorted(word1) == sorted(word2) >> True >> >> Easy-peasy. ;) > > Ah, but for anagrams you need a HUGE dict of words to compare with. > Then you have to search that list semi-efficiently. (Some) human > brains do that pretty well, but computers are not that bright - all > brute algos. A trie would work.
[toc] | [prev] | [next] | [standalone]
| From | Pancho <Pancho.Jones@protonmail.com> |
|---|---|
| Date | 2025-11-11 08:38 +0000 |
| Message-ID | <10euslc$j4v6$1@dont-email.me> |
| In reply to | #77305 |
On 11/11/25 01:40, Lawrence D’Oliveiro wrote: > On Tue, 11 Nov 2025 00:35:54 +0000, Pancho wrote: > >> As a simple example, a function to check if one word is an anagram of >> another word. This is a real life interview question I got wrong. > > Python 3.13.9 (main, Oct 15 2025, 14:56:22) [GCC 15.2.0] on linux > Type "help", "copyright", "credits" or "license" for more information. > >>> word1 = "asterisk" > >>> word2 = "seaskirt" > >>> sorted(word1) == sorted(word2) > True > > Easy-peasy. ;) Yes easy peasy, when you get it right, but it is also easy to go the wrong way, generate all permutations,
[toc] | [prev] | [next] | [standalone]
| From | rbowman <bowman@montana.com> |
|---|---|
| Date | 2025-11-11 19:43 +0000 |
| Message-ID | <mnhhueF1ld6U2@mid.individual.net> |
| In reply to | #77323 |
On Tue, 11 Nov 2025 08:38:04 +0000, Pancho wrote: > On 11/11/25 01:40, Lawrence D’Oliveiro wrote: >> On Tue, 11 Nov 2025 00:35:54 +0000, Pancho wrote: >> >>> As a simple example, a function to check if one word is an anagram of >>> another word. This is a real life interview question I got wrong. >> >> Python 3.13.9 (main, Oct 15 2025, 14:56:22) [GCC 15.2.0] on linux >> Type "help", "copyright", "credits" or "license" for more >> information. >> >>> word1 = "asterisk" >> >>> word2 = "seaskirt" sorted(word1) == sorted(word2) >> True >> >> Easy-peasy. ;) > > Yes easy peasy, when you get it right, but it is also easy to go the > wrong way, generate all permutations, Generating all the possible anagrams would be more challenging that comparing two words.
[toc] | [prev] | [next] | [standalone]
| From | c186282 <c186282@nnada.net> |
|---|---|
| Date | 2025-11-11 23:43 -0500 |
| Message-ID | <rdmcnd6sdIgVjYn0nZ2dnZfqnPadnZ2d@giganews.com> |
| In reply to | #77337 |
On 11/11/25 14:43, rbowman wrote: > On Tue, 11 Nov 2025 08:38:04 +0000, Pancho wrote: > >> On 11/11/25 01:40, Lawrence D’Oliveiro wrote: >>> On Tue, 11 Nov 2025 00:35:54 +0000, Pancho wrote: >>> >>>> As a simple example, a function to check if one word is an anagram of >>>> another word. This is a real life interview question I got wrong. >>> >>> Python 3.13.9 (main, Oct 15 2025, 14:56:22) [GCC 15.2.0] on linux >>> Type "help", "copyright", "credits" or "license" for more >>> information. >>> >>> word1 = "asterisk" >>> >>> word2 = "seaskirt" sorted(word1) == sorted(word2) >>> True >>> >>> Easy-peasy. ;) >> >> Yes easy peasy, when you get it right, but it is also easy to go the >> wrong way, generate all permutations, > > Generating all the possible anagrams would be more challenging that > comparing two words. But "generation" doesn't solve the PROBLEM. Exactly WHICH permutation is the RIGHT one ??? In short, when is 'redrum' vitally important and when not ?
[toc] | [prev] | [next] | [standalone]
| From | The Natural Philosopher <tnp@invalid.invalid> |
|---|---|
| Date | 2025-11-12 10:50 +0000 |
| Message-ID | <10f1opa$1cbme$3@dont-email.me> |
| In reply to | #77368 |
On 12/11/2025 04:43, c186282 wrote: >> Generating all the possible anagrams would be more challenging that >> comparing two words. > > But "generation" doesn't solve the PROBLEM. Exactly WHICH > permutation is the RIGHT one ??? Ah, The Problem of Induction... -- "And if the blind lead the blind, both shall fall into the ditch". Gospel of St. Mathew 15:14
[toc] | [prev] | [next] | [standalone]
| From | c186282 <c186282@nnada.net> |
|---|---|
| Date | 2025-11-12 23:11 -0500 |
| Message-ID | <MuOcnThTubEYx4j0nZ2dnZfqnPqdnZ2d@giganews.com> |
| In reply to | #77395 |
On 11/12/25 05:50, The Natural Philosopher wrote: > On 12/11/2025 04:43, c186282 wrote: >>> Generating all the possible anagrams would be more challenging that >>> comparing two words. >> >> But "generation" doesn't solve the PROBLEM. Exactly WHICH >> permutation is the RIGHT one ??? > > Ah, The Problem of Induction... Yes, a 'broader', 'more human', issue. If you get a 16-character anagram, which permutation applies to YOUR particular issue ??? Simple automation won't solve that. "Redrum !"
[toc] | [prev] | [next] | [standalone]
Page 12 of 16 — ← Prev page 1 … 10 11 [12] 13 14 … 16 Next page →
Back to top | Article view | comp.os.linux.misc
csiph-web