Earlier quoted context omitted.
Because they thought that a word is something said in a human language that they can understand.
Mi ne pensas ke lingvoj kiuj usas ekskluzive la basan latinan alfabeton estas komprepeneblaj per si mem.
Exploring pre-1990 versions of wc(1) (2023)
11–20 of 27 posts
Re: Exploring pre-1990 versions of wc(1) (2023)
#12Earlier quoted context omitted.
Because they thought that a word is something said in a human language that they can understand.
Mi ne pensas ke lingvoj kiuj usas ekskluzive la basan latinan alfabeton estas komprepeneblaj per si mem.
Re: Exploring pre-1990 versions of wc(1) (2023)
#13http://en.wikipedia.org/wiki/Plan_9_from_Bell_Labs follows the Unix philosophy. A lot of legacy has been shed. I can count 13 options to ls, 11 options to sed and just 5 to sed.
The standard Plan 9 shell, Rc, is described in mere ~500 lines of manpage, while Bash takes whooping ~5400 lines.
Oh, and there is no `dll hell' in P9 :-)
Re: Exploring pre-1990 versions of wc(1) (2023)
#14> A word is a maximal string of characters delimited by spaces, tabs or newlines. And then the actual code explicitly filters out and ignores every character larger than 0x7F. Just why.
ASCII is 7 bits (the eight bit would be parity), so that makes perfect sense, in an ASCII world.
Re: Exploring pre-1990 versions of wc(1) (2023)
#15Those `goto`s between two different for loops is crazy.
Re: Exploring pre-1990 versions of wc(1) (2023)
#16Earlier quoted context omitted.
ASCII is 7 bits (the eight bit would be parity), so that makes perfect sense, in an ASCII world.
So the character e.g. "B" would have this parity bit set and therefore should be filtered out and not count as a letter, in the ASCII world?
Re: Exploring pre-1990 versions of wc(1) (2023)
#17Re: Exploring pre-1990 versions of wc(1) (2023)
#18Earlier quoted context omitted.
Mi ne pensas ke lingvoj kiuj usas ekskluzive la basan latinan alfabeton estas komprepeneblaj per si mem.
Ze riform iz komplit.
Re: Exploring pre-1990 versions of wc(1) (2023)
#19A fun read on word count optimization can be found in Abrash's Black Book: https://www.jagregory.com/abrash-black-book/#lessons-learned... You can gloss over the asm if you wish, the tricks that are explained around it are worth it imho.
I wonder if large lookup tables/table-driven state machines are still as good as they used to be. After all, even with all the on-chip caches, the additional memory accesses today seem to be slower than doing some multi-instruction SIMD voodoo.
[0] https://git.savannah.gnu.org/cgit/coreutils.git/tree/src/wc_...
Re: Exploring pre-1990 versions of wc(1) (2023)
#20Earlier quoted context omitted.
ASCII is 7 bits (the eight bit would be parity), so that makes perfect sense, in an ASCII world.
So the character e.g. "B" would have this parity bit set and therefore should be filtered out and not count as a letter, in the ASCII world?