The ArrayList class is used to store elements in a dynamic array.
The important facts about ArrayList class are:
- It can contain duplicate elements.
- Elements are stored according to insertion order.
- It is non synchronized.
- It allows random access because array works at the index basis.
- List manipulation is slow because a lot of shifting needs to be performed if any element is removed from the list or added in any position (except end).
Hierarchy of ArrayList class
ArrayList
class inherits
AbstractList
class and implements
List
interface. The
List
interface inherits
Collection
and
Iterable
interfaces in hierarchical order.
Source code of Item.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
package com.t4b.test;
public class Item {
String name;
int id;
double price;
public Item(String name, int id, double price) {
super();
this.name = name;
this.id = id;
this.price = price;
}
}
Source code of TestMain.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
package com.t4b.test;
import java.util.ArrayList;
public class TestMain {
public static void main(String[] args) {
ArrayList<Item> items = new ArrayList<Item>();
// add items
items.add(new Item("Apple", 1, 150.0));
items.add(new Item("Grape", 2, 250.0));
items.add(new Item("Bag", 3, 1050.0));
Item itm = new Item("Mango", 4, 100);
items.add(itm);
System.out.println(items.size());
// remove item
items.remove(1);
items.remove(itm);
System.out.println(items.size());
ArrayList<Item> otherItems = new ArrayList<Item>();
otherItems.add(new Item("Bag", 3, 1050.0));
otherItems.add(new Item("Mango", 4, 100));
// add a list to another list
System.out.println(items.size());
items.addAll(otherItems);
System.out.println(items.size());
// iterate over the list
for (Item i : items) {
System.out.println(i);
}
}
Posts
No comments:
Post a Comment
Note: Only a member of this blog may post a comment.