/** * Returns first free slot, -1 if no slots are available */ int getFirstFree() { for (int i = 0; i < ELEMS_PER_PAGE; i++) { if (isFree(i)) return i; } return -1; }
/** * Returns first free slot, -1 if no slots are available */ int getFirstFree() { for (int i = 0; i < ELEMS_PER_PAGE; i++) { if (isFree(i)) return i; } return -1; }
/** * Returns first free slot, -1 if no slots are available */ int getFirstFree() { for (; previousFoundFree < ELEMS_PER_PAGE; previousFoundFree++) { if (isFree(previousFoundFree)) return previousFoundFree; } return -1; }
/** * Returns first free slot, -1 if no slots are available */ int getFirstFree() { for ( int i = 0; i < ELEMS_PER_PAGE; i++ ) { if ( isFree( i ) ) { return i; } } return -1; }