Serious developers know that code can always be improved. With each iteration, you make optimizations—small and large—that can have a huge impact on your application’s speed, size, resilience, and maintainability. In Seriously Good Software: Code that Works, Survives, and Wins, author, teacher, and Java expert Marco Faella teaches you techniques for writing better code. You’ll start with a simple application and follow it through seven careful refactorings, each designed to explore another dimension of quality.

Part 1 Preliminaries

1 Software Qualities and Problem Statement

1.1 Mostly external software qualities

1.1.1 Correctness

1.1.2 Robustness

1.1.3 Usability

1.1.4 Efficiency

1.2 Mostly internal software qualities

1.2.1 Readability

1.2.2 Reusability

1.2.3 Testability

1.2.4 Maintainability

1.3 Interactions between software qualities

1.4 Special qualities

1.4.1 Thread safety

1.4.2 Succinctness

1.5 Structure of the book

1.6 Specifications for a system of water containers

1.6.1 The API

1.6.2 The use case

1.7 Data model and representations

1.7.1 Storing water amounts

1.7.2 Storing connections

1.8 Hello containers!

1.8.1 Fields and constructor

1.8.2 Methods `getAmount` and `addWater`

1.8.3 Method `connectTo`

1.9 Further reading

2 Reference Implementation

2.1 The code `reference`

2.1.1 Memory layout diagrams

2.1.2 The methods

2.2 Memory requirements

2.3 Time complexity

2.3.1 Time complexity of `reference`

2.4 Summary

2.5 Applying what you learned

Exercise 1

Exercise 2

Exercise 3 (mini-project)

2.6 Answers to quizzes and exercises

Pop quiz 1

Pop quiz 2

Pop quiz 3

Pop quiz 4

Exercise 1

Exercise 2

Exercise 3

2.7 Further reading

Part 2 Software qualities

3 Need for Speed: Time Efficiency

3.1 Adding water in constant time `[Speed 1]`

3.1.1 Time complexity

3.2 Adding connections in constant time `[Speed 2]`

3.2.1 Representing groups as circular lists

3.2.2 Delaying the updates

3.3 The best balance: union-find algorithms `[Speed 3]`

3.3.1 Finding the group representative

3.3.2 Connecting trees of containers

3.3.3 Worst-case time complexity

3.3.4 Amortized time complexity

3.3.5 Amortized analysis of resizable arrays

3.3.6 Comparing implementations

3.3.7 Experiments

3.3.8 Theory vs practice

3.4 Real-world use cases

3.5 Summary

3.6 Applying what you learned

Exercise 1

Exercise 2

Exercise 3 (mini-project)

Exercise 4 (mini-project)

Exercise 5

3.7 Answers to quizzes and exercises

Pop quiz

Exercise 1

Exercise 2

Exercise 3

Exercise 4

Exercise 5

3.8 Further reading

4 Precious Memory: Space Efficiency

4.1 Gently squeezing `[Memory 1]`

4.1.1 Space and time complexity

4.2 Plain arrays `[Memory 2]`

4.2.1 Space and time complexity

4.3 Forgoing objects `[Memory 3]`

4.3.1 The object-less API

4.3.2 Fields and getAmount method

4.3.3 Creating containers with a factory method

4.3.4 Connecting containers by ID

4.3.5 Space and time complexity

4.4 The black hole `[Memory 4]`

4.4.1 Space and time complexity

4.4.2 Space-time trade-offs

4.5 Real-world use cases

4.6 Summary

4.7 Applying what you learned

Exercise 1 (mini-project)

Exercise 2

Exercise 3

Exercise 4

Exercise 5 (mini-project)

4.8 Answers to quizzes and exercises

Pop quiz 1

Pop quiz 2

Pop quiz 3

Pop quiz 4

Pop quiz 5

Exercise 1

Exercise 2

Exercise 3

Exercise 4

Exercise 5

4.9 Further reading

5 Self-conscious code: Reliability through monitoring

5.1 Design by contract

5.2 Pre- and post-conditions

5.3 Invariants

5.4 Correctness and robustness

5.5 Checking contracts

5.6 Designing containers by contract

5.7 Containers that check their contracts `[Contracts]`

5.7.1 Checking the contract of `addWater`

5.7.2 Checking the contract of `connectTo`

5.8 Containers that check their invariants `[Invariants]`

5.8.1 Checking the invariants in `connectTo`

5.8.2 Checking the invariants in `addWater`

5.8.3 Real-world use cases

5.9 Summary

5.10 Applying what you learned

Exercise 1

Exercise 2

Exercise 3

Exercise 4

5.11 Answers to quizzes and exercises

Pop quiz 1

Pop quiz 2

Pop quiz 3

Pop quiz 4

Pop quiz 5

Exercise 1

Exercise 2

Exercise 3

Exercise 4

5.12 Further reading

6 Lie to me: Reliability through testing

6.1 Basic testing notions

6.2 Coverage in testing

6.3 Testing and design-by-contract

6.4 JUnit

6.5 Testing containers `[UnitTests]`

6.5.1 Initializing the tests

6.5.2 Testing `addWater`

6.5.3 Testing `connectTo`

6.5.4 Running the tests

6.5.5 Measuring code coverage

6.6 Testability `[Testable]`

6.6.1 Controllability

6.6.2 Observability

6.6.3 Isolation: severing dependencies

6.6.4 Real-world use cases

6.7 Summary

6.8 Applying what you learned

Exercise 1

Exercise 2

Exercise 3

Exercise 4

Exercise 5

6.9 Answers to quizzes and exercises

Pop quiz 1

Pop quiz 2

Pop quiz 3

Pop quiz 4

Pop quiz 5

Pop quiz 6

