From: fizzbintuesday@that-google-mail-domain.com   
      
   JJ wrote:   
   > On Sun, 5 Sep 2021 12:53:16 -0400, Tom Del Rosso wrote:   
   >> JJ wrote:   
   >>> On Fri, 3 Sep 2021 03:07:18 -0400, Tom Del Rosso wrote:   
   >>>> JJ wrote:   
   >>>>> On Thu, 2 Sep 2021 03:08:01 -0400, Tom Del Rosso wrote:   
   >>>>>>   
   >>>>>> What does HasStr do? Find a substring?   
   >>>>>   
   >>>>> Yes. A sub to check the existence of a substring when the index of   
   >>>>> the substring doesn't matter. It's basically just a sub which   
   >>>>> finds the index of a substring.   
   >>>>   
   >>>> So you're thinking of doing it this way?   
   >>> [snip]   
   >>>   
   >>> Huh? Why are you using string lengths to check the existence of a   
   >>> substring?   
   >>   
   >> I don't know! I thought that was what you were suggesting when you   
   >> said:   
   >>   
   >> "The method could be used as a fast `HasStr` sub. :)"   
   >   
   > By "method", I meant the algorithm. Not the sub itself as is.   
   >   
   > But nevermind though, cause I found out that the divide-and-conquer   
   > algorithm can't be used as a faster substring search than sequential   
   > one.   
      
   If the objective is to find exactly where the substring exists then it   
   could actually be faster for a long string.   
      
   I mean using the asterisk in string substitution like below, and testing   
   the length of the result. Even more so if you already know the length of   
   the original string.   
      
   call set poststring=%%string:*%substring%=%%   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)