# 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/dcpg25a
yue-fang-readfog
feeds.twtxt.net
View Thread
Rust 挑戰 - 動手實現 HashMap 1
讓我們在 Rust 中實現一個哈希表數據結構，由於哈希表的效率和通用性，它在數據結構中非常重要。通過從頭開始實現它，我們可以深入瞭解所涉及的底層算法和數據結構。同時還還會提高我們的 Rust 技能。說到算法，我們將實現線性探測開放尋址哈希表。我們將採用自頂向下的方法，從較高級別的抽象開始，然後逐步向下到較低級別的抽象和實現。讓我們從最頂層的抽象開始：API，我們不支持 Rust 標準庫 std:: ⌘ Read more