I am working on a QB64 GPT. I have been training it on the Wiki as well as some sample programs. Doesn't always produce ready-to-use code, especially when it comes to OpenGL or Windows API. Otherwise, most things it makes should be good. If anyone is willing to concatenate all their samples or libraries into single files, I'd be happy to use them as training data for the GPT. It also has InForm as training data, though I can't say it does too well. I plan on making another GPT that is strictly for helping with making changes to the IDE/compiler.

https://chatgpt.com/g/g-Cufiyami0-qb64-gpt

Orbit sub calculates points about a point cx, cy at a given angle in degrees and radius using trig functions COS and SIN ratios according to degrees.

I don't think there is present option whereby the NEXT (as in the FOR..NEXT) will automatically display the control variable after Next?? When a For is typed you get an automatic warning that you need the NEXT but if the For already has a control variable then could the warning also include the control variable? For x = 1 to 10 "Warning missing NEXT x"

I do appreciate there is a lot less typing if the control variable is not needed to complete the For .. Next but sometimes when I have a lot of nested IF statements with a lot of For..Next loops it is always a missing End If that is somewhere in that mess of code which creates a Program Flow error. Following which For goes to which Next can be a little challenging. So I was thinking is the Flow Error highlighted Next x as the loop where I can find the missing End If (as opposed to the Next y or Next Num etc in the same mess of coding) it could help.

  Alchemy.7z (Size: 355.16 KB / Downloads: 99)

I've re-written the word-game Alchemy with several new innovations, which I think make it more enjoyable.

It has 3 sets of 20 word-pairs, roughly sorted in order of difficulty from easy to  hard. All pairs are 
proven to be solvable, with the current best results stored as three Previous best files. These automatically 
update when the records are beaten, but can be removed and re-started at will. 

It allows re-starting a word-pair, or re-picking the set of words. A random-access word file is included which 
makes the word-checking function much faster.

My thanks to Steve and bplus for their help. 

A quick little method to get prime numbers from 2 to a little over 1,000,000.

Screen _NewImage(1280, 900, 32)

_ScreenMove _Middle

For i = 1 To 999999 'I didn't stop at 1,000,000 just cause I didn't want that last SLEEP/CLS to erase the last page. 

    If IsPrime(i) Then Print i;

    If i Mod 12000 = 0 Then Sleep: Cls

Next

Beep 'an audible warning so folks can take their finger off whatever key they're using to spam past the SLEEP statements.

_Delay 2 'and time for them to let go of that key

_KeyClear 'so if they're using ENTER as the "Get on with it damn ya!" key, it won't blow past the manual test.

Print

Print



Print "Feel free to do some independent tesing to see if my response is speedy enough for you:"

Do

    Input "Give me a number from 0 to 1,016,064 and I'll tell you if it's prime or not.  (Zero quits.) =>"; num

    If IsPrime(num) Then

        Print num; "is, indeed, a prime number!"

    Else

        Print "Nope!"; num; "is not prime!"

    End If

Loop Until num = 0

System





