Article Categories
- All Categories
-
Data Structure
-
Networking
-
RDBMS
-
Operating System
-
Java
-
MS Excel
-
iOS
-
HTML
-
CSS
-
Android
-
Python
-
C Programming
-
C++
-
C#
-
MongoDB
-
MySQL
-
Javascript
-
PHP
-
Economics & Finance
Programming Articles
Page 1506 of 2547
Period getYears() method in Java
The number of years for a particular Period can be obtained using the getYears() method in the Period class in Java. This method requires no parameters and it returns the number of years in the Period.A program that demonstrates this is given as followsExampleimport java.time.Period; public class Demo { public static void main(String[] args) { String period = "P5Y7M15D"; Period p = Period.parse(period); System.out.println("The Period is: " + p); System.out.println("The number of years are: " + p.getYears()); } }OutputThe Period is: P5Y7M15D The number of years ...
Read MoreHow to write an if-else statement in a JSP page?
The if...else block starts out as an ordinary Scriptlet, but the Scriptlet is closed at each line with HTML text included between the Scriptlet tags.Example IF...ELSE Example Today is weekend Today is not weekend The above code will generate the following result −Today is not weekend
Read MoreJava Program to get previous and next index using ListIterator
To get the exact evaluation of the previous and next index, you need use the next() method of the Iterator. This will eventually help you in gaining more understanding about Iterators. Let us first create an ArrayList and add some elements −ArrayList arrList = new ArrayList (); arrList.add(100); arrList.add(200); arrList.add(300); arrList.add(400); arrList.add(500); arrList.add(600); arrList.add(700); arrList.add(800); arrList.add(900); arrList.add(1000);Now, create a ListIterator −ListIteratoriterator = arrList.listIterator();Get the previous and next index now −iterator.previousIndex(); iterator.nextIndex();Exampleimport java.util.ArrayList; import java.util.ListIterator; public class Demo { public static void main(String[] args) { ArrayListarrList = new ArrayList(); arrList.add(100); ...
Read MoreLinkedBlockingQueue Class in Java
The LinkedBlockingQueue Class in Java has a blocking queue that is optionally bounded and based on linked nodes. This means that if the capacity is provided then the LinkedBlockingQueue is bound, otherwise it is not bound. Also, FIFO for ordering elements.A program that demonstrates this is given as follows −Exampleimport java.util.concurrent.LinkedBlockingQueue; public class Demo { public static void main(String[] args) { LinkedBlockingQueue lbQueue = new LinkedBlockingQueue(); lbQueue.add("Amy"); lbQueue.add("John"); lbQueue.add("May"); lbQueue.add("Harry"); lbQueue.add("Anne"); System.out.println("The elements in LinkedBlockingQueue are: " + ...
Read MoreHow to remove all elements from a Collection in another Collection
Let’s say the following is our Collection i.e. ArrayList −Listlist = new ArrayList(); list.add(100); list.add(200); list.add(200); list.add(200); list.add(300); list.add(400); list.add(400); list.add(500);Now, create another Collection −List list2 = new ArrayList(); list2.add(100); list2.add(200); list2.add(300); list2.add(400);To remove all elements from a Collection in another Collection, try the following with list and list2 as our two Collections −list.removeAll(list2);Exampleimport java.util.ArrayList; import java.util.List; public class Demo { public static void main(String args[]) throws Exception { Listlist = new ArrayList(); list.add(100); list.add(200); list.add(200); list.add(200); list.add(300); ...
Read MoreLinkedTransferQueue in Java
The LinkedTransferQueue Class in Java has a transfer queue that has unbounded functionality and is based on linked nodes. It uses FIFO for ordering elements. This class implements the Collection interface as well as the AbstractQueue class. It is a part of the Java Collection Framework.A program that demonstrates this is given as follows −Exampleimport java.util.concurrent.LinkedTransferQueue; public class Demo { public static void main(String[] args) throws InterruptedException { LinkedTransferQueue ltQueue = new LinkedTransferQueue(); ltQueue.add("Amy"); ltQueue.add("John"); ltQueue.add("May"); ltQueue.add("Harry"); ltQueue.add("Anne"); ...
Read MoreHow to retain elements from a Collection in another Collection
Let’s say the following is our Collection i.e. ArrayList −Listlist = new ArrayList(); list.add(100); list.add(200); list.add(200); list.add(200); list.add(300); list.add(400); list.add(400); list.add(500);Now, create another Collection −List list2 = new ArrayList(); list2.add(100); list2.add(200); list2.add(300); list2.add(400);To retain all elements from a Collection in another Collection, try the following with list and list2 as our two Collections −list.retainAll(list2);Exampleimport java.util.ArrayList; import java.util.List; public class Demo { public static void main(String args[]) throws Exception { Listlist = new ArrayList(); list.add(100); list.add(200); list.add(200); list.add(200); list.add(300); ...
Read MoreThe add() method of Java AbstractSequentialList class
The AbstractSequentialList class has the add(int index, E ele) method to add element to the specific position. You can also use the add() method inherited from AbstractList class.add(int index, E ele) methodThe syntax is as follows:add(int index, E ele)Here, index is where the element is to be inserted. The ele is the element to be inserted.To work with the AbstractSequentialList class in Java, you need to import the following package:import java.util.AbstractSequentialList;The following is an example to implement AbstractSequentialList add() method in Java:Exampleimport java.util.LinkedList; import java.util.AbstractSequentialList; public class Demo { public static void main(String[] args) { AbstractSequentialList ...
Read MoreHow to test if a List is an Unmodifable List in Java?
We will first set a list to unmodifiable and after that test if it is unmodifiable or not. Let us create a List and add elements −List list = new LinkedList (); list.add(10); list.add(20); list.add(30); list.add(40); list.add(50);Set the above list to unmodifiable −Listunmodifiable = Collections.unmodifiableList(list);Now, use If-else, to check whether the list in unmodifiable or not −if (unmodifiable.getClass().getName().contains("UnmodifiableList")) System.out.println("This is an UnmodifiableList" ); else System.out.println("This is not an UnmodifiableList" );Exampleimport java.util.Collections; import java.util.LinkedList; import java.util.List; public class Demo { public static void main(String[] args) { Listlist = new LinkedList(); ...
Read MoreConcurrentLinkedDeque in Java
The ConcurrentLinkedDeque Class in Java implements a deque and used a concurrent linked list for help. This class implements the Collection interface as well as the AbstractCollection class. It is a part of the Java Collection Framework.A program that demonstrates this is given as follows −Exampleimport java.util.concurrent.*; public class Demo { public static void main(String[] args) { ConcurrentLinkedDeque clDeque = new ConcurrentLinkedDeque(); clDeque.add("James"); clDeque.add("May"); clDeque.add("John"); clDeque.add("Sara"); clDeque.add("Anne"); System.out.println("The elements in ConcurrentLinkedDeque are: " + clDeque); } }The ...
Read More