Modify casing of marked letters Announcing the arrival of Valued Associate #679: Cesar Manara Unicorn Meta Zoo #1: Why another podcast?Insert tags around entities in bodyOrganizing and visually duplicating imagesSprite animation handlerPython script to delete sections of textLazy String splitter in C++DailyProgrammer 284: Wandering FingersParsing Z80 assembler in C++Rich Edit Form Input (x86-16)Decode the Morse CodeFunction to parse .NET composite string format

What makes accurate emulation of old systems a difficult task?

Suing a Police Officer Instead of the Police Department

How to translate "red flag" into Spanish?

How to open locks without disable device?

All ASCII characters with a given bit count

My bank got bought out, am I now going to have to start filing tax returns in a different state?

First instead of 1 when referencing

Approximating integral with small parameter

What’s with the clanks at the end of the credits in Avengers: Endgame?

Does Mathematica have an implementation of the Poisson binomial distribution?

Are these square matrices always diagonalisable?

Are all CP/M-80 implementations binary compatible?

Could moose/elk survive in the Amazon forest?

Is there metaphorical meaning of "aus der Haft entlassen"?

Why doesn't the standard consider a template constructor as a copy constructor?

How would this chord from "Rocket Man" be analyzed?

How do I check if a string is entirely made of the same substring?

Multiple fireplaces in an apartment building?

Multiple options vs single option UI

Has a Nobel Peace laureate ever been accused of war crimes?

How can I wire a 9-position switch so that each position turns on one more LED than the one before?

Mistake in years of experience in resume?

Why do distances seem to matter in the Foundation world?

Is it possible to cast 2x Final Payment while sacrificing just one creature?



Modify casing of marked letters



Announcing the arrival of Valued Associate #679: Cesar Manara
Unicorn Meta Zoo #1: Why another podcast?Insert tags around entities in bodyOrganizing and visually duplicating imagesSprite animation handlerPython script to delete sections of textLazy String splitter in C++DailyProgrammer 284: Wandering FingersParsing Z80 assembler in C++Rich Edit Form Input (x86-16)Decode the Morse CodeFunction to parse .NET composite string format



.everyoneloves__top-leaderboard:empty,.everyoneloves__mid-leaderboard:empty,.everyoneloves__bot-mid-leaderboard:empty margin-bottom:0;








15












$begingroup$


Trying to learn coding in my 30s.



Could anybody review my code and give me some feedback if possible? It works, but I am sure there are better ways to solve this problem.



The problem:



A text is given. Write a program that modifies the casing of letters to uppercase at all places in the text surrounded by <upcase> and </upcase> tags. Tags cannot be nested.



Here is what I've come up with:



namespace Task6Casing

class Program

static void Main(string[] args)

Console.Write("Text: ");
string text = Console.ReadLine();

char[] textNew = new char[text.Length];

int i = 0, j = 0, k = 0;

while (i < text.Length)

if (text.IndexOf("<upcase>", k) < 0) // check if there is any <upcase> tag
// if no, copy everyting
while (i < text.Length)

textNew[j++] = text[i++];


else

while (i < text.IndexOf("<upcase>", k)) // if there is an <upcase> tag, copy letters until the tag

textNew[j++] = text[i++];


i += 8; // move index i to the position right next to the <upcase> tag
k = i;


if (text.IndexOf("</upcase>", k) < 0) // check if there is any </upcase> tag
// if no, copy everyting in CAPITAL letters
while (i < text.Length)

textNew[j++] = Char.ToUpper(text[i++]);


else

while (i < text.IndexOf("</upcase>", k)) // if there is an </upcase> tag, copy letters in CAP letters until the tag

textNew[j++] = Char.ToUpper(text[i++]);


i += 9; // move index i to the position right next to the </upcase> tag



foreach(char c in textNew)

Console.Write(c);

Console.WriteLine();













share|improve this question











