Say I have an item data that contains say a list of 1000 space-seperated 8 char hash values and I want to check if a specific hash is present. I'm guessing using isin would check at every position except when the current position is <8 from the $len of the data. And $matchtok would build a temp string but reading the chars sequentially until it hits the token seperator, then compares the hash against the temp string. If != then reset the temp string and continue. If that's the case then wouldn't $matchtok be faster because there would be less compares? Am I wrong in my guess of how isin/$matchtok works?