# 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/5x5mu3q
yue-fang-readfog-go
feeds.twtxt.net
View Thread
Go 底層探索 -四-: 哈希表 Map[上篇]**
@注: 以下內容來自【Go 語言底層原理剖析、Go 語言設計與實現】兩書中的摘要信息，一起讀書、一起學習。介紹-----Go語言中的map又被稱爲哈希表，是使用頻率極高的一種數據結構。哈希表的原理是將多個鍵/值（key/value）對, 分散存儲在buckets（桶）中。通常map的時間複雜度爲O(1), 通過一個鍵快速尋找其唯一對應的值value。在許多情況下，哈希表的查找速度明顯快於一些搜 ⌘ Read more*