NSSE2  FILE%  HEAPS   TST16K  COMPACT  COMPACTR " % FILEDIT ? FILEDITCC HEXDEC ( HEXREM / MEMREM 3 MEMSET 8 FILEDITPG FILEDITEK  FILEDREMU MEMRYMAPY BASICEXP[ SORT ^  ALPHSORTj x y } 4 PROGRAM SHOWS FILE CAPACITY CURT USAGE - OF SERIAL FILES NTHSTAR BASIC . 101277 B. PALMER 415) 9412270 2( A$255)\ USE LY FILE WITH STRINGS 52 UNDER 255 CHARACTERS IN GTH %< 12)\ " (BYTES OF STORAGE)", -F 24),"CAPACITY",\38),"USED %"\ )P 1 "FILE NAME: ",F$\ #0,F$,L\ U0 $Z C256L\25),\%C7I,C,\ n 6d 35),\%C7I,U,\45),\%5F2,P100,\" %"\ P #n 0)0 \ 0)1 4x THE CSTANT 5 IN THE STATEMENT ASSUMES THAT 0 EIGHT DIGIT PRECISI BASIC WROTE THE FILE  #0,N\ UU5\ n #0,A$\ UUA$)2\ n  #0\ PUC\  + RIBUTED BY BT ROMAN BRIAN WITT 4 1 OCT 77 AT BYTE WALNUT CREEK COMPUTER FAIR , "HOW MANY NUMBERS TO SORT? ",N\NN) ( N1  2 Y$1),DN) "< "INPUT OR RANDOM DATA? ",Y$ F Y$"I" 5P "PLEASE GIVE AN OFFSET FOR RANDOM VALUES " , J Z JJJ1)) d A1 N n DA)10N0))N x A  \ 25),"RANDOM DATA"  ; \ "INPUT",N," NUMBERS EACH SEPARATED BY A RETURN."\ Z1 N  1 "",DZ)  SZ5\ SS)  SS))64),  Z  \ # PX)XX2X2))2))2 . BX)XXDXX)DXX1)) XXT))  T2 N  QDT)\IT  I1 @  JPI) " Q DJ) @ , DI)DJ)\IJ 6  @ DI)Q J T T TN ^ BDT)\DT)D1)\TT1\I1 h IIT  r JBI) | DJ)B   DI)DJ)\IJ  h  DI)B  T2 ^  25),"SORTED DATA"    \ "ANOTHER SORT? ",Y$  Y$"Y" <   Z0 N1  SZ5\ SS)  SS))64),DZ1),  Z  S)  SS))64),DZ1),  Z  XO[;XDBR/-CB4" E4,8) ' "16KRA DIAGNOSTIC FOR BOARD AT ", * CRESPDING ROWS A,B,C,D BOARD\ #! R0)7\ R1)6\ R2)9\ R3)8 # R$"02468ACE" C% R$R3)21,R3)21),"000 AND ",R$R1)21,R1)21),"000" 2 E0 4 R0 3\ C0 7 6 ER,C)0 8 C\ R d FIXED PATTERN n R0 3 x PRR)4096   A  A1  D PA,D  R  BACK FIXED PATTERN  R0 3  PRR)4096   A  A1 "  S WPA)  WS  \ ERR RINE  " R ", E0  "NO ERRORS" 6 ); "NOW RANDOM TESTING: HOW MUCH? ",M < M0  @ J1M) J R0 3 O PRR)4096 T T1 M ^ PT,2550).49) h T r R  J1M)  R0 3  PRR)4096  T1 M  S2550).49)  WPT)  WS     T  R  , . FIXED PATTERN\ DISPLACEMENT,) PAIRS + 0,255,1,0,2,0,4,0,8,0,16,0,32,0,64,0 & 128,0,256,0,512,0,1024,0,2048,0 * 4000,254,4001,253,4002,251,4003,247 * 4004,239,4005,223,4006,191,4007,127  1  ERR SUBRINE  B 0 7  W1W  S1S  SS2)  WW2)  2WS12SW1 8 $ E E 1 . ER,B) ER,B) 1 8 B B  E," ERRORS SO FAR"  20),"ERROR SUMMARY"  10), $ %5I,9,10,11,12,13,14,15,16,17  E$"ABCD"  R 0 3 ' " ",E$R1,R1)," (P)", B %5I,ER,5),ER,4),ER,6),ER,1),ER,0),ER,2),ER,3),ER,7)  R  d\\\"BASIC COMPACTOR" n\10),"BY GLENN STEINER" 3x\\"PROGRAM WILL REMOVE ALL SPACES WHICH ARE" -"NOT NORMALLY NEEDED IN A BASIC PROGRAM" 3"NOTE--BASIC PROGRAM MUST FIRST BE DEFINED AS" " A TYPE 3 DATA FILE" /"COMPACTED FILE WILL REPLACE THE ORIGINAL" "BASIC PROGRAM FILE" ("NAME OF FILE TO BE COMPACTED: ",A$ #0,A$ #1,A$ P0\N0\R2 ,,#0,&K,&L1,&L2\ CHAR COUNT NUMBER .#1,&K,&L1,&L2,\ IT BACK 1K1 3"LINE NUMBER: ",L1256L2, 4K1K\A0\A10 !5RR)\Q0\ RESET QUOTE FLAG 6I4K +;A2A1\A1A\ PREVIOUS TWO TOKENS READ @#0,&A\ FETCH A CHARACTER 0EA1154A2154L\ IGNE STATEMENT NUMBERS .JA32Q0R0|\ SKIP SPACES POSSIBLE LA92O *MQ0\RR)\ NEW STATEMENT ENCOUNTERED OA143RR)1 TA34R0Q1Q ^#1,&A, h |K1K11 I KK1#1%P,&K1, '" ",KK1," CHARACTERS REMOVED" NNKK1 PPK1\#1%P1,&A , #0\#1 #\N," CHARACTERS WERE REMOVED" "DONE"   PROGRAM COMPACT  AUTH GN STEINER  6( PURPOSE PROGRAM OVES UNNECESSARY SPACES FROM A :2 BASIC PROGRAM. THIS IS USEFUL WHEN YOU ARE 5< PUSHED SPACE EVERY BYTE IS NEEDED. 7F USE THE PROGRAM YOU WISH BE COMPACTED MUST 4P FIRST BE CHANGED FROM A E 2 A E 3 1Z PROGRAM UG THE DOS "TY" COMM. 5d THE COMPACT PROGRAM MAY BE . WHEN THE 5n COMPACT PROGRAM IS DE THE FILE MUST BE 1x CHANGED BACK A E 2 PROGRAM FILE. 5 ES THE PROGRAM BE COMPACTED MUST HAVE GOOD / SYNTAX FUNNY THINGS MAY HAPPEN. 3 COMPACT DOES PROPERLY TAKE O ACCOUNT $ QUOTES STATEMENTS. 3 UNLESS YOU UNDERST HOW BASIC WKS, I 4 WOULD ADVISE YOU TRY MODYING THIS  PROGRAM. AM YOU WANT MUST BE ENTERED  O THE DIRECRY. / THE HELP DIRECRY IS ED HELP.DIR - EACH PROGRAM FILEPRNT  AUTH LARRY G. KAVERT  *( PURPOSE COPY ANY E 3 FILE. 8P USE THE PROGRAM. COPY, YOU JUST ENTER THE 4Z SOURCE DESTINATI FILES NE OF THE 1d ENTS ARE ED. , AFTER YOU ENTER 4n THE FILE BE ED, THE COMPUTER WILL :x THE ELEMENT # FOLLOWED BY A COL, A SPACE, 0 THE ELEMENT. 15 S ARE ED AT A 9 TIME, AFTER WHICH, A CR WILL CAUSE THE 15  BE ED. 7 ES ATTEMPTS EXECUTE PROGRAM WITH NEXISTENT . FILES WILL CAUSE PROGRAM BOMB.  ANSWER FOR A ",C$  "WOULD BE"\ G$ " G$"YES" @ , G$"NO" J 6 d @ B1L1\ B2L11\ T C10\ C20\ A$500)\ - "PRINTS OUT OR COPIES ANY TYPE 3 FILE"  \ "PRINT OR COPY? ",A7$ ( A7$"PRINT" 2 A7$"COPY"  < "SOURCE FILE: ",F1$ F "DESTINATION FILE: ",F2$ P #0,F1$\ #1,F2$ Z 0)1) ,d,x d #0,A$\ #1,A$ n Z x #0,B1\ #1,B1 Z  #1\  ! "FILE TO BE PRINTED: ",F1$  \ #0,F1$  "FILE CONTENTS:"  C1C11\ C2C21  C215  C20\ " ",A1$  0)1) ,, #0,A$  C1,": ",A$\ #0,N1  C1,": ",N1\  #0\  "THE ANSWER FOR A ",C$  "WOULD BE"\ G$ " G$"YES" @ , G$"NO" J 6 d @ B1L1\ B2L11\ T- HEX DECIMAL VICE VERSA CVERTER 1 PROGRAMMED 101077 BY RALD M. LAPEDIS  A$6),Z$1),X3)  "INSTRUCTIONS?",A$  A$1,1)"N" P 4( "TYPE THE NUMBER TO BE CONVERTED FOLLOWED BY" 92 "'H' IF IT'S IN HEX. NUMBERS WITH HEX DIGITS ARE" << "IMPLICITLY ASSUMED TO BE HEX, AND NO 'H' IS NEEDED." F "TYPE '0' TO END." -P \ 1 "THE NUMBER: ",A$ \ A$""  .Z A$1,1)"0"  \ A$1,1)"H" n (d A A$) \ A$A)"H" , n " IS INVALID" \ P x   HEX DECIMAL  > THE NUMBER HAS ANY HEX CHARACTERS, ITS OBVIOUSLY HEX 6 AA1 \ MAKE ALLOWANCE ENCE OF 'H' HEX  A5 n X1 A1 \ X1A$X,X)) 6 X148 X170) X157 X165) n \ X  P0 \ D0  XA1 1 1 # DDAA$X,X),A)16P \ PP1  X ! " = ",D," DECIMAL" \ P    DECIMAL HEX " , X1 A \ X1A$X,X)) /6 X148 X157 \ MAYBE ITS HEX? @ X J AA$1,A)) 'T ACA) \ A1 n \ A$" " ^ X0 3 h A$X1,X1)B$XX)) \ X 9r X 1 3 \ A$1,1)"0" A$A$2,A$))  | X  " = ",A$," HEX"  P     OF MAIN  0 AZ$,A) \ HEX II DECIMAL NUMBER ! AZ$)48 \ A9 AA7  A \   * B$B) \ DECIMAL NUMBER HEX II # B10 B48) B55)   & <0 CC) \ BREAKDOWN DECIMAL # O 4 DECIMAL CODED HEX #: C65535 1 \ OVERFLOW 1D X0)0 \ X1)0 \ X2)0 \ X3)0 \ C1 4096 !N C2 0 3 \ MSD IN X0) X CC1)2 v,l,b #b CCC1 \ XC2)XC2)1 \ X l XC2)XC2)1 \  v C1C116 \ C2  C   3 HEXDEC HEXADECIMAL DECIMAL VICE VERSA. 4 INSTRUCTIS ARE PROVIDED IN THE BASIC PROGRAM. 8 THE LIMITS ARE FFFFH 65535 DECIMAL. RING A BELL? A( "THIS PROGRAM IS A COLLECTION OF REM STATEMENTS. LIST IT"  8 MEMSETSETS NTHSTAR BASIC USE ANY IGUOUS MEMY 8 LOCATIS. PLE THERE IS A 4K BOARD AT LOCATI 3 0. THE MEMSET WOULD BE 0 THE START, 6( FFF THE LAST. THERE WERE 20 K OF MEMY AT ,2 2000H, THE WOULD BE START, 6< 6FFF THE LAST. THE REPRESENTS BAS SO THAT #F YOU D'T HAVE MEMIZE IT. AP "THIS PROGRAM IS A COLLECTION OF REM STATEMENTS. LIST IT"  LOCATIS. PLE THERE IS A 4K BOARD AT L 5 MEMSET SETS UP NTH STAR BASIC USE NSTARD $ WKING SRAGE ERASES ITSELF ) PROGRAMMED OCT 1977 BY R LA PEDIS ( 2 A$4),B$4),C$2) &< 1 "START ADDRESS IN HEX? ",A$ +F " / END ADDRESS IN HEX? ",B$ \ P Z d A$1,1) "*" "n CB$)0 < B$A$B$) x S10758)10759)256  FAB$)B256  SF <  10761,A \ 10762,B   % CA$) 0 CB$) 0 < 0 A$A$A$) \ B$A$B$) \ A$ B$ < 1 10758,AA$) \ 10759,B \ START ADDR  S B 256 A - 10761,AB$) \ 10762,B \ ADDR  F B 256 A : "BASIC IS NOW SET FOR",FS1," BYTES. THAT EQUALS", . FFS1)256 \ FF)  FF1) ) F 0 1, F, \ " BLOCKS."  C10752) " , OF MAIN 6 @ *J ADD LEADING ZEROS CVERSI EASE. T ^ A$Z$) h Z$) 4 | *r X 1 4Z$) \ Z$ "0"Z$ \ X | Z$ \   9 CHANGE 4 II CHARS O TWO BYTES OF BASE 10 ATI.   AA$) < C$ A$3,4) \ A$ A$1,2) \ MOST SIG BYTE IN A$ B ) A BC$1,1),A)16 BC$2,2),A) ) B BA$1,1),B)16 BA$2,2),B)  A \   ! II HEX DECIMAL NUMBER   BZ$,B) + B Z$) 48 \ B 9 B B 7  B \ & 0 : 9D MAKE SURE THAT STRING IS HEX GARBAGE GIGO) N X CZ$) b X1 Z$) 0l Z$X,X)) 57 Z$X,X)) 65  0v Z$X,X)) 48 Z$X,X)) 70   X  1  0   -\0YO<\YOG\ZOR\O[\5FFF\5FFFFF FFFF PA!EB%PC \ \ 20), "FILEDIT" 8 "PRINT CONTENTS, EDIT, OR COPY A BASIC DATA FILE" & \ "PRINT, EDIT, OR COPY? ",A7$ !( A7$"PRINT" "FILEDITP" "2 A7$ "COPY" "FILEDITC" < A7$"EDIT"  5F "DO YOU WANT DETAILS? ",Y$ \ Y$) 0 P Y$1,1) "Y" BZ "TYPE A SPACE TO ACCEPT A LINE, A QUESTION MARK TO DELETE," Ad "AN S TO SKIP DOWN TO A PARTICULAR LINE, AN M TO MOVE ALL" @n "LINES DOWN TO (BUT NOT INCLUDING) A GIVEN LINE, AN A TO" ?x "TO INSERT A LINE AFTER THE OLD LINE, A B TO INSERT ONE" C "BEFORE THE OLD LINE, OR AN EQUAL SIGN TO REPLACE THE LINE." < "WHEN INSERTING, TYPE C AFTER EACH LINE TO CONTINUE." = "FILEDIT IS NOT INTENDED FOR EDITING FILES OF DATA OF"  "MIXED TYPES."  "FILEDITE"   |K1K11 I KK1#1%P,&K1, '" ",KK1," CHARACTERS REMOVED" NNKK1 PPK1\#1%P1,&A , #0\#1 #\N," CHARACTERS WERE REMOVED" "DONE" & C10\ C20\ A$200),B$200) \  "SOURCE FILE: ",F1$  "DESTINATION FILE: ",F2$ ( #0,F1$\ #1,F2$ 2 0)1) n,<,P < #0,A$\C1 C1 1 F #1, A$ \ 2 P #0,B1\ C2 C2 1 Z #1,B1 d 2 7n #1\ C1, "STRINGS AND ", C2, " NUMBERS COPIED." x #0\ DIT" " # B1,\ Q$ \ Q$ " " "  Q$ "?"  Q$ "=" B1 " #1,B1 , 6 #1\  !@ "FILE TO BE PRINTED:  A$500) ! "FILE TO BE PRINTED: ",F1$  \ #0,F1$ \ C1 0 ( "FILE CONTENTS:" 2 0)1) d,<,P < #0,A$ \ C1 C1 1 F %5I,C1,": ",A$ \ 2 P #0,N1 \ C1 C1 1 Z %5I,C1,": ",%,N1\ 2 d #0\  & C10\ C20\ A$200),B$200) \  "SOURCE FILE: ",F1$  "DESTINATION FILE: ",F2$ ( #0,F1$\ #1,F2$\ J 0 2 0)1) ^,<, < #0,A$\J J 1 3F %5I, J, " ",A$,\ ">",Q$ \ Q$ " " P Q$ "?" 2 Z Q$ "=" A$ d Q$ "M" n Q$ "S" x Q$ "B" #1,A$  Q$ "A" 2 0 1 B$ \ #1, B$ \ ">",Q$ \ Q$"C"  ' "LINE # ? ", N \ N J ' "CANNOT WORK BACKWARDS!" \ F  #0, A$ \J J 1  N J F  Q$ "M" #1, A$  0)1) T, , ( #0,B1\ J J 1 \ N J  ! Q$ "M" #1, B1 \  #0, B1 \ J J 1 2 %4I, J, %, B1,\ ">",Q$ \ Q$ " " ,  Q$ "?" 2  Q$ "=" B1  Q$ "M" O  Q$ "S" O " Q$ "B" J , #1,B1 6 Q$ "A" J @ 2 0J B2 \ #1, B2 \ ">",Q$ \ Q$ "C" J K 'O "ITEM # ? ", N \ N J  P N J &Q "CANNOT WORK BACKWARDS" \  -T "REACHED END OF FILE SEEKING LINE ", N ^ #1 h #0\  T "FILE CONTENTS:" ^ C1C11\ C2C21 h C215 | r C20\ " ",A1$ | 0)1) ,,  #0,A$  C1,": ",A$\ ^  #0,N1  C1,": ",N1\ ^  #0\ O BE PRINTED: ",F1$ J \ #0,F1$ T "FILE CONTENTS:" ^ C1C11\ C2C21 h C215 | r C20\ " ",A1$ | 0)1) ,,  #0,A$  C1,": ",A$\ ^  #0,N1  C1,": ",N1\ ^  #0\  8 FIL IS A SYSTEM OF FOUR MODULES WHICH PERM COPY, 0 FUNCTIS BASIC FILES. THE CODE 7 FIL IS AN EXTENSI OF FILEPRNT BY LARRY KAVERT 1( GN STEINER. THE FOUR MODULES ARE LINK :2 CRECTLY THEY MUST ALL BE DRIVE #1 THE CODE MUST 7< BE CHANGED. FIL IS IN MODULES BOTH REDUCE THE 2F SRAGE REQUIENT SIMPLY THE INSERTI OF P SPECIAL PURPOSE CODE.  14 14 14 14 14 14 14 14 14 14 14 14 14 14 14 14 14 14 14 14 14 14 14 14 14 14 14 14 14 14 14 14 14 14 14 14 14 14 14 14 14 14 14 14 14 14 14 14 14 14 14 15 15 15 15 15 15 15 15 15 15 15 15 15 15 15 15 15 15 15 15 15 15 15 15 15 15 15 15 15 15 15 15 15 15 15 15 15 15 15 15 15 15 15 15 15 15 15 15 15 15 15  "MEMRYMAP"  A$16) & A$"0123456789ABCDEF" \ B$"048C" 8( " MEMORY MAP (ASSUMES MDC AT E800, 16K AT 2000H)" 2 M1 16 < A$M,M),"...", F M P Z M1 16 d B$, n M \ x I 0 \ J 8191 \ I 1 16 \ "M", \ I " I 24576 \ J 59391 \ + ".", \ I 60416 \ J 65535 \   A I J 1024  DA) \ A,255D ! A)255D "M", ".", A,D A \  WWWWWW8 "BASIC WORKSPACE EXPANDER FOR STANDARD BASICS" \  A10752 \ 2A00H  L0A6)256A7) ( H1A9)256A10) <2 "OLD LO MEMORY BOUND: ",L0," OLD HI MEMORY BOUND: ",H1 "< DH11024) \ H11024,255D *F H11024)255D H1H11024 n P H1,D \ )Z BEE THE DISK ROLLER IS REACHED d H1 58368 < n A10),H1256) x H11024,D \ & \ "NEW HI MEMORY BOUND",H1 \ VA) u E + FAST ST, MINIMUM COMPARIS, MIN. S . VARIATI OF WOODRUM ST BY RICHARD HART 3 PUBLISHED IN CREATIVE COMPUTING JANFEB 1978 +n "HOW MANY RANDOM NUMBERS TO SORT: ",N s N0 x NN) \ ARRAY #'S  I1 N  "NUMBER: ",NI)  I "SORTING..." ENTRY 4 L9N)2).9) \ LINKSN2N)2 ELEMENTS ! LNL92) \ LINK ARRAY  I0  K1,I,M1,T2,T40  JN1 \ HEAD OF SEQ 1  L1)1 \ LJ)1 \ K21 # N1  \ , HING ST  S1N \ NUMBER OF LEAVES  CLIMB TREE ) S1 4 @ \ LOW DER TWIG UE  K2K22 \ TAL # OF TWIGS  B2S12 " S1B2) , T4T4B2S1)K2 6 @ INITIAL CALCULATIS $J T4K2T4 \ # OF LODER TWIGS $T B2K22 \ HIBIT OF BIN CTR ^ TWIG #h K1K2  \ ST COMPE !r T1K11 \ K1K11 \ TWIG # | B1B2 \ HI BIT UE $ T3T2 \ PREV REFLECTED TWIG # # ADD 1 REFL BIN CTR & CARRY  T1T12 ' T1)T1  \ NO ME CARRIES & M1M11 \ # OF MERGES & CARRIES  T2T2B1  B1B12 \ BIT UE   \ CARRY 1  TWIG CALCULATIS " T2T2B1 \ REFLECTED TWIG # ' S12 & \ 2TWIGS & 3TWIGS  3TWIGS & 4TWIGS , T3T4 0 \ LODER TWIG 3TWIG)  4TWIG % M1M1 \ DISENGAGE # OF MERGES  v ,& T3T4 b \ LODER TWIG 3TWIG) 0 3TWIG : M1M11 \ # OF MERGES D II1 \ LEAF (N LI)I \ LJ)I \ GENERATE A LEAF X JJ1 \ SEQUENCE HEAD b 2TWIG l M1M11 \ # OF MERGES v II1 \ LEAF . L1I \ LI)I \LJ)I \ GENERATE A LEAF ) L0J \ HEAD OF OLDER LEAF LAST ) + JJ1 \ HEAD OF LATEST LEAF 2 S)  II1 \ LEAF / L2I \ LI)I \ LJ)I \ GENERATE A LEAF   \ MERGE LEAVES  MERGE TWIGS & BRANCHES + JJ1 \ HEAD OF LATEST BRANCH TWIG + L0J1 \ HEAD OF OLDER BRANCH TWIG $ L1LL0) \ HEAD OF SEQUENCE 1 # L2LJ) \ HEAD OF SEQUENCE 2 , NL1) NL2) 4 \ STAY IN SEQ 1  LL0)L2 \ SWITCH SEQ 2  L0L2 \ P LEAF IN SEQ 2 !  L2LL0) \ LEAF IN SEQ 2 ! L2L0 f \ OF SEQ 2 *  NL1)NL2)  \ STAY IN SEQ 2 * LL0)L1 \ SWITCH SEQ 1 4 L0L1 \ P LEAF IN SEQ 1 > L1LL0) \ LEAF IN SEQ 1 "H L1L0  \ OF SEQ 1 R LL0)L2 \ SWITCH SEQ 2 \ p f LL0)L1 \ SWITCH SEQ 1 p M1M11 \ # OF MERGES z M10   M10 ^ $ GENERATE 2ND HALF OF A 4TWIG & M11M1 \ REENGAGE # OF MERGES  v  ! L0N1 \ FIRST LINK IN SEQ  I 1 N  L0LL0) \ FOLLOW LINKS  NL0),  I  A /]AA AAA@A]P@P + FAST ST, MINIMUM COMPARIS, MIN. S . VARIATI OF WOODRUM ST BY RICHARD HART 3 PUBLISHED IN CREATIVE COMPUTING JANFEB 1978 "n "HOW MANY WORDS TO SORT: ",N s N0 t "MAXIMUM WORD LENGTH: ",W u W1 v W1W1 'x N$NW1)) \ ARRAY WDS  I1 N  P1I1)W \ WD POER  "WORD ",N$P,PW1)  I "SORTING..." ENTRY 4 L9N)2).9) \ LINKSN2N)2 ELEMENTS ! LNL92) \ LINK ARRAY  I0  K1,I,M1,T2,T40  JN1 \ HEAD OF SEQ 1  L1)1 \ LJ)1 \ K21 # N1  \ , HING ST  S1N \ NUMBER OF LEAVES  CLIMB TREE ) S1 4 @ \ LOW DER TWIG UE  K2K22 \ TAL # OF TWIGS  B2S12 " S1B2) , T4T4B2S1)K2 6 @ INITIAL CALCULATIS $J T4K2T4 \ # OF LODER TWIGS $T B2K22 \ HIBIT OF BIN CTR ^ TWIG #h K1K2  \ ST COMPE !r T1K11 \ K1K11 \ TWIG # | B1B2 \ HI BIT UE $ T3T2 \ PREV REFLECTED TWIG # # ADD 1 REFL BIN CTR & CARRY  T1T12 ' T1)T1  \ NO ME CARRIES & M1M11 \ # OF MERGES & CARRIES  T2T2B1  B1B12 \ BIT UE   \ CARRY 1  TWIG CALCULATIS " T2T2B1 \ REFLECTED TWIG # ' S12 & \ 2TWIGS & 3TWIGS  3TWIGS & 4TWIGS , T3T4 0 \ LODER TWIG 3TWIG)  4TWIG % M1M1 \ DISENGAGE # OF MERGES  v ,& T3T4 b \ LODER TWIG 3TWIG) 0 3TWIG : M1M11 \ # OF MERGES D II1 \ LEAF (N LI)I \ LJ)I \ GENERATE A LEAF X JJ1 \ SEQUENCE HEAD b 2TWIG l M1M11 \ # OF MERGES v II1 \ LEAF . L1I \ LI)I \LJ)I \ GENERATE A LEAF ) L0J \ HEAD OF OLDER LEAF LAST ) + JJ1 \ HEAD OF LATEST LEAF 2 S)  II1 \ LEAF / L2I \ LI)I \ LJ)I \ GENERATE A LEAF   \ MERGE LEAVES  MERGE TWIGS & BRANCHES + JJ1 \ HEAD OF LATEST BRANCH TWIG + L0J1 \ HEAD OF OLDER BRANCH TWIG $ L1LL0) \ HEAD OF SEQUENCE 1 # L2LJ) \ HEAD OF SEQUENCE 2 1 P11L11)W \ P21L21)W \ WD POERS 7 N$P1,P1W1) N$P2,P2W1) 4 \ STAY IN 1  LL0)L2 \ SWITCH SEQ 2  L0L2 \ P LEAF IN SEQ 2 !  L2LL0) \ LEAF IN SEQ 2 ! L2L0 f \ OF SEQ 2 1  P11L11)W \ P21L21)W \ WD POERS 6% N$P1,P1W1) N$P2,P2W1)  \ STAY IN 2 * LL0)L1 \ SWITCH SEQ 1 4 L0L1 \ P LEAF IN SEQ 1 > L1LL0) \ LEAF IN SEQ 1 "H L1L0  \ OF SEQ 1 R LL0)L2 \ SWITCH SEQ 2 \ p f LL0)L1 \ SWITCH SEQ 1 p M1M11 \ # OF MERGES z M10   M10 ^ $ GENERATE 2ND HALF OF A 4TWIG & M11M1 \ REENGAGE # OF MERGES  v  ! L0N1 \ FIRST LINK IN SEQ  I 1 N  L0LL0) \ FOLLOW LINKS  P1L01)W \ WD POER  N$P,PW1) \ WD  I  ^`A^BABBTERRY NIKSCH WORKS AT NORTHSTAR COMPUTERS pA *)QS: ): )"): THE RANSEED FILE IS USED SET UP THE DOS ROMIZE 9 THE SEQUENCES GENERATED BY THE FUNCTI IN BASIC. > THE FOLLOWING SEQUENCE OF OPERATIS WILL INSTALL RANSEED\ ( LF DOS 3000 2 LF RANSEED 39E0 < SF DOS 3000 @F THE SOURCE CODE RANSEED MAY BE FOUND IN THE FILE RANSRC 8P RANSEED IS USED BY ING IT FROM BASIC AS FOLLOWS\ %Z A 10720) 65536 ) 8d CE RANSEED DEPS THE DISK ROLLER PSEUDOSECR