Recent Episodes
Episode 489: Sam Boyer on Package Management
Guest Sam Boyer, author of So you want to write a package manager talks about package management with Host Robert Blumen. The discussion covers – what is a package? what does it mean to manage package? package meta-data; package versioning; the quantity of packages in modern applications; examples from popular programming languages; where do packages […]
Episode 488: Chris Riccomini and Dmitriy Ryaboy on the Missing Readme
Chris Riccomini and Dmitriy Ryaboy discuss their book, The Missing Readme, which is intended to be the missing manual for new software engineers. Felienne spoke with Riccomini and Ryaboy about a range of topics that new software engineers might not have learned about in university or bootcamp, including how to handle technical debt, how to […]
Episode 487: Davide Bedin on Dapr Distributed Application Runtime
Davide Bedin, a cloud solution architect at Microsoft and professional Dapr enthusiast joined host Jeff Doolittle to discuss his book, Practical Microservices with Dapr and .NET. Dapr (the Distributed Application Runtime; https://dapr.io) simplifies cloud-native application development by providing standards-based solutions for common application requirements. This approach provides a clean separation of core application logic from […]
Episode 486: Bob Nystrom on Dart
Bob Nystrom, author of Crafting Interpreters and a software engineer at Google working on the Dart programming language, discusses the key features of Dart that make it an excellent choice for fast apps on any platform. Host Gavin Henry spoke with Nystrom about Dart’s history, hardware out of your control, async-await, concurrency, mobile platforms, threads, […]
Episode 485: Howard Chu on B+tree Data Structure in Depth
Howard Chu, CTO of Symas Corp and chief architect of the OpenLDAP project, discusses the key features of B+tree data structures, which are the default selection for efficient and predictable storage of sorted data. Host Gavin Henry spoke with Chu about B+tree data structures; why they allow searches, insertions, and deletions in logarithmic time; what […]
