I’ve looked high and low and I don’t see anything that would suit my needs. I have two strings, A and B, and I want to check to see if string B is contained inside string A. For example A is Litterbox and B is Box. So in this instance B is contained inside of A and would return True.
I was going to write my own function to do the comparisons by splitting the A string out into an array of characters and looping from there low-level style, but I don’t think it’s possible, since using “Parse Into Array” doesn’t seem to allow a blank/empty separator.
Anyone have any suggestions?
As always, given the wonderful limitations of Blueprints, I may have to scratch this idea all together and just find a different workaround/method for what I’m trying to achieve in general.
Did you try doing “Get Substring”? You could set “Length” to the string length you are looking for, then increment an int for “Start Index” till it returns the string.
Yeah, great idea. Unfortunately in my daily work I’m usually dealing with one extreme or the other (as far as programming languages go) so it didn’t even occur to me to find a middle-ground. You rock.
There is actually a find substring node too. If the string is not found it should return -1 which is the default start search index, otherwise I think it returns the found index of the first letter in your string.