Reputation: 46591
I was using long.TryParse
, but switched to regex. Currently, it takes a total of 7+ milliseconds for a 123+K message. The 7+ milliseconds is from the XElement.Parse to the end of the foreach methods.
Stopwatch s1 =Stopwatch.StartNew();
XElement element = XElement.Parse(xml);
string pattern = @"\b\d+\b";
Regex r = new Regex(pattern);
IEnumerable<XElement> elementsWithPossibleCCNumbers = element
.Descendants()
.Where(d => d.Attributes()
.Where(a => a.Value.Length >= 13 &&
a.Value.Length <= 16 &&
r.IsMatch(a.Value)).Count() == 1)
.Select(x => x);
foreach(var x in elementsWithPossibleCCNumbers)
{
foreach(var a in x.Attributes())
{
//Check if the value is a number
if(r.IsMatch(a.Value))
{
//Check if value is the credit card
if(a.Value.Length >= 13 && a.Value.Length <= 16)
{
a.Value = Regex.Replace(a.Value, @"\b\d{13,16}\b", match =>
new String('*', match.Value.Length - 4) +
match.Value.Substring(match.Value.Length - 4)
);
}
else //If value is not a credit card, replace it with ***
a.Value = Regex.Replace(a.Value ,@"\b\d+\b", "***");
}
}
}
xml = element.ToString();
s1.Stop();
XElement.Parse(xml);
takes between 2 - 3 ms.
The LINQ query takes between 0.004 - 0.005 ms.
The foreach statements take between 4 - 5 ms.
Upvotes: 1
Views: 181
Reputation: 64068
It appears you're doing two search and replacements:
*
's and the last 4 digits*
's.One approach would be to make XLinq work a little bit harder for you:
// you're not using the elements, ignore them, just get the attributes
foreach (var atr in xelt.Descendants()
.Where(e => e.Attributes()
.Any(a => a.Value.Length >= 13
&& a.Value.Length <= 16))
.SelectMany(e => e.Attributes()))
{
// static basicDigits = new Regex(@"\b\d+\b", RegexOptions.Compiled);
// static ccDigits = new Regex(@"\b\d{13,16}\b", RegexOptions.Compiled);
if (ccDigits.IsMatch(atr.Value))
{
atr.Value = ccDigits.Replace(
atr.Value,
mm => new String('*', mm.Value.Length - 4)
+ mm.Value.Substring(mm.Value.Length - 4));
}
else
{
atr.Value = basicDigits.Replace(atr.Value, "***");
}
}
// using 150k XML (1k nodes/5k attrs, 3 attr/node avg, avg depth 4 nodes)
// with 10% match rate:
// - 25.7 MB/s (average 100 trials)
// - 61 attributes/ms
Sample input XML:
<item f1="abc123abc" f2="helloooo 1234567" f3="abc123abc">
<item f1="abc123abc" f2="helloooo 1234567" f3="abc123abc" real1="4444555566667777" />
<item f1="abc123abc" f2="helloooo 1234567" f3="abc123abc" />
ruBTMjSesurMsP6lK2jg
</item>
Output:
<item f1="abc123abc" f2="helloooo 1234567" f3="abc123abc">
<item f1="abc123abc" f2="helloooo ***" f3="abc123abc" real1="************7777" />
<item f1="abc123abc" f2="helloooo 1234567" f3="abc123abc" />
ruBTMjSesurMsP6lK2jg
</item>
Upvotes: 1
Reputation: 3866
You may want to consider precompiling your regex. The article here: http://en.csharp-online.net/CSharp_Regular_Expression_Recipes%E2%80%94Compiling_Regular_Expressions explains the pro and cons of compiling regex quite nicely.
Upvotes: 0