ok VS hackernews

This - https://github.com/JohnEarnest/ok - can also be used sometimes...

If you want to try out K, there are some open source implementations, like John Earnest's oK which has a REPL and a calculator-like interface for mobile phones with a charting feature.

and have the programmer use the word "barchart", they instead prefer to use the definition itself. The word "barchart" has a specific meaning (here, an ascii "bar chart" of 0s and 1s, showing the relative sizes of the values of input array x), but "{x>\:!|/x}" might be useful for more than just bar charts. This idiom contains smaller idioms like "count til max" (!|/) which in turn contains "max" (|/).

Being able to see the code makes it easier to explore and tweak to your specific needs. But more importantly, there are no "official" names for concepts like "count til max". That's just my personal name for it. A python programmer would call it "range". You could come up with your own name for (!|/) that makes perfect sense to you. But that name will probably be longer than its definition, and less flexible.

[1] https://github.com/JohnEarnest/ok/blob/gh-pages/examples/idi...

check out oK[0] by John Earnest, who is the author of the content of this post

it is well-written manual and is a great jumping off point

there is a k-enthusiast element.io server[1] where you can ask any question you like. folks are friendly!

[0] https://github.com/JohnEarnest/ok

[1] https://matrix.to/#/#aplfarm-k:matrix.org

this might help a little: https://github.com/wting/hackernews

I think it's a ratio of votes to time. I think as little as 4 votes can get something on the homepage if they come in fairly quickly.

The source code for hn is available if you want to go and look up the specifics. I'm not sure if this is the most up-to-date mirror, but the site doesn't change that often: https://github.com/wting/hackernews

Might not count as modern, but the original Reddit and HackerNews codebases:

- https://github.com/reddit-archive/reddit1.0

- https://github.com/wting/hackernews (actually news.arc, based on old hn)

There's also this https://github.com/wting/hackernews -- which is a version of the source code to the site from sometime in the past.

"Otherwise" was the operative word in my (slightly sarcastic) example. :)

Avoiding all caps words means you sometimes have to go back and change "FAA" back from "Faa".

HN's software is no longer open source, but at one time, this is how it processed titles on initial submission: https://github.com/wting/hackernews/blob/master/news.arc#L15...

And at any rate, #1 on HN is not the product of any simple rule like "most upvotes per unit time with some decay function applied." There is significant judgment in expressed in the way that stories are ranked. The sourcecode as of 2012 was enough to demonstrate this, but in my understanding yet more judgment has been applied since then.

https://github.com/wting/hackernews/blob/master/news.arc

"ad-hoc filesystem based solution" is the closest of your definitions, I think. Last time I saw/heard, HN was built in Arc, a Lisp dialect, and use(s/d) a variant of this (mirrored) code: https://github.com/wting/hackernews

Check out around this area of the code to see how simple it is. All just plain files. A database, of sorts, but not in the way you might be expecting: https://github.com/wting/hackernews/blob/master/news.arc#L16...

There is a modern maintained variant at https://github.com/arclanguage/anarki/tree/master/apps/news as well.

File syncing between machines is pretty much an easily solved problem. I don't know how they do it, but it could be something like https://syncthing.net/ or even some scripting with `rsync`. Heck, a cronned `tar | gzip | scp` might even be enough for an app whose data isn't exactly mission critical.

The old version in arc, mirrored at https://github.com/wting/hackernews/blob/5a3296417d23d1ecc90..., uses the file system as a database.

https://github.com/wting/hackernews/blob/5a3296417d23d1ecc90... shows the monotonically increasing number:

  (def new-item-id ()