I was wondering if anyone has done an performance testing on regex (vs)
perlfunc "patterns"?
I was thinking of replacing this....
ptype=RegExp
pattern=(\d+)\s+::\s+(\S+)\s+::\s+(\S+)\s+::\s+(\S+)\s+::\s+(\S+)\s+::\s+(.*)\s+::\s+(\S+.*)\s+::\s+(.*)\s+::\s+(.*)\s+::\s+(.*)
With this....
ptype=perlfunc
pattern=sub { my (@parseStr) = split/ :: /, $_[0]; if ($#parseStr > 4) {return
(@parseStr); } else {return (0); } }
And was wondering what performance differences there might be.
My events have this format... (input format) of ---
$1 :: $2 :: $3 :: $4 :: $5 :: $6 :: $7 :: $8 :: $9
:: $10
------------------------------------------------------------------------------
Get 100% visibility into Java/.NET code with AppDynamics Lite
It's a free troubleshooting tool designed for production
Get down to code-level detail for bottlenecks, with <2% overhead.
Download for free and get started troubleshooting in minutes.
http://p.sf.net/sfu/appdyn_d2d_ap2
_______________________________________________
Simple-evcorr-users mailing list
Simple-evcorr-users@lists.sourceforge.net
https://lists.sourceforge.net/lists/listinfo/simple-evcorr-users