$endgroup$


















    15












    $begingroup$


    Trying to learn coding in my 30s.



    Could anybody review my code and give me some feedback if possible? It works, but I am sure there are better ways to solve this problem.



    The problem:



    A text is given. Write a program that modifies the casing of letters to uppercase at all places in the text surrounded by <upcase> and </upcase> tags. Tags cannot be nested.



    Here is what I've come up with:



    namespace Task6Casing

    class Program

    static void Main(string[] args)

    Console.Write("Text: ");
    string text = Console.ReadLine();

    char[] textNew = new char[text.Length];

    int i = 0, j = 0, k = 0;

    while (i < text.Length)

    if (text.IndexOf("<upcase>", k) < 0) // check if there is any <upcase> tag
    // if no, copy everyting
    while (i < text.Length)

    textNew[j++] = text[i++];


    else

    while (i < text.IndexOf("<upcase>", k)) // if there is an <upcase> tag, copy letters until the tag

    textNew[j++] = text[i++];


    i += 8; // move index i to the position right next to the <upcase> tag
    k = i;


    if (text.IndexOf("</upcase>", k) < 0) // check if there is any </upcase> tag
    // if no, copy everyting in CAPITAL letters
    while (i < text.Length)

    textNew[j++] = Char.ToUpper(text[i++]);


    else

    while (i < text.IndexOf("</upcase>", k)) // if there is an </upcase> tag, copy letters in CAP letters until the tag

    textNew[j++] = Char.ToUpper(text[i++]);


    i += 9; // move index i to the position right next to the </upcase> tag



    foreach(char c in textNew)

    Console.Write(c);

    Console.WriteLine();













    share|improve this question











    $endgroup$














      15












      15








      15


      2



      $begingroup$


      Trying to learn coding in my 30s.



      Could anybody review my code and give me some feedback if possible? It works, but I am sure there are better ways to solve this problem.



      The problem:



      A text is given. Write a program that modifies the casing of letters to uppercase at all places in the text surrounded by <upcase> and </upcase> tags. Tags cannot be nested.



      Here is what I've come up with:



      namespace Task6Casing

      class Program

      static void Main(string[] args)

      Console.Write("Text: ");
      string text = Console.ReadLine();

      char[] textNew = new char[text.Length];

      int i = 0, j = 0, k = 0;

      while (i < text.Length)

      if (text.IndexOf("<upcase>", k) < 0) // check if there is any <upcase> tag
      // if no, copy everyting
      while (i < text.Length)

      textNew[j++] = text[i++];


      else

      while (i < text.IndexOf("<upcase>", k)) // if there is an <upcase> tag, copy letters until the tag

      textNew[j++] = text[i++];


      i += 8; // move index i to the position right next to the <upcase> tag
      k = i;


      if (text.IndexOf("</upcase>", k) < 0) // check if there is any </upcase> tag
      // if no, copy everyting in CAPITAL letters
      while (i < text.Length)

      textNew[j++] = Char.ToUpper(text[i++]);


      else

      while (i < text.IndexOf("</upcase>", k)) // if there is an </upcase> tag, copy letters in CAP letters until the tag

      textNew[j++] = Char.ToUpper(text[i++]);


      i += 9; // move index i to the position right next to the </upcase> tag



      foreach(char c in textNew)

      Console.Write(c);

      Console.WriteLine();













      share|improve this question











      $endgroup$




      Trying to learn coding in my 30s.



      Could anybody review my code and give me some feedback if possible? It works, but I am sure there are better ways to solve this problem.



      The problem:



      A text is given. Write a program that modifies the casing of letters to uppercase at all places in the text surrounded by <upcase> and </upcase> tags. Tags cannot be nested.



      Here is what I've come up with:



      namespace Task6Casing

      class Program

      static void Main(string[] args)

      Console.Write("Text: ");
      string text = Console.ReadLine();

      char[] textNew = new char[text.Length];

      int i = 0, j = 0, k = 0;

      while (i < text.Length)

      if (text.IndexOf("<upcase>", k) < 0) // check if there is any <upcase> tag
      // if no, copy everyting
      while (i < text.Length)

      textNew[j++] = text[i++];


      else

      while (i < text.IndexOf("<upcase>", k)) // if there is an <upcase> tag, copy letters until the tag

      textNew[j++] = text[i++];


      i += 8; // move index i to the position right next to the <upcase> tag
      k = i;


      if (text.IndexOf("</upcase>", k) < 0) // check if there is any </upcase> tag
      // if no, copy everyting in CAPITAL letters
      while (i < text.Length)

      textNew[j++] = Char.ToUpper(text[i++]);


      else

      while (i < text.IndexOf("</upcase>", k)) // if there is an </upcase> tag, copy letters in CAP letters until the tag

      textNew[j++] = Char.ToUpper(text[i++]);


      i += 9; // move index i to the position right next to the </upcase> tag



      foreach(char c in textNew)

      Console.Write(c);

      Console.WriteLine();










      c# beginner strings console






      share|improve this question















      share|improve this question













      share|improve this question




      share|improve this question








      edited Mar 26 at 17:46









      Sᴀᴍ Onᴇᴌᴀ

      10.7k62168




      10.7k62168










      asked Mar 26 at 10:13









      FreddyFreddy

      762




      762




















          3 Answers
          3






          active

          oldest

          votes


















          7












          $begingroup$

          Your code is easy to understand and very performant.



          Some improvements:



          • String for start / end tag could be stored as constant. That has the advantage that it can be changed on one central location and the length of the string can be accessed like i += START_TAG.Length

          • When using a StringBuilder instead of of the char array newText, the running variable 'j' can be dropped.

          • The 2 code parts


           if (text.IndexOf("<upcase>", k) < 0) // check if there is
          any <upcase> tag
          // if no, copy everyting
          while (i < text.Length)

          textNew[j++] = text[i++];


          else

          while (i < text.IndexOf("<upcase>", k)) // if there is an <upcase> tag, copy letters until the tag

          textNew[j++] = text[i++];


          i += 8; // move index i to the position right next to the <upcase> tag
          k = i;




          and




           if (text.IndexOf("</upcase>", k) < 0) // check if there is any </upcase> tag
          // if no, copy everyting in CAPITAL letters
          while (i < text.Length)

          textNew[j++] = Char.ToUpper(text[i++]);


          else

          while (i < text.IndexOf("</upcase>", k)) // if there is an </upcase> tag, copy letters in CAP letters until the tag

          textNew[j++] = Char.ToUpper(text[i++]);


          i += 9; // move index i to the position right next to the </upcase> tag




          are very simlar. Probably it is possible to create one more generic code fragment that coveres both cases.




          Since your solution is still understandable for such a simple use case, it will fast become unmaintainable if the use case becomes more complex. Therefore, it makes sense to think about a more abstract OOP concepts to model the solution.



          One alternative impl. (that is probably over engineered for the given problem) gives an idea how a more object oriented design could look like:



           public class Tag

          private readonly Func<char, char> map;
          public Tag(string start, string end, Func<char, char> map)

          this.Start = start;
          this.End = end;
          this.map = map;


          public string Start get;
          public string End get;
          public char Map(char input) => this.map(input);


          public class TagProcessor

          private readonly Tag tag;
          private readonly StringBuilder output = new StringBuilder();

          private string input;
          private bool isTagOpen;
          private int index;

          public TagProcessor(Tag tag)

          this.tag = tag;


          public string Process(string input)

          this.input = input;
          this.index = 0;
          this.isTagOpen = false;
          this.output.Clear();

          do

          var tagProcessed = this.TryOpenTag()
          while (this.MoveNext());

          return output.ToString();


          private bool IsEndTag() => input.IndexOf(tag.End, this.index) == this.index;

          private bool IsStartTag() => input.IndexOf(tag.Start, this.index) == this.index;

          private bool MoveNext()

          index++;
          return index < this.input.Length;


          private void ApplyCurrentChar()

          var inputChar = this.input[this.index];
          var transfomed = this.isTagOpen ? tag.Map(inputChar) : inputChar;
          this.output.Append(transfomed);


          private bool TryOpenTag()

          if (!isTagOpen && IsStartTag())

          this.index += this.tag.Start.Length - 1;
          this.isTagOpen = true;
          return true;


          return false;


          private bool TryCloseTag()

          if (isTagOpen && IsEndTag())

          this.index += this.tag.End.Length - 1;
          this.isTagOpen = false;
          return true;


          return false;



          public static void Main(string[] args)

          var processor = new TagProcessor(new Tag("<upcase>", "</upcase>", char.ToUpper));

          var test = new[]

          "abc<upcase>test</upcase>",
          "abc<upcase>test",
          "abc<upcase></upcase>test",
          "abc<upcase>test</upcase>test",
          "abc<upcase>te<upcase>st</upcase>test",
          "a</upcase>bc<upcase>te<upcase>st</upcase>te</upcase>st",
          ;

          foreach (var t in test)
          Console.WriteLine(t + ": " + processor.Process(t));
          Console.ReadLine();



          The advantages are, that this solution remains readable if the complexity grows (e.g. more tags were added) and it allows to change / extend the logic without understanding the whole parsing logic. Further more, each method has a single pupose which increases comprehensibleness.






          share|improve this answer











          $endgroup$




















            4












            $begingroup$

            This loop



             while (i < text.IndexOf("<upcase>", k))

            ....



            invokes IndexOf multiple times for nothing. I'd call it just once and use the result:



             const int upcasePos = text.IndexOf("<upcase>", k);
            if (upcasePos < 0)

            while (i < text.Length)

            textNew[j++] = text[i++];


            else

            while (i < upcasePos)

            textNew[j++] = text[i++];


            ....



            Edit



            You can also speed things up by getting rid of char-by-char iteration, and instead processing longer parts of the string at once with standard routines.
            Here's an outline:



             StringBuilder sb = new StringBuilder();

            for (int k = 0; k < text.length; )

            int tagOpen = text.IndexOf("<upcase>", k));
            if (tagOpen < 0)

            sb.Append(text.Substring(k)); // take the tail
            break;


            sb.Append(text.Substring(k, tagOpen - k));
            k = tagOpen + 8; // skip the tag

            int tagClose = text.IndexOf("</upcase>", k));
            if (tagClose < 0)

            sb.Append(text.Substring(k).toUpper()); // take the tail in upper case
            break;


            sb.Append(text.Substring(k, tagClose - k).toUpper());
            k = tagClose + 9; // skip the tag


            result = sb.ToString(); // return this





            share|improve this answer











            $endgroup$




















              3












              $begingroup$

              Below is a refactoring of your algorithm with some inline comments.



              string Review(string text)

              const string startTag = "<upcase>"; // Use declared string rather than string literals
              const string endTag = "</upcase>";

              // textNew is a somewhat "backward" name. result or newText would be better
              char[] result = new char[text.Length];
              // Instantiate each variable on a single line. It's easier to find and maintain
              // Provide some meaningful names instead for i, j and k. (i, j and k may be alright in a lessser complex context, but here they easily lose their meaining through the loop)
              int curIndex = 0;
              int resultIndex = 0;
              int searchIndex = 0;

              while (curIndex < text.Length)

              if (text.IndexOf(startTag, searchIndex) < 0)

              while (curIndex < text.Length)

              result[resultIndex++] = text[curIndex++];


              else

              // Repeatedly calling the same function with the same values is inefficient
              int startIndex = text.IndexOf(startTag, searchIndex);
              while (curIndex < startIndex)

              result[resultIndex++] = text[curIndex++];


              curIndex += startTag.Length; // Use the length of the tag string instead of a magic number
              searchIndex = curIndex;


              if (text.IndexOf(endTag, searchIndex) < 0)

              while (curIndex < text.Length)

              result[resultIndex++] = Char.ToUpper(text[curIndex++]);


              else

              // Repeatedly calling the same function with the same values is inefficient
              int endIndex = text.IndexOf(endTag, searchIndex);
              while (curIndex < endIndex)

              result[resultIndex++] = Char.ToUpper(text[curIndex++]);


              curIndex += endTag.Length; // Use the length of the tag string instead of a magic number



              // Return the result instead of write it to the console.
              return new string(result.Take(resultIndex).ToArray()); // You have to truncate the char array in order to prevent a trailing new line
              //OR: return new string(textNew).TrimEnd('');




              Below is some other approaches that you may find useful for inspiration:



              string ToUpperInTags(string text)

              const string start = "<upcase>";
              const string stop = "</upcase>";

              List<string> fragments = new List<string>();
              int curIndex = 0;
              while (curIndex < text.Length)

              int startIndex = text.IndexOf(start, curIndex);
              if (startIndex >= 0)

              fragments.Add(text.Substring(curIndex, startIndex - curIndex));
              int stopIndex = text.IndexOf(stop, startIndex + start.Length);
              if (stopIndex < 0) throw new InvalidOperationException($"Unpaired start at startIndex");
              fragments.Add(text.Substring(startIndex + start.Length, stopIndex - (startIndex + start.Length)).ToUpper());
              curIndex = stopIndex + stop.Length;

              else

              fragments.Add(text.Substring(curIndex));
              break;



              return string.Join("", fragments);


              string ToUpperInTags2(string text)

              string pattern = @"(?<start><upcase>)(?<content>[^<>]*)(?<stop></upcase>)?";
              foreach (Match match in Regex.Matches(text, pattern))

              text = Regex.Replace(text, $"match.Groups["start"]match.Groups["content"]match.Groups["stop"]", match.Groups["content"].Value.ToUpper());


              return text;


              string ToUpperInTags3(string text)

              string pattern = @"<upcase>(?<content>[^<>]*)(</upcase>)?";
              return Regex.Replace(text, pattern, m => m.Groups["content"].Value.ToUpper());



              They don't all behave exactly as yours, and are just provided for inspiration for further study...






              share|improve this answer











              $endgroup$













                Your Answer






                StackExchange.ifUsing("editor", function ()
                StackExchange.using("externalEditor", function ()
                StackExchange.using("snippets", function ()
                StackExchange.snippets.init();
                );
                );
                , "code-snippets");

                StackExchange.ready(function()
                var channelOptions =
                tags: "".split(" "),
                id: "196"
                ;
                initTagRenderer("".split(" "), "".split(" "), channelOptions);

                StackExchange.using("externalEditor", function()
                // Have to fire editor after snippets, if snippets enabled
                if (StackExchange.settings.snippets.snippetsEnabled)
                StackExchange.using("snippets", function()
                createEditor();
                );

                else
                createEditor();

                );

                function createEditor()
                StackExchange.prepareEditor(
                heartbeatType: 'answer',
                autoActivateHeartbeat: false,
                convertImagesToLinks: false,
                noModals: true,
                showLowRepImageUploadWarning: true,
                reputationToPostImages: null,
                bindNavPrevention: true,
                postfix: "",
                imageUploader:
                brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
                contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
                allowUrls: true
                ,
                onDemand: true,
                discardSelector: ".discard-answer"
                ,immediatelyShowMarkdownHelp:true
                );



                );













                draft saved

                draft discarded


















                StackExchange.ready(
                function ()
                StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcodereview.stackexchange.com%2fquestions%2f216232%2fmodify-casing-of-marked-letters%23new-answer', 'question_page');

                );

                Post as a guest















                Required, but never shown

























                3 Answers
                3






                active

                oldest

                votes








                3 Answers
                3






                active

                oldest

                votes









                active

                oldest

                votes






                active

                oldest

                votes









                7












                $begingroup$

                Your code is easy to understand and very performant.



                Some improvements:



                • String for start / end tag could be stored as constant. That has the advantage that it can be changed on one central location and the length of the string can be accessed like i += START_TAG.Length

                • When using a StringBuilder instead of of the char array newText, the running variable 'j' can be dropped.

                • The 2 code parts


                 if (text.IndexOf("<upcase>", k) < 0) // check if there is
                any <upcase> tag
                // if no, copy everyting
                while (i < text.Length)

                textNew[j++] = text[i++];


                else

                while (i < text.IndexOf("<upcase>", k)) // if there is an <upcase> tag, copy letters until the tag

                textNew[j++] = text[i++];


                i += 8; // move index i to the position right next to the <upcase> tag
                k = i;




                and




                 if (text.IndexOf("</upcase>", k) < 0) // check if there is any </upcase> tag
                // if no, copy everyting in CAPITAL letters
                while (i < text.Length)

                textNew[j++] = Char.ToUpper(text[i++]);


                else

                while (i < text.IndexOf("</upcase>", k)) // if there is an </upcase> tag, copy letters in CAP letters until the tag

                textNew[j++] = Char.ToUpper(text[i++]);


                i += 9; // move index i to the position right next to the </upcase> tag




                are very simlar. Probably it is possible to create one more generic code fragment that coveres both cases.




                Since your solution is still understandable for such a simple use case, it will fast become unmaintainable if the use case becomes more complex. Therefore, it makes sense to think about a more abstract OOP concepts to model the solution.



                One alternative impl. (that is probably over engineered for the given problem) gives an idea how a more object oriented design could look like:



                 public class Tag

                private readonly Func<char, char> map;
                public Tag(string start, string end, Func<char, char> map)

                this.Start = start;
                this.End = end;
                this.map = map;


                public string Start get;
                public string End get;
                public char Map(char input) => this.map(input);


                public class TagProcessor

                private readonly Tag tag;
                private readonly StringBuilder output = new StringBuilder();

                private string input;
                private bool isTagOpen;
                private int index;

                public TagProcessor(Tag tag)

                this.tag = tag;


                public string Process(string input)

                this.input = input;
                this.index = 0;
                this.isTagOpen = false;
                this.output.Clear();

                do

                var tagProcessed = this.TryOpenTag()
                while (this.MoveNext());

                return output.ToString();


                private bool IsEndTag() => input.IndexOf(tag.End, this.index) == this.index;

                private bool IsStartTag() => input.IndexOf(tag.Start, this.index) == this.index;

                private bool MoveNext()

                index++;
                return index < this.input.Length;


                private void ApplyCurrentChar()

                var inputChar = this.input[this.index];
                var transfomed = this.isTagOpen ? tag.Map(inputChar) : inputChar;
                this.output.Append(transfomed);


                private bool TryOpenTag()

                if (!isTagOpen && IsStartTag())

                this.index += this.tag.Start.Length - 1;
                this.isTagOpen = true;
                return true;


                return false;


                private bool TryCloseTag()

                if (isTagOpen && IsEndTag())

                this.index += this.tag.End.Length - 1;
                this.isTagOpen = false;
                return true;


                return false;



                public static void Main(string[] args)

                var processor = new TagProcessor(new Tag("<upcase>", "</upcase>", char.ToUpper));

                var test = new[]

                "abc<upcase>test</upcase>",
                "abc<upcase>test",
                "abc<upcase></upcase>test",
                "abc<upcase>test</upcase>test",
                "abc<upcase>te<upcase>st</upcase>test",
                "a</upcase>bc<upcase>te<upcase>st</upcase>te</upcase>st",
                ;

                foreach (var t in test)
                Console.WriteLine(t + ": " + processor.Process(t));
                Console.ReadLine();



                The advantages are, that this solution remains readable if the complexity grows (e.g. more tags were added) and it allows to change / extend the logic without understanding the whole parsing logic. Further more, each method has a single pupose which increases comprehensibleness.






                share|improve this answer











                $endgroup$

















                  7












                  $begingroup$

                  Your code is easy to understand and very performant.



                  Some improvements:



                  • String for start / end tag could be stored as constant. That has the advantage that it can be changed on one central location and the length of the string can be accessed like i += START_TAG.Length

                  • When using a StringBuilder instead of of the char array newText, the running variable 'j' can be dropped.

                  • The 2 code parts


                   if (text.IndexOf("<upcase>", k) < 0) // check if there is
                  any <upcase> tag
                  // if no, copy everyting
                  while (i < text.Length)

                  textNew[j++] = text[i++];


                  else

                  while (i < text.IndexOf("<upcase>", k)) // if there is an <upcase> tag, copy letters until the tag

                  textNew[j++] = text[i++];


                  i += 8; // move index i to the position right next to the <upcase> tag
                  k = i;




                  and




                   if (text.IndexOf("</upcase>", k) < 0) // check if there is any </upcase> tag
                  // if no, copy everyting in CAPITAL letters
                  while (i < text.Length)

                  textNew[j++] = Char.ToUpper(text[i++]);


                  else

                  while (i < text.IndexOf("</upcase>", k)) // if there is an </upcase> tag, copy letters in CAP letters until the tag

                  textNew[j++] = Char.ToUpper(text[i++]);


                  i += 9; // move index i to the position right next to the </upcase> tag




                  are very simlar. Probably it is possible to create one more generic code fragment that coveres both cases.




                  Since your solution is still understandable for such a simple use case, it will fast become unmaintainable if the use case becomes more complex. Therefore, it makes sense to think about a more abstract OOP concepts to model the solution.



                  One alternative impl. (that is probably over engineered for the given problem) gives an idea how a more object oriented design could look like:



                   public class Tag

                  private readonly Func<char, char> map;
                  public Tag(string start, string end, Func<char, char> map)

                  this.Start = start;
                  this.End = end;
                  this.map = map;


                  public string Start get;
                  public string End get;
                  public char Map(char input) => this.map(input);


                  public class TagProcessor

                  private readonly Tag tag;
                  private readonly StringBuilder output = new StringBuilder();

                  private string input;
                  private bool isTagOpen;
                  private int index;

                  public TagProcessor(Tag tag)

                  this.tag = tag;


                  public string Process(string input)

                  this.input = input;
                  this.index = 0;
                  this.isTagOpen = false;
                  this.output.Clear();

                  do

                  var tagProcessed = this.TryOpenTag()
                  while (this.MoveNext());

                  return output.ToString();


                  private bool IsEndTag() => input.IndexOf(tag.End, this.index) == this.index;

                  private bool IsStartTag() => input.IndexOf(tag.Start, this.index) == this.index;

                  private bool MoveNext()

                  index++;
                  return index < this.input.Length;


                  private void ApplyCurrentChar()

                  var inputChar = this.input[this.index];
                  var transfomed = this.isTagOpen ? tag.Map(inputChar) : inputChar;
                  this.output.Append(transfomed);


                  private bool TryOpenTag()

                  if (!isTagOpen && IsStartTag())

                  this.index += this.tag.Start.Length - 1;
                  this.isTagOpen = true;
                  return true;


                  return false;


                  private bool TryCloseTag()

                  if (isTagOpen && IsEndTag())

                  this.index += this.tag.End.Length - 1;
                  this.isTagOpen = false;
                  return true;


                  return false;



                  public static void Main(string[] args)

                  var processor = new TagProcessor(new Tag("<upcase>", "</upcase>", char.ToUpper));

                  var test = new[]

                  "abc<upcase>test</upcase>",
                  "abc<upcase>test",
                  "abc<upcase></upcase>test",
                  "abc<upcase>test</upcase>test",
                  "abc<upcase>te<upcase>st</upcase>test",
                  "a</upcase>bc<upcase>te<upcase>st</upcase>te</upcase>st",
                  ;

                  foreach (var t in test)
                  Console.WriteLine(t + ": " + processor.Process(t));
                  Console.ReadLine();



                  The advantages are, that this solution remains readable if the complexity grows (e.g. more tags were added) and it allows to change / extend the logic without understanding the whole parsing logic. Further more, each method has a single pupose which increases comprehensibleness.






                  share|improve this answer











                  $endgroup$















                    7












                    7








                    7





                    $begingroup$

                    Your code is easy to understand and very performant.



                    Some improvements:



                    • String for start / end tag could be stored as constant. That has the advantage that it can be changed on one central location and the length of the string can be accessed like i += START_TAG.Length

                    • When using a StringBuilder instead of of the char array newText, the running variable 'j' can be dropped.

                    • The 2 code parts


                     if (text.IndexOf("<upcase>", k) < 0) // check if there is
                    any <upcase> tag
                    // if no, copy everyting
                    while (i < text.Length)

                    textNew[j++] = text[i++];


                    else

                    while (i < text.IndexOf("<upcase>", k)) // if there is an <upcase> tag, copy letters until the tag

                    textNew[j++] = text[i++];


                    i += 8; // move index i to the position right next to the <upcase> tag
                    k = i;




                    and




                     if (text.IndexOf("</upcase>", k) < 0) // check if there is any </upcase> tag
                    // if no, copy everyting in CAPITAL letters
                    while (i < text.Length)

                    textNew[j++] = Char.ToUpper(text[i++]);


                    else

                    while (i < text.IndexOf("</upcase>", k)) // if there is an </upcase> tag, copy letters in CAP letters until the tag

                    textNew[j++] = Char.ToUpper(text[i++]);


                    i += 9; // move index i to the position right next to the </upcase> tag




                    are very simlar. Probably it is possible to create one more generic code fragment that coveres both cases.




                    Since your solution is still understandable for such a simple use case, it will fast become unmaintainable if the use case becomes more complex. Therefore, it makes sense to think about a more abstract OOP concepts to model the solution.



                    One alternative impl. (that is probably over engineered for the given problem) gives an idea how a more object oriented design could look like:



                     public class Tag

                    private readonly Func<char, char> map;
                    public Tag(string start, string end, Func<char, char> map)

                    this.Start = start;
                    this.End = end;
                    this.map = map;


                    public string Start get;
                    public string End get;
                    public char Map(char input) => this.map(input);


                    public class TagProcessor

                    private readonly Tag tag;
                    private readonly StringBuilder output = new StringBuilder();

                    private string input;
                    private bool isTagOpen;
                    private int index;

                    public TagProcessor(Tag tag)

                    this.tag = tag;


                    public string Process(string input)

                    this.input = input;
                    this.index = 0;
                    this.isTagOpen = false;
                    this.output.Clear();

                    do

                    var tagProcessed = this.TryOpenTag()
                    while (this.MoveNext());

                    return output.ToString();


                    private bool IsEndTag() => input.IndexOf(tag.End, this.index) == this.index;

                    private bool IsStartTag() => input.IndexOf(tag.Start, this.index) == this.index;

                    private bool MoveNext()

                    index++;
                    return index < this.input.Length;


                    private void ApplyCurrentChar()

                    var inputChar = this.input[this.index];
                    var transfomed = this.isTagOpen ? tag.Map(inputChar) : inputChar;
                    this.output.Append(transfomed);


                    private bool TryOpenTag()

                    if (!isTagOpen && IsStartTag())

                    this.index += this.tag.Start.Length - 1;
                    this.isTagOpen = true;
                    return true;


                    return false;


                    private bool TryCloseTag()

                    if (isTagOpen && IsEndTag())

                    this.index += this.tag.End.Length - 1;
                    this.isTagOpen = false;
                    return true;


                    return false;



                    public static void Main(string[] args)

                    var processor = new TagProcessor(new Tag("<upcase>", "</upcase>", char.ToUpper));

                    var test = new[]

                    "abc<upcase>test</upcase>",
                    "abc<upcase>test",
                    "abc<upcase></upcase>test",
                    "abc<upcase>test</upcase>test",
                    "abc<upcase>te<upcase>st</upcase>test",
                    "a</upcase>bc<upcase>te<upcase>st</upcase>te</upcase>st",
                    ;

                    foreach (var t in test)
                    Console.WriteLine(t + ": " + processor.Process(t));
                    Console.ReadLine();



                    The advantages are, that this solution remains readable if the complexity grows (e.g. more tags were added) and it allows to change / extend the logic without understanding the whole parsing logic. Further more, each method has a single pupose which increases comprehensibleness.






                    share|improve this answer











                    $endgroup$



                    Your code is easy to understand and very performant.



                    Some improvements:



                    • String for start / end tag could be stored as constant. That has the advantage that it can be changed on one central location and the length of the string can be accessed like i += START_TAG.Length

                    • When using a StringBuilder instead of of the char array newText, the running variable 'j' can be dropped.

                    • The 2 code parts


                     if (text.IndexOf("<upcase>", k) < 0) // check if there is
                    any <upcase> tag
                    // if no, copy everyting
                    while (i < text.Length)

                    textNew[j++] = text[i++];


                    else

                    while (i < text.IndexOf("<upcase>", k)) // if there is an <upcase> tag, copy letters until the tag

                    textNew[j++] = text[i++];


                    i += 8; // move index i to the position right next to the <upcase> tag
                    k = i;




                    and




                     if (text.IndexOf("</upcase>", k) < 0) // check if there is any </upcase> tag
                    // if no, copy everyting in CAPITAL letters
                    while (i < text.Length)

                    textNew[j++] = Char.ToUpper(text[i++]);


                    else

                    while (i < text.IndexOf("</upcase>", k)) // if there is an </upcase> tag, copy letters in CAP letters until the tag

                    textNew[j++] = Char.ToUpper(text[i++]);


                    i += 9; // move index i to the position right next to the </upcase> tag




                    are very simlar. Probably it is possible to create one more generic code fragment that coveres both cases.




                    Since your solution is still understandable for such a simple use case, it will fast become unmaintainable if the use case becomes more complex. Therefore, it makes sense to think about a more abstract OOP concepts to model the solution.



                    One alternative impl. (that is probably over engineered for the given problem) gives an idea how a more object oriented design could look like:



                     public class Tag

                    private readonly Func<char, char> map;
                    public Tag(string start, string end, Func<char, char> map)

                    this.Start = start;
                    this.End = end;
                    this.map = map;


                    public string Start get;
                    public string End get;
                    public char Map(char input) => this.map(input);


                    public class TagProcessor

                    private readonly Tag tag;
                    private readonly StringBuilder output = new StringBuilder();

                    private string input;
                    private bool isTagOpen;
                    private int index;

                    public TagProcessor(Tag tag)

                    this.tag = tag;


                    public string Process(string input)

                    this.input = input;
                    this.index = 0;
                    this.isTagOpen = false;
                    this.output.Clear();

                    do

                    var tagProcessed = this.TryOpenTag()
                    while (this.MoveNext());

                    return output.ToString();


                    private bool IsEndTag() => input.IndexOf(tag.End, this.index) == this.index;

                    private bool IsStartTag() => input.IndexOf(tag.Start, this.index) == this.index;

                    private bool MoveNext()

                    index++;
                    return index < this.input.Length;


                    private void ApplyCurrentChar()

                    var inputChar = this.input[this.index];
                    var transfomed = this.isTagOpen ? tag.Map(inputChar) : inputChar;
                    this.output.Append(transfomed);


                    private bool TryOpenTag()

                    if (!isTagOpen && IsStartTag())

                    this.index += this.tag.Start.Length - 1;
                    this.isTagOpen = true;
                    return true;


                    return false;


                    private bool TryCloseTag()

                    if (isTagOpen && IsEndTag())

                    this.index += this.tag.End.Length - 1;
                    this.isTagOpen = false;
                    return true;


                    return false;



                    public static void Main(string[] args)

                    var processor = new TagProcessor(new Tag("<upcase>", "</upcase>", char.ToUpper));

                    var test = new[]

                    "abc<upcase>test</upcase>",
                    "abc<upcase>test",
                    "abc<upcase></upcase>test",
                    "abc<upcase>test</upcase>test",
                    "abc<upcase>te<upcase>st</upcase>test",
                    "a</upcase>bc<upcase>te<upcase>st</upcase>te</upcase>st",
                    ;

                    foreach (var t in test)
                    Console.WriteLine(t + ": " + processor.Process(t));
                    Console.ReadLine();



                    The advantages are, that this solution remains readable if the complexity grows (e.g. more tags were added) and it allows to change / extend the logic without understanding the whole parsing logic. Further more, each method has a single pupose which increases comprehensibleness.







                    share|improve this answer














                    share|improve this answer



                    share|improve this answer








                    edited Mar 26 at 11:53

























                    answered Mar 26 at 11:43









                    JanDotNetJanDotNet

                    7,0381339




                    7,0381339























                        4












                        $begingroup$

                        This loop



                         while (i < text.IndexOf("<upcase>", k))

                        ....



                        invokes IndexOf multiple times for nothing. I'd call it just once and use the result:



                         const int upcasePos = text.IndexOf("<upcase>", k);
                        if (upcasePos < 0)

                        while (i < text.Length)

                        textNew[j++] = text[i++];


                        else

                        while (i < upcasePos)

                        textNew[j++] = text[i++];


                        ....



                        Edit



                        You can also speed things up by getting rid of char-by-char iteration, and instead processing longer parts of the string at once with standard routines.
                        Here's an outline:



                         StringBuilder sb = new StringBuilder();

                        for (int k = 0; k < text.length; )

                        int tagOpen = text.IndexOf("<upcase>", k));
                        if (tagOpen < 0)

                        sb.Append(text.Substring(k)); // take the tail
                        break;


                        sb.Append(text.Substring(k, tagOpen - k));
                        k = tagOpen + 8; // skip the tag

                        int tagClose = text.IndexOf("</upcase>", k));
                        if (tagClose < 0)

                        sb.Append(text.Substring(k).toUpper()); // take the tail in upper case
                        break;


                        sb.Append(text.Substring(k, tagClose - k).toUpper());
                        k = tagClose + 9; // skip the tag


                        result = sb.ToString(); // return this





                        share|improve this answer











                        $endgroup$

















                          4












                          $begingroup$

                          This loop



                           while (i < text.IndexOf("<upcase>", k))

                          ....



                          invokes IndexOf multiple times for nothing. I'd call it just once and use the result:



                           const int upcasePos = text.IndexOf("<upcase>", k);
                          if (upcasePos < 0)

                          while (i < text.Length)

                          textNew[j++] = text[i++];


                          else

                          while (i < upcasePos)

                          textNew[j++] = text[i++];


                          ....



                          Edit



                          You can also speed things up by getting rid of char-by-char iteration, and instead processing longer parts of the string at once with standard routines.
                          Here's an outline:



                           StringBuilder sb = new StringBuilder();

                          for (int k = 0; k < text.length; )

                          int tagOpen = text.IndexOf("<upcase>", k));
                          if (tagOpen < 0)

                          sb.Append(text.Substring(k)); // take the tail
                          break;


                          sb.Append(text.Substring(k, tagOpen - k));
                          k = tagOpen + 8; // skip the tag

                          int tagClose = text.IndexOf("</upcase>", k));
                          if (tagClose < 0)

                          sb.Append(text.Substring(k).toUpper()); // take the tail in upper case
                          break;


                          sb.Append(text.Substring(k, tagClose - k).toUpper());
                          k = tagClose + 9; // skip the tag


                          result = sb.ToString(); // return this





                          share|improve this answer











                          $endgroup$















                            4












                            4








                            4





                            $begingroup$

                            This loop



                             while (i < text.IndexOf("<upcase>", k))

                            ....



                            invokes IndexOf multiple times for nothing. I'd call it just once and use the result:



                             const int upcasePos = text.IndexOf("<upcase>", k);
                            if (upcasePos < 0)

                            while (i < text.Length)

                            textNew[j++] = text[i++];


                            else

                            while (i < upcasePos)

                            textNew[j++] = text[i++];


                            ....



                            Edit



                            You can also speed things up by getting rid of char-by-char iteration, and instead processing longer parts of the string at once with standard routines.
                            Here's an outline:



                             StringBuilder sb = new StringBuilder();

                            for (int k = 0; k < text.length; )

                            int tagOpen = text.IndexOf("<upcase>", k));
                            if (tagOpen < 0)

                            sb.Append(text.Substring(k)); // take the tail
                            break;


                            sb.Append(text.Substring(k, tagOpen - k));
                            k = tagOpen + 8; // skip the tag

                            int tagClose = text.IndexOf("</upcase>", k));
                            if (tagClose < 0)

                            sb.Append(text.Substring(k).toUpper()); // take the tail in upper case
                            break;


                            sb.Append(text.Substring(k, tagClose - k).toUpper());
                            k = tagClose + 9; // skip the tag


                            result = sb.ToString(); // return this





                            share|improve this answer











                            $endgroup$



                            This loop



                             while (i < text.IndexOf("<upcase>", k))

                            ....



                            invokes IndexOf multiple times for nothing. I'd call it just once and use the result:



                             const int upcasePos = text.IndexOf("<upcase>", k);
                            if (upcasePos < 0)

                            while (i < text.Length)

                            textNew[j++] = text[i++];


                            else

                            while (i < upcasePos)

                            textNew[j++] = text[i++];


                            ....



                            Edit



                            You can also speed things up by getting rid of char-by-char iteration, and instead processing longer parts of the string at once with standard routines.
                            Here's an outline:



                             StringBuilder sb = new StringBuilder();

                            for (int k = 0; k < text.length; )

                            int tagOpen = text.IndexOf("<upcase>", k));
                            if (tagOpen < 0)

                            sb.Append(text.Substring(k)); // take the tail
                            break;


                            sb.Append(text.Substring(k, tagOpen - k));
                            k = tagOpen + 8; // skip the tag

                            int tagClose = text.IndexOf("</upcase>", k));
                            if (tagClose < 0)

                            sb.Append(text.Substring(k).toUpper()); // take the tail in upper case
                            break;


                            sb.Append(text.Substring(k, tagClose - k).toUpper());
                            k = tagClose + 9; // skip the tag


                            result = sb.ToString(); // return this






                            share|improve this answer














                            share|improve this answer



                            share|improve this answer








                            edited Mar 26 at 17:55

























                            answered Mar 26 at 13:44









                            CiaPanCiaPan

                            1,3971513




                            1,3971513





















                                3












                                $begingroup$

                                Below is a refactoring of your algorithm with some inline comments.



                                string Review(string text)

                                const string startTag = "<upcase>"; // Use declared string rather than string literals
                                const string endTag = "</upcase>";

                                // textNew is a somewhat "backward" name. result or newText would be better
                                char[] result = new char[text.Length];
                                // Instantiate each variable on a single line. It's easier to find and maintain
                                // Provide some meaningful names instead for i, j and k. (i, j and k may be alright in a lessser complex context, but here they easily lose their meaining through the loop)
                                int curIndex = 0;
                                int resultIndex = 0;
                                int searchIndex = 0;

                                while (curIndex < text.Length)

                                if (text.IndexOf(startTag, searchIndex) < 0)

                                while (curIndex < text.Length)

                                result[resultIndex++] = text[curIndex++];


                                else

                                // Repeatedly calling the same function with the same values is inefficient
                                int startIndex = text.IndexOf(startTag, searchIndex);
                                while (curIndex < startIndex)

                                result[resultIndex++] = text[curIndex++];


                                curIndex += startTag.Length; // Use the length of the tag string instead of a magic number
                                searchIndex = curIndex;


                                if (text.IndexOf(endTag, searchIndex) < 0)

                                while (curIndex < text.Length)

                                result[resultIndex++] = Char.ToUpper(text[curIndex++]);


                                else

                                // Repeatedly calling the same function with the same values is inefficient
                                int endIndex = text.IndexOf(endTag, searchIndex);
                                while (curIndex < endIndex)

                                result[resultIndex++] = Char.ToUpper(text[curIndex++]);


                                curIndex += endTag.Length; // Use the length of the tag string instead of a magic number



                                // Return the result instead of write it to the console.
                                return new string(result.Take(resultIndex).ToArray()); // You have to truncate the char array in order to prevent a trailing new line
                                //OR: return new string(textNew).TrimEnd('');




                                Below is some other approaches that you may find useful for inspiration:



                                string ToUpperInTags(string text)

                                const string start = "<upcase>";
                                const string stop = "</upcase>";

                                List<string> fragments = new List<string>();
                                int curIndex = 0;
                                while (curIndex < text.Length)

                                int startIndex = text.IndexOf(start, curIndex);
                                if (startIndex >= 0)

                                fragments.Add(text.Substring(curIndex, startIndex - curIndex));
                                int stopIndex = text.IndexOf(stop, startIndex + start.Length);
                                if (stopIndex < 0) throw new InvalidOperationException($"Unpaired start at startIndex");
                                fragments.Add(text.Substring(startIndex + start.Length, stopIndex - (startIndex + start.Length)).ToUpper());
                                curIndex = stopIndex + stop.Length;

                                else

                                fragments.Add(text.Substring(curIndex));
                                break;



                                return string.Join("", fragments);


                                string ToUpperInTags2(string text)

                                string pattern = @"(?<start><upcase>)(?<content>[^<>]*)(?<stop></upcase>)?";
                                foreach (Match match in Regex.Matches(text, pattern))

                                text = Regex.Replace(text, $"match.Groups["start"]match.Groups["content"]match.Groups["stop"]", match.Groups["content"].Value.ToUpper());


                                return text;


                                string ToUpperInTags3(string text)

                                string pattern = @"<upcase>(?<content>[^<>]*)(</upcase>)?";
                                return Regex.Replace(text, pattern, m => m.Groups["content"].Value.ToUpper());



                                They don't all behave exactly as yours, and are just provided for inspiration for further study...






                                share|improve this answer











                                $endgroup$

















                                  3












                                  $begingroup$

                                  Below is a refactoring of your algorithm with some inline comments.



                                  string Review(string text)

                                  const string startTag = "<upcase>"; // Use declared string rather than string literals
                                  const string endTag = "</upcase>";

                                  // textNew is a somewhat "backward" name. result or newText would be better
                                  char[] result = new char[text.Length];
                                  // Instantiate each variable on a single line. It's easier to find and maintain
                                  // Provide some meaningful names instead for i, j and k. (i, j and k may be alright in a lessser complex context, but here they easily lose their meaining through the loop)
                                  int curIndex = 0;
                                  int resultIndex = 0;
                                  int searchIndex = 0;

                                  while (curIndex < text.Length)

                                  if (text.IndexOf(startTag, searchIndex) < 0)

                                  while (curIndex < text.Length)

                                  result[resultIndex++] = text[curIndex++];


                                  else

                                  // Repeatedly calling the same function with the same values is inefficient
                                  int startIndex = text.IndexOf(startTag, searchIndex);
                                  while (curIndex < startIndex)

                                  result[resultIndex++] = text[curIndex++];


                                  curIndex += startTag.Length; // Use the length of the tag string instead of a magic number
                                  searchIndex = curIndex;


                                  if (text.IndexOf(endTag, searchIndex) < 0)

                                  while (curIndex < text.Length)

                                  result[resultIndex++] = Char.ToUpper(text[curIndex++]);


                                  else

                                  // Repeatedly calling the same function with the same values is inefficient
                                  int endIndex = text.IndexOf(endTag, searchIndex);
                                  while (curIndex < endIndex)

                                  result[resultIndex++] = Char.ToUpper(text[curIndex++]);


                                  curIndex += endTag.Length; // Use the length of the tag string instead of a magic number



                                  // Return the result instead of write it to the console.
                                  return new string(result.Take(resultIndex).ToArray()); // You have to truncate the char array in order to prevent a trailing new line
                                  //OR: return new string(textNew).TrimEnd('');




                                  Below is some other approaches that you may find useful for inspiration:



                                  string ToUpperInTags(string text)

                                  const string start = "<upcase>";
                                  const string stop = "</upcase>";

                                  List<string> fragments = new List<string>();
                                  int curIndex = 0;
                                  while (curIndex < text.Length)

                                  int startIndex = text.IndexOf(start, curIndex);
                                  if (startIndex >= 0)

                                  fragments.Add(text.Substring(curIndex, startIndex - curIndex));
                                  int stopIndex = text.IndexOf(stop, startIndex + start.Length);
                                  if (stopIndex < 0) throw new InvalidOperationException($"Unpaired start at startIndex");
                                  fragments.Add(text.Substring(startIndex + start.Length, stopIndex - (startIndex + start.Length)).ToUpper());
                                  curIndex = stopIndex + stop.Length;

                                  else

                                  fragments.Add(text.Substring(curIndex));
                                  break;



                                  return string.Join("", fragments);


                                  string ToUpperInTags2(string text)

                                  string pattern = @"(?<start><upcase>)(?<content>[^<>]*)(?<stop></upcase>)?";
                                  foreach (Match match in Regex.Matches(text, pattern))

                                  text = Regex.Replace(text, $"match.Groups["start"]match.Groups["content"]match.Groups["stop"]", match.Groups["content"].Value.ToUpper());


                                  return text;


                                  string ToUpperInTags3(string text)

                                  string pattern = @"<upcase>(?<content>[^<>]*)(</upcase>)?";
                                  return Regex.Replace(text, pattern, m => m.Groups["content"].Value.ToUpper());



                                  They don't all behave exactly as yours, and are just provided for inspiration for further study...






                                  share|improve this answer











                                  $endgroup$















                                    3












                                    3








                                    3





                                    $begingroup$

                                    Below is a refactoring of your algorithm with some inline comments.



                                    string Review(string text)

                                    const string startTag = "<upcase>"; // Use declared string rather than string literals
                                    const string endTag = "</upcase>";

                                    // textNew is a somewhat "backward" name. result or newText would be better
                                    char[] result = new char[text.Length];
                                    // Instantiate each variable on a single line. It's easier to find and maintain
                                    // Provide some meaningful names instead for i, j and k. (i, j and k may be alright in a lessser complex context, but here they easily lose their meaining through the loop)
                                    int curIndex = 0;
                                    int resultIndex = 0;
                                    int searchIndex = 0;

                                    while (curIndex < text.Length)

                                    if (text.IndexOf(startTag, searchIndex) < 0)

                                    while (curIndex < text.Length)

                                    result[resultIndex++] = text[curIndex++];


                                    else

                                    // Repeatedly calling the same function with the same values is inefficient
                                    int startIndex = text.IndexOf(startTag, searchIndex);
                                    while (curIndex < startIndex)

                                    result[resultIndex++] = text[curIndex++];


                                    curIndex += startTag.Length; // Use the length of the tag string instead of a magic number
                                    searchIndex = curIndex;


                                    if (text.IndexOf(endTag, searchIndex) < 0)

                                    while (curIndex < text.Length)

                                    result[resultIndex++] = Char.ToUpper(text[curIndex++]);


                                    else

                                    // Repeatedly calling the same function with the same values is inefficient
                                    int endIndex = text.IndexOf(endTag, searchIndex);
                                    while (curIndex < endIndex)

                                    result[resultIndex++] = Char.ToUpper(text[curIndex++]);


                                    curIndex += endTag.Length; // Use the length of the tag string instead of a magic number



                                    // Return the result instead of write it to the console.
                                    return new string(result.Take(resultIndex).ToArray()); // You have to truncate the char array in order to prevent a trailing new line
                                    //OR: return new string(textNew).TrimEnd('');




                                    Below is some other approaches that you may find useful for inspiration:



                                    string ToUpperInTags(string text)

                                    const string start = "<upcase>";
                                    const string stop = "</upcase>";

                                    List<string> fragments = new List<string>();
                                    int curIndex = 0;
                                    while (curIndex < text.Length)

                                    int startIndex = text.IndexOf(start, curIndex);
                                    if (startIndex >= 0)

                                    fragments.Add(text.Substring(curIndex, startIndex - curIndex));
                                    int stopIndex = text.IndexOf(stop, startIndex + start.Length);
                                    if (stopIndex < 0) throw new InvalidOperationException($"Unpaired start at startIndex");
                                    fragments.Add(text.Substring(startIndex + start.Length, stopIndex - (startIndex + start.Length)).ToUpper());
                                    curIndex = stopIndex + stop.Length;

                                    else

                                    fragments.Add(text.Substring(curIndex));
                                    break;



                                    return string.Join("", fragments);


                                    string ToUpperInTags2(string text)

                                    string pattern = @"(?<start><upcase>)(?<content>[^<>]*)(?<stop></upcase>)?";
                                    foreach (Match match in Regex.Matches(text, pattern))

                                    text = Regex.Replace(text, $"match.Groups["start"]match.Groups["content"]match.Groups["stop"]", match.Groups["content"].Value.ToUpper());


                                    return text;


                                    string ToUpperInTags3(string text)

                                    string pattern = @"<upcase>(?<content>[^<>]*)(</upcase>)?";
                                    return Regex.Replace(text, pattern, m => m.Groups["content"].Value.ToUpper());



                                    They don't all behave exactly as yours, and are just provided for inspiration for further study...






                                    share|improve this answer











                                    $endgroup$



                                    Below is a refactoring of your algorithm with some inline comments.



                                    string Review(string text)

                                    const string startTag = "<upcase>"; // Use declared string rather than string literals
                                    const string endTag = "</upcase>";

                                    // textNew is a somewhat "backward" name. result or newText would be better
                                    char[] result = new char[text.Length];
                                    // Instantiate each variable on a single line. It's easier to find and maintain
                                    // Provide some meaningful names instead for i, j and k. (i, j and k may be alright in a lessser complex context, but here they easily lose their meaining through the loop)
                                    int curIndex = 0;
                                    int resultIndex = 0;
                                    int searchIndex = 0;

                                    while (curIndex < text.Length)

                                    if (text.IndexOf(startTag, searchIndex) < 0)

                                    while (curIndex < text.Length)

                                    result[resultIndex++] = text[curIndex++];


                                    else

                                    // Repeatedly calling the same function with the same values is inefficient
                                    int startIndex = text.IndexOf(startTag, searchIndex);
                                    while (curIndex < startIndex)

                                    result[resultIndex++] = text[curIndex++];


                                    curIndex += startTag.Length; // Use the length of the tag string instead of a magic number
                                    searchIndex = curIndex;


                                    if (text.IndexOf(endTag, searchIndex) < 0)

                                    while (curIndex < text.Length)

                                    result[resultIndex++] = Char.ToUpper(text[curIndex++]);


                                    else

                                    // Repeatedly calling the same function with the same values is inefficient
                                    int endIndex = text.IndexOf(endTag, searchIndex);
                                    while (curIndex < endIndex)

                                    result[resultIndex++] = Char.ToUpper(text[curIndex++]);


                                    curIndex += endTag.Length; // Use the length of the tag string instead of a magic number



                                    // Return the result instead of write it to the console.
                                    return new string(result.Take(resultIndex).ToArray()); // You have to truncate the char array in order to prevent a trailing new line
                                    //OR: return new string(textNew).TrimEnd('');




                                    Below is some other approaches that you may find useful for inspiration:



                                    string ToUpperInTags(string text)

                                    const string start = "<upcase>";
                                    const string stop = "</upcase>";

                                    List<string> fragments = new List<string>();
                                    int curIndex = 0;
                                    while (curIndex < text.Length)

                                    int startIndex = text.IndexOf(start, curIndex);
                                    if (startIndex >= 0)

                                    fragments.Add(text.Substring(curIndex, startIndex - curIndex));
                                    int stopIndex = text.IndexOf(stop, startIndex + start.Length);
                                    if (stopIndex < 0) throw new InvalidOperationException($"Unpaired start at startIndex");
                                    fragments.Add(text.Substring(startIndex + start.Length, stopIndex - (startIndex + start.Length)).ToUpper());
                                    curIndex = stopIndex + stop.Length;

                                    else

                                    fragments.Add(text.Substring(curIndex));
                                    break;



                                    return string.Join("", fragments);


                                    string ToUpperInTags2(string text)

                                    string pattern = @"(?<start><upcase>)(?<content>[^<>]*)(?<stop></upcase>)?";
                                    foreach (Match match in Regex.Matches(text, pattern))

                                    text = Regex.Replace(text, $"match.Groups["start"]match.Groups["content"]match.Groups["stop"]", match.Groups["content"].Value.ToUpper());


                                    return text;


                                    string ToUpperInTags3(string text)

                                    string pattern = @"<upcase>(?<content>[^<>]*)(</upcase>)?";
                                    return Regex.Replace(text, pattern, m => m.Groups["content"].Value.ToUpper());



                                    They don't all behave exactly as yours, and are just provided for inspiration for further study...







                                    share|improve this answer














                                    share|improve this answer



                                    share|improve this answer








                                    edited Mar 26 at 15:35

























                                    answered Mar 26 at 15:28









                                    Henrik HansenHenrik Hansen

                                    8,51711231




                                    8,51711231



























                                        draft saved

                                        draft discarded
















































                                        Thanks for contributing an answer to Code Review Stack Exchange!


                                        • Please be sure to answer the question. Provide details and share your research!

                                        But avoid


                                        • Asking for help, clarification, or responding to other answers.

                                        • Making statements based on opinion; back them up with references or personal experience.

                                        Use MathJax to format equations. MathJax reference.


                                        To learn more, see our tips on writing great answers.




                                        draft saved


                                        draft discarded














                                        StackExchange.ready(
                                        function ()
                                        StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcodereview.stackexchange.com%2fquestions%2f216232%2fmodify-casing-of-marked-letters%23new-answer', 'question_page');

                                        );

                                        Post as a guest















                                        Required, but never shown





















































                                        Required, but never shown














                                        Required, but never shown












                                        Required, but never shown







                                        Required, but never shown

































                                        Required, but never shown














                                        Required, but never shown












                                        Required, but never shown







                                        Required, but never shown







                                        Popular posts from this blog

                                        Færeyskur hestur Heimild | Tengill | Tilvísanir | LeiðsagnarvalRossið - síða um færeyska hrossið á færeyskuGott ár hjá færeyska hestinum

                                        He _____ here since 1970 . Answer needed [closed]What does “since he was so high” mean?Meaning of “catch birds for”?How do I ensure “since” takes the meaning I want?“Who cares here” meaningWhat does “right round toward” mean?the time tense (had now been detected)What does the phrase “ring around the roses” mean here?Correct usage of “visited upon”Meaning of “foiled rail sabotage bid”It was the third time I had gone to Rome or It is the third time I had been to Rome

                                        Slayer Innehåll Historia | Stil, komposition och lyrik | Bandets betydelse och framgångar | Sidoprojekt och samarbeten | Kontroverser | Medlemmar | Utmärkelser och nomineringar | Turnéer och festivaler | Diskografi | Referenser | Externa länkar | Navigeringsmenywww.slayer.net”Metal Massacre vol. 1””Metal Massacre vol. 3””Metal Massacre Volume III””Show No Mercy””Haunting the Chapel””Live Undead””Hell Awaits””Reign in Blood””Reign in Blood””Gold & Platinum – Reign in Blood””Golden Gods Awards Winners”originalet”Kerrang! Hall Of Fame””Slayer Looks Back On 37-Year Career In New Video Series: Part Two””South of Heaven””Gold & Platinum – South of Heaven””Seasons in the Abyss””Gold & Platinum - Seasons in the Abyss””Divine Intervention””Divine Intervention - Release group by Slayer””Gold & Platinum - Divine Intervention””Live Intrusion””Undisputed Attitude””Abolish Government/Superficial Love””Release “Slatanic Slaughter: A Tribute to Slayer” by Various Artists””Diabolus in Musica””Soundtrack to the Apocalypse””God Hates Us All””Systematic - Relationships””War at the Warfield””Gold & Platinum - War at the Warfield””Soundtrack to the Apocalypse””Gold & Platinum - Still Reigning””Metallica, Slayer, Iron Mauden Among Winners At Metal Hammer Awards””Eternal Pyre””Eternal Pyre - Slayer release group””Eternal Pyre””Metal Storm Awards 2006””Kerrang! Hall Of Fame””Slayer Wins 'Best Metal' Grammy Award””Slayer Guitarist Jeff Hanneman Dies””Bullet-For My Valentine booed at Metal Hammer Golden Gods Awards””Unholy Aliance””The End Of Slayer?””Slayer: We Could Thrash Out Two More Albums If We're Fast Enough...””'The Unholy Alliance: Chapter III' UK Dates Added”originalet”Megadeth And Slayer To Co-Headline 'Canadian Carnage' Trek”originalet”World Painted Blood””Release “World Painted Blood” by Slayer””Metallica Heading To Cinemas””Slayer, Megadeth To Join Forces For 'European Carnage' Tour - Dec. 18, 2010”originalet”Slayer's Hanneman Contracts Acute Infection; Band To Bring In Guest Guitarist””Cannibal Corpse's Pat O'Brien Will Step In As Slayer's Guest Guitarist”originalet”Slayer’s Jeff Hanneman Dead at 49””Dave Lombardo Says He Made Only $67,000 In 2011 While Touring With Slayer””Slayer: We Do Not Agree With Dave Lombardo's Substance Or Timeline Of Events””Slayer Welcomes Drummer Paul Bostaph Back To The Fold””Slayer Hope to Unveil Never-Before-Heard Jeff Hanneman Material on Next Album””Slayer Debut New Song 'Implode' During Surprise Golden Gods Appearance””Release group Repentless by Slayer””Repentless - Slayer - Credits””Slayer””Metal Storm Awards 2015””Slayer - to release comic book "Repentless #1"””Slayer To Release 'Repentless' 6.66" Vinyl Box Set””BREAKING NEWS: Slayer Announce Farewell Tour””Slayer Recruit Lamb of God, Anthrax, Behemoth + Testament for Final Tour””Slayer lägger ner efter 37 år””Slayer Announces Second North American Leg Of 'Final' Tour””Final World Tour””Slayer Announces Final European Tour With Lamb of God, Anthrax And Obituary””Slayer To Tour Europe With Lamb of God, Anthrax And Obituary””Slayer To Play 'Last French Show Ever' At Next Year's Hellfst””Slayer's Final World Tour Will Extend Into 2019””Death Angel's Rob Cavestany On Slayer's 'Farewell' Tour: 'Some Of Us Could See This Coming'””Testament Has No Plans To Retire Anytime Soon, Says Chuck Billy””Anthrax's Scott Ian On Slayer's 'Farewell' Tour Plans: 'I Was Surprised And I Wasn't Surprised'””Slayer””Slayer's Morbid Schlock””Review/Rock; For Slayer, the Mania Is the Message””Slayer - Biography””Slayer - Reign In Blood”originalet”Dave Lombardo””An exclusive oral history of Slayer”originalet”Exclusive! Interview With Slayer Guitarist Jeff Hanneman”originalet”Thinking Out Loud: Slayer's Kerry King on hair metal, Satan and being polite””Slayer Lyrics””Slayer - Biography””Most influential artists for extreme metal music””Slayer - Reign in Blood””Slayer guitarist Jeff Hanneman dies aged 49””Slatanic Slaughter: A Tribute to Slayer””Gateway to Hell: A Tribute to Slayer””Covered In Blood””Slayer: The Origins of Thrash in San Francisco, CA.””Why They Rule - #6 Slayer”originalet”Guitar World's 100 Greatest Heavy Metal Guitarists Of All Time”originalet”The fans have spoken: Slayer comes out on top in readers' polls”originalet”Tribute to Jeff Hanneman (1964-2013)””Lamb Of God Frontman: We Sound Like A Slayer Rip-Off””BEHEMOTH Frontman Pays Tribute To SLAYER's JEFF HANNEMAN””Slayer, Hatebreed Doing Double Duty On This Year's Ozzfest””System of a Down””Lacuna Coil’s Andrea Ferro Talks Influences, Skateboarding, Band Origins + More””Slayer - Reign in Blood””Into The Lungs of Hell””Slayer rules - en utställning om fans””Slayer and Their Fans Slashed Through a No-Holds-Barred Night at Gas Monkey””Home””Slayer””Gold & Platinum - The Big 4 Live from Sofia, Bulgaria””Exclusive! Interview With Slayer Guitarist Kerry King””2008-02-23: Wiltern, Los Angeles, CA, USA””Slayer's Kerry King To Perform With Megadeth Tonight! - Oct. 21, 2010”originalet”Dave Lombardo - Biography”Slayer Case DismissedArkiveradUltimate Classic Rock: Slayer guitarist Jeff Hanneman dead at 49.”Slayer: "We could never do any thing like Some Kind Of Monster..."””Cannibal Corpse'S Pat O'Brien Will Step In As Slayer'S Guest Guitarist | The Official Slayer Site”originalet”Slayer Wins 'Best Metal' Grammy Award””Slayer Guitarist Jeff Hanneman Dies””Kerrang! Awards 2006 Blog: Kerrang! Hall Of Fame””Kerrang! Awards 2013: Kerrang! Legend”originalet”Metallica, Slayer, Iron Maien Among Winners At Metal Hammer Awards””Metal Hammer Golden Gods Awards””Bullet For My Valentine Booed At Metal Hammer Golden Gods Awards””Metal Storm Awards 2006””Metal Storm Awards 2015””Slayer's Concert History””Slayer - Relationships””Slayer - Releases”Slayers officiella webbplatsSlayer på MusicBrainzOfficiell webbplatsSlayerSlayerr1373445760000 0001 1540 47353068615-5086262726cb13906545x(data)6033143kn20030215029