11use std:: num:: NonZeroU32 ;
22
3- use gix_diff:: { blob:: intern :: TokenSource , tree:: Visit } ;
3+ use gix_diff:: { blob:: TokenSource , tree:: Visit } ;
44use gix_hash:: ObjectId ;
55use gix_object:: {
66 bstr:: { BStr , BString } ,
@@ -204,13 +204,13 @@ pub fn file(
204204 #[ cfg( debug_assertions) ]
205205 {
206206 let source_blob = odb. find_blob ( & entry_id, & mut buf) ?. data . to_vec ( ) ;
207- let mut source_interner = gix_diff:: blob:: intern :: Interner :: new ( source_blob. len ( ) / 100 ) ;
207+ let mut source_interner = gix_diff:: blob:: Interner :: new ( source_blob. len ( ) / 100 ) ;
208208 let source_lines_as_tokens: Vec < _ > = tokens_for_diffing ( & source_blob)
209209 . tokenize ( )
210210 . map ( |token| source_interner. intern ( token) )
211211 . collect ( ) ;
212212
213- let mut blamed_interner = gix_diff:: blob:: intern :: Interner :: new ( blamed_file_blob. len ( ) / 100 ) ;
213+ let mut blamed_interner = gix_diff:: blob:: Interner :: new ( blamed_file_blob. len ( ) / 100 ) ;
214214 let blamed_lines_as_tokens: Vec < _ > = tokens_for_diffing ( & blamed_file_blob)
215215 . tokenize ( )
216216 . map ( |token| blamed_interner. intern ( token) )
@@ -407,7 +407,7 @@ pub fn file(
407407
408408 // I don’t know yet whether it would make sense to use a data structure instead that preserves
409409 // order on insertion.
410- out. sort_by ( |a, b | a. start_in_blamed_file . cmp ( & b . start_in_blamed_file ) ) ;
410+ out. sort_by_key ( |a| a. start_in_blamed_file ) ;
411411 Ok ( Outcome {
412412 entries : coalesce_blame_entries ( out) ,
413413 blob : blamed_file_blob,
@@ -758,7 +758,7 @@ fn blob_changes(
758758 diff_algorithm : gix_diff:: blob:: Algorithm ,
759759 stats : & mut Statistics ,
760760) -> Result < Vec < Change > , Error > {
761- use gix_diff:: blob:: v2 :: Hunk ;
761+ use gix_diff:: blob:: Hunk ;
762762
763763 resource_cache. set_resource (
764764 previous_oid,
@@ -776,17 +776,12 @@ fn blob_changes(
776776 ) ?;
777777
778778 let outcome = resource_cache. prepare_diff ( ) ?;
779- let input = gix_diff:: blob:: v2 :: InternedInput :: new (
779+ let input = gix_diff:: blob:: InternedInput :: new (
780780 outcome. old . data . as_slice ( ) . unwrap_or_default ( ) ,
781781 outcome. new . data . as_slice ( ) . unwrap_or_default ( ) ,
782782 ) ;
783783
784- let diff_algorithm: gix_diff:: blob:: v2:: Algorithm = match diff_algorithm {
785- gix_diff:: blob:: Algorithm :: Histogram => gix_diff:: blob:: v2:: Algorithm :: Histogram ,
786- gix_diff:: blob:: Algorithm :: Myers => gix_diff:: blob:: v2:: Algorithm :: Myers ,
787- gix_diff:: blob:: Algorithm :: MyersMinimal => gix_diff:: blob:: v2:: Algorithm :: MyersMinimal ,
788- } ;
789- let mut diff = gix_diff:: blob:: v2:: Diff :: compute ( diff_algorithm, & input) ;
784+ let mut diff = gix_diff:: blob:: Diff :: compute ( diff_algorithm, & input) ;
790785 diff. postprocess_lines ( & input) ;
791786
792787 let mut last_seen_after_end = 0 ;
@@ -882,5 +877,5 @@ fn collect_parents(
882877/// Return an iterator over tokens for use in diffing. These are usually lines, but it's important
883878/// to unify them so the later access shows the right thing.
884879pub ( crate ) fn tokens_for_diffing ( data : & [ u8 ] ) -> impl TokenSource < Token = & [ u8 ] > {
885- gix_diff:: blob:: sources:: byte_lines_with_terminator ( data)
880+ gix_diff:: blob:: sources:: byte_lines ( data)
886881}
0 commit comments