Information for RPM perl-Net-Patricia-1.22-22.fc31.riscv64.rpm
| ID | 437113 | ||||||||||||||||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| Name | perl-Net-Patricia | ||||||||||||||||||||||||
| Version | 1.22 | ||||||||||||||||||||||||
| Release | 22.fc31 | ||||||||||||||||||||||||
| Epoch | |||||||||||||||||||||||||
| Arch | riscv64 | ||||||||||||||||||||||||
| Summary | Patricia Trie perl module for fast IP address lookups | ||||||||||||||||||||||||
| Description | This module uses a Patricia Trie data structure to quickly perform IP address prefix matching for applications such as IP subnet, network or routing table lookups. The data structure is based on a radix tree using a radix of two, so sometimes you see patricia implementations called "radix" as well. The term "Trie" is derived from the word "retrieval" but is pronounced like "try". Patricia stands for "Practical Algorithm to Retrieve Information Coded as Alphanumeric", and was first suggested for routing table lookups by Van Jacobsen. Patricia Trie performance characteristics are well-known as it has been employed for routing table lookups within the BSD kernel since the 4.3 Reno release. | ||||||||||||||||||||||||
| Build Time | 2019-08-03 00:08:51 GMT | ||||||||||||||||||||||||
| Size | 43.54 KB | ||||||||||||||||||||||||
| 03c71c27c691157c62b4dc70b301dcf7 | |||||||||||||||||||||||||
| License | GPLv2+ and BSD | ||||||||||||||||||||||||
| Buildroot | f31-build-68271-30167 | ||||||||||||||||||||||||
| Provides |
|
||||||||||||||||||||||||
| Obsoletes | No Obsoletes | ||||||||||||||||||||||||
| Conflicts | No Conflicts | ||||||||||||||||||||||||
| Requires |
|
||||||||||||||||||||||||
| Recommends | No Recommends | ||||||||||||||||||||||||
| Suggests | No Suggests | ||||||||||||||||||||||||
| Supplements | No Supplements | ||||||||||||||||||||||||
| Enhances | No Enhances | ||||||||||||||||||||||||
| Files | |||||||||||||||||||||||||
| Component of |
|
||||||||||||||||||||||||
