Tootfinder

Opt-in global Mastodon full text search. Join the index!

No exact results. Similar results found.
@Erikmitk@mastodon.gamedev.place
2026-01-07 07:51:09

I can 100% relate to the final point of the quoted article.
As a middle manager I have enough influence to shape our institution but not as many responsibilities to estrange me from the actual work being done. That's a sweet spot for me!
indieauthors.social/@indieauth

Screenshot from the final paragraph of the article with the first two sentenced highlighted: I think this is what made me realize that I'm happiest as a mid-level manager. I have the authority to mentor staff and shape library services, but I still have my hands in the day-to-day work that I enjoy so much. I can cover the desk if we're short-staffed. I can collaborate with my team on improving department procedures. I can develop relationships with patrons and get input on what the community w…
@ethanwhite@hachyderm.io
2025-12-07 17:16:35

Excellent piece by @… on the ebb and flow of creative work and the inevitability and importance of fallow periods.
“What I failed to notice: that the fallow periods were doing something too. They were composting. I was taking in books and conversations and experiences without the pressure to immediately metabolize them into output. I was wandering without a map, which meant I sometimes stumbled into territory I never would have found if I'd been navigating by GPS.
The harvest seasons, when they returned, drew on seeds I hadn't remembered planting.”
joanwestenberg.com/the-harvest

@beeb@hachyderm.io
2025-12-13 19:51:54
Content warning: Advent of Code Day 11

Day 11 of #AdventOfCode is a classical graph problem like we're used to from previous years.
Unlike previously, I immediately thought of checking what the graph looked like with a visualization tool. Luckily, `petgraph` allows to export a graphviz file which can be then used to visualize the nodes and edges.
From that, it was clear that a few nodes were acting as "bridges" between largers subnets of nodes with no particular arrangement besides being directed towards the next "bridge" layer. Those bridge layers comprised 4 to 5 nodes in my input, and were the only ones with more than 6 incoming edges, so I used that as my filter criterion.
To gather them, I sorted the graph in topological order and chunked them by their position offset compared to the previous node. When doing this, all the nodes from a bridge layer end up being at most 20 positions away from the previous node in the sorted list.
Finally, I progressed through each subnet, collecting information about how many paths lead to each one of the end layer's nodes. By multiplying with all the paths leading to each start layer's node, we get the overall total number of paths.
#AoC #AoC2025 #AdventOfCode2025 #RustLang #rust