hit9

8 ms·

1.
Show HN: Tinytasktree – Behavior-tree-style task orchestration for LLM agents(github.com)
2 points by hit9 3mo ago|0 comments
2.
Show HN: Nanocode-CLI – A lightweight terminal-based AI coding assistant(github.com)
4 points by hit9 4mo ago|0 comments
3.
Show HN: Bitproto – the bit level data interchange format(bitproto.readthedocs.io)
4 points by hit9 6y ago|0 comments
4.
Show HN: Validate flask request and response json schemas via docstring(github.com)
3 points by hit9 10y ago|0 comments
5.
Show HN: A simple tcp traffic duplicator in golang(github.com)
2 points by hit9 10y ago|0 comments
6.
How do we detect anomalous metrics (outliers) via 3-sigma rule(github.com)
1 points by hit9 10y ago|0 comments
7.
by hit9 10y ago
Reasons to create it: - Most redis client implementations don't support redis cluster. - It's hard to provide redis client libraries for multiple languages without breaking compatibilities. - twemproxy requires restarting to add&#
8.
Fast multiple-threaded redis cluster proxy written in C(github.com)
4 points by hit9 10y ago|1 comments
9.
Implement on-disk stack. (just for interesting(github.com)
1 points by hit9 10y ago|0 comments
10.
by hit9 10y ago
Hmm.. The 2 * 3 ... 29 can be larger, if we want a larger tree. Comment 1: O(2 * 3 ... 29) is indeed constant level, but we don't like it. The put/get/delete operations on this tree are all constant level, but at most S
11.
by hit9 10y ago
And the github project is https://github.com/hit9/htree
12.
by hit9 10y ago
The page dosen't say words like "faster than a hash table". The hash table has time complexity O(1) on get/set operations. And this tree has a constant-level time complexity, and should be a bit slower than hash table. B
13.
by hit9 10y ago
Sorry but I have typo in the documentation, the " Goroutine Safety." is the headline of following paragraph. HTree dose not guarantee the goroutine safety: > "Lock granularity depends on the use case." The docs page u
14.
by hit9 10y ago
And the origin string keys are stored in the htree item only if there is collision. So the string key distinguishing checks are at most once.
15.
by hit9 10y ago
And the memory are expensive in that case..
16.
by hit9 10y ago
This tree is implemented as the record position informations indexing container for a disk-based storage engine on the bitcask model..
17.
by hit9 10y ago
Yep.
18.
by hit9 10y ago
In golang, array is auto-expanding so the children array allocates more space than its length, which depends on the golang internal implementation. > "Child nodes are stored in an array orderly, and checked by binary-search but not
19.
by hit9 10y ago
Advantage: constant level time complexity with better space utilization. The binary tree with the binary-search searching strategy has a time complexity O(logN), which is higher than htree's. This htree is mainly for memory bounded cas
20.
by hit9 10y ago
For this case, conflicts can be solved via the traditional separate chaining strategy, to open a list on the Item. This htree was originally implemented as the indexing container to store key-value poisition informations for the bitcask sto
21.
In-memory hash tree implementation(godoc.org)
102 points by hit9 10y ago|53 comments
22.
Real-time anomalies(outliers) detection system for periodic metrics(github.com)
5 points by hit9 11y ago|0 comments
23.
by hit9 11y ago
Hi, skyline is a great work, here is my views: 1. Skyline has many built-in detection algorithms. Banshee only uses the 3-sigma rule. 2. Skyline's algorithms are pure and simple, without considerations of burr points, scatters (like co
24.
Metric anomalies detection(github.com)
12 points by hit9 11y ago|4 comments
25.
My tested C snippets for buffer, queue, stack, event, skiplist.. with examples(github.com)
1 points by hit9 11y ago|0 comments
26.
Show HN: Image to Ascii Text – output HTML or Ansi terminal with color support(github.com)
7 points by hit9 11y ago|0 comments
27.
Show HN: Fast consistent hashing proxy for etsy/statsd(github.com)
2 points by hit9 11y ago|0 comments
28.
Show HN: Gif2txt – Gif Image to Ascii Text(github.com)
20 points by hit9 11y ago|3 comments
29.
Show HN: Gif2txt – Gif Image to Ascii Text(github.com)
5 points by hit9 11y ago|0 comments
30.
Awesome Go Version Manager(github.com)
1 points by hit9 11y ago|0 comments

More ›