orderedmap
🔃 An ordered map in Go with amortized O(1) for Set, Get, Delete and Len. (by elliotchance)
biscuit
Biscuit research OS (by mit-pdos)
orderedmap | biscuit | |
---|---|---|
1 | 12 | |
730 | 2,406 | |
- | 1.5% | |
3.6 | 0.0 | |
6 months ago | over 1 year ago | |
Go | Go | |
MIT License | BSD 3-clause "New" or "Revised" License |
The number of mentions indicates the total number of mentions that we've tracked plus the number of user suggested alternatives.
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
orderedmap
Posts with mentions or reviews of orderedmap.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2021-06-09.
-
Go is a nice improvement over C and C++, and it doesn't make me feel dirty like Java does.
Ex https://github.com/elliotchance/orderedmap
biscuit
Posts with mentions or reviews of biscuit.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2023-04-06.
-
Biscuit 3.0
No, it isn't the third release of a POSIX like OS research written in Go,
https://github.com/mit-pdos/biscuit
-
If I know neither Go or Rust, which do I choose to learn first/only?
But there are other brave people exists like biscuit or gopher-os who can do it :)))
-
Pre-Overengineering
That's something I found in doing a bit of a dive on why ripgrep is so fast at doing a very specific kind of string search workload (Gallant / burntsushi / author of ripgrep is an actual wizard and contributes to Rust's regex engines, for reference). I wrote tiny proof of concepts in a variety of languages, all in my same style -- and sometimes my Go variants were as fast as the equivalent Rust/C (even in release / -O3/2 (every once in a blue moon, O3 makes no diff or is a slight regression in some exec paths)). I eventually found something about benchmarks in a related area, leading to this: https://benhoyt.com/writings/count-words/#performance-results-and-learnings. Somebody on the Go sub even linked me to the Biscuit OS: https://pdos.csail.mit.edu/papers/biscuit.pdf, which, tidbit, has Jon Gjengset (Crust of Rust legend) in the contribs list (https://github.com/mit-pdos/biscuit).
-
What is a "CPU Biscuit"?
https://github.com/mit-pdos/biscuit maybe this
-
Rust: A Critical Retrospective
Go has been used to implement OS kernel code, e.g. in the Biscuit OS from MIT: https://github.com/mit-pdos/biscuit
Of course, the garbage collector did not exactly make it easier - but it's an interesting piece of software.
- Can Go be used for kernel development?
- GOLang in embedded systems
-
GOLang in embedded systems (1 physical threads)
https://github.com/mit-pdos/biscuit says 5% slowdown over C. Garbage collection is going to require some more RAM, generally <=2x though.
- Biscuit operating system written in Go
- The difference between Go and Rust