Skip to main content

Project Lombok is New Feature or plugin

Project Lombok is a Java library tool that generates code for minimizing boilerplate code. The library replaces boilerplate code with easy-to-use annotations.

For example, by adding a couple of annotations, you can get rid of code clutters, such as getters and setters methods, constructors, hashcode, equals, and toString methods, and so on.

We have written a lot of boilerplate code such as getter, setter, equals, hashCode methods etc. in Java for years. In some cases, this causes problems in subjects like clean and readable code.

For such situations, Project Lombok saves our eyes  . Also, you will be able to spend more time on the business logic using Lombok.

“Never write another getter or equals method again, with one annotation your class has a fully featured builder, Automate your logging variables, and much more.”

Project Lombok uses annotations to avoid boilerplate code. In the best cases, only five lines can replace hundreds of lines of code.


@Data
@AllArgsConstructor
@NoArgsConstructor
@Entity
@Table
public class Book {
@Id
@GeneratedValue
private Long id;
private String writer;
private String name;
private String genre;
private String year;
}

Descriptions of used annotations according to JavaDoc:

  • @Data : “Generates getters for all fields, a useful toString method, and hashCode and equals implementations that check * all non-transient fields. Will also generate setters for all non-final fields, as well as a constructor.”
  • @AllArgsConstructor : “Generates a all-args constructor.”
  • @NoArgsConstructor : “Generates a no-args constructor.”
  • @Slf4j : “Causes lombok to generate a logger field.”



Comments

Popular posts from this blog

Dealing with Passwords in Java Applications: 5 Best Practices You Should Follow

 In modern Java applications—whether core Java applications or enterprise-level web applications—working with passwords is inevitable. Passwords are sensitive pieces of information, just like Social Security Numbers (SSNs), and if you’re handling real human data in systems such as online banking or healthcare portals, it’s critical to implement best practices for dealing with passwords securely. Below, I’ll share five essential best practices that I’ve learned and recommend for managing passwords, particularly when you are handling authentication and authorization. While these tips are a good starting point, be sure to tailor them to your application’s requirements and security policies. 1) Use SSL/TLS to Transfer Username and Password When users send passwords over the network, it is crucial to use SSL/TLS to encrypt the communication. This ensures that sensitive information is protected from eavesdroppers. Tools like LDAP and Active Directory are commonly used for storing usern...

New Features in Java 11

  Java 11 introduced several new features and enhancements. Here are some notable features with examples: Local-Variable Syntax for Lambda Parameters: Java 11 allows var to be used in lambda parameters, which provides improved readability and conciseness. Example: java // Before Java 11   someList.forEach((String item) -> { System.out.println(item); }); // With Java 11   someList.forEach(( var item) -> { System.out.println(item); }) HTTP Client (Standard API): Java 11 introduced a new HTTP client API as a replacement for the deprecated HttpURLConnection . It provides a more modern and flexible way to send HTTP requests and handle responses. Example import java.net.URI; import java.net.http.HttpClient; import java.net.http.HttpRequest; import java.net.http.HttpResponse; public class HttpClientExample { public static void main (String[] args) throws Exception { HttpClient client = HttpClient.newHttpClient(); HttpRequest request = HttpReque...

How does a hash map work internally in Java?

Hash map work internally in Java Basically, HashMap is an array of Entry class, a static inner class defined in HashMap is as below: static class Entry implements Map. Entry  { final K key; V value; Entry next; final int hash; //getters and setters } Each element in Hashmap stores in it a key, its value, a reference to next entry in case hash value is the same for two entries, in that case, a linked list will be formed. Default initial capacity of a HashMap is 16 i.e a HashMap is initialized with a default 16 sized array. Now, let us see what happens when we put an element into HashMap. Following is the code for put method in hashmap: public V put(K key, V value) { if (key == null) return putForNullKey(value); int hash = hash(key.hashCode()); int i = indexFor(hash, table.length); for (Entry e = table[i]; e != null; e = e.next) { Object k; if (e.hash == hash && ((k = e.key) == key || key.equals(k))) { V oldValue = e.value; e....