One feature of Scala is it reuse Java's Exception class hierarchies, but much easier to use. For one thing, it treats Exception as "unchecked" just like RuntimeException, which I think one of the reason it causes Java to be unnecessary verbose. For example when opening a file stream, one way Java can do it is:

public void doFile(File file) throws FileNotFoundException, IOException {  
  FileInputStream fins = null;
try{
fins = new FileInputStream(file);
//process it.
}finally{
if(fins != null){ fins.close(); }
}
}

But in Scala equivalent can be done as follow:
def doFile(file: File): Unit = {  
  val fins = new FileInputStream(file)
try{
//process it.
}finally{
fins.close
}
}

In Scala, you don't need to predefine the "fins" to null then try it, and then check to close in finally block, because if FileInputStream failed, an FileNotFoundException instance will be thrown out of the method, before reaching to the try block. In addition, the Scala user of the doFile method do NOT need to invoke it inside a try/catch block, while Java requires it. This is possible because Exception, or any subclasses are "uncheck" as default in Scala. This mean that the exception will keep throw to next stack frame until it finds a "catcher". If none are found, it will exit main at the end.

Views: 39

Happy 10th year, JCertif!

Notes

Welcome to Codetown!

Codetown is a social network. It's got blogs, forums, groups, personal pages and more! You might think of Codetown as a funky camper van with lots of compartments for your stuff and a great multimedia system, too! Best of all, Codetown has room for all of your friends.

When you create a profile for yourself you get a personal page automatically. That's where you can be creative and do your own thing. People who want to get to know you will click on your name or picture and…
Continue

Created by Michael Levin Dec 18, 2008 at 6:56pm. Last updated by Michael Levin May 4, 2018.

Looking for Jobs or Staff?

Check out the Codetown Jobs group.

 

Enjoy the site? Support Codetown with your donation.



InfoQ Reading List

30+ Updates per Second per Account: Uber Scales Ledger Processing with Batching

Uber introduced a high-throughput financial ledger processing system designed to handle hot account write contention at scale. Using 250ms batching, Redis coordination, and optimistic atomic updates, the system supports 30+ updates per second per account while preserving consistency and auditability, reducing multi-hour processing pipelines to minutes in its distributed accounting infrastructure.

By Leela Kumili

How a Culture of Data-Driven Conversations Can Support Platform Engineering

To provide SRE as a service, a team built a center of excellence, introducing Federated SREs and roles like production manager and technical tribe lead. They created a culture of data-driven conversations where SLOs and SLAs were democratised. Surviving growing cognitive load meant continuously simplifying architecture and embedding sovereignty and resilience into platform design decisions.

By Ben Linders

Presentation: Architecting a Centralized Platform for Data Deletion at Netflix

The speakers discuss the architectural challenges of executing safe data deletion across distributed datastores. Balancing durability, availability & correctness, they explain how to orchestrate multi-system deletion propagation without impacting live traffic. They share lessons on controlling tombstone accumulation, building continuous audit loops, and gaining trust with a centralized platform.

By Vidhya Arvind, Shawn Liu

Article: Architectural Change Cases: A Practical Tool for Evolutionary Architectures

Architectural change cases extend architecture decision record (ADR) thinking by evaluating how decisions may evolve over time. Change cases expose hidden assumptions and help teams estimate the reversibility and cost of change.

By Pierre Pureur, Kurt Bittner

AWS Replaces Fat-Tree Data Center Networks with Random Graph Theory, Cutting Routers by 69%

AWS disclosed that Resilient Network Graphs, a flat network architecture based on quasi-random graph theory, is now the default for most new data center builds. The design replaces fat-tree hierarchies with direct ToR-to-ToR mesh connections using passive optical ShuffleBoxes, cutting routers by 69%, boosting throughput by 33%, and reducing network power consumption by 40%.

By Steef-Jan Wiggers

© 2026   Created by Michael Levin.   Powered by

Badges  |  Report an Issue  |  Terms of Service