SEQUENCING DATA SET MEMBER ACCESS METHOD,SEQUENCING DATA SETACCESS RECURSIVE METHOD AND SEQUENCING DATA SET MEMBER ACCESS DEVICE

摘要

PROBLEM TO BE SOLVED: To construct a menu system which has high space efficiency by dividing a data set into a plurality of ordered subsets, making at least one of each subset a bracket member and referring to other members by a set data symbol. SOLUTION: A menu tree 10 has 1st, 2nd and 3rd levels 1 to 3 and the level 3 is composed of twenty-six members which represent an alphabet data set 12. The set 12 is alphabetically structured, the first letter is 'a' and the last one is 'z'. The set is divided into six subsets and the level 2 of the tree 10 is represented by combinations of a bracket member 16 and a set data member symbol 14.... Although an entire set 12 can not simultaneously be shown on a screen, an optional letter can be selected by using a selected bracket member and an ellipsis 14.