SimdStringOps

Struct SimdStringOps 

Source
pub struct SimdStringOps;
Expand description

SIMD-accelerated string comparison operations

Implementations§

Source§

impl SimdStringOps

Source

pub fn is_available() -> bool

Check if SIMD acceleration is available

Examples found in repository?
examples/complete_integration.rs (line 245)
181    fn demo_performance_monitored_simd(&self) -> Result<()> {
182        println!("⚡ Demo 2: Performance-Monitored SIMD Operations");
183        println!("===============================================");
184
185        let testtexts = [
186            "The quick brown fox jumps over the lazy dog".to_string(),
187            "Pack my box with five dozen liquor jugs".to_string(),
188            "How vexingly quick daft zebras jump!".to_string(),
189            "Bright vixens jump; dozy fowl quack".to_string(),
190        ];
191
192        println!("Running SIMD-accelerated operations with performance monitoring...");
193
194        // Start monitoring
195        let operation_monitor = self
196            .performance_monitor
197            .start_operation("simd_operations")?;
198
199        let start_time = Instant::now();
200
201        // Optimized text processing
202        let testtext_refs: Vec<&str> = testtexts.iter().map(|s| s.as_str()).collect();
203        let processed_results = AdvancedSIMDTextProcessor::advanced_batch_process(&testtext_refs);
204
205        // SIMD string operations
206        let char_counts: Vec<usize> = testtexts
207            .iter()
208            .map(|text| SimdStringOps::count_chars(text, 'o'))
209            .collect();
210
211        // Optimized similarity matrix
212        let similarity_matrix =
213            AdvancedSIMDTextProcessor::advanced_similarity_matrix(&testtext_refs);
214
215        let processing_time = start_time.elapsed();
216
217        // Complete monitoring
218        operation_monitor.complete(testtexts.len())?;
219
220        println!("\n📊 SIMD Operation Results:");
221        println!("  • Processing Time: {processing_time:?}");
222        println!("  • Documents Processed: {}", processed_results.len());
223        println!("  • Character Counts (letter 'o'): {char_counts:?}");
224        println!(
225            "  • Similarity Matrix Size: {}x{}",
226            similarity_matrix.len(),
227            similarity_matrix[0].len()
228        );
229
230        // Display similarity matrix
231        println!("\n🔗 Text Similarity Matrix:");
232        for (i, row) in similarity_matrix.iter().enumerate() {
233            print!("  Row {i}: [");
234            for (j, &similarity) in row.iter().enumerate() {
235                if j > 0 {
236                    print!(", ");
237                }
238                print!("{similarity:.3}");
239            }
240            println!("]");
241        }
242
243        // Show SIMD capabilities
244        println!("\n⚙️  SIMD Capabilities:");
245        println!("  • SIMD Available: {}", SimdStringOps::is_available());
246        println!("  • String Processing: Optimized");
247        println!("  • Pattern Matching: Optimized");
248        println!("  • Similarity Computation: Vectorized");
249
250        println!();
251        Ok(())
252    }
Source

pub fn count_chars(text: &str, target: char) -> usize

Fast character counting using SIMD

