作者: Tetsumei Tsuruoka
DOI:
关键词:
摘要: Entries which become lookup objects and have variable length comparison conditions are divided into a plurality of groups, representative key is taken as data for each group, mask that sets range matching with match candidate, well object data, stored in masked memory so setting can be made the entries. Information corresponding to groups obtained from memory, entries limited within group. Further, entries, objects, classified tree state, nodes adopted at points where bit values either “0” or “1”, order first bit, entry performed after groups.