This is my second post here on leaflet! I think today's log is a little more refined than yesterday. It's probably because the Dodgers won.

Yesterday

I worked on error boundaries in VoltX and scaffolded some observability enhancements.

Most of my time was spent on workspace level LSP features. The foundation is a dependency graph and the Tarjan SCC (strongly connected components) algorithm. The LSP indexes the workspace, resolves imports, and handles a cache.

Today

As I continue to learn about type inference to solidify my understanding, I plan to keep pushing towards completing the LSP implementation.

Static Analysis

Control & data flow analysis using graphs (per function). This includes narrowing of flow and construction of union types for conditionals (each branch is a member).

Handle PEP 484/585 type hints & annotations

Work on diagnostics - I'm a little worried about this one, because I want to create useful messages and I know I'll be second guessing wording.

Go Dodgers!