The insight behind Boyer-Moore is that if you start searching for a pattern in a string starting with the last character in the pattern, you can jump your search forward multiple characters when you hit a mismatch. Let’s say our pattern p is the sequence of characters p1, p2, …, pn and we are searching … Read more
strings.EqualFold() can check if two strings are equal, while ignoring case. It even works with Unicode. See http://golang.org/pkg/strings/#EqualFold for more info. http://play.golang.org/p/KDdIi8c3Ar package main import ( “fmt” “strings” ) func main() { fmt.Println(strings.EqualFold(“HELLO”, “hello”)) fmt.Println(strings.EqualFold(“ÑOÑO”, “ñoño”)) } Both return true.
Moore’s UTexas webpage walks through both algorithms in a step-by-step fashion (he also provides various technical sources): Knuth-Morris-Pratt Boyer-Moore According to the man himself, The classic Boyer-Moore algorithm suffers from the phenomenon that it tends not to work so efficiently on small alphabets like DNA. The skip distance tends to stop growing with the pattern … Read more
You could consider doing the filtering task on a background thread which would invoke a callback method when it’s done, or simply restart filtering if input is changed. The general idea is to be able to use it like this: public partial class YourForm : Form { private readonly BackgroundWordFilter _filter; public YourForm() { InitializeComponent(); … Read more
Check this Vim tip: Search for visually selected text Or you can simply yank the selected text with y and go to search mode /, then you can paste the last yanked text with Ctrl+R 0