@@ -240,11 +240,6 @@ impl TermShortlistBuilder {
240
240
}
241
241
}
242
242
243
- fn add_empty ( & mut self , term : QueryTerm ) {
244
- // TODO(CX-5637): Remove the call to add_empty
245
- self . query_term_shortlist_items . entry ( term) . or_default ( ) ;
246
- }
247
-
248
243
fn add_match (
249
244
& mut self ,
250
245
term : QueryTerm ,
@@ -301,8 +296,6 @@ pub(crate) fn shortlist_and_id_mapping(
301
296
let mut shortlist_id_to_term_id = BTreeMap :: new ( ) ;
302
297
let mut builder = TermShortlistBuilder :: new ( ) ;
303
298
for ( query_term, matches) in term_matches {
304
- // TODO(CX-5637): Remove the call to add_empty
305
- builder. add_empty ( query_term. clone ( ) ) ;
306
299
for ( distance, match_term, term_id) in matches {
307
300
let new_shortlist_id = builder. add_match ( query_term. clone ( ) , match_term, distance) ;
308
301
if let Some ( new_shortlist_id) = new_shortlist_id {
@@ -317,8 +310,6 @@ impl TermShortlist {
317
310
pub fn new ( term_matches : BTreeMap < QueryTerm , BTreeSet < ( EditDistance , Term ) > > ) -> Self {
318
311
let mut builder = TermShortlistBuilder :: new ( ) ;
319
312
for ( query_term, matches) in term_matches {
320
- // TODO(CX-5637): Remove the call to add_empty
321
- builder. add_empty ( query_term. clone ( ) ) ;
322
313
for ( distance, match_term) in matches {
323
314
builder. add_match ( query_term. clone ( ) , match_term, distance) ;
324
315
}
0 commit comments