edu.princeton.cs.algorithms

Class LinkedBag<Item>

java.lang.Object

edu.princeton.cs.algorithms.LinkedBag<Item>

All Implemented Interfaces:

Iterable<Item>

public class LinkedBag<Item>
extends Object
implements Iterable<Item>

The LinkedBag class represents a bag (or multiset) of generic items. It supports insertion and iterating over the items in arbitrary order.

This implementation uses a singly-linked list with a non-static nested class Node. See Bag for a version that uses a static nested class. The add, isEmpty, and size operations take constant time. Iteration takes time proportional to the number of items.

For additional documentation, see Section 1.3 of Algorithms, 4th Edition by Robert Sedgewick and Kevin Wayne.

Author:

Robert Sedgewick, Kevin Wayne

Constructor Summary

Constructors

Constructor and Description
LinkedBag() Initializes an empty bag.

Method Summary

Methods

Modifier and Type	Method and Description
void	add(Item item) Adds the item to this bag.
boolean	isEmpty() Is this bag empty?
Iterator<Item>	iterator() Returns an iterator that iterates over the items in the bag.
static void	main(String[] args) Unit tests the LinkedBag data type.
int	size() Returns the number of items in this bag.

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

LinkedBag

public LinkedBag()

Initializes an empty bag.

Method Detail

isEmpty

public boolean isEmpty()

Is this bag empty?

Returns:

true if this bag is empty; false otherwise

size

public int size()

Returns the number of items in this bag.

Returns:

the number of items in this bag

add

public void add(Item item)

Adds the item to this bag.

Parameters:

item - the item to add to this bag

iterator

public Iterator<Item> iterator()

Returns an iterator that iterates over the items in the bag.

Specified by:

iterator in interface Iterable<Item>

main

public static void main(String[] args)

Unit tests the LinkedBag data type.