int pos = 0;
public int available() { return Math.max(0, size - pos); }
public long skip(long n) throws IOException { pos += (int)n; return n; } // FEATURE: don't skip past EOF
int pos = 0;
public int available() { return Math.max(0, size - pos); }
public long skip(long n) throws IOException { pos += (int)n; return n; } // FEATURE: don't skip past EOF