Understanding Date Handling and Collection Framework

java.util and
CollectionFramework

Available at : http://www.asbspace.in/ppt Prof. Ashish Bhatia

• This presentation is for teaching purpose only.
• This presentation may contain some material
from books / api documentation / internet.
• No intention of breaking any rights or what so
ever.


Date and Time Related Classes
• Date
• TimeZone
• Calendar
• GregorianCalendar

• Epoch : 1st Jan 1970 0:0:0.0 GMT
– 1st January 1970 5:30:0.0 IST


Simple Program

????????? toString()

Constructor


Comparing Date


Calendar
• Abstract Class
• No public constructor
• day, month, year, hour, minutes , seconds, era
• Many int constants
• Many methods


Some Methods


TimeZone
• Class
• Maintains offset value
• ID for instances

• public static TimeZone getDefault()
• public static void setDefault(TimeZone zone)


• public String getId()
• public String getDisplayName()
• public int getOffset(long date)
• public int getRawOffset
• public void setRawOffset(int offmilliseconds)
• public static TimeZone getTimeZone(String ID)


GregorianCalendar
• Concrete class of Calendar
• Two fields AD and BC for era
• 7 constructors
• GreogrianCalendar gc = new
GregorianCalendar();
– Current date and time in default locale and time
zone


GregorianCalendar
• Ff

Year = Number of year elapsed from 1900
Month = 0 indicating Jan


GregorianCalendar
fd

• boolean isLeapYear(int year)
– Test for leap year


DateFormat


Array Class

• Contains various methods for manipulating
arrays - mostly static methods
• Contains a static factory that allows arrays to
be viewed as lists.
• fill, equals, sort, binarysearch, toString


fill method
• public static void fill(datatype[] array, datatype
value)
• public static void fill(datatype[] array, int
fromindex , int toindex, datatype value)

• datatype = Primitive Datatype + Object


Program


Output


fill()


equals()
• Return Boolean
• Take two arguments
• public static boolean equals( datatype [] a,
datatype[] b)

• Compare each element and size of array


equals()


sort()
• Sort the array
• Ascending Order


sort()


binarySearch()
• Uses binary search method to find the index
of element
• Prerequisites : Sorted Array


binarySearch()


Collection Framework
• Standardizing and having interoperability
between various data structures
• Introduced in Java 1.2
• Relies on Standard interfaces


• Eight generics interfaces type
– Determined the common methods for all
collection class
• Operations
– Basic Operations
– Array Operations
– Bulk Operations


Basic Operations


Array Operations


Bulk Operation


Iterator
• Lets you cycle through collection


Example


Set Interface
• Defines a set
• Collection of unique element [ no duplication]
• Extends the Collection
– All the methods
• HashSet and TreeSet are concrete classes
• AbstractSet : base abstract class


List Interface
• Extends Collection
• Insertion, updating, all are index based
• Index starts from 0
• It can store duplicates value
• It adds its own methods


Methods


List Iterator
• public interface ListIterator<E> extends
Iterator<E>
• A ListIterator has no current element;
its cursor position always lies between the
element that would be returned by a call
toprevious() and the element that would be
returned by a call to next().
• An iterator for a list of length n has
n+1 possible cursor positions,

List Iterator

•


List Iterator
• In general, to use an iterator to cycle through
thecontents of a collection, follow these steps:
1.Obtain an iterator to the start of the collection
by calling the collection’s iterator( ) method.
2.Set up a loop that makes a call to hasNext( ).
Have the loop iterate as long as hasNext( )
returns true.
3.Within the loop, obtain each element by
calling next( ).

Vector Class


Vector Class
• Dynamic Array
– The size of a Vector can grow or shrink as needed
to accommodate adding and removing items after
the Vector has been created

• Synchronized
• Each vector tries to optimize storage
management by maintaining a capacity and
a capacityIncrement

Vector Class
• Modified from Java 1.2 [ IS IT SAME AS JAVA
2]
• To implement List and become part of


Vector Class Constructors

Initial Size 10

• The increment specifies the number of
elements to allocate each time that a vector is
resized upward.

Vector Class
• Starts with initial capacity
• Allocates more space for new objects once the
capacity is reached
• It allocates more space that required so
allocation is done minimal time
• Double size if nothing is specified
• What if incr size = 0 [ Default Value]


Now Lets add elements

• addElement(Object o)

• Size = ? Capacity = ?


• Size = 4 Capacity = 5
– WHY

• Size = ? Capacity = ?
• 5,5
• 5,8
• Any Other Option

Solution : Generics

• <Object>
– Specifies the data type

• Vector<String> v = new Vector<String> ();
• Vector<Rectangle> v = new
Vector<Rectangle> ();


Printing Vector


One Example 


Lets Create Vector

• Size = ?? Capacity = ??
• DEFAULT = 10


Will This Work !!!


How to Print area ?


Stack


ArrayList


ArrayList
• Resizable-array implementation of
the List interface.
• Implements all optional list operations, and
permits all elements, including null.
• This class is roughly equivalent to Vector,
except that it is unsynchronized.


Map Interface
• Continued to Next Presentation


Understanding Date Handling and Collection Framework

More Related Content

Similar to Understanding Date Handling and Collection Framework (20)

More from ashishspace (6)

Recently uploaded (20)

Understanding Date Handling and Collection Framework