new benchmark graph
This commit is contained in:
@@ -111,5 +111,22 @@ for (int i=0; i<50000; i++){
|
||||
|
||||
In the chart above we can see that the 2.5.1 version with 8 threads has a better performance than the 2.5.1 version with 1 threads, and we can see it as much as the load increases.
|
||||
|
||||
This particular advantage will be more noticeable with nfproxy module that is not implemented yet.
|
||||
Command: `./comparemark.py nfproxy -p testpassword -d 1 -s 50 -V 100`
|
||||
|
||||
The code used to test matches the following regex with the python re module:
|
||||
```
|
||||
(?:[a-z0-9!#$%&'*+/=?^_`{|}~-]+(?:\.[a-z0-9!#$%&'*+/=?^_`{|}~-]+)*|"(?:[\x01-\x08\x0b\x0c\x0e-\x1f\x21\x23-\x5b\x5d-\x7f]|\\[\x01-\x09\x0b\x0c\x0e-\x7f])*")@(?:(?:[a-z0-9](?:[a-z0-9-]*[a-z0-9])?\.)+[a-z0-9](?:[a-z0-9-]*[a-z0-9])?|\[(?:(?:25[0-5]|2[0-4][0-9]|[01]?[0-9][0-9]?)\.){3}(?:25[0-5]|2[0-4][0-9]|[01]?[0-9][0-9]?|[a-z0-9-]*[a-z0-9]:(?:[\x01-\x08\x0b\x0c\x0e-\x1f\x21-\x5a\x53-\x7f]|\\[\x01-\x09\x0b\x0c\x0e-\x7f])+)\])
|
||||
```
|
||||
|
||||

|
||||
|
||||

|
||||
|
||||
# Comparing nfproxy with nfregex
|
||||
|
||||
Nfproxy has obviously a worse performance than nfregex, but it is more flexible and can be used in more complex scenarios.
|
||||
|
||||

|
||||
|
||||

|
||||
|
||||
|
||||
Reference in New Issue
Block a user