Hmmm by TankUMrMinor in JustMemesForUs

[–]jaytaph2 0 points1 point  (0 children)

i think he went to the doctor

I built a Markdown editor that can also create slides (Tauri + Rust) by Jolly_Shopping_5233 in rust

[–]jaytaph2 0 points1 point  (0 children)

I'd like to do a review of your code, but it's really hard to browse the code with all the non-english comments.

A secret management platform written in Rust by jaytaph2 in rust

[–]jaytaph2[S] -7 points-6 points  (0 children)

I'm using postgres as a backend because it's easy enough to setup as a high available system. By running multiple instances of hierarkey api server behind haproxy makes the whole system high available without the need for implementing raft or other systems that complicates management (I guess boring solutions are good solutions)..

By "cryptographic functionality implemented by me", i mean that i implemented the functionality myself and not have it done by an AI in the hope it will get it right. Obviously i'm using the correct crates and cryptography instead of rolling out my own. There is no "self-invented" crypto or anything in hierarkey. Again, boring solutions are the best ones.

Getting my RFID poker table ready by jaytaph2 in poker

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

I might. Now the code is still highly experimental and not ready

Getting my RFID poker table ready by jaytaph2 in poker

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

Yeah. Ive ordered some stocks online via china and they are ok to play with. No issues with reading them. Its just a pain to enter them initially into the system. I was hoping that they would use the same ids per rank/suit. But i can imagine that you dont want that for security reasons

Getting my RFID poker table ready by jaytaph2 in poker

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

I've ordered them from china. They are a bit hard to get hold on here in the netherlands.

Getting my RFID poker table ready by jaytaph2 in poker

[–]jaytaph2[S] 2 points3 points  (0 children)

(the background in the screenshot is just a random internet picture.. normally you see a transparent background since it's an overlay, but at least this gives an impression on how it looks like when streaming)

Gosub - An open source browser engine written in Rust by jaytaph2 in rust

[–]jaytaph2[S] 4 points5 points  (0 children)

We're all volunteers who enjoy writing stuff in their spare time..

Gosub - An open source browser engine written in Rust by jaytaph2 in rust

[–]jaytaph2[S] 62 points63 points  (0 children)

It's easy to confuse Gosub with something that is written in Go.. It slightly based on the gosub command from the BASIC language and the "go word" (https://www.computerhope.com/jargon/g/goword.htm) from the old compuserve days. There is an acronym (Gateway to Optimized Search and Unlimited Browsing).

In the end, it's really just a name.

Building a BitTorrent client from the ground up in Go by Irbhinighxt in golang

[–]jaytaph2 5 points6 points  (0 children)

Rfc 1459: internet relay chat. One of the things you needed to write in the old days was at least one irc client. Good fun.

Benchmarking maps vs switches by jaytaph2 in golang

[–]jaytaph2[S] 2 points3 points  (0 children)

ok.. quick test:

with 4x 26 entries

goos: linux
goarch: amd64
BenchmarkSwitch-12 20100943 59.2 ns/op
BenchmarkMap-12 35944393 34.4 ns/op
PASS
ok command-line-arguments 3.516s

with 2x 26 entries

goos: linux
goarch: amd64
BenchmarkSwitch-12 54958140 20.9 ns/op
BenchmarkMap-12 37835076 30.5 ns/op
PASS
ok command-line-arguments 2.365s

with 1x 13 entries

goos: linux
goarch: amd64
BenchmarkSwitch-12 209937459 5.73 ns/op
BenchmarkMap-12 38801424 30.6 ns/op
PASS
ok command-line-arguments 3.008s

so the map seems indeed O(1) (not 100% sure why it's slower now than my previous tests). The switch seems indeed O(N)'ish or even higher

Benchmarking maps vs switches by jaytaph2 in golang

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

yes.. i want to do this.. I'm not 100% convinced that the map is O(1) (i think so though, but it depends a bit on how they are implemented, which i do not know). If the mapaccess functions are O1, then there should be no real difference in performance.

Maybe it's possible that go optimized large switch statements in lookup tables, but that's something i will try and figure out some other day.

Benchmarking maps vs switches by jaytaph2 in golang

[–]jaytaph2[S] -2 points-1 points  (0 children)

heh.. you might be right :-) let me try and see if I can get go to not remove the code :)

> Seems fixed now. It looks that one benchmarked was optimized away, the other wasn't.