Can't wait for browser support for this... ;-)
Readit NewsSmalltalker-80 commented on UEFI Bindings for JavaScript codeberg.org/smnx/prometh... · Posted by u/ananas-dev
Smalltalker-80 commented on Ga68, a GNU Algol 68 Compiler fosdem.org/2026/schedule/... · Posted by u/matt_d
I prefer Simula 67 ;-)
Yeah, that Algol code is not very pretty :-).
I'm sticking with my namesake from 1980...
Smalltalker-80 commented on Simply Scheme: Introducing Computer Science (1999) people.eecs.berkeley.edu/... · Posted by u/AlexeyBrin
Ah, Scheme was part of a programming language course,
studying CS in ~ 1990.
We students struggled to match all the parenthesis on our VT100 terminals.
And to understand the intended purpose of the functions,
which are not attached to modules or classes (without macro's)..
Next to a book on 6502 assembly,
you can google "apple 2 original system manual" and download it.
I contains ROM assembly source code and schematics.
Smalltalker-80 commented on The Tulip Creative Computer github.com/shorepine/tuli... · Posted by u/apitman
Funny! In the '80s Tulip Computers NV[1] was a Dutch computer manufacturer that manufactured PC clones.
Was thinking that too.. :)
Smalltalker-80 commented on How to store a chess position in 26 bytes (2022) ezzeriesa.notion.site/How... · Posted by u/kurinikku
Each side has 16 pieces, so you need 32 elements.
Ah how silly of me, that woud make it 28 bytes.
(I had the nagging feeling I was missing something :-)
And promotions are also not covered by this...
Smalltalker-80 commented on How to store a chess position in 26 bytes (2022) ezzeriesa.notion.site/How... · Posted by u/kurinikku
Why not do it simpler? :
Create an array with 16 elements, one element per piece, black + white.
Every array element is 7 bits wide, 1 bit for captured or not,
and 6 bits for the square number the piece is on (8 x 8).
Then you need 16 * 7 = 112 bits = 14 bytes.
(And the captured-bit can even be compressed further as a 65th square,
but that makes it more calculation intensive to extract a position)
Smalltalker-80 commented on A tab hoarder's journey to sanity twitter.com/borisandcrisp... · Posted by u/borisandcrispin
That is the way I work.
Now my bookmark list is crazy. I have started using 'open all' and then reviewing items in each folder to see if they are worth keeping. 99% of the time. no. Many times they are from years ago and the site doesnt even exist anymore. I have some items in my folders that go back to 1992. I have a bad habit of 'oh that is mildly interesting ctrl-d time'. Usually a few weeks later 'what was I thinking'.
My tabs however are wildly focused on what I am doing right now. Once that task is done. I close them out. Think my max is 20 tabs. But usually I really only need about 5. The rest I close out. I probably can find it again with search. That is how I found it the first time...
That also reminds me, time to delete more folders.
Ditto on the working set.
For the 'crazy' bookmark lists:
I now have 220 bookmarks, max 4 levels deep, counting the bookmark bar as level 1.
And that's work and private combined.
Before I add a tab to the bookmarks, I ask myself:
Am I likely to need this again?
If the answer is not a full yes, I just close the tab.
It can also be found again quickly enough with a simple google search
or the browsing history.
Smalltalker-80 commented on A tab hoarder's journey to sanity twitter.com/borisandcrisp... · Posted by u/borisandcrispin
It boggles my mind that, not only do people do this, but it's common. I've seen managers at work with hundreds of tabs open, with an uncanny ability to know exactly where the thing they need is.
I've been using tabbed browsers for 20-something years and I never really have more than 1, 2 at a time. If I need to call something back, I either bookmark it or I open up the history and search for it.
I'm also baffled by the number of (also smart) colleagues
with completely cluttered, unreadable tab bars
using computers with severly degradated performance.
.
When a simple, clean bookmark hierarchy (under the tab bar)
plus a working set of open tabs for the task at hand
is so much more productive...
Smalltalker-80 commented on Inverse Parentheses kellett.im/a/inverse-pare... · Posted by u/mighty-fine
Based on this comment (https://news.ycombinator.com/item?id=46352389), I think I understood the missing first paragraph:
If you have the expression 1+2*3 you have three elements with two operands. You need to choose a rule to pick one of them first.
In mathematics, the rule is "*/ then +-" and then from left to right. This means that usually first you do 2*3, then 1+.
But what if you do want to make 1+2 first?
There is another alternative, parenthesis. Those mean "do the thing inside first" so (1+2)*3 changes the precedence and now you do 1+2 first, then *3
The post is asking: with parenthesis you can increase the precedence of operations. What if you could decrease it?
Let's use «» as another operand (the blog uses parenthesis, but that makes it really confusing) this operand means "do the thing inside last". So the expression 1+«2*3» means "do 1+ first, then 2*3.
The issue is...this doesn't make sense, what the blog is really saying is to reduce the precedence of operators. Think the expression 1+2«*»3 or 1+2(*)3 and now the rule is "the parenthesized operators have one precedence less" so 1+2(*)3=(1+2)*3
Thanks indeed.
Using a simple left-to-right evaluation is the most logical solution.
You can reorder expressions to use less parentheses and make them easier to read. E.g.: Smalltalk :-).
But this requires everyone un-learning their primary school maths of e.g. multiply-before-add, so it's not popular.
Having hand-picked operator precedences complicates things further when you allow operator overloading and user defined operators. E.g. Swift has special keywords to specify precedence for these. Ick...