#[derive(Drop, Debug, PartialEq)] pub struct Position { pub col: usize, pub row: usize, } #[derive(Debug, PartialEq, Drop)] pub struct SearchResult { pub word: ByteArray, pub start: Position, pub end: Position, } pub fn search(grid: Span, words_to_search_for: Span) -> Span { let mut results: Array = ArrayTrait::new(); let num_rows = grid.len(); let num_cols = grid[0].len(); for word in words_to_search_for { let word_len = word.len(); for row in 0..num_rows { for col in 0..num_cols { // Horizontal (left-to-right) if col + word_len <= num_cols && is_horizontal_match(grid, word, row, col) { results .append( SearchResult { word: word.clone(), start: Position { col: col + 1, row: row + 1 }, end: Position { col: col + word_len, row: row + 1 }, }, ); } // Horizontal (right-to-left) if col >= word_len - 1 && is_horizontal_reverse_match(grid, word, row, col) { results .append( SearchResult { word: word.clone(), start: Position { col: col + 1, row: row + 1 }, end: Position { col: word_len - col, row: row + 1 }, }, ); } // Vertical (top-to-bottom) if row + word_len <= num_rows && is_vertical_match(grid, word, row, col) { results .append( SearchResult { word: word.clone(), start: Position { col: col + 1, row: row + 1 }, end: Position { col: col + 1, row: row + row + word_len }, }, ); } // Vertical (bottom-to-top) if row >= word_len - 1 && is_vertical_reverse_match(grid, word, row, col) { results .append( SearchResult { word: word.clone(), start: Position { col: col + 1, row: row + 1 }, end: Position { col: col + 1, row: row + 1 - word_len + 1 }, }, ); } // Diagonal (top-left to bottom-right) if row + word_len <= num_rows && col + word_len <= num_cols && is_diagonal_tl_br_match(grid, word, row, col) { results .append( SearchResult { word: word.clone(), start: Position { col: col + 1, row: row + 1 }, end: Position { col: col + word_len, row: row + word_len }, }, ); } // Diagonal (top-right to bottom-left) if row + word_len <= num_rows && col >= word_len - 1 && is_diagonal_tr_bl_match(grid, word, row, col) { results .append( SearchResult { word: word.clone(), start: Position { col: col + 1, row: row + 1 }, end: Position { col: col + 1 - word_len + 1, row: row + word_len }, }, ); } // Diagonal Up-Right (Bottom-Left to Top-Right) if row >= word_len && is_diagonal_bl_tr_match(grid, word, row, col) { results .append( SearchResult { word: word.clone(), start: Position { col: col + 1, row: row + 1 }, end: Position { col: col + word_len, row: row + 1 - word_len + 1 }, }, ); } // Diagonal Up-Left (Bottom-Right to Top-Left) if row >= word_len && col >= word_len && is_diagonal_br_tl_match(grid, word, row, col) { results .append( SearchResult { word: word.clone(), start: Position { col: col + 1, row: row + 1 }, end: Position { col: col + 1 - word_len + 1, row: row + 1 - word_len + 1, }, }, ); } } } } results.span() } // Helper function to check for Different direction // Horizontal match (left-to-right) fn is_horizontal_match(grid: Span, word: @ByteArray, row: usize, col: usize) -> bool { let mut result = true; let word_len = word.len(); if col + word_len > grid[row].len() { return false; } for i in 0..word_len { if grid[row][col + i] != word[i] { result = false; break; } } result } // Horizontal match (right-to-left) fn is_horizontal_reverse_match( grid: Span, word: @ByteArray, row: usize, col: usize, ) -> bool { let mut result = true; let word_len = word.len(); // Check if the starting column is valid for a right-to-left match if col < word_len - 1 { return false; } for i in 0..word_len { if grid[row][col - i] != word[i] { result = false; break; } } result } // Vertical match (top-to-bottom) fn is_vertical_match(grid: Span, word: @ByteArray, row: usize, col: usize) -> bool { let mut result = true; let word_len = word.len(); if row + word_len > grid.len() { return false; } for i in 0..word_len { if grid[row + i][col] != word[i] { result = false; break; } } result } // Vertical match (bottom-to-top) fn is_vertical_reverse_match( grid: Span, word: @ByteArray, row: usize, col: usize, ) -> bool { let mut result = true; let word_len = word.len(); if row < word_len - 1 { return false; } for i in 0..word_len { if grid[row - i][col] != word[i] { result = false; break; } } result } // Diagonal match (top-left to bottom-right) fn is_diagonal_tl_br_match( grid: Span, word: @ByteArray, row: usize, col: usize, ) -> bool { let mut result = true; let word_len = word.len(); if row + word_len > grid.len() || col + word_len > grid[row].len() { return false; } for i in 0..word_len { if grid[row + i][col + i] != word[i] { result = false; break; } } result } // Diagonal match (top-right to bottom-left) fn is_diagonal_tr_bl_match( grid: Span, word: @ByteArray, row: usize, col: usize, ) -> bool { let mut result = true; let word_len = word.len(); if row + word_len > grid.len() || col < word_len - 1 { println!("get"); return false; } for i in 0..word_len { if grid[row + i][col - i] != word[i] { result = false; break; } } result } fn is_diagonal_bl_tr_match( grid: Span, word: @ByteArray, row: usize, col: usize, ) -> bool { let mut result = true; let word_len = word.len(); // Check if the starting row and column allow the word to fit diagonally if row < word_len || col + word_len > grid[row].len() { return false; } for i in 0..word_len { if grid[row - i][col + i] != word[i] { result = false; break; } } result } fn is_diagonal_br_tl_match( grid: Span, word: @ByteArray, row: usize, col: usize, ) -> bool { let mut result = true; let word_len = word.len(); // Check if the starting row and column allow the word to fit in this diagonal direction if word_len > row || col < word_len { return false; } for i in 0..word_len { if grid[row - i][col - i] != word[i] { result = false; break; } } result }