Dear Chegg Experts, I am a beginner C++ programmer seeking help on my current as

ID: 3672098 • Letter: D

Question

Dear Chegg Experts,

I am a beginner C++ programmer seeking help on my current assignment on the following possible topics:

STL containers and the container templates.

I am grateful for any assistance.

An STL list application

In the lectures we instantiated an stl list of floats and, above it, built some insert() and remove() methods on the client side that managed the list in increasing sorted order. In this assignment we will do the same for Card objects, using a natural ordering and a random Card generator that will be provided at the end of this document.:

You will provide global scope insert(), remove() and removeAll() like in the lessons. They take an stl list of Cards (first parameter) and a Card (second parameter). This is very much like the iTunes example that follows the float example, so you'll want to study that.

Part 1: STL list specifications

There are very few changes you'll need to make to the overall design of what you saw:

bool removeAll(CardList &myList, Card &x) - Notice that this method returns a bool which should be true if x was in the list, and false if it was not.

For Cards, there is no < operator. Use compareTo() in your insert() and/or remove() methods, as needed.

Nothing should be changed in any of the classes or methods brought in from the earlier assignments. Everything you do should be added as client scope code.

Client notes for part 1

Instantiate about five to ten cards randomly, but produce duplicates of every card in the list: every card you generate goes into your list twice. Display the list immediately after you build it. (Note, you might have four, not two, of some cards because of generateRandomCard(), and that's fine. (Maybe even six or eight or ... .)

Display the list.

Next, pick up to half of the cards you inserted for removal, but do it as follows. If you instantiated five cards initially and put them into the list twice, then your list has 10 cards. Pick, say, two (or three or all five) distinct cards from your initial five and remove() all traces of each of those two cards. I don't want you to use removeAll() for this step. Instead use remove(), which only removes one instance of a card. So you'll have to use remove() on the same card repeatedly. I.e., if 3 of diamonds is a card, remove all copies of 3 of Diamonds, not just the first. Don't rely on any knowledge you might have about how many copies of the 3 of diamonds are in the list, but use an intelligent loop to keep remove()-ing it until the return value of remove() tells you the loop is done.

Display the list and confirm that it looks right after the removal.

Finally, test removeAll()'s return value somehow after the above test.

Submit an entire source and run.

Here are the additional Card class members and a new global scope random Card generator that you will need. Add this to the existing Card class and test it out with the provided main() to be sure it works. Then you can use this as a basis for this week's assignment.

Placed into my code below:

// main.cpp

// Created by Macintosh User on 2/26/16.

#include <iostream>

#include <string>

#include <ctime>

#include <list>

using namespace std;

class Card

{

public:

enum Suit { clubs, diamonds, hearts, spades };

static char DEFAULT_VAL;

static Suit DEFAULT_SUIT;

static const int NUM_CARD_VALS = 13;

static const int NUM_CARD_SUITS = 4;

private:

char value;

Suit suit;

bool errorFlag;

public:

Card(char value = DEFAULT_VAL, Suit suit = DEFAULT_SUIT);

string toString();

bool set(char value = DEFAULT_VAL, Suit suit = DEFAULT_SUIT);

char getVal() { return value; }

Suit getSuit() { return suit; }

bool getErrorFlag() { return errorFlag; }

bool equals(Card card);

// comparison members and methods

const static char valueRanks[NUM_CARD_VALS];

const static Suit suitRanks[NUM_CARD_SUITS];

int compareTo(Card &other);

static int getSuitRank(Suit st);

static int getValueRank(char val);

// helpers

private:

bool isValid(char value, Suit suit);

};

// global scope method prototypes

typedef list<Card> CardList;

void showList(CardList &myList);

void insert(CardList &myList, Card &x);

bool remove(CardList &myList, Card &x);

bool removeAll(CardList &myList, Card &x);

// for easy comparisons

int operator==(Card first, Card other)

{ return first.compareTo(other) == 0; }

// for client Card generation

Card generateRandomCard();

char Card::DEFAULT_VAL = 'A';

Card::Suit Card::DEFAULT_SUIT = Card::spades;

// for comparisons -- ordering values and ranks

const char Card::valueRanks[NUM_CARD_VALS] // const forces correct # initializers

= { '2', '3', '4', '5', '6', '7', '8', '9', 'T',

'J', 'Q', 'K', 'A'};

const Card::Suit Card::suitRanks[NUM_CARD_SUITS] = {Card::clubs, Card::diamonds,

Card::hearts, Card::spades};

// main to test comparison mechanism and random card generation

int main()

{

int k;

Card card1, card2;

srand(time(NULL)); // or not, if you want repetition

cout << "should all be 0: ";

card1.set('A', Card::spades); card2.set('A', Card::spades);