Function IsPrime (num)

    'to check for any given number less than 1,016,064, we only have to do a maximum of 170 comparisons

    'as the max value we ever have to check against is the SQR of our number.

    'for example, no value higher than 10 could ever be a factor in 100 and be prime!

    'so for numbers less than 1,000,000, all we need do is compare them against factors less than 1,000.

    'and there's not that many of them, as you can see below!

    If num < 2 _Orelse num > 1016064 Then Exit Function

    Restore prime_factors

    IsPrime = -1

    For j = 1 To 10 'broken down to give 10 quick exit points so we don't check every value for an answer.

        Read count

        For i = 1 To count

            Read factor

            If num <= factor Then

                Exit Function

            Else

                If num Mod factor = 0 Then IsPrime = 0: Exit Function

            End If

        Next

        If num < factor * factor Then Exit Function

    Next



    Exit Function

    prime_factors: 'for a list of prime factors for numbers from 1 to 1,000,000

    Data 25: 'for numbers from 1 to 100

    Data 2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97: 'factors up to 10,000 (100 ^ 2)

    Data 21: 'for numbers from 101 to 200

    Data 101,103,107,109,113,127,131,137,139,149,151,157,163,167,173,179,181,191,193,197,199: 'up to 44,100 (210 ^ 2)

    Data 16

    Data 211,223,227,229,233,239,241,251,257,263,269,271,277,281,283,293: 'up to 93,636 (306 ^ 2)

    Data 16

    Data 307,311,313,317,331,337,347,349,353,359,367,373,379,383,389,397: 'up to 160,000 (400 ^ 2)

    Data 17

    Data 401,409,419,421,431,433,439,443,449,457,461,463,467,479,487,491,499: 'up to 252,004 (502 ^ 2)

    Data 14

    Data 503,509,521,523,541,547,557,563,569,571,577,587,593,599: 'up to 360,000 (600 ^ 2)

    Data 16

    Data 601,607,613,617,619,631,641,643,647,653,659,661,673,677,683,691: 'up to 490,000 (700 ^ 2)

    Data 14

    Data 701,709,719,727,733,739,743,751,757,761,769,773,787,797: 'up to 652,864 (808 ^ 2)

    Data 15

    Data 809,811,821,823,827,829,839,853,857,859,863,877,881,883,887: 'up to 820,836 (906 ^ 2)

    Data 14

    Data 907,911,919,929,937,941,947,953,967,971,977,983,991,997: 'up to 1,01,064 (1008 ^ 2)

End Function

I'm sure I'm doing it wrong! To update, I currently download the new file (into my Downloads folder), then extract the files to my QB64PE folder (which is directly on the C: drive).
I then go to this new folder in PE, and copy all the files to the PE folder itself. I'm prompted to write over old files found or to skip the copy. 
Is there a quicker/simpler way to update (maybe skipping files that are not changed)?

https://github.com/QB64-Phoenix-Edition/...ses/latest

Quote:What's Changed
Refactor RAD v2 Opal OPL3 FM Emulator by @a740g in #490

Multiple font related optimization and improvements by @a740g in #491

Especially some monospaced fonts related quirks discovered with the previous release have been fixed

Thanks to @RhoSigma , this wonderful keyword was added into the language a few versions back.  I'm honestly surprised we haven't had more people talk about it, use it, or at least ask about it!  This is one of those commands that I consider to be a *MUST HAVE*  for anyone who does any serious library creation.

What is $INCLUDEONCE?  And what's it do for us that's so nifty?

$INCLUDEONCE is a metacommand that you place inside any of your library files, and no matter how many $INCLUDE statements they show up in, they're only included ONCE in your code.


For example, let's say I write various libraries and I have a Truth.BI file which I make excessive use of:

Truth.BI

More playing around today. I created a few functions to quickly get vector quantities from a SIN lookup table.

The SIN/COSINE table returns standard results while the conversion functions negate the COSINE value so 0 degrees and 0Pi are north/up.

Greetings all.

100% New here.
I normally program for windows, but i miss the good old days where stuff were so much simpler.
I also realize how much I have forgotten about Qbasic and the stuff I enjoyed.

My request is not really serious, but rather curious as to certain processes that I saw in VBDOS that were carried over into windows.
It is easy to use pre-existing controls in visual designers, but how on earth did Microsoft create those basic controls for VB dos??

Like: On a dos screen in QB64 I set width to 140, 50 which looks much like the old DOS screens.
Drawing boxes with Ascii codes using commands SUBs is pretty fun, but it is just lines and text.

How would one try and create a basic FORM in Screen 0 that looks like VBDOS (the draw is easy) that you could MOVE and open another?
It has to be some image clipping of sorts and event trapping?

I am having loads of fun, but i also realize how much i have become dependent on other people's designers without understanding the core processes that runs it.

Some ideas would be much appreciated.

Regards, Pete