mirror of
https://github.com/nmap/nmap.git
synced 2026-01-02 04:49:02 +00:00
3a67da3a7e
instead of a custom hash table and an STL list instead of a custom linked list. The biggest gain comes from using the list.sort method rather than inserting ports in sorted order (equivalent to insertion sort). The new code passes Doug's p-switch-tests. Here are time comparisons, using the old and new services code, and using the standard nmap-services file and the 65535-port nmap-services-huge. The times are the duration of the call to nmap_services_init. Three trials were done for each case, except for the old-code/nmap-services-huge case. nmap-services: old code: 0.215 0.201 0.227 (average 0.214 s) new code: 0.025 0.022 0.023 (average 0.023 s) nmap-services-huge: old code: 441.014 (average 441.014 s) new code: 0.984 0.975 0.978 (average 0.979 s)
Here is some documentation for Nmap, but these files are much less comprehensive than what you'll find at the actual Nmap documentation site ( http://nmap.org ).