# 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/xwrytlq
Go 中祕而不宣的數據結構 Treap：平衡樹不一定就用紅黑樹**
treap 是一棵二叉樹，它同時維護二叉搜索樹 （BST） 和堆的屬性, 所以由此得名 (tree + heap ⇒ treap)。從形式上講，treap （tree + heap） 是一棵二叉樹，其節點包含兩個值，一個 key 和一個 priority，這樣 key 保持 BST 屬性，priority 是一個保持 heap 屬性的隨機值（至於是最大堆還是最小堆並不重要）。相對於其 ⌘ Read more