-
+3 how to detect if a file exist ?Need help. I am making a generic menu to my compilations over the spectrum +3. Exist some way programatically to detect if some file exists on the d…
... file check routine which uses DEF FN to define the file name ... /> The function definition is:
DEF FN o(f$)=USR 49050
FN o(f$) arg
ld ... -
+3 how to detect if a file exist ?Need help. I am making a generic menu to my compilations over the spectrum +3. Exist some way programatically to detect if some file exists on the d…
... ?[/QUOTE]
Errrm ... use DEF FN to pass arguments to USR ... -
+3 how to detect if a file exist ?Need help. I am making a generic menu to my compilations over the spectrum +3. Exist some way programatically to detect if some file exists on the d…
... day. Specifically, the use of FN o(f$) in these lines ... : GO SUB 9220: DEF FN o(f$)=USR 49050: DEF FN p(t,e ... LET r$=l$(item): IF FN o(r$+CHR$ 255) THEN ... file name passed in the FN o(f$) call.
BITWISE operators...Hi Folks, Another question - is there a way (fast) to do bitwise operations in Sinclair BASIC? Many thanks Paddy
... numbers as strings in the DEF FN article on the tech wiki ...BITWISE operators...Hi Folks, Another question - is there a way (fast) to do bitwise operations in Sinclair BASIC? Many thanks Paddy
... you could use a FN. Your example would become ... address of first character after FN
INC HL
FN
AND B
[CODE]
10 DEF FN A(X,Y) = USR start_address ...
20 PRINT FN A(10,20)
[/ ...PFN PRINT by Garry Rowland...Hi Folks, Whilst watching Casualty last night I thought I would surf the archive and look at some "classic" software. One I tried was a program cal…
... had the instructions, something about DEF FN and such.... I also used ...Time function?How do you do a timer? Example: Start timer If timer = 10 seconds then reset timer Thanks
... /> Basicly:
[code]50 DEF FN t()= INT ((65536* PEEK 23674 ... )/50)
60 LET now=FN t()
70 PRINT "DO ... 10 SECONDS...";
80 IF FN t()Location of variableHi everyone When basic makes an array how to you find out the location in the ram of where the data is stored. :) Also, does it store the values in…
... .
[code]
4 DEF FN p(a)=PEEK a+256 ... :
FOR i=FN p(23627) TO FN p(23641)-2:
FN p(i+1): NEXT i ... /> FOR a=i+1 TO FN p(23641)-2:
IF ...Location of variableHi everyone When basic makes an array how to you find out the location in the ram of where the data is stored. :) Also, does it store the values in…
...
[CODE]10 REM DEF FN v()=PEEK (23627)+256*PEEK ... (23628)
15 REM DEF FN t(a)=INT (PEEK ( ... a)/32)
20 REM DEF FN c$(a)=CHR$ (PEEK ... /> 9050 REM LET v0=FN v()
9055 LET ... 9130 REM LET n$(i0)=FN c$(v0)
9135 ... br /> 9150 REM IF FN t(v0)5 THEN ...Sorting an array...Hi Folks, Over the weekend I had a play with sorting algorithms - takes me back to my student days! :-o My first try was with the good old Bubble S…
... the time stuff in a DEF FN but for some reason they ...Sorting an array...Hi Folks, Over the weekend I had a play with sorting algorithms - takes me back to my student days! :-o My first try was with the good old Bubble S…
... Shell Sort demo
2 DEF FN t()=65536*PEEK 23674+256 ...
90 LET t1=FN t(): LET t2=FN t():
LET ...Keyboard mapping...Hi Folks, This is probably going to be one of those daft questions but... On the emulators (Spectrum and CPC) why are the keyboards not mapped to t…
... is fine. Do not use DEF FN though as it seems to ...Keyboard mapping...Hi Folks, This is probably going to be one of those daft questions but... On the emulators (Spectrum and CPC) why are the keyboards not mapped to t…
... is fine. Do not use DEF FN though as it seems to ...Sorting an array...Hi Folks, Over the weekend I had a play with sorting algorithms - takes me back to my student days! :-o My first try was with the good old Bubble S…
... quicksort implementation...
[code] 1 DEF FN t()=(PEEK 23672+256*PEEK ... 1000
30 LET t1=FN t(): LET fr=1: LET ... : GO SUB 4000: LET t2=FN t()
40 GO SUB ...Sorting an array...Hi Folks, Over the weekend I had a play with sorting algorithms - takes me back to my student days! :-o My first try was with the good old Bubble S…
... quicksort implementation...
[code] 1 DEF FN t()=(PEEK 23672+256*PEEK ... 1000
30 LET t1=FN t(): LET fr=1: LET ... : GO SUB 4000: LET t2=FN t()
40 GO SUB ...numbers to binaryHi everyone, I have looked through the manual and have found nothing. How do you change a number to binary easily? I know you can go binary to decim…
... " method):
[code]10 DEF FN b$(n)=("0000" AND n ...
30 PRINT FN b$(INT (n/16));FN b$(n-16 ...numbers to binaryHi everyone, I have looked through the manual and have found nothing. How do you change a number to binary easily? I know you can go binary to decim…
... /> [code] 5 RANDOMIZE
10 DEF FN b$()=STR$(INT (RND*2 ... n$=FN b$()+FN b$()+FN b$()+FN b$()+FN b$()+FN b$()+FN b$()+FN b$()
numbers to binaryHi everyone, I have looked through the manual and have found nothing. How do you change a number to binary easily? I know you can go binary to decim…
... it... :)
[code]10 DEF FN b$(n,d)=VAL$ "STR ... $(INT (n/d),d/2)+FN b$(n-d*INT (n ... -255): ";n
30 PRINT FN b$(INT (n/16),4 ... );FN b$(n-16*INT (n/ ...Sorting an array...Hi Folks, Over the weekend I had a play with sorting algorithms - takes me back to my student days! :-o My first try was with the good old Bubble S…
... i: PRINT : RETURN
9000 DEF FN t()=(PEEK 23672+256*PEEK ... 5000
9030 LET t1=FN t(): LET a=1: LET ... : GO SUB 4000: LET t2=FN t()
9040 GO SUB ...Sorting an array...Hi Folks, Over the weekend I had a play with sorting algorithms - takes me back to my student days! :-o My first try was with the good old Bubble S…
... i: PRINT : RETURN
9000 DEF FN t()=(PEEK 23672+256*PEEK ... 5000
9030 LET t1=FN t(): LET a=1: LET ... : GO SUB 4000: LET t2=FN t()
9040 GO SUB ...Sorting an array...Hi Folks, Over the weekend I had a play with sorting algorithms - takes me back to my student days! :-o My first try was with the good old Bubble S…
[B]STEP 3 -[/B] Now let's take a look at the quicksort algorithm, since we will need to properly understand it in order to find further improvements.
The basic idea behind the quicksort algorithm can be represented by the following pseudo-code ...variable variable names with VAL$It's possible to make the RH-side variable names in a LET statement be themselves variable by using VAL$. Thus, if v$ holds the [b]name[/b] of anothe…
[QUOTE=Dr BEEP;483699][code]
1 let b$="hello"
2 let v$="b$"
3 let a$=VAL$ v$
4 print a$
[/code][/QUOTE]
Very nice - scope for a [B]DEF FN[/B] there ?!Sorting an array...Hi Folks, Over the weekend I had a play with sorting algorithms - takes me back to my student days! :-o My first try was with the good old Bubble S…
... i: PRINT : RETURN
9000 DEF FN t()=(PEEK 23672+256*PEEK ... 5000
9030 LET t1=FN t(): LET a=1: LET ... : GO SUB 4000: LET t2=FN t()
9040 GO SUB ...ForthTrying to search for FORTH programs and FORTH articles within the forum is proving to be a complete nightmare!! If I search for FORTH in Infoseek I …
... that's because it uses DEF FN and FN). "Mined Out", "Derby Day ... ] [INT] 1000
OP /
FN INT
OP -
OP ...inverting graphics using basic?just curious if it could be done by poking screen memory ? and what's the structure. (foreground / background for each char ? ) reason I ask is I'd …
... bit long funciton):
DEF FN O(x,y)=(128 AND ... AND INT (FN V(FN V(FN V(FN V(FN V(FN V(FN V(x ... ) OR INT FN V(FN V(FN V(FN V(FN V(FN V(FN V(y ... , this is AND:
DEF FN A(x,y)=(128 AND ... AND INT FN V(FN V(FN…inverting graphics using basic?just curious if it could be done by poking screen memory ? and what's the structure. (foreground / background for each char ? ) reason I ask is I'd …
... bit long funciton):
DEF FN O(x,y)=(128 AND ... AND INT (FN V(FN V(FN V(FN V(FN V(FN V(FN V(x ... ) OR INT FN V(FN V(FN V(FN V(FN V(FN V(FN V(y ... , this is AND:
DEF FN A(x,y)=(128 AND ... AND INT FN V(FN V(FNinverting graphics using basic?just curious if it could be done by poking screen memory ? and what's the structure. (foreground / background for each char ? ) reason I ask is I'd …
... bit long funciton):
DEF FN O(x,y)=....
FN, but how, can please somebody ... are depend on another function (FN V) and that is dependant ... itself on yet another function (FN T from memory)!
