public long skip(long n) {
		long skipped=0L;
		int skip;
		while(n>0) {
			if(n<(skip=curr.remaining())) {
				curr.position(curr.position()+(int)n);
				skipped+=skip;
				n=0;
			} else {
				curr.position(curr.limit());
				
				skipped-=skip;
				if(idx<bbs.size()) {
					curr=bbs.get(idx++);
					n-=skip;
				} else {
					n=0;
				}
			}
		}
		return skipped;
	}
public long skip ( long n ) { long skipped = 0L ; int skip ; while ( n > 0 ) { if ( n < ( skip = curr . remaining ( ) ) ) { curr . position ( curr . position ( ) + ( int ) n ) ; skipped += skip ; n = 0 ; } else { curr . position ( curr . limit ( ) ) ; skipped -= skip ; if ( idx < bbs . size ( ) ) { curr = bbs . get ( idx ++ ) ; n -= skip ; } else { n = 0 ; } } } return skipped ; }
Returns how many are left that were not skipped
@param n
@return