Exercise 1

Exercise 2

Exercise 3

Exercise 4

Exercise 5

6.10 Further reading

7 Coding aloud: Readability

8 Many cooks in the kitchen: Thread safety

9 Please recycle: Reusability

Appendixes

Appendix A: Golf coding: Succinctness

About the Technology

Great code blends the skill of a programmer with the time-tested techniques and best practices embraced by the entire development community. Although each application has its own context and character, some dimensions of quality are always important. This book concentrates on eight pillars of seriously good software: speed, memory usage, reliability, readability, thread safety, generality, and elegance. The Java-based examples demonstrate techniques that apply to any OO language.

About the book

Seriously Good Software takes you on a journey through software development best practices as you develop a simple inefficient implementation into a robust, professional-quality application. The deceptively-simple problem—balancing water levels in multiple connected containers—presents some interesting complexities as you optimize the code for speed, efficiency, and durability. Author Marco Faella’s passion for teaching shines bright as you learn to assess performance and write thread-safe code that’s easily readable, testable, and maintainable. Along the way, you’ll gain a keen sense of the trade-offs inherent to every programming task, no matter how simple.

Each chapter contains hands-on exercises with complete, clear solutions that relate the techniques to real-world applications. Occasional pop quizzes ensure you’ve got a firm grasp on the concepts as you go along. When you’re done with this book, evaluating software qualities, considering tradeoffs and operational constraints, and asking all the right questions will be a reflex!

What's inside

Evaluating software qualities
Distinguishing between qualities that are internal, external, functional, and non-functional
Assessing tradeoffs and interactions between software qualities
Fulfilling different quality objectives for a single unifying task
Hands-on exercises and detailed solutions
Exercises covering the inner workings of the Java API

About the reader

For developers with basic object-oriented programming skills and intermediate Java skills.

About the author

Marco Faella has been teaching an advanced programming language course for twelve years as an associate professor at a major Italian university. As passionate about programming as he is about teaching, Marco has published many research articles in peer-reviewed journals, a Java certification manual, and a Java programming video course.

Manning Early Access Program (MEAP) Read chapters as they are written, get the finished eBook as soon as it’s ready, and receive the pBook long before it's in bookstores.

6 of 9 chapters available

MEAP combo

...

$39.99 pBook + eBook + liveBook

Seriously Good Software (combo) added to cart

continue shopping go to cart

continue shopping

go to cart

Subtotal:	$39.99
Shipping:	---
Total:	---

Part 1 Preliminaries

1 Software Qualities and Problem Statement

1.1 Mostly external software qualities

1.1.1 Correctness

1.1.2 Robustness

1.1.3 Usability

1.1.4 Efficiency

1.2 Mostly internal software qualities

1.2.1 Readability

1.2.2 Reusability

1.2.3 Testability

1.2.4 Maintainability

1.3 Interactions between software qualities

1.4 Special qualities

1.4.1 Thread safety

1.4.2 Succinctness

1.5 Structure of the book

1.6 Specifications for a system of water containers

1.6.1 The API

1.6.2 The use case

1.7 Data model and representations

1.7.1 Storing water amounts

1.7.2 Storing connections

1.8 Hello containers!

1.8.1 Fields and constructor

1.8.2 Methods getAmount and addWater

1.8.3 Method connectTo

1.9 Further reading

2 Reference Implementation

2.1 The code reference

2.1.1 Memory layout diagrams

2.1.2 The methods

2.2 Memory requirements

2.3 Time complexity

2.3.1 Time complexity of reference

2.4 Summary

2.5 Applying what you learned

Exercise 1

Exercise 2

Exercise 3 (mini-project)

2.6 Answers to quizzes and exercises

Pop quiz 1

Pop quiz 2

Pop quiz 3

Pop quiz 4

Exercise 1

Exercise 2

Exercise 3

2.7 Further reading

Part 2 Software qualities

3 Need for Speed: Time Efficiency

3.1 Adding water in constant time [Speed 1]

3.1.1 Time complexity

3.2 Adding connections in constant time [Speed 2]

3.2.1 Representing groups as circular lists

3.2.2 Delaying the updates

3.3 The best balance: union-find algorithms [Speed 3]

3.3.1 Finding the group representative

3.3.2 Connecting trees of containers

3.3.3 Worst-case time complexity

3.3.4 Amortized time complexity

3.3.5 Amortized analysis of resizable arrays

3.3.6 Comparing implementations

3.3.7 Experiments

3.3.8 Theory vs practice

3.4 Real-world use cases

3.5 Summary

3.6 Applying what you learned

Exercise 1

Exercise 2

Exercise 3 (mini-project)

Exercise 4 (mini-project)

Exercise 5

3.7 Answers to quizzes and exercises

Pop quiz

Pop quiz

Pop quiz

Pop quiz

Exercise 1

Exercise 2

1.8.2 Methods `getAmount` and `addWater`

1.8.3 Method `connectTo`

2.1 The code `reference`

2.3.1 Time complexity of `reference`

3.1 Adding water in constant time `[Speed 1]`

3.2 Adding connections in constant time `[Speed 2]`

3.3 The best balance: union-find algorithms `[Speed 3]`

4.1 Gently squeezing `[Memory 1]`

4.2 Plain arrays `[Memory 2]`

4.3 Forgoing objects `[Memory 3]`

4.4 The black hole `[Memory 4]`

5.7 Containers that check their contracts `[Contracts]`

5.7.1 Checking the contract of `addWater`

5.7.2 Checking the contract of `connectTo`

5.8 Containers that check their invariants `[Invariants]`

5.8.1 Checking the invariants in `connectTo`

5.8.2 Checking the invariants in `addWater`