Let me introduce the PMF2 (that's my own file format) archiver. It is a compression program, the main advantage of which is that files can be compressed and decompressed using only QB64 directly from the source code. It allows you to view packed files and can unpack just one specific file or all files from the archive. It has a built-in feature that makes sure that if the unzipped file already exists on the hard drive, the new unzipped file will have a parenthesis with a number after the name, just like Windows does.

So you get the option to have many files in a single file with the option to extract just one specific one or all files.
Higher operations, such as updating a specific file in the archive, or deleting one file in the archive are not yet supported, I also saved something for another time, that's clear after all

Well, it's probably dawning on someone. So who asked how to add more files to the EXE? I'll add a new thread directly to that in a moment. 



rewrite in source code file names for your correct files in array FL for trying!

Piral:

Wondering if any of you guys have done any coding with Blockchain. As I understand it, there is basically a record which is not written until all records are searched and the new record to be written is deemed valid in someway before it can be written to the chain of records. The two main/key points I take away from this is that VALIDATION before writing the record can be very complex and secondly, the chain must be sequential or there has to be an index table that allows the records to be found in the order in which they were written. So in pseudocode the layout would be something like this:


- compose a validation routine which comprises decisions on what is accurate and acceptable

- Input a record

- Review the present chain
  a:for duplication of inputted record
  b:for a location in chain where the inputted record will be written
  c: subject the inputted record to the validation routine
  d: write the inputted record or reject the record.
  e: keep an index as to where this inputted record can be found

The blockchain that I'm trying to work on is not for public input but rather something which raises the accuracy of the data in the data base and improves retrieval of any given small piece of data stored. In this regard, what I don't have in the above pseudocode layout is a search routine. It would seem I need 2 search routines, one associated with the Review of the chain before writing a record and one associated with a search of data where No record is intended on being written. A number of years ago I started on a blockchain program but found it was going to be extremely large and abandoned it. So I'm looking at it again but trying to conceptualize a smaller program.

Here is a small program for solving a Sudoku.
Start the program, press "C" to clear the field. Then fill in the sudoku that you can find in newspapers or other media and finally press "S" to solve the sudoku.
You cannot solve it yourself, the computer does all the work for you.
Comments are welcome 


  sudoku.bas (Size: 10.37 KB / Downloads: 70)

Attached Files

Thumbnail(s)
   

Would help me notice a new release sooner if latest release hyperline also had the version or have it displayed somewhere on the home page??? Guessing I missed 3.50 altogther 

Just my two cents 

BTW, requrie to update is a great touch for peeps like me  

Back in December, we held a Christmas banner contest which Bplus won by blowing away the competition with a very nice Christmas themed banner.  Now that Spring is right around the corner, it's time for folks to showcase their abilities and to have fun creating a Spring themed banner for our site!  

Can Bplus hold on to his accolades and design another winning banner for the Spring season?  Will someone else step up and knock him off his throne as our resident designer?  The world (of QB64 Phoenix Edition, anyway) is anxiously holding its breath to find out!

Rules are rather simple -- Spend the time between now and the 18th of March (2023) to design and create the best logo and share that you can.  A poll will be placed up on Sunday, the 19th of March (Spring-Eve) and folks will have all day to vote for their favorite banner.  The one with the most votes on the 20th will have their banner placed prominently for display so everyone can enjoy their work and effort!

Banner Image size should be 1400x256 to match what we currently have, but with that single limitation in mind, the world is your imagination!  Have fun and see what you can create that screams "Spring" "Phoenix"  "QB64" "Steve is Awesome!!!"... 

I'm pretty sure the QB64 version of this has already been posted in here, but danged if I can find it.

BAM Version.

I use this program quite often myself. This is a program that loads a file in ICO format. Its use is easy:

Icon = LOADICO (filename, imagenumber)
or
Number of Images in file = LOADICO (filename, -1)
or
Display all images in file ICO = LOADICO(filename, 0)

It is intended to be used on a 32-bit screen. It's just a small feature, so I didn't make it a library. Attached are some ICO files to try. ICO files can be freely downloaded. The reason I chose ICO is that a single file can contain multiple sizes of the same icon. This is what you need when creating an application. Not every computer has the same screen size, so - it is necessary to place different sizes of the same icons. Yes, this can be solved internally via _PUTIMAGE with a single size, but this is another option.

Attached Files

  icons.zip (Size: 627.85 KB / Downloads: 24)

Hey guys.

I found in the depths of the hard disk my older thing, which has only one task - to allow you to use mouse cursors in a way other than the built-in function such as _MOUSESHOW "LINK" and the like. The ANI files have the same format (or very similar), so I included them in the library as well, under the same command.

command:
handle = LOADCURSOR (path\file.cur) or
handle = LOADCURSOR (path\file.ani)
Function to the variable handle returns a positive number of the cursor or animation in the case of ani file.

Then there is the command PUTCURSOR (handle, positionX, positionY) - this command, like the _PUTIMAGE command, places the cursor image on the screen. It is intended for the graphics screen loop when the screen background is refreshed on each cycle. I could, if there was interest, make the modification to a hardware image, then you won't have to monitor the screen refresh, but the _Display command will be necessary.

_Putimage will never work with the handle returned by the LOADCURSOR function!

PUTCURSOR is also a common command and places animations loaded from ANI files in the same way.

Then we have the FREECURSOR command, it releases the loaded images of cursors or animations from memory. Usage: FREECURSOR (handle)

I've gone so far as to allow the decomposition of animation from ANI files into individual frames. For this you need the following 2 functions:

LENCURSOR - works only with ANI files - returns the number of ANI animation frames. Usage:
Frames = LENCURSOR (handle)

And the second function - it will allow you to get a handle from the animation compatible with the _PUTIMAGE command of each frame in the animation. Example for getting the third image in the animation:
Pic3 = DECOMPOSECURSOR (handle, 3)


This is an older program (I had to patch it a lot to get it to work in PE) and I have a feeling that someone on Linux once reported something to me about display issues. If this happens, please go to the cursor.bm file, subroutine PUTCUR, disable all the lines related to the mouse (110, 111, 112), I have a note that this should be the source of the problem at the time.

Finally, I would like to mention the so-called field within a field, I see on the forum that you deal with something like that. I use something like this in this program. So let's break down the cursor.bi file:


TYPE Cursors_internal
    StartOffset AS LONG 'use ANI
    EndOffset AS LONG

    X_reduction AS INTEGER ' CUR X coordinate reduction read from file
    Y_reduction AS INTEGER ' CUR Y coordinate reduction read from file
    Image AS LONG '          own CUR image is saved here
    Flag AS LONG '1 for ANI, 2 for CUR
END TYPE

DIM SHARED ACTIVE_MOUSE_CURSOR ' variable, which memorize new mouse cursor usage. Used in PutCur SUB
REDIM SHARED Internal_Recorded(0) AS Cursors_internal
REDIM SHARED Internal_Recorded_ANIs(0) AS LONG 'frames array


StartOffset.
  What is it? That's exactly it. A field within a field. This value indicates the starting index number in the Internal_Recorded_ANIs field. This is because an animation in an ANI file can have many frames. So how to write them in one field? You just add an auxiliary field and that is the Internal_Recorded_ANIs field.
EndOffset
This is the index value of the Internal_Recorded_ANIs field, it indicates the last index value that belongs to that one particular ANI file.

See how easy it is now to add more and more ANI images?

X_reduction AS INTEGER ' CUR X coordinate reduction read from file
Y_reduction AS INTEGER ' CUR Y coordinate reduction read from file

these values are contained in the CUR and ANI files and specify the number of pixels to shift the display so that the mouse points where the image

  Image AS LONG 'own CUR image is saved here

exactly as the comment says. When you load a CUR file, you get them as one image. This can be added directly to the main field, it's one record for one item, no problem with that.

  Flag AS LONG '1 for ANI, 2 for CUR
this is just a note that is written here by LOADCURSOR, according to which the program knows whether it should take the image from the main or from the auxiliary field

Finally own field
REDIM SHARED Internal_Recorded(0) AS Cursors_internal
  As you can see above: You call the file via its handle, which is the index number of the Internal_Recorder field. From this you will immediately know if it is a CUR or ANI file. For ANI, the first two records will tell you about the images that belong to that particular ANI. Next, learn about display corrections. So you have everything you need


BI, BM, ANI and CUR files in attachment (zip format)

Attached Files

  CurAni.zip (Size: 227.7 KB / Downloads: 21)

Môže nám niekto pomôcť.
Mám problém s jedným algoritmom. Neviem to vyriešiť.
Ide o triedenie čísel od najväčšieho po najmenšie.

Predmet - Objekt - Strana - súradnice
                        - súradnice
                        - súradnice
                        - súradnice
                        - súradnice
                        - súradnice
Predmet - Objekt - Strana - súradnice
                        - súradnice
                        - súradnice
          Objekt - Strana - súradnice
                        - súradnice
                        - súradnice
                        - súradnice
                        - súradnice
                        - súradnice
          Objekt - Strana - súradnice
                        - súradnice
                        - súradnice
                        - súradnice
                        - súradnice
                        - súradnice
Predmet - Objekt - Strana - súradnice
                        - súradnice
                        - súradnice
                  Strana - súradnice
                        - súradnice
                        - súradnice
                  Strana - súradnice
                        - súradnice
                        - súradnice
                  Strana - súradnice
                        - súradnice
                        - súradnice
Predmet - Objekt - Strana - súradnice
                        - súradnice
                        - súradnice
                        - súradnice
                        - súradnice
                        - súradnice

Každý predmet má niekoľko objektov.
Každý objekt má niekoľko strán
Každá strana má niekoľko súradníc.
Čo sa môže zmeniť.
Musím ich vytriediť.
Vk = náhodné číslo
Objekt(1, 1, 1, 0).z = Vk
Objekt(1, 1, 1, 1).x = -Vk
Objekt(1, 1, 1, 1).y = -Vk

Objekt(1, 1, 4, 4).x = Vk
Objekt(1, 1, 4, 4).y = -Vk
Objekt(1, 1, 4, 4).z = Vk

Objekt(2, 1, 2, 6).x = Vk
Objekt(2, 1, 2, 6).y = Vk
Objekt(2, 1, 2, 6).z = Vk

  Objekt ( 2 , 1 , 2 , 6 )
        Predmet - Objekt - Strana - súradnice
     
Počítal som súradnice a spočítal steny na obejct.
Teraz mám Predmet a Objekt
Skúsil som toto a nefunguje to veľmi dobre:

                    SwapStran(i, a, b).z = SwapStran(i, a, b).z + Z
                    SwapObjektov(i, a).z = SwapObjektov(i, a).z + SwapStran(i, a, b).z
                  --   
                    SwapSubjektov(i).z = SwapSubjektov(i).z + SwapObjektov(i, a).z
                    toto už nie je možné
                    pretože súčet rôznych predmetov je príliš veľký a nefunguje to
                  --
    SwapingStran:
    Pre i = 1 Do PocetSubjektov
        Ak PovolenieSwapObjektov(i) = 1 Potom
            Znovu = 0
            Pre a = 1 To Subjekt(i).PocetObjektov
                Pre b = 1 To Subjekt(i).PocetStran
                    k = 1: Ak b = Predmet(i).PocetStran Potom k = 0
                    Ak SwapStran(i, a, b).z > SwapStran(i, a, b + k).z Potom
                        Swap SwapStran(i, a, b).z, SwapStran(i, a, b + k).z
                    Znovu = 1
                    Koniec Ak
                Ďalej b
            Ďalej a
            Ak Znovu = 1, potom prejdite na SwapingStran:
        Koniec Ak
    Ďalej i

    SwapingObjektov:
    Pre i = 1 Do PocetSubjektov
        Ak PovolenieSwapObjektov(i) = 1 Potom
            Znovu = 0: O = 0: Ak i = PocetSubjektov Potom O = 1
            Pre a = 1 To Subjekt(i).PocetObjektov
                k = 1: Ak a = Subjekt(i).PocetObjektov Potom k = 0
                Ak SwapObjektov(i - O, a).z < SwapObjektov(i, a + k).z Potom
                    Swap SwapObjektov(i - O, a).z, SwapObjektov(i, a + k).z
                    Znovu = 1
                Koniec Ak
            Ďalej a
        Koniec Ak
    Ďalej i
    If Znovu = 1 Then GoTo SwapingObjektov

-------------------------------------------------- -------------------------------------
Tu je problém:

    Výmena Subjektov:
    Znovu = 0: ii = 0: a1 = 1: a = 0
    Pre i = 1 Do PocetSubjektov
        ii = ii + 1
        Ak i + ii >= PocetSubjektov Potom ii = 0: Znovu = 0
        Ak PovolenieSwapObjektov(i) = 1 alebo PovolenieSwapObjektov(i + ii) = 1 Potom
            Do
              a = a + 1
                Ak SwapObjektov(i, a).z < SwapObjektov(i + ii, a1).z Potom
                    Swap SwapObjektov(i, a).z, SwapObjektov(i + ii, a1).z
                    Znovu = 1
                Koniec Ak
                Ak a >= Predmet(i).PocetObjektov Potom
                    a = 0
                    a1 = a1 + 1
                Koniec Ak
                Ak a1 >= Subjekt(i + ii).PocetObjektov Then a1 = 1: Exit Do
            Slučka, kým znovu = 1
        Koniec Ak
    Ďalej i
    If Znovu = 1 Then GoTo SwapingSubjektov