Hacker Newsnew | past | comments | ask | show | jobs | submit | meribold's commentslogin

My terminal "warns" about them thanks to using a bitmap font that has no (significant?) Unicode coverage beyond code points 0 to 255.

This seems like it would be great together with a pair of display glasses (like those from XREAL, for example). But I wish it had a TrackPoint.


Sad to see GPT-4.5 being gone. It knew things. More than any other model I'm aware of.


I can't imagine anyone leaving this comment besides GPT-4.5


Such a nefarious package could also read browser cookies, SSH keys, emails, photos, and a million of other things.


> person who managed to put their words online

He also managed to do quite a lot of other things: https://en.wikipedia.org/wiki/Andrej_Karpathy


The person is also quite good at specifically putting their words online in a way that others can benefit from them. (Enough so that it’s a bit of a running joke[1] when he quits his job and has time to write some more words.) That skill is generally difficult to transmit, so if they’re saying something in that direction it could be worth listening.

[1] https://news.ycombinator.com/item?id=39365638


This system seems quite similar to sending messages to oneself on Signal/Telegram/whatever. What I like about using messenger apps is that every note gets a timestamp and that messenger apps are, in my experience, more polished than note-taking apps.


Then you’re at the mercy of a third party service for access to your notes.


That depends on the messenger app. Telegram, for instance, supports backing up messages as HTML and/or JSON.


There are screen-locking programs that don't hide what's on the screen (for example `alock` and `xtrlock`). So you can use one of those in a script that also launches this tool.


You don't need to compare the whole key most of the time. I think the amortized cost for a comparison is in O(1).


Not in a balanced tree, since the further down the tree you go, the longer the shared prefix between the search key and node key becomes.

So the complexity becomes something like 1 + 2 + 3 + .. + log n = O(log^2 n).


Good point. Perhaps we could store the length of the common prefix from the last time we went left as well as from the last time we went right. The minimum of those two should remain a common prefix with the search key for the rest of the lookup and should therefore be safe to skip during subsequent comparisons.


But that would actually help it because you can store how far down the match is by that point in the tree, and know how few digits you have to actually compare.


What's better about the T440 compared to the successors up to the T480? I'd consider the T440 a low point due to the lack of TrackPoint buttons.


You could quite easily use a t420 keyboard in a t440 with a few pins masked which was the last traditional thinkpad keyboard.

Actually I may be getting the numbers wrong, it could be the t430 that I was thinking about. It's been rather a long time since I did any brain surgery on thinkpads.


> "git oldest-ancestor brancha branchb" does what it says.

The oldest (common) ancestor of two revisions would typically be the initial commit. I assume your alias really finds the last (most recent) common ancestor. But are you aware of the `git merge-base` builtin? Your alias looks an awful lot like it.


Oh, yes that's exactly what I really meant. Whoops.

I'll check out merge-base tomorrow, thanks for mentioning it!


Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: