Search Results

There might be some edge cases to consider, but you might approach it as follows. Create a replacement rule for each element of lis1 (and keep a list of such rules): replaceRules = (# ~~ ___ -> #) & / …

Select[lis,StringContainsQ[","]@*Last]

You introduce some confusion by setting Mystring to be a list Mystring = {"123456789"} Since List is such an important structure in Mathematica, many functions are designed to work naturally with Lis …

If your sample text is assigned to the symbol text, then you could do this: Select[Partition[TextWords[text], 2, 1], Apply[SameQ, ToLowerCase[StringPart[#, 1]]] &] Of course, this is a simplistic int …

StringTrim[#, StartOfString ~~ DigitCharacter ... ~~ WhitespaceCharacter ...] & /@ lis or StringTrim[#, RegularExpression["^\\d*\\s*"]] & /@ lis

I'd try something along these lines StringReplace[ text, RegularExpression["(?m)^whitenode(.*{a};$)"] -> "yellownode$1"] This solution relies on some assumptions. It doesn't account for extra wh …

This one passes all of the tests I've seen so far, but I'm still not actually sure it will work for what you want to use it for. SameOrderQ[full_, abbr_] := StringContainsQ[ StringJoin[DeleteCas …

Here's how I interpret the documentation: 1-1: "a", no match 1-2: "aa", no match 1-3: "aab", no match 1-4: "aabb", match rule "aabb"->"aab" 5-5: "a", no match 5-6: "aa", no match 5-7: "aaa", no match …

This is a more general implementation, and it happens to be a bit faster, although I'm not sure if that's what you meant by "efficient". It might require some explanation (see below). mergeAffixes[aff …

Decompose the problem. For example, "Make any 2-letter word uppercase" is a problem that you can probably solve (hint, there is a built in function for that). Now move on to "Make any 2-letter word up …

Here's an attempt: MyStringTemplate[form_String][repls__] := With[ {positions = StringPosition[form, "``"], stringRepls = ToString /@ {repls}}, StringReplacePart[form, PadRight[stringRe …

I might try MapIndexed. This assumes that each sublist at the first level has length 3. It could be modified if that's not the case. To show how MapIndexed might work, let's test with a dummy function …

I actually like StringTemplate for these kinds of things. It's nicely reusable as a function, like a curried StringForm (but it produces actual strings at the end). You also have the option of naming …

Let's put your transformation into a function for re-usability: func[str_] := str <> "H" Here's your input: input = "abcdEFGpcf" Now, we can use either string expressions or RegularExpression: Strin …

In version 13.2 StringRepeat[" ", 0] produces an empty string.