// all sizes+addresses are in ints (4 bytes)
sclass ManagedIntObjects_v1 {
  int[] mem = new int[0];
  new FreeList freeList;
  
  replace Addr with int.
  replace Addr2 with Int.
  
  *() {
    alloc(1); // so 0 is usable as the null pointer
  }
  
  void ensureCapacity(int size) {
    if (memorySize() < size)
      setMemorySize(roundUpToPowerOfTwo(size));
  }
  
  int memorySize() { ret mem.length; }
  
  void setMemorySize(int newSize) {
    int size = memorySize();
    if (newSize < size) unimplemented("Shrinking memory");
    freeList.add(IntRange(size, newSize));
    mem = resizeIntArray(mem, newSize);
  }
  
  void growMemory() {
    setMemorySize(memorySize()*2);
  }
  
  int alloc(int length) {
    IntRange r;
    while ((r = freeList.findFreeSpace(length)) == null)
      growMemory();
    freeList.remove(IntRange(r.start+length, r.end));
    ret r.start;
  }
  
  void free(int start, int length) {
    freeList.add(IntRange(start, start+length));
  }
  
  int get(Addr i) { ret mem[i]; }
  int read(Addr i) { ret mem[i]; }
  void set(Addr i, int val) { mem[i] = val; }
  
  // words a pointer requires
  int sizeOfPointer() { ret 1; }
  
  Addr nullPtr() { ret 0; }
  
  // convenience pointer array handling (memory layout: length + data)
  
  L<Addr2> pointerArray(Addr addr) {
    int size = get(addr);
    ret new RandomAccessAbstractList<Addr2>() {
      public int size() { ret size; }
      public Addr2 get(int i) { rangeCheck(i, size); ret read(addr+1+i); }
      public Int set(int i, int val) { Int old = get(i); set(addr+1+i, val); ret old; }
    };
  }
}