001
002
003
004
005
006
007
008
009
010
011
012
013
014
015
016
017
018
019
020
021
022
023
024
025
026
027
028
029
030
031
032
033
034
035
036
037
038
039
040
041
042
043
044
045
046
047
048
049
050
051
052
053
054
055
056
057
058
059
060
061
062
063
064
065
066
067
068
069
070
071
072
073
074
075
076
077
078
079
080
081
082
083
084
085
086
087
088
089
090
091
092
093
094
095
096
097
098
099
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
package algs13;
import  stdlib.*;
import java.util.Iterator;
import java.util.NoSuchElementException;

/**
 *  The {@code Bag} class represents a bag (or multiset) of
 *  generic items. It supports insertion and iterating over the
 *  items in arbitrary order.
 *  <p>
 *  The <em>add</em>, <em>isEmpty</em>, and <em>size</em>  operation
 *  take constant time. Iteration takes time proportional to the number of items.
 *  <p>
 *  For additional documentation, see <a href="http://algs4.cs.princeton.edu/13stacks">Section 1.3</a> of
 *  <i>Algorithms, 4th Edition</i> by Robert Sedgewick and Kevin Wayne.
 */
public class Bag<T> implements Iterable<T> {
  private int N;         // number of elements in bag
  private Node<T> first;    // beginning of bag

  // helper linked list class
  private static class Node<T> {
    public Node() { }
    public T item;
    public Node<T> next;
  }

  /**
   * Create an empty stack.
   */
  public Bag() {
    first = null;
    N = 0;
  }

  /**
   * Is the BAG empty?
   */
  public boolean isEmpty() {
    return first == null;
  }

  /**
   * Return the number of items in the bag.
   */
  public int size() {
    return N;
  }

  /**
   * Add the item to the bag.
   */
  public void add(T item) {
    Node<T> oldfirst = first;
    first = new Node<>();
    first.item = item;
    first.next = oldfirst;
    N++;
  }

  // check internal invariants
  protected static <T> boolean check(Bag<T> that) {
    int N = that.N;
    Bag.Node<T> first = that.first;
    if (N == 0) {
      if (first != null) return false;
    }
    else if (N == 1) {
      if (first == null)      return false;
      if (first.next != null) return false;
    }
    else {
      if (first.next == null) return false;
    }

    // check internal consistency of instance variable N
    int numberOfNodes = 0;
    for (Bag.Node<T> x = first; x != null; x = x.next) {
      numberOfNodes++;
    }
    if (numberOfNodes != N) return false;

    return true;
  }


  /**
   * Return an iterator that iterates over the items in the bag.
   */
  public Iterator<T> iterator()  {
    return new ListIterator();
  }

  // an iterator, doesn't implement remove() since it's optional
  private class ListIterator implements Iterator<T> {
    private Node<T> current = first;

    public boolean hasNext()  { return current != null;                     }
    public void remove()      { throw new UnsupportedOperationException();  }

    public T next() {
      if (!hasNext()) throw new NoSuchElementException();
      T item = current.item;
      current = current.next;
      return item;
    }
  }

  /**
   * A test client.
   */
  public static void main(String[] args) {
    StdIn.fromString ("to be or not to - be - - that - - - is");
    Bag<String> bag = new Bag<>();
    while (!StdIn.isEmpty()) {
      String item = StdIn.readString();
      bag.add(item);
    }

    StdOut.println("size of bag = " + bag.size());
    for (String s : bag) {
      StdOut.println(s);
    }
  }
}