src/PokerHand.java
public void insertBackOrder() {
		LinkNode<Card> ref = head;

		while (ref != null) {
			if (ref.getData().getRank().getValue() != hasOnePair() && ref.getData().getRank().getValue() != hasTwoPair()
					&& !existInTail(ref.getData()))
				tail = new LinkNode<Card>(ref.getData(), tail);
			ref = ref.getNext();
		}
	}
// useful if we need to compare high cards.
useful if we need to compare high cards.
useful if we need to compare high cards .
public void insertBackOrder() {
		LinkNode<Card> ref = head;
		while (ref != null) {
			if (ref.getData().getRank().getValue() != hasOnePair() && ref.getData().getRank().getValue() != hasTwoPair()
					&& !existInTail(ref.getData()))
				tail = new LinkNode<Card>(ref.getData(), tail);
			ref = ref.getNext();
		}
	}
public void insertBackOrder ( ) { LinkNode < Card > ref = head ; while ( ref != null ) { if ( ref . getData ( ) . getRank ( ) . getValue ( ) != hasOnePair ( ) && ref . getData ( ) . getRank ( ) . getValue ( ) != hasTwoPair ( ) && ! existInTail ( ref . getData ( ) ) ) tail = new LinkNode < Card > ( ref . getData ( ) , tail ) ; ref = ref . getNext ( ) ; } }
useful if we need to compare high cards.
useful if we need to compare high cards .