Word Search is "too complex" Question
in [Word VBA]
|
From: George Lee on 16 Mar 2010 12:06 "The Find What text contains a Pattern Match expression which is too complex." What is the rule for being too complex? I can't determine the rule just by playing with it. It's not character limited (other than 255), and it doesn't seem to be "item" limited (like no more than ten []{} pairing).
From: Fumei2 via OfficeKB.com on 16 Mar 2010 12:57 Can you post what the pattern is? George Lee wrote: >"The Find What text contains a Pattern Match expression which is too complex." > >What is the rule for being too complex? I can't determine the rule just by >playing with it. It's not character limited (other than 255), and it doesn't >seem to be "item" limited (like no more than ten []{} pairing). -- Gerry Message posted via OfficeKB.com http://www.officekb.com/Uwe/Forums.aspx/word-programming/201003/1
From: George Lee on 17 Mar 2010 11:05 Simple cases: [0-9][0-9][0-9][0-9][0-9][0-9][0-9] ' OK [0-9]@[0-9]@[0-9]@[0-9]@[0-9]@[0-9]@[0-9]@ 'OK [0-9][0-9][0-9][0-9][0-9][0-9][0-9][0-9] 'too long From these it looks like seven brackets are the maximum. Is there confirmation of this somewhere? Is this the only condition? "Fumei2 via OfficeKB.com" wrote: > Can you post what the pattern is? > > George Lee wrote: > >"The Find What text contains a Pattern Match expression which is too complex." > > > >What is the rule for being too complex? I can't determine the rule just by > >playing with it. It's not character limited (other than 255), and it doesn't > >seem to be "item" limited (like no more than ten []{} pairing). > > -- > Gerry > > Message posted via OfficeKB.com > http://www.officekb.com/Uwe/Forums.aspx/word-programming/201003/1 > > . >
From: Doug Robbins - Word MVP on 17 Mar 2010 17:25 Instead of constructions such as: [0-9][0-9][0-9][0-9][0-9][0-9][0-9][0-9] , Use [0-9]{#} where # is the number of digits that you are seeking. or {#,} where you are seeking at least # digits, {#,##} where you are seeking between # and ## digits. -- Hope this helps. Please reply to the newsgroup unless you wish to avail yourself of my services on a paid consulting basis. Doug Robbins - Word MVP, originally posted via msnews.microsoft.com "George Lee" <GeorgeLee(a)discussions.microsoft.com> wrote in message news:943E632F-1228-45FE-A75C-CA54F38CCCA9(a)microsoft.com... > Simple cases: > [0-9][0-9][0-9][0-9][0-9][0-9][0-9] ' OK > [0-9]@[0-9]@[0-9]@[0-9]@[0-9]@[0-9]@[0-9]@ 'OK > [0-9][0-9][0-9][0-9][0-9][0-9][0-9][0-9] 'too long > > From these it looks like seven brackets are the maximum. Is there > confirmation of this somewhere? Is this the only condition? > > "Fumei2 via OfficeKB.com" wrote: > >> Can you post what the pattern is? >> >> George Lee wrote: >> >"The Find What text contains a Pattern Match expression which is too >> >complex." >> > >> >What is the rule for being too complex? I can't determine the rule just >> >by >> >playing with it. It's not character limited (other than 255), and it >> >doesn't >> >seem to be "item" limited (like no more than ten []{} pairing). >> >> -- >> Gerry >> >> Message posted via OfficeKB.com >> http://www.officekb.com/Uwe/Forums.aspx/word-programming/201003/1 >> >> . >>
From: George Lee on 18 Mar 2010 10:04 Thanks. I know these examples were contrived and I have workarounds. I was asking more what the conditions of a "too complex" of a pattern were. Microsoft doesn't seem to publish those. "Doug Robbins - Word MVP" wrote: > Instead of constructions such as: > > [0-9][0-9][0-9][0-9][0-9][0-9][0-9][0-9] , > > Use > > [0-9]{#} > > where # is the number of digits that you are seeking. or {#,} where you are > seeking at least # digits, {#,##} where you are seeking between # and ## > digits. > > -- > Hope this helps. > > Please reply to the newsgroup unless you wish to avail yourself of my > services on a paid consulting basis. > > Doug Robbins - Word MVP, originally posted via msnews.microsoft.com > > "George Lee" <GeorgeLee(a)discussions.microsoft.com> wrote in message > news:943E632F-1228-45FE-A75C-CA54F38CCCA9(a)microsoft.com... > > Simple cases: > > [0-9][0-9][0-9][0-9][0-9][0-9][0-9] ' OK > > [0-9]@[0-9]@[0-9]@[0-9]@[0-9]@[0-9]@[0-9]@ 'OK > > [0-9][0-9][0-9][0-9][0-9][0-9][0-9][0-9] 'too long > > > > From these it looks like seven brackets are the maximum. Is there > > confirmation of this somewhere? Is this the only condition? > > > > "Fumei2 via OfficeKB.com" wrote: > > > >> Can you post what the pattern is? > >> > >> George Lee wrote: > >> >"The Find What text contains a Pattern Match expression which is too > >> >complex." > >> > > >> >What is the rule for being too complex? I can't determine the rule just > >> >by > >> >playing with it. It's not character limited (other than 255), and it > >> >doesn't > >> >seem to be "item" limited (like no more than ten []{} pairing). > >> > >> -- > >> Gerry > >> > >> Message posted via OfficeKB.com > >> http://www.officekb.com/Uwe/Forums.aspx/word-programming/201003/1 > >> > >> . > >>
|
Next
|
Last
Pages: 1 2 Prev: Plural/Possessive Options Next: Insufficient memory and DisplayAlerts None |