{

Giant()

{

m_id = s_next++;

}

void fee()

{

cout << m_id << "-fee ";

}

void phi()

{

cout << m_id << "-phi ";

}

void pheaux()

{

cout << m_id << "-pheaux ";

}

int m_id;

static int s_next;

{

typedef void(Giant:: *Action)();

Command(Giant *object, Action method)

{

m_object = object;

m_method = method;

}

void execute()

{

(m_object->*m_method)();

}

Giant *m_object;

Action m_method;

{

Queue()

{

m_add = m_remove = 0;

}

void enque(T *c)

{

m_array[m_add] = c;

m_add = (m_add + 1) % SIZE;

}

T *deque()

{

int temp = m_remove;

m_remove = (m_remove + 1) % SIZE;

return m_array[temp];

}

enum {

SIZE = 8

};

T *m_array[SIZE];

int m_add, m_remove;

{

Queue<Command> que;

Command *input[] = {

new Command(new Giant, &Giant::fee), new Command(new Giant, &Giant::phi),

new Command(new Giant, &Giant::pheaux), new Command(new Giant, &Giant

::fee), new Command(new Giant, &Giant::phi), new Command(new Giant,

&Giant::pheaux)

};

for (int i = 0; i < 6; i++)

que.enque(input[i]);

for (int i = 0; i < 6; i++)

que.deque()->execute();

cout << '\n';

}