/* cStash.cpp */

#include "cStash.h"
#include <iostream>
#include <cassert>

using namespace std;


// Quantity of elements to add when increasing storage:
const int increment = 100;


void initialize(CStash *s, int sz) {
  s->size = sz;
  s->quantity = 0;
  s->storage = 0;
  s->next = 0;
}



int add(CStash *s, const void *element) {
  // Enough space left?
  if(s->next >= s->quantity) {
    inflate(s, increment);
  }

  // Copy element into storage, starting at next empty space:
  int startBytes = s->next * s->size;
  unsigned char *e = (unsigned char *)element;
  for (int i = 0; i < s->size; i++) {
    s->storage[startBytes + i] = e[i];
  }
  s->next++;
  return (s->next - 1);
}



void *fetch(CStash *s, int index) {
  // Check index boundaries:
  assert(0 <= index);
  if(index >= s->next) return 0;

  // Produce pointer to desired element:
  return &(s->storage[index * s->size]);
}



int count(CStash *s) {
  // Elements in CStash
  return s->next;
}



void inflate(CStash *s, int increase) {
  assert(increase > 0);
  int newQuantity = s->quantity + increase;
  int newBytes = newQuantity * s->size;
  int oldBytes = s->quantity * s->size;
  unsigned char *b = new unsigned char[newBytes];

  for (int i = 0; i < oldBytes; i++) {
   // Copy old to new:
    b[i] = s->storage[i];
  }

  // Old storage:
  delete [](s->storage);

  // Point to new memory:
  s->storage = b;
  s->quantity = newQuantity;
}



void cleanup(CStash *s) {
  if(s->storage != 0) {
   cout << "freeing storage" << endl;
   delete[] s->storage;
  }
}