Method push

code/data-structures/heap.cpp:30–46

    memset(loc, 255, len << 2); }
  ~heap() { delete[] q; delete[] loc; }
  void push(int n, bool fix = true) {
    if (len == count || n >= len) {
#ifdef RESIZE
      int newlen = 2 * len;
      while (n >= newlen) newlen *= 2;
      int *newq = new int[newlen], *newloc = new int[newlen];
      rep(i,0,len) newq[i] = q[i], newloc[i] = loc[i];
      memset(newloc + len, 255, (newlen - len) << 2);
      delete[] q, delete[] loc;
      loc = newloc, q = newq, len = newlen;
#else
      assert(false);
#endif
    }
    assert(loc[n] == -1);
    loc[n] = count, q[count++] = n;
    if (fix) swim(count-1); }
  void pop(bool fix = true) {
    assert(count > 0);
    loc[q[0]] = -1, q[0] = q[--count], loc[q[0]] = 0;