Re: Parsing timestamps?

On 10-06-2025 22:56, LIT wrote:

3. As Mr. Pelc remarked, stack operators are faster.

 This is what Mr. Pelc remarked, regarding such style
of programming - yes, many years ago I was guilty of
that too - already 15 years ago:
 https://groups.google.com/g/comp.lang.forth/c/m9xy5k5BfkY/m/FFmH9GE5UJAJ
 "Although the code is compilable and can be made efficient,
the source code is a maintenance nightmare!"
 Maybe he changed his mind since that time - well, since
he's here, you may want to ask him a question.

Again, a perfect proof of people having *NO* idea of what they're doing. I tackled that *EXACT* problem in https://www.youtube.com/watch?v=gfE8arB3uWk
3 constant vec
vec array a
vec array b
vec array c
: v! vec 0 do tuck i th ! loop drop ;
: .v vec 0 do dup  i th ? loop drop ;
: v+ vec 0 do over i th @ over i th @ + -rot loop drop drop spin ;
: vadd >r v+ r> v! ;
3 2 1 a v!
6 5 4 b v!
a b c vadd c .v
I don't see how that is problematic maintenance wise. It's not the language, it's not the method. It's the programmer overestimating himself "YEAH, I CAN TOTALLY DO THAT!!", humbling himself - and then blaming the language.
Hans Bezemer