55 lines
1.7 KiB
Java
55 lines
1.7 KiB
Java
// collections/LinkedListFeatures.java
|
|
// (c)2016 MindView LLC: see Copyright.txt
|
|
// We make no guarantees that this code is fit for any purpose.
|
|
// Visit http://OnJava8.com for more book information.
|
|
import typeinfo.pets.*;
|
|
import java.util.*;
|
|
|
|
public class LinkedListFeatures {
|
|
public static void main(String[] args) {
|
|
LinkedList<Pet> pets =
|
|
new LinkedList<>(Pets.list(5));
|
|
System.out.println(pets);
|
|
// Identical:
|
|
System.out.println(
|
|
"pets.getFirst(): " + pets.getFirst());
|
|
System.out.println(
|
|
"pets.element(): " + pets.element());
|
|
// Only differs in empty-list behavior:
|
|
System.out.println("pets.peek(): " + pets.peek());
|
|
// Identical; remove and return the first element:
|
|
System.out.println(
|
|
"pets.remove(): " + pets.remove());
|
|
System.out.println(
|
|
"pets.removeFirst(): " + pets.removeFirst());
|
|
// Only differs in empty-list behavior:
|
|
System.out.println("pets.poll(): " + pets.poll());
|
|
System.out.println(pets);
|
|
pets.addFirst(new Rat());
|
|
System.out.println("After addFirst(): " + pets);
|
|
pets.offer(Pets.get());
|
|
System.out.println("After offer(): " + pets);
|
|
pets.add(Pets.get());
|
|
System.out.println("After add(): " + pets);
|
|
pets.addLast(new Hamster());
|
|
System.out.println("After addLast(): " + pets);
|
|
System.out.println(
|
|
"pets.removeLast(): " + pets.removeLast());
|
|
}
|
|
}
|
|
/* Output:
|
|
[Rat, Manx, Cymric, Mutt, Pug]
|
|
pets.getFirst(): Rat
|
|
pets.element(): Rat
|
|
pets.peek(): Rat
|
|
pets.remove(): Rat
|
|
pets.removeFirst(): Manx
|
|
pets.poll(): Cymric
|
|
[Mutt, Pug]
|
|
After addFirst(): [Rat, Mutt, Pug]
|
|
After offer(): [Rat, Mutt, Pug, Cymric]
|
|
After add(): [Rat, Mutt, Pug, Cymric, Pug]
|
|
After addLast(): [Rat, Mutt, Pug, Cymric, Pug, Hamster]
|
|
pets.removeLast(): Hamster
|
|
*/
|