Sign Up

Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.

Have an account? Sign In

Have an account? Sign In Now

Sign In

Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.

Sign Up Here

Forgot Password?

Don't have account, Sign Up Here

Forgot Password

Lost your password? Please enter your email address. You will receive a link and will create a new password via email.

Have an account? Sign In Now

You must login to ask a question.

Forgot Password?

Need An Account, Sign Up Here

Please briefly explain why you feel this question should be reported.

Please briefly explain why you feel this answer should be reported.

Please briefly explain why you feel this user should be reported.

Sign InSign Up

The Archive Base

The Archive Base Logo The Archive Base Logo

The Archive Base Navigation

  • SEARCH
  • Home
  • About Us
  • Blog
  • Contact Us
Search
Ask A Question

Mobile menu

Close
Ask a Question
  • Home
  • Add group
  • Groups page
  • Feed
  • User Profile
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Buy Points
  • Users
  • Help
  • Buy Theme
  • SEARCH
Home/ Questions/Q 8047747
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: June 5, 20262026-06-05T06:11:49+00:00 2026-06-05T06:11:49+00:00

Does anyone have an idea which would be better for potential string replacement? If

  • 0

Does anyone have an idea which would be better for potential string replacement?

If I have a collection of varying length of strings of varying lengths in which some strings might need special replacement of encoded hex values (e.g. =0A, %20… etc)

The “replacements” (there could be multiple) for each string would be handled by a Regular Expression to detect the appropriate escaped hex values

Which would be more efficient?

  1. To simply run the replacement on every string in the collection ensuring by brute force that all needed replacements are done

  2. To perform a test if a replacement is needed and only run the replacement on the strings that need it.

I’m working in C#.

Update

A little additional info from the answers and comments.

This is primarily for VCARD processing that is loaded from a QR Code

I currently have a regex that uses capture groups to get the KEY, PARAMETERS and VALUE from each KEY;PARAMETERS:VALUE in the VCARD.

Since i’m supporting v 2.1 and 3.0 the encoding and line folding are VERY different so I need to know the version before I decode.

Now it doesn’t make sense to me to run the entire regular expression JUST to get the version and apply the approptiate replace to the whole vcard block of text and THEN rerun the regular expression.

To me it makes more sense to just get my capture groups loaded up then snag the version and do the appropriate decoding replacement on each match

  • 1 1 Answer
  • 0 Views
  • 0 Followers
  • 0
Share
  • Facebook
  • Report

Leave an answer
Cancel reply

You must login to add an answer.

Forgot Password?

Need An Account, Sign Up Here

1 Answer

  • Voted
  • Oldest
  • Recent
  • Random
  1. Editorial Team
    Editorial Team
    2026-06-05T06:11:51+00:00Added an answer on June 5, 2026 at 6:11 am

    When you just Replace it will perform slightly slower when there’s No Match because of the additional checks that Replace does (e.g.)

    if (replacement == null)
    {
        throw new ArgumentNullException("replacement");
    }
    

    Regex.Replace does return the input if no matches are found so there’s no memory issue here.

    Match match = regex.Match(input, startat);
    if (!match.Success)
    {
        return input;
    }
    

    When there is a match the regex.Match fires twice once when you do it and again when replace does it. Which means Check and Replace will perform slower then.

    So your results will be based on

    • Do you expect a lot of matches or a lot of misses?
    • When there are matches how does the fact that the Regex.Match will run twice overwelm the extra parameter checks? My guess is it probably will.
    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

Does anyone have an idea of how to get posts that have no comments
does anyone have an idea on how I could capture the image id when
Does anyone have any idea how to change the thickness of the text pointer
Does anyone have an idea how to Print (A4) the Content of a ListView
Does anyone have any idea on how can you create a product filtering query
Does anyone have any idea when Microsoft might be dropping another Silverlight 4 public
Does anyone have any idea if you can find source JARs on Maven repositories?
Does anyone have any idea what this jQuery selector will do? object.find('td:eq(1) div div');
Does anyone have an idea, link, library, source code, ... on how to convert
In datasets there was a method WriteXml or ReadXml Does anyone have any idea

Explore

  • Home
  • Add group
  • Groups page
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Users
  • Help
  • SEARCH

Footer

© 2021 The Archive Base. All Rights Reserved
With Love by The Archive Base

Insert/edit link

Enter the destination URL

Or link to existing content

    No search term specified. Showing recent items. Search or use up and down arrow keys to select an item.