510511512513514515516517
return v; } else { throw new KeyNotFoundException( "Cannot find an entry for key " + key ); } }
536537538539540541542543
return ( ( BTree<V, V> ) v ); } else { throw new KeyNotFoundException( "Cannot find an entry for key " + key ); } }