Longest prefix match operations
A method of matching an entry in a list, e.g. phone number prefixes to data, e.g. phone numbers, by writing source code, preferably using nested switch statements, to match an entry in a list to data by sorting the list and turning it into a tree, preferably partitioning the tree into a plurality of...
Gespeichert in:
| Hauptverfasser: | , , , , , , |
|---|---|
| Format: | Patent |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Zusammenfassung: | A method of matching an entry in a list, e.g. phone number prefixes to data, e.g. phone numbers, by writing source code, preferably using nested switch statements, to match an entry in a list to data by sorting the list and turning it into a tree, preferably partitioning the tree into a plurality of disjoint trees and then compiling the source code and running that code to match an entry in a list to data. |
|---|