Computer Science Is Still Alive
summary
A JetBrains IDE developer describes how classic computer-science algorithms and data structures are used inside IntelliJ IDEA. The talk covers specific features of IntelliJ IDEA and the algorithms behind them, including graph cycles, strongly connected components, tree isomorphism, depth-first search, longest common subsequence (LCS), Tarjan’s algorithm and related techniques applied to real tooling problems.
AI-written summary · about
chapters (16)
- 0:00Introduction
- 1:27Everyday bugs and CS
- 3:22Cyclic dependencies
- 6:16Module dependencies
- 9:28Refactoring and closure
- 11:18Control flow and assignment
- 14:54AST comparison
- 18:09Interval trees
- 21:19Project-wide search
- 23:30Code diffing
- 26:20Token pooling
- 28:29Concurrent inspections
- 32:08Persistent data structures
- 34:17When algorithms fail
- 36:08Managing inspections
- 41:03Q&A
related talks
01h 03mWhy Do Developers Love IntelliJ IDEA?
42mDeveloper Productivity With IntelliJ IDEA
44mIntelliJ IDEA-based IDEs Tips & Tricks
51mIntelliJ IDEA-Based IDE Tips & Tricks
52mIntelliJ IDEA Tips and Tricks
50mReading code
44mTips & Tricks for IntelliJ IDEA-based IDEs
45mDebugging applications with IntelliJ IDEA