11use std:: mem;
22use std:: ops:: { BitAnd , BitAndAssign , BitOr , BitOrAssign , BitXor , BitXorAssign , Sub , SubAssign } ;
33
4- use retain_mut:: RetainMut ;
5-
64use crate :: bitmap:: container:: Container ;
75use crate :: bitmap:: Pairs ;
86use crate :: RoaringBitmap ;
@@ -240,7 +238,7 @@ impl BitAndAssign<RoaringBitmap> for RoaringBitmap {
240238 mem:: swap ( self , & mut rhs) ;
241239 }
242240
243- RetainMut :: retain_mut ( & mut self . containers , |cont| {
241+ self . containers . retain_mut ( |cont| {
244242 let key = cont. key ;
245243 match rhs. containers . binary_search_by_key ( & key, |c| c. key ) {
246244 Ok ( loc) => {
@@ -258,7 +256,7 @@ impl BitAndAssign<RoaringBitmap> for RoaringBitmap {
258256impl BitAndAssign < & RoaringBitmap > for RoaringBitmap {
259257 /// An `intersection` between two sets.
260258 fn bitand_assign ( & mut self , rhs : & RoaringBitmap ) {
261- RetainMut :: retain_mut ( & mut self . containers , |cont| {
259+ self . containers . retain_mut ( |cont| {
262260 let key = cont. key ;
263261 match rhs. containers . binary_search_by_key ( & key, |c| c. key ) {
264262 Ok ( loc) => {
@@ -335,7 +333,7 @@ impl SubAssign<RoaringBitmap> for RoaringBitmap {
335333impl SubAssign < & RoaringBitmap > for RoaringBitmap {
336334 /// A `difference` between two sets.
337335 fn sub_assign ( & mut self , rhs : & RoaringBitmap ) {
338- RetainMut :: retain_mut ( & mut self . containers , |cont| {
336+ self . containers . retain_mut ( |cont| {
339337 match rhs. containers . binary_search_by_key ( & cont. key , |c| c. key ) {
340338 Ok ( loc) => {
341339 SubAssign :: sub_assign ( cont, & rhs. containers [ loc] ) ;
0 commit comments