Maybe they do actually read the nug: https://kb.4d.com/assetid=78301
On Thu, Aug 22, 2019 at 1:13 PM Chip Scheide via 4D_Tech < 4d_tech@lists.4d.com> wrote: > Given 2 strings, > I want to find, and return, the longest substring which is the same in > both, regardless where in either string the longest substring starts. > > ex: > 1- This is my dog > 2- My dog does not have fleas > longest common string is 'my dog' > > how to go about this, efficiently? > I am assuming that there is regex black magic that would do this. > > --------------- > Gas is for washing parts > Alcohol is for drinkin' > Nitromethane is for racing > ********************************************************************** > 4D Internet Users Group (4D iNUG) > Archive: http://lists.4d.com/archives.html > Options: https://lists.4d.com/mailman/options/4d_tech > Unsub: mailto:4d_tech-unsubscr...@lists.4d.com > ********************************************************************** -- Kirk Brooks San Francisco, CA ======================= What can be said, can be said clearly, and what you can’t say, you should shut up about *Wittgenstein and the Computer * ********************************************************************** 4D Internet Users Group (4D iNUG) Archive: http://lists.4d.com/archives.html Options: https://lists.4d.com/mailman/options/4d_tech Unsub: mailto:4d_tech-unsubscr...@lists.4d.com **********************************************************************
