dyx

4 ms·

1.
Show HN: Training Neural Networks with a Single Unix Pipeline(github.com)
5 points by dyx 3y ago|0 comments
2.
Show HN: Trie implementation balancing between time, space and simplicity(github.com)
1 points by dyx 4y ago|0 comments
3.
Fast Text-to-PDF Converter with ~200 Lines of C89, Requiring Only Libc(github.com)
3 points by dyx 4y ago|0 comments
4.
Hardv: A highly extendable flashcard quiz app for Unix terminals(github.com)
3 points by dyx 4y ago|0 comments
5.
by dyx 4y ago
Oh, after carefully check the man page of flock(1) in Linux, it supports timeout. So the last value of this program disappears. Please ignore my ignorance and disturbance. I wish I could delete the post but there is no way to do it.
6.
by dyx 4y ago
I implement this program since flock(1) in Linux doesn't support timeout of pending. I've never used BSD. After reading the link provided by you, I think my program becomes no value, if there is a Linux version of lockf(1). Sad.
7.
by dyx 4y ago
You are right in this situation. The scene for this program is that I don't know all the tasks. Namely, tasks are generated in real time. 1. I posted some task to the queue and continue my work, then the work make me post another work.
8.
by dyx 4y ago
1. I want to run commands in background, but sequentially 2. Used in a server application for queued long-time task
9.
Task Queue, with No Daemon(github.com)
2 points by dyx 4y ago|9 comments
10.
Implementing Condition Variables with Semaphores (2003) [pdf](birrell.org)
20 points by dyx 4y ago|1 comments
11.
Finger: The First Social Software (2019)(somanymachines.com)
73 points by dyx 4y ago|18 comments
12.
Show HN: shsub, a template engine for the shell language(github.com)
1 points by dyx 4y ago|0 comments