I'm trying to find all patterns of a number to accommodate a dyslexic typer. By matching any pattern that contains the characters in the given input as many times as they /exist/ in the input. English sucks, example's better:
given 231
match 2 3 and 1 in any order, but do not repeat because there's only a single 1, a single 2, and a single 3:
123
132
213
231
312
321
but not:
111
112
221
222
311
333
223
332
etc...
My brain is locked. I'm thinking it should be easy but all i can come up with is along the lines of:
Expand|Select|Wrap|Line Numbers
- (3|2|1)+
Thanks,
Dan