@@ -264,11 +264,6 @@ impl<'src> SourceMap<'src> {
264
264
}
265
265
}
266
266
267
- /// Like `HashMap::contains_key`.
268
- pub fn contains ( & self , id : SourceId ) -> bool {
269
- self . map . contains_key ( & id)
270
- }
271
-
272
267
/// Like `HashMap::get`.
273
268
pub fn get ( & self , id : SourceId ) -> Option < & ( dyn Source + ' src ) > {
274
269
self . map . get ( & id) . map ( |s| s. as_ref ( ) )
@@ -279,32 +274,17 @@ impl<'src> SourceMap<'src> {
279
274
self . map . get_mut ( & id) . map ( |s| s. as_mut ( ) )
280
275
}
281
276
282
- /// Like `HashMap::get`, but first calculates the `SourceId` from a `PackageId`.
283
- pub fn get_by_package_id ( & self , pkg_id : PackageId ) -> Option < & ( dyn Source + ' src ) > {
284
- self . get ( pkg_id. source_id ( ) )
285
- }
286
-
287
277
/// Like `HashMap::insert`, but derives the `SourceId` key from the `Source`.
288
278
pub fn insert ( & mut self , source : Box < dyn Source + ' src > ) {
289
279
let id = source. source_id ( ) ;
290
280
self . map . insert ( id, source) ;
291
281
}
292
282
293
- /// Like `HashMap::is_empty`.
294
- pub fn is_empty ( & self ) -> bool {
295
- self . map . is_empty ( )
296
- }
297
-
298
283
/// Like `HashMap::len`.
299
284
pub fn len ( & self ) -> usize {
300
285
self . map . len ( )
301
286
}
302
287
303
- /// Like `HashMap::values`.
304
- pub fn sources < ' a > ( & ' a self ) -> impl Iterator < Item = & ' a Box < dyn Source + ' src > > {
305
- self . map . values ( )
306
- }
307
-
308
288
/// Like `HashMap::iter_mut`.
309
289
pub fn sources_mut < ' a > (
310
290
& ' a mut self ,
0 commit comments