GLOBAL MAP DATA DICTIONARY #.401 -- SORT TEMPLATE FILE 3/24/25 PAGE 1 STORED IN ^DIBT( (685 ENTRIES) SITE: WWW.BMIRWIN.COM UCI: VISTA,VISTA (VERSION 22.2) ----------------------------------------------------------------------------------------------------------------------------------- This file stores either SORT or SEARCH criteria. For SORT criteria, the SORT DATA multiple contains the sort parameters. For SEARCH criteria, the template also contains a list of record numbers selected as the result of running the search. CROSS REFERENCED BY: NAME(B) ^DIBT(D0,0)= (#.01) NAME [1F] ^ (#2) DATE CREATED [2D] ^ (#3) READ ACCESS [3F] ^ (#4) FILE [4P:1] ^ (#5) USER # [5N] ^ (#6) WRITE ==>ACCESS [6F] ^ (#7) DATE LAST USED [7D] ^ (#8) TEMPLATE TYPE [8S] ^ ^DIBT(D0,2,0)=^.4014^^ (#1621) SORT FIELD DATA ^DIBT(D0,2,D1,0)= (#.01) FILE OR SUBFILE NO. [1N] ^ (#2) FIELD NO. [2N] ^ (#3) FIELD NAME [3F] ^ (#4) SORT QUALIFIERS BEFORE ==>FIELD [4F] ^ (#4.1) SORT QUALIFIERS AFTER FIELD [5F] ^ ^ (#4.2) COMPUTED FIELD TYPE [7F] ^ ^ ^ (#15) DATA ==>TYPE FOR SORTING [10P:.81] ^ ^DIBT(D0,2,D1,1,0)=^.40141^^ (#17) MULTIPLE FIELD DATA ^DIBT(D0,2,D1,1,D2,0)= (#.01) MULT.FILE OR SUBFILE NO. [1N] ^ (#1) NODE [2F] ^ ^DIBT(D0,2,D1,2,0)=^.401418^^ (#18) RELATIONAL JUMP FIELD DATA ^DIBT(D0,2,D1,2,D2,0)= (#.01) RELATIONAL START FILE NO. [1N] ^ (#1) NEXT SUBSCRIPT [2N] ^ (#2) TO FILE OR SUBFILE [3N] ^ (#3) ==>GLOBAL REFERENCE [4F] ^ (#4) MULTIVALUED FLAG [5S] ^ ^DIBT(D0,2,D1,2,D2,RCOD)= (#5) RELATIONAL CODE [E1,245K] ^ ^DIBT(D0,2,D1,3,0)=^.401419^^ (#19) OVERFLOW DATA ^DIBT(D0,2,D1,3,D2,0)= (#.01) FIRST SUBSCRIPT FOR OVERFLOW [1F] ^ (#1) SECOND SUBSCRIPT FOR OVERFLOW [2N] ^ ^DIBT(D0,2,D1,3,D2,OVF0)= (#2) OVERFLOW CODE [E1,245K] ^ ^DIBT(D0,2,D1,ASK)= (#4.3) ASK FOR FROM AND TO [1S] ^ ^DIBT(D0,2,D1,CM)= (#16) COMPUTED FIELD CODE [E1,245K] ^ ^DIBT(D0,2,D1,F)= (#5) FROM VALUE INTERNAL [1F] ^ (#6) FROM VALUE EXTERNAL [2F] ^ (#6.5) FROM VALUE PRINTABLE [3F] ^ ^DIBT(D0,2,D1,FCOMPUTED)= (#21401) FROM VALUE COMPUTATION [E1,245F] ^ ^DIBT(D0,2,D1,GET)= (#10) GET CODE [E1,245K] ^ ^DIBT(D0,2,D1,IX)= (#9) CROSS REFERENCE DATA [E1,245F] ^ ^DIBT(D0,2,D1,OUT)= (#20) SUBHEADER OUTPUT TRANSFORM [E1,245K] ^ ^DIBT(D0,2,D1,PTRIX)= (#9.5) POINT TO CROSS REFERENCE [E1,245F] ^ ^DIBT(D0,2,D1,QCON)= (#11) QUERY CONDITION [E1,245K] ^ ^DIBT(D0,2,D1,SER)= (#13) SEARCH EFFICIENCY RATING [1N] ^ (#14) PROBABILITY RATING [2N] ^ ^DIBT(D0,2,D1,SRTTXT)= (#21) TEXT SORT FLAG [1S] ^ ^DIBT(D0,2,D1,T)= (#7) TO VALUE INTERNAL [1F] ^ (#8) TO VALUE EXTERNAL [2F] ^ (#8.5) TO VALUE PRINTABLE [3F] ^ ^DIBT(D0,2,D1,TCOMPUTED)= (#21402) TO VALUE COMPUTATION [E1,245F] ^ ^DIBT(D0,2,D1,TXT)= (#12) DESCRIPTION OF SORT [E1,200F] ^ ^DIBT(D0,%D,0)=^.4012^^ (#10) DESCRIPTION ^DIBT(D0,%D,D1,0)= (#.01) DESCRIPTION [1W] ^ ^DIBT(D0,BY0)= (#1622) BY(0) [1F] ^ (#1623) L(0) [2N] ^ ^DIBT(D0,BY0D,0)=^.4011624^^ (#1624) SORT RANGE DATA FOR BY(0) ^DIBT(D0,BY0D,D1,0)= (#.01) SUBSCRIPT LEVEL [1N] ^ (#1) FR(0,n) [2F] ^ (#2) TO(0,n) [3F] ^ ^DIBT(D0,BY0D,D1,1)= (#3.1) DISPAR(0,n) PIECE ONE [1F] ^ (#3.2) DISPAR(0,n) PIECE TWO [2F] ^ ^DIBT(D0,BY0D,D1,2)= (#4) DISPAR(0,n,OUT) [E1,245K] ^ ^DIBT(D0,CANONIC)= (#21409) CANONIC FOR THIS FILE [1S] ^ ^DIBT(D0,DIPT)= (#491620) PRINT TEMPLATE [1F] ^ ^DIBT(D0,O,0)=^.4011^^ (#15) SEARCH SPECIFICATIONS ^DIBT(D0,O,D1,0)= (#.01) SEARCH SPECIFICATIONS [1W] ^ ^DIBT(D0,QR)= (#9) SEARCH COMPLETE DATE [1D] ^ (#11) TOTAL RECORDS SELECTED [2N] ^ ^DIBT(D0,ROU)= (#1815) ROUTINE INVOKED [E1,13F] ^ ^DIBT(D0,ROUOLD)= (#1816) PREVIOUS ROUTINE INVOKED [E1,13F] ^ INPUT TEMPLATE(S): PRINT TEMPLATE(S): ^DIPT(759)= ONCOLOGY SORT TEMPLATE LIST ^DIPT(476)= RT SORT TEMPLATES SORT TEMPLATE(S): ^DIBT(377)= ONCOLOGY SORT TEMPLATE LIST ^DIBT(222)= RT SORT TEMPLATES FORM(S)/BLOCK(S): ^DIST(.403,.40001)= DIBTED ^DIST(.404,.400011)= DIBTED ^DIST(.404,.400012)= DIBTED2