Examples found in repository?
examples/complete_integration.rs (line 208)
181    fn demo_performance_monitored_simd(&self) -> Result<()> {
182        println!("⚡ Demo 2: Performance-Monitored SIMD Operations");
183        println!("===============================================");
184
185        let testtexts = [
186            "The quick brown fox jumps over the lazy dog".to_string(),
187            "Pack my box with five dozen liquor jugs".to_string(),
188            "How vexingly quick daft zebras jump!".to_string(),
189            "Bright vixens jump; dozy fowl quack".to_string(),
190        ];
191
192        println!("Running SIMD-accelerated operations with performance monitoring...");
193
194        // Start monitoring
195        let operation_monitor = self
196            .performance_monitor
197            .start_operation("simd_operations")?;
198
199        let start_time = Instant::now();
200
201        // Optimized text processing
202        let testtext_refs: Vec<&str> = testtexts.iter().map(|s| s.as_str()).collect();
203        let processed_results = AdvancedSIMDTextProcessor::advanced_batch_process(&testtext_refs);
204
205        // SIMD string operations
206        let char_counts: Vec<usize> = testtexts
207            .iter()
208            .map(|text| SimdStringOps::count_chars(text, 'o'))
209            .collect();
210
211        // Optimized similarity matrix
212        let similarity_matrix =
213            AdvancedSIMDTextProcessor::advanced_similarity_matrix(&testtext_refs);
214
215        let processing_time = start_time.elapsed();
216
217        // Complete monitoring
218        operation_monitor.complete(testtexts.len())?;
219
220        println!("\n📊 SIMD Operation Results:");
221        println!("  • Processing Time: {processing_time:?}");
222        println!("  • Documents Processed: {}", processed_results.len());
223        println!("  • Character Counts (letter 'o'): {char_counts:?}");
224        println!(
225            "  • Similarity Matrix Size: {}x{}",
226            similarity_matrix.len(),
227            similarity_matrix[0].len()
228        );
229
230        // Display similarity matrix
231        println!("\n🔗 Text Similarity Matrix:");
232        for (i, row) in similarity_matrix.iter().enumerate() {
233            print!("  Row {i}: [");
234            for (j, &similarity) in row.iter().enumerate() {
235                if j > 0 {
236                    print!(", ");
237                }
238                print!("{similarity:.3}");
239            }
240            println!("]");
241        }
242
243        // Show SIMD capabilities
244        println!("\n⚙️  SIMD Capabilities:");
245        println!("  • SIMD Available: {}", SimdStringOps::is_available());
246        println!("  • String Processing: Optimized");
247        println!("  • Pattern Matching: Optimized");
248        println!("  • Similarity Computation: Vectorized");
249
250        println!();
251        Ok(())
252    }
Source

pub fn find_whitespace_positions(text: &str) -> Vec<usize>

Fast whitespace detection using SIMD

Source

pub fn to_lowercase_ascii(text: &str) -> String

SIMD-accelerated case conversion for ASCII text

Source

pub fn find_substring(haystack: &str, needle: &str) -> Option<usize>

SIMD-accelerated substring search using byte comparison

Source

pub fn is_alphanumeric_ascii(text: &str) -> bool

SIMD-accelerated character validation

Source

pub fn hamming_distance(s1: &str, s2: &str) -> Option<usize>

SIMD-accelerated Hamming distance calculation

Auto Trait Implementations§

Blanket Implementations§

Source§

impl<T> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source§

impl<T> IntoEither for T

Source§

fn into_either(self, into_left: bool) -> Either<Self, Self>

Converts self into a Left variant of Either<Self, Self> if into_left is true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more
Source§

fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
where F: FnOnce(&Self) -> bool,

Converts self into a Left variant of Either<Self, Self> if into_left(&self) returns true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more
Source§

impl<T> Pointable for T

Source§

const ALIGN: usize

The alignment of pointer.
Source§

type Init = T

The type for initializers.
Source§

unsafe fn init(init: <T as Pointable>::Init) -> usize

Initializes a with the given initializer. Read more
Source§

unsafe fn deref<'a>(ptr: usize) -> &'a T

Dereferences the given pointer. Read more
Source§

unsafe fn deref_mut<'a>(ptr: usize) -> &'a mut T

Mutably dereferences the given pointer. Read more
Source§

unsafe fn drop(ptr: usize)

Drops the object pointed to by the given pointer. Read more
Source§

impl<T> Same for T

Source§

type Output = T

Should always be Self
Source§

impl<SS, SP> SupersetOf<SS> for SP
where SS: SubsetOf<SP>,

Source§

fn to_subset(&self) -> Option<SS>

The inverse inclusion map: attempts to construct self from the equivalent element of its superset. Read more
Source§

fn is_in_subset(&self) -> bool

Checks if self is actually part of its subset T (and can be converted to it).
Source§

fn to_subset_unchecked(&self) -> SS

Use with care! Same as self.to_subset but without any property checks. Always succeeds.
Source§

fn from_subset(element: &SS) -> SP

The inclusion map: converts self to the equivalent element of its superset.
Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = Infallible

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
Source§

impl<V, T> VZip<V> for T
where V: MultiLane<T>,

Source§

fn vzip(self) -> V