The PatternDictionary subpackage of the StringTools package provides for persistent multiple pattern matching. It maintains a search data structure for multiple patterns (called the dictionary), against which text strings may be searched. This allows you to handle the missing case in StringTools[Search] where there are multiple patterns and multiple texts. The PatternDictionary subpackage provides facilities for managing this list of patterns.

Five procedures are provided for managing and using the search patterns.

All of the StringTools package commands treat strings as (null-terminated) sequences of $8$-bit (ASCII) characters.  Thus, there is no support for multibyte character encodings, such as unicode encodings.

$\mathrm{with}\left(\mathrm{StringTools}\right)\:$

$\mathrm{with}\left(\mathrm{PatternDictionary}\right)\:$

$\mathrm{bid}≔\mathrm{Create}\left('\mathrm{builtin}'\right)\:$

$\mathrm{Search}\left(\mathrm{bid}\,''happy''\right)$

$\left[2\,12\right],\left[1\,10570\right],\left[1\,10732\right],\left[1\,10739\right]$

$\mathrm{dict}≔\mathrm{Create}\left(\left[''fee''\,''foo''\right]\right)\:$

$\mathrm{Size}\left(\mathrm{dict}\right)$

$2$

$\mathrm{Get}\left(\mathrm{dict}\,1\right)$

$''fee''$

$\mathrm{Get}\left(\mathrm{dict}\,2\right)$

$''foo''$

$s≔\mathrm{Search}\left(\mathrm{dict}\,''afoot''\right)$

$s≔\left[2\,2\right]$

$\mathrm{map2}\left(\mathrm{Get}\,\mathrm{dict}\,\mathrm{map2}\left(\mathrm{op}\,2\,\left[s\right]\right)\right)$

$\left[''foo''\right]$

$\mathrm{Search}\left(\mathrm{dict}\,''defoe''\right)$

$\mathrm{dict}≔\mathrm{Create}\left(\left[''fee''\,''foo''\,''foe''\right]\right)\:$

$r≔\mathrm{Search}\left(\mathrm{dict}\,''defoe''\right)$

$r≔\left[3\,3\right]$

$\mathrm{map2}\left(\mathrm{Get}\,\mathrm{dict}\,\mathrm{map2}\left(\mathrm{op}\,2\,\left[r\right]\right)\right)$

$\left[''foe''\right]$

$\mathrm{seq}\left(\mathrm{Get}\left(\mathrm{dict}\,n\right)\,n=1..\mathrm{Size}\left(\mathrm{dict}\right)\right)$

$''fee'',''foo'',''foe''$

$\mathrm{Factors}\left(''spacewalk''\,\mathrm{bid}\right)$

$''space'',''walk''$

$\mathrm{Factors}\left(''spacewalking''\,\mathrm{bid}\right)$

Error, (in aux) no factorization

$\mathrm{WordList}≔''/usr/share/dict/words''\:$

$\mathrm{WordList}≔\mathrm{FileTools}:-\mathrm{JoinPath}\left(\left[\mathrm{kernelopts}\left(':-\mathrm{datadir}'\right)\,''help''\,''StringTools''\,''words.dat''\right]\right)\:$

$\mathrm{dict}≔\mathrm{Create}\left(\mathrm{remove}\left(\mathrm{type}\,\mathrm{Split}\left(\mathrm{readbytes}\left(\mathrm{WordList}\,'\mathrm{TEXT}'\,\mathrm{\infty }\right)\right)\,''''\right)\right)\:$

$\mathrm{Factors}\left(''spacewalking''\,\mathrm{dict}\right)$

$''space'',''walk'',''in'',''g''$

$\mathrm{dict}≔\mathrm{Create}\left(\left[\mathrm{seq}\right]\left(\mathrm{ThueMorse}\left(i\right)\,i=10..1000\right)\right)\:$

$\mathrm{Search}\left(\mathrm{dict}\,\mathrm{Random}\left(1000\,'\mathrm{binary}'\right)\right)$

$\mathrm{dict}≔\mathrm{Create}\left(\left[\mathrm{seq}\right]\left(\mathrm{Fibonacci}\left(i\,''a''\,''b''\right)\,i=2..10\right)\right)$

$\mathrm{dict}≔\mathbf{module}\left(\right)\mathbf{option}\mathrm{unload}\=\mathrm{free}\,\mathrm{dictionary}\;\mathbf{local}\mathrm{did}\,\mathrm{stringlist}\,\mathrm{free}\;\mathbf{export}\mathrm{get}\,\mathrm{size}\,\mathrm{search}\;\mathbf{description}''a\; dictionary\; object''\;\mathbf{end\; module}$

$\mathrm{Factors}\left(\mathrm{Fibonacci}\left(12\,''a''\,''b''\right)\,\mathrm{dict}\right)$

$''abaababaabaababaababaabaababaabaababaababaabaababaababaabaababaabaababaababaabaababaabaab'',''abaababaabaababaababaabaababaabaababaababaabaababaababaabaababaabaababaababaabaababaabaab'',''abaababaabaababaababaabaababaabaab'',''abaababaabaab'',''aba'',''abaab''$