Queue + Stack C++
<p>How do u push Items to the front of the array, ( like a stack ) without starting at MAXSIZE-1? I've been trying to use the modulus operator to do so..</p>

<pre><code>bool quack::pushFront(const int nPushFront) 
{     
    if ( count == maxSize ) // indicates a full array
    {
         return false;
     }
    else if ( count == 0 ) 
    {
     ++count;
     items[0].n = nPushFront;
     return true;
    }
     intBack = intFront;
     items[++intBack] = items[intFront];
     ++count;
     items[(top+(count)+maxSize)%maxSize].n = nPushFront;
 /*
    for ( int shift = count - 1; shift &gt;= 0; --shift )
    {
      items[shift] = i€tems[shift-1];
    } 
     items[top+1].n = nPushFront; */
     return true;    
  }
</code></pre>

<p>"quack" meaning a cross between a queue and a stack. I cannot simply shift my elements by 1 because it is terribly inefficient. I've been working on this for over a month now. I just need some guidence to push_front by using the modulus operator...I dont think a loop is even necessary.</p>

<p>Its funny because I will need to print the list randomly. So if I start adding values to the MAXSIZE-1 element of my integer array, and then need to print the array, I will have garbage values..</p>

<pre><code>not actual code:

pushFront(2);
pushFront(4);
cout &lt;&lt; q;
</code></pre>

<p>if we started adding from the back i would get several null values.
I cannot just simply shift the array elements down or up by one.</p>

<p>I cant use any stls, or boosts.</p>
