Refactoring Techniques in Java | CodeSignal Learn

Refactoring Techniques in Java | CodeSignal Learn

Introduction

Hello, Explorer! Today is about refactoring . Consider it as organizing your favorite toys in the toybox. We're going to learn about the Extract Method, Rename Method, and Substitute Algorithm refactorings. Refactoring helps us make our code cleaner and neater while keeping the functionality the same!

Refactoring Overview

Imagine having a complex map. Refactoring transforms it into simpler directions. Our code gets rearranged to make it more readable and efficient without altering what it does. Let's consider a small code snippet before and after refactoring: Java // Before refactoring public double calculate(double total, int quantity) {double price = total / quantity; double tax = price * 0.2; double totalPrice = price + tax; return totalPrice;} // After refactoring public double calculateTotalPrice(double total, int quantity) {double price = calculatePrice(total, quantity); double tax = calculateTax(price); return price + tax;} public double calculatePrice(double total, int quantity) {return total / quantity;} public double calculateTax(double price) {return price * 0.2;} Both versions of the code do the same thing, but the latter is simpler and easier to understand!

Understanding the Extract Method

Imagine a large recipe for a complete breakfast. The Extract Method technique is like having separate recipes for eggs, toast, coffee, etc., instead of one large recipe. Take a look at this code: Java // Before refactoring public String greetUser(String username) {username = username.trim().toLowerCase(); // Prepare the username String message = "Hello, " + username + "!"; // Prepare the message return message; // Return the prepared message} // After refactoring public String cleanUsername(String username) {return username.trim().toLowerCase(); // Returns a cleaned version of the username} public String greetUser(String username) {username = cleanUsername(username); // Clean the username String message = "Hello, " + username + "!"; // Prepare and return the message return message;} Here, we moved the username preparation from greetUser into its own function cleanUsername . Nice and tidy!

Using Rename Method

Sign up

Join the 1M+ learners on CodeSignal

Be a part of our community of 1M+ users who develop and demonstrate their skills on CodeSignal

Clear method names make it easy to understand our code, just as clear street names make navigating a city more accessible. Let's have a look at renaming a method: // Before refactoring public double fx(double x) {return 3.14 * (x * x); // Calculates a value that is pi times the square of x} // After refactoring public double calculateCircleArea(double radius) {return 3.14 * (radius * radius); // Calculates the area of a circle with a given radius} Renaming the function fx to calculateCircleArea makes it easier to understand its purpose.

Discovering Substitute Algorithm

Substitute Algorithm involves replacing a part of a code (an algorithm) with a simpler one, analogous to discovering a faster route to school. Here's an example: // Before refactoring public int findSmallest(int[] numbers) { int smallest = Integer.MAX_VALUE; for (int num : numbers) { if (num < smallest) { smallest = num; } } return smallest; } // After refactoring import java.util.Collections; import java.util.Arrays; import java.util.List; public int findSmallest(int[] numbers) { List<Integer> numberList = Arrays.stream(numbers).boxed().toList(); return Collections.min(numberList); // Returns the smallest number from 'numbers' } Just like the Collections.min() method in Java, it performs the same job as our previous function, but with less code.

Java

// Before refactoring
public double fx(double x) {
    return 3.14 * (x * x); // Calculates a value that is pi times the square of x
}

// After refactoring
public double calculateCircleArea(double radius) {
    return 3.14 * (radius * radius); // Calculates the area of a circle with a given radius
}

Java

// Before refactoring
public int findSmallest(int[] numbers) {
    int smallest = Integer.MAX_VALUE;
    for (int num : numbers) {
        if (num < smallest) {
            smallest = num;
        }
    }
    return smallest;
}

// After refactoring
import java.util.Collections;
import java.util.Arrays;
import java.util.List;

public int findSmallest(int[] numbers) {
    List<Integer> numberList = Arrays.stream(numbers).boxed().toList();
    return Collections.min(numberList); // Returns the smallest number from 'numbers'
}