# 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 5
# self = https://watcher.sour.is/conv/uy6vyxq
xuu
txt.sour.is
View Thread
So, I finally got day 17 to under a second on my machine. (in the test runner it takes 10)

I implemented a Fibonacci Heap to replace the priority queue to great success.

https://git.sour.is/xuu/advent-of-code/src/branch/main/search.go#L168-L268
lyse
lyse.isobeef.org
View Thread
You intrigued me, @xuu. I have to read up on Fibonacci Heaps when I'm clear-headed. :-)
xuu
txt.sour.is
View Thread
@lyse i first learned about it from this vid https://www.youtube.com/watch?v=6JxvKfSV9Ns&pp=ygUOZmlib25hY2NpIGhlYXA%3D

and this site: https://www.programiz.com/dsa/fibonacci-heap
xuu@dev.txt.sour.is
dev.txt.sour.is
View Thread
@lyse i first learned about it from this vid https://www.youtube.com/watch?v=6JxvKfSV9Ns&pp=ygUOZmlib25hY2NpIGhlYXA%3D

and this site: https://www.programiz.com/dsa/fibonacci-heap
lyse
lyse.isobeef.org
View Thread
@xuu Thanks, that video is quite good. Crazy stuff. ;-)