I just want to add that I also seek the functionality that Robert suggested.
That is how I wound up here.

Question, do you have a tree to search and is that why identifiers can’t be split. Or could one be allowed to use grouping in the regexes??

Very difficult robot-test, extremely hard, this is my 10:th time trying to read it

struct Test
{
public int Value;
}

becomes:

struct Test : IEquatable
{
public int Value;

public bool Equals(Test other)
{
return other.Value == this.Value;
}

public override bool Equals(object obj)
{
if (ReferenceEquals(null, obj))
{
return false;
}
if (obj.GetType() != typeof(Test))
{
return false;
}
return Equals((Test)obj);
}

public override int GetHashCode()
{
return this.Value;
}

public static bool operator ==(TestMe left, TestMe right)
{
return left.Equals(right);
}

public static bool operator !=(TestMe left, TestMe right)
{
return !left.Equals(right);
}
}

There’s currently no way to get a search placeholder and divide it into two placeholders in the replace pattern. We’re working on making scenarios like yours possible but no schedules yet

public MyTypeName[] VarName {get; set; } // an array of MyTypeNames

and turn it into:

private readonly Collection varName = new Collection();
public Collection VarName {get{ return varName;}}

I am having trouble turning the Pascal Cased VarName to the Camel Cased varName. Any suggestions?
(real code is probably a little different as I just typed this in.)

i.e
(”string” is object) == true
but
(”string”.GetType() == typeof(object)) == false