Boost your Java development productivity with the Java Boilerplate Generator extension for Visual Studio Code. Say goodbye to repetitive code setup and hello to streamlined project initialization. This extension provides essential Java boilerplate code snippets and templates, helping you kickstart your projects swiftly and efficiently.
Step 1: Install Java Easy Snippet
Step 2: Not Downloaded Yet? Download Now
Step 3: Find all snippets below and use as per need.
Step 4: Happy Coding
No | Java Snippet Short Code | Description |
---|---|---|
1 | java | Basic Java Class with Main Method |
2 | jclass | Basic Java public Class code |
3 | jmain | Basic Java code with Main Method |
--- | -------------------------- | ----------------------------------- |
--- | -------------------------- | ----------------------------------- |
4 | jscan | Java class with a Scanner object for user input |
5 | jscanint | Scanner object for user input Integer |
6 | jscanstr | Scanner object for user input String |
7 | jscandouble | Scanner object for user input double |
8 | jscanlong | Scanner object for user input Long |
9 | jscanfloat | Scanner object for user input Float |
10 | jscanbool | Scanner object for user input Boolean |
11 | jscanbyte | Scanner object for user input Byte |
12 | jscanshort | Scanner object for user input short |
13 | jscanchr | Scanner object for user input Char |
14 | jscanbiginteger | Scanner object for user input Big Integer |
15 | jscanbigdecimal | Scanner object for user input Big Decimal |
16 | jscannextline | Scanner object for user input Next Line |
17 | jscanintarray | Scanner object for user input Integer Array |
18 | jscanstrarray | Scanner object for user input String Array |
19 | jscanintarraylist | Scanner object for user input Integer ArrayList |
20 | jscanstrarraylist | Scanner object for user input String ArrayList |
21 | jscanintlinkedlist | Scanner object for user input Integer LinedList |
22 | jscanstrlinkedlist | Scanner object for user input String LinkedList |
23 | jscanintqueue | Scanner object for user input Integer Queue |
24 | jscanstrqueue | Scanner object for user String Queue |
25 | jscanintstack | Scanner object for user input Integer stack |
26 | jscanstrstack | Scanner object for user String Integer Stack |
27 | jscanintset | Scanner object for user input Integer set |
28 | jscanstrset | Scanner object for user input String Set |
29 | jscaninttreemap | Scanner object for user input Integer TreeMap |
30 | jscanstrtreemap | Scanner object for user input String treeMap |
31 | jscanintpriorityqueue | Scanner object for user input Integer Priority Queue |
32 | jscanstrpriorityqueue | Scanner object for user String Integer Priority Queue |
33 | jscaninthashset | Scanner object for user input Integer Hash Set |
34 | jscanstrhashset | Scanner object for user input String Hash set |
35 | jscaninttreeset | Scanner object for user input Integer Tree Set |
36 | jscanstrtreeset | Scanner object for user input String Tree Set |
37 | jscanintlinkedhashset | Scanner object for user input Integer Linked Hash Set |
38 | jscanstrlinkedhashset | Scanner object for user input String Linked Hash set |
--- | -------------------------- | ----------------------------------- |
--- | -------------------------- | ----------------------------------- |
39 | jout | Creates a Java output code |
40 | joutarray | Creates a Java output code of Array |
41 | joutarraylist | Creates a Java output code of ArrayList |
42 | jouthashmap | Creates a Java output code HashMap |
43 | joutlinkedlist | Creates a Java output code LinkedList |
44 | joutqueue | Creates a Java output code Queue |
45 | joutstack | Creates a Java output code Stack |
46 | joutset | Creates a Java output code Set |
47 | jouttreemap | Creates a Java output code Tree Map |
48 | joutpq | Creates a Java output code Priority Queue |
49 | jouthashset | Creates a Java output code of Hash-Set |
50 | jouttreeset | Creates a Java output code of Tree-Set |
51 | joutlinkedhashset | Creates a Java output code of Linked Hash Set |
--- | -------------------------- | ----------------------------------- |
--- | -------------------------- | ----------------------------------- |
52 | jarraylist | Java Class with ArrayList |
53 | jarraylist | Java Class with ArrayList |
54 | jarraylist | Java Class with ArrayList |
55 | jhashmap | Java Class with HashMap |
56 | jlinkedlist | Java Class with LinkedList |
57 | jqueue | Java Class with Queue |
58 | jstack | Java Class with Stack |
59 | jset | Java Class with HashSet |
60 | jtreemap | Java Class with TreeMap |
61 | jpqueue | Java Class with PriorityQueue |
62 | jhashset | Java Class with HashSet |
63 | jtreeset | Java Class with TreeSet |
64 | jlinkedhashset | Java Class with LinkedHashSet |
65 | jarraylistiter | Java Class with ArrayList Iteration |
66 | jhashmapiter | Java Class with HashMap Iteration |
67 | jlinkedlistiter | Java Class with LinkedList Iteration |
68 | jqueueiter | Java Class with Queue Iteration |
69 | jstackiter | Java Class with Stack Iteration |
70 | jsetiter | Java Class with Set Iteration |
71 | jtreemapiter | Java Class with TreeMap Iteration |
72 | jpqueueiter | Java Class with PriorityQueue Iteration |
--- | ------------------------- | ----------------------------------- |
--- | ------------------------- | ----------------------------------- |
73 | userarray | user-defined Array |
74 | userarraylist | user-defined ArrayList |
75 | userlinkedlist | user-defined Singly LinkedList |
76 | userdoublylinkedlist | user-defined Doubly LinkedList |
77 | usercircularlinkedlist | user-defined Circular LinkedList |
78 | userstack | user-defined Stack |
79 | userqueue | user-defined Queue |
80 | userpriorityqueue | user-defined Priority Queue |
81 | userhashset | user-defined Hash Set |
82 | usertreeset | user-defined Tree Set |
83 | userlinkedhashset | User-defined Linked Hash Set |
84 | userhashmap | User-defined Hash Map |
85 | usertreemap | User-defined Tree Map |
86 | trywithresources | Try with resources |
87 | trycatch | Try catch exception |
88 | trycatchfinally | Try catch exception |
89 | ifelse | ifelse Condition |
90 | ifelseif | ifelseif Condition |
91 | switch | switch |
92 | for | for loop Iteration |
93 | foreach | foreach Iteration |
93 | while | while Iteration |
93 | dowhile | dowhile Iteration |
94 | jprintf | Creates a Java printf code |
public class Main {
public static void main(String[] args) {
$0
}
}
public class Main {
}
public static void main(String[] args) {
$0
}
<!------------------------------------------------------------------------------------------>
Scanner sc = new Scanner(System.in);
int ${1:variable} = scanner.nextInt();
String ${1:variable} = scanner.nextLine();
double ${1:variable} = scanner.nextDouble();
float ${1:variable} = scanner.nextFloat();
float ${1:variable} = scanner.nextLong();
boolean ${1:variable} = scanner.nextBoolean();
scanner.nextLine();
Scanner sc = new Scanner(System.in);
int[] arr = new int[sc.nextInt()];
for (int i = 0; i < arr.length; i++) {
arr[i] = sc.nextInt();
}
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
sc.nextLine(); // Consume the newline character
String[] arr = new String[n];
for (int i = 0; i <arr.length; i++) {
arr[i] = sc.nextLine();
}
❇️ jscanintarraylist = Creates a Java class with a Scan scanner object for user input Integer Array list
Scanner scanner = new Scanner(System.in);
int n = scanner.nextInt();
List<Integer> list = new ArrayList<>();
for (int i = 0; i < n; i++) {
list.add(scanner.nextInt());
}
❇️ jscanstrarraylist = Creates a Java class with a Scan scanner object for user input String Array list
Scanner scanner = new Scanner(System.in);
int n = scanner.nextInt();
scanner.nextLine(); // Consume the newline character
ArrayList<String> list = new ArrayList<>();
for (int i = 0; i < n; i++) {
list.add(scanner.nextLine());
}
❇️ jscanintlinkedlist = Creates a Java class with a Scan scanner object for user input Integer LinkedList
Scanner scanner = new Scanner(System.in);
int n = scanner.nextInt();
List<Integer> list = new LinkedList<>();
for (int i = 0; i < n; i++) {
list.add(scanner.nextInt());
}
❇️ jscanstrlinkedlist = Creates a Java class with a Scan scanner object for user input String LinkedList
Scanner scanner = new Scanner(System.in);
int n = scanner.nextInt();
scanner.nextLine(); // Consume the newline character
LinkedList<String> list = new LinkedList<>();
for (int i = 0; i < n; i++) {
list.add(scanner.nextLine());
}
Scanner scanner = new Scanner(System.in);
int n = scanner.nextInt();
Queue<Integer> queue = new LinkedList<>();
for (int i = 0; i < n; i++) {
queue.offer(scanner.nextInt());
}
Scanner scanner = new Scanner(System.in);
int n = scanner.nextInt();
scanner.nextLine(); // Consume the newline character
Queue<String> queue = new LinkedList<>();
for (int i = 0; i < n; i++) {
queue.offer(scanner.nextLine());
}
Scanner scanner = new Scanner(System.in);
int n = scanner.nextInt();
Stack<Integer> stack = new Stack<>();
for (int i = 0; i < n; i++) {
stack.push(scanner.nextInt());
}
Scanner scanner = new Scanner(System.in);
int n = scanner.nextInt();
scanner.nextLine(); // Consume the newline character
Stack<String> stack = new Stack<>();
for (int i = 0; i < n; i++) {
stack.push(scanner.nextLine());
}
Scanner scanner = new Scanner(System.in);
int n = scanner.nextInt();
Set<Integer> set = new HashSet<>();,
for (int i = 0; i < n; i++) {
set.add(scanner.nextInt());
}
Scanner scanner = new Scanner(System.in);
int n = scanner.nextInt();
scanner.nextLine(); // Consume the newline character
Set<String> set = new HashSet<>();,
for (int i = 0; i < n; i++) {
set.add(scanner.nextLine());
}
Scanner scanner = new Scanner(System.in);
int n = scanner.nextInt();
Map<Integer, Integer> map = new TreeMap<>();
for (int i = 0; i < n; i++) {
set.add(scanner.nextInt());
}
Scanner scanner = new Scanner(System.in);
int n = scanner.nextInt();
scanner.nextLine(); // Consume the newline character
Map<String, Integer> map = new TreeMap<>();
for (int i = 0; i < n; i++) {
map.put(scanner.nextLine(), scanner.nextInt());
}
<!------------------------------------------------------------------------------------->
System.out.println();
System.out.printf();
for (final var element : arr) {
System.out.println(element);
}
for (final var element : list) {
System.out.println(element);
}
for (final var entry : map.entrySet()) {
System.out.println(entry.getKey() + entry.getValue());
}
for (final var element : list) {
System.out.println(element);
}
<!--------------------------------------------------------------------------------->
List<Integer> list = new ArrayList<>();
Map<String, Integer> map = new HashMap<>();
List<Integer> list = new LinkedList<>();
Queue<Integer> queue = new LinkedList<>();
Stack<Integer> stack = new Stack<>();
HashSet<Integer> set = new HashSet<>();
<!-------------------------------------------------------------------------------------->
static class LinkedList<T> {
private Node<T> head;
private int size;
private static class Node<T> {
T data;
Node<T> next;
Node(T data) {
this.data = data;
this.next = null;
}
}
public LinkedList() {
head = null;
size = 0;
}
public void add(T element) {
Node<T> newNode = new Node<>(element);
if (head == null) {
head = newNode;
} else {
Node<T> current = head;
while (current.next != null) {
current = current.next;
}
current.next = newNode;
}
size++;
}
public void print() {
Node<T> current = head;
while (current != null) {
System.out.print(current.data + " ");
current = current.next;
}
System.out.println();
}
public int size() {
return size;
}
}
static class HashSet<T> {
private HashMap<T, Boolean> map;
public HashSet() {
map = new HashMap<>();
}
public void add(T element) {
map.put(element, true);
}
public boolean contains(T element) {
return map.containsKey(element);
}
public void remove(T element) {
map.remove(element);
}
public boolean isEmpty() {
return map.isEmpty();
}
public int size() {
return map.size();
}
}
static class Stack<T> {
private Node<T> top;
private int size;
private static class Node<T> {
T data;
Node<T> next;
Node(T data) {
this.data = data;
this.next = null;
}
}
public Stack() {
top = null;
size = 0;
}
public void push(T element) {
Node<T> newNode = new Node<>(element);
newNode.next = top;
top = newNode;
size++;
}
public T pop() {
if (top == null) {
throw new EmptyStackException();
}
T data = top.data;
top = top.next;
size--;
return data;
}
public T peek() {
if (top == null) {
throw new EmptyStackException();
}
return top.data;
}
public boolean isEmpty() {
return top == null;
}
public int size() {
return size;
}
}
try (Scanner scanner = new Scanner(System.in)) {
$0
} catch (Exception e) {
System.out.println(e.getMessage());
}
try {
$0
} catch (Exception e) {
System.out.println(e.getMessage());
}
try {
$0
} catch (Exception e) {
System.out.println(e.getMessage());
} finally {
System.out.println("Finally block");
}
if ($1) {
$0
} else {
}
if ($1) {
$0
} else if ($2) {
} else {
}
switch ($1) {
case $2:
$0
break;
default:
break;
}
for (int i = 0; i < $1; i++) {
$0
}
for ($1 : $2) {
$0
}
while ($1) {
$0
}
do {
$0
} while ($1);