File tree Expand file tree Collapse file tree 1 file changed +0
-6
lines changed Expand file tree Collapse file tree 1 file changed +0
-6
lines changed Original file line number Diff line number Diff line change @@ -321,8 +321,6 @@ References
321
321
322
322
// TODO: Extend this to use AVX2 instructions.
323
323
// TODO: Extend this to use AVX512 instructions.
324
- // TODO: Extend this to cleverly use Aho-Corasick. Possibly to replace both
325
- // "slow" searching and the verification step.
326
324
// TODO: Make the inner loop do aligned loads.
327
325
328
326
use std:: cmp;
@@ -437,8 +435,6 @@ impl Teddy {
437
435
pub fn find ( & self , haystack : & [ u8 ] ) -> Option < Match > {
438
436
// If our haystack is smaller than the block size, then fall back to
439
437
// a naive brute force search.
440
- //
441
- // TODO: Use Aho-Corasick.
442
438
if haystack. is_empty ( ) || haystack. len ( ) < ( BLOCK_SIZE + 2 ) {
443
439
return self . slow ( haystack, 0 ) ;
444
440
}
@@ -788,8 +784,6 @@ impl UnsafeLoad for u8x16 {
788
784
type Elem = u8 ;
789
785
790
786
unsafe fn load_unchecked ( slice : & [ u8 ] , offset : usize ) -> u8x16 {
791
- // TODO: Can we just do pointer casting here? I don't think so, since
792
- // this could be an unaligned load? Help me.
793
787
let mut x = u8x16:: splat ( 0 ) ;
794
788
ptr:: copy_nonoverlapping (
795
789
slice. get_unchecked ( offset) ,
You can’t perform that action at this time.
0 commit comments