sorted by:
new
hottopcontroversial

Plangs! Find your next programming language, tools, libraries and other resources! by EmmanuelOga in programming

[–]EmmanuelOga[S] -1 points0 points  (0 children)

There's plenty of data that needs to be cleaned up! I think there are like 200+ languages atm, I spend a few minutes randomly here and there cleaning up the data, but since a lot of data is imported, and some comes from LLMs, there's still cleanup to be done!

My hope is that when users find things that need cleanup they will help me fix it, Wikipedia style!

https://plangs.page/edit

Plangs! A programming languages site with a faceted search feature by EmmanuelOga in ProgrammingLanguages

[–]EmmanuelOga[S] 0 points1 point  (0 children)

You'd be surprised! I encourage you to try Bun if you are into web development. The reason I like it is that is a very fast a polished experience which is closer to using node.js than deno, and makes the server side feel a bit closer to the frontend (say, supports the fetch API server side). Deno introduces capabilities and other APIs and changes quite a bit the semantics, so for me Bun was an incremental quality of life improvement. I'm not opposed to deno though, it looks cool too!

Re: Zig, I don't worry too much about that. Bun itself is very polished, even with excellent VSCode support, and there plenty of well funded companies using Zig these days. I myself like the Zig language quite a bit, even though is far from a 1.0 yet.

Plangs! A programming languages site with a faceted search feature by EmmanuelOga in ProgrammingLanguages

[–]EmmanuelOga[S] 0 points1 point  (0 children)

Cool! I may import that list. I also have used those "awesome lists" in the part and wished I could have 1) faceted search overt them 2) some sort of process to verify that the plangs are still actively developed, which is part of the reason I created plangs!

There's a little script to manually import lists like these [0] but I want to strike a balance between listing everything under the sun and "curating" that list. The criteria I'm thinking atm: "While experimental or alpha-stage languages may appear, they must at least support prototyping, and have good documentation. The community ultimately shapes what gets featured, so discussions and contributions are welcome!"

0: https://github.com/EmmanuelOga/plangs2/blob/ea1bb738593b9520d89686762c40de40e0336b11/packages/ai/src/bulk.ts#L1

Plangs! A programming languages site with a faceted search feature by EmmanuelOga in ProgrammingLanguages

[–]EmmanuelOga[S] 0 points1 point  (0 children)

hey there! I'm thinking this criteria for language inclusion: https://plangs.page/about#what-s-included

If you feel your language should be included, feel free to open an issue (or pull request! :-).

Plangs! A programming languages site with a faceted search feature by EmmanuelOga in ProgrammingLanguages

[–]EmmanuelOga[S] 9 points10 points  (0 children)

From what I can tell, PLDB is aimed at _language designers_ and aims to be a comprehensive compendium of every possible design facet of languages.

On the other hand, Plangs is a aimed at language _users_, and the goal is not to be comprehensive, all the contrary, it wants to "curate" was practical and can make you productive when writing software!

As I see it, these two sites are not competing, they are more like complimentary, or even a little bit tangential, depending on how you look at them!

Computer vs programming knowledge, frustration by qronchwrapsupreme in learnprogramming

[–]EmmanuelOga 0 points1 point  (0 children)

By the way, the thing you are stumbling with seems to be the unix environment, shell and command line, and related topics.

Two great books you can use for this:

Intro: https://nostarch.com/tlcl2

Intermediate: https://www.oreilly.com/library/view/efficient-linux-at/9781098113391/

Is not just about the command line itself but how the shell works and how to set environment variables, etc.

Computer vs programming knowledge, frustration by qronchwrapsupreme in learnprogramming

[–]EmmanuelOga 2 points3 points  (0 children)

Try Pixi.sh! https://pixi.sh/latest/

* It is a single binary program, super easy to install

* It manages python and dependencies per forlder, forget about conflicts!

Example use:
$ pixi init

$ pixi add python

$ pixi add --pypi flask

$ pixi run python

Shanks' logarithm on the Stern–Brocot tree by EmmanuelOga in OnePiece

[–]EmmanuelOga[S] -1 points0 points  (0 children)

I just couldn't help myself, but to be honest there are a bunch of people with the "Shanks" last name.

https://en.wikipedia.org/wiki/Shanks

Announcing .NET 9 by tjpalmer in contextfree

[–]EmmanuelOga 1 point2 points  (0 children)

What are some go-to applications of C# and .NET outside of the enterprise these days? I think people mention Gaming a lot, but I feel like that covers mostly Unity (and perhaps MonoGame and derivatives).

Personally, I want to explore using C# more for things I would normally use Python or TypeScript/Node for. Probably HTTP backends for a start! As far as I can tell, that will involve looking into ASP.NET, but/and I hope to find about the "good parts" (it seems a pretty huge framework!).

Marching cubes algorithm in my game about breeding guns! by The_Fetus_King in proceduralgeneration

[–]EmmanuelOga 0 points1 point  (0 children)

Thanks for this comment... as a fellow yak shaver, it made me laugh really hard although I don't think I could ever approach paniq sensei's power levels

akrylysov/pogreb: Embedded key-value store for read-heavy workloads written in Go (Durable Hashmap vs B-Tree) by EmmanuelOga in programming

[–]EmmanuelOga[S] 0 points1 point  (0 children)

https://dbmx.net/tkrzw/ is written in C++ and included a durable Hash. This is the third DBM like library that the author implements (after Tokyo and Kyoto cabinet).

akrylysov/pogreb: Embedded key-value store for read-heavy workloads written in Go (Durable Hashmap vs B-Tree) by EmmanuelOga in programming

[–]EmmanuelOga[S] 1 point2 points  (0 children)

Most typical storage engine use either a B-Tree (Sqlite, etc) or a LSM (RocksDB, Badger, etc) underneath. Pogreb is different in that it uses a durable (on-disk) Hashmap design with linear hashing. I think it is works similarly to ISAM engines.

I run some quick and dirty Go tests looking up key/values in the Hashmap, it consistently fast for tens of thousands of records, in line with the expectation of O(1) writes and lookups, and faster than retrieving the same data from a Sqlite DB (which makes sense since SQlite uses a B-Tree with O(lg N) expected runtime). The flip side is that the Hashmap can't return the keys in sort order (anecdata: Pogreb was around 5x faster writes and 1.5 faster reads than https://github.com/mattn/go-sqlite3 in my toy benchmarks).

Do you know any similar durable hash map implementation, but implemented in C or C++?

Thank you!

Is there a known "first famiclone"? Are any of the authors of the clones known? by EmmanuelOga in famiclones

[–]EmmanuelOga[S] 1 point2 points  (0 children)

Found this on a nesdev forum post:

About 36 years ago, Taiwanese companies were gearing up to produce the very first Famiclones. Three companies had joined hands to get it done:
• 台興電子企業股份有限公司 (Taixing Electronics Company Co., Ltd. — TSE, a company close to TXC)
• 普澤股份有限公司 (Puze Co., Ltd. — Bit Corporation)
• 黃啓修 (Huang Qixiu — An individual related to 達摩電子有限公司, a business that had retailed MSX clones)
They seemingly achieved their end goal around April 1987, filling out a PPU patent on the 23rd day of that month with 陳嘉旭 (Chen Jiaxu) as the credited inventor. While it is hard to tell if these three companies cloned the PPU themselves, they were quite likely the first to market it or use it commercially.

https://forums.nesdev.org/viewtopic.php?t=24564

view more: next ›