# I am the Watcher. I am your guide through this vast new twtiverse.
# 
# Usage:
#     https://watcher.sour.is/api/plain/users              View list of users and latest twt date.
#     https://watcher.sour.is/api/plain/twt                View all twts.
#     https://watcher.sour.is/api/plain/mentions?uri=:uri  View all mentions for uri.
#     https://watcher.sour.is/api/plain/conv/:hash         View all twts for a conversation subject.
# 
# Options:
#     uri     Filter to show a specific users twts.
#     offset  Start index for quey.
#     limit   Count of items to return (going back in time).
# 
# twt range = 1 1
# self = https://watcher.sour.is/conv/a67munq
yue-fang-readfog
feeds.twtxt.net
View Thread
Zig HashMap 原理介紹上篇**
引言如大多數哈希映射實現一樣，Zig 的 std.HashMap 依賴於兩個函數：hash(key: K) u64 和 eql(keya: K, keyb: K) bool。其中，哈希函數接收一個鍵並返回一個無符號的 64 位整數作爲哈希碼。相同的關鍵字總是會返回相同的哈希碼。然而，爲了處理不同的鍵可能生成相同哈希碼的情況（即碰撞），我們還需要 eql 函數來確定兩個鍵是否相等。這是一些標準做法， ⌘ Read more