private void assertStillOpen() { idContainer.assertStillOpen(); }
/** * Frees the <CODE>id</CODE> making it a defragged id that will be * returned by next id before any new id (that hasn't been used yet) is * returned. * <p> * This method will throw an <CODE>IOException</CODE> if id is negative or * if id is greater than the highest returned id. However as stated in the * class documentation above the id isn't validated to see if it really is * free. * * @param id * The id to be made available again */ @Override public synchronized void freeId( long id ) { idContainer.assertStillOpen(); if ( IdValidator.isReservedId( id ) ) { return; } if ( id < 0 || id >= highId ) { throw new IllegalArgumentException( "Illegal id[" + id + "], highId is " + highId ); } idContainer.freeId( id ); }
private void assertStillOpen() { idContainer.assertStillOpen(); }
/** * Frees the <CODE>id</CODE> making it a defragged id that will be * returned by next id before any new id (that hasn't been used yet) is * returned. * <p> * This method will throw an <CODE>IOException</CODE> if id is negative or * if id is greater than the highest returned id. However as stated in the * class documentation above the id isn't validated to see if it really is * free. * * @param id * The id to be made available again */ @Override public synchronized void freeId( long id ) { idContainer.assertStillOpen(); if ( IdValidator.isReservedId( id ) ) { return; } if ( id < 0 || id >= highId ) { throw new IllegalArgumentException( "Illegal id[" + id + "], highId is " + highId ); } idContainer.freeId( id ); }