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...
Saved in:
Main Authors | , , , , , , |
---|---|
Format | Patent |
Language | English |
Published |
08.05.2013
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | 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. |
---|---|
Bibliography: | Application Number: GB20120018825 |