Jump to content
Have You Played Atari Today?
2600|5200|7800|Lynx|Jaguar|Forums|Store

SteveB

Members
 View Profile  See their activity

  • Posts

    548

  • Joined

  • Last visited

 Content Type 

Everything posted by SteveB

  1. SteveB
    As we have been talking auvout Extended BASIC II+ in the Pandemic-Call ... I created a Package to use this in TiCodEd. Just put it to the LIB directory and select it on the Project-Page: XB IIplus.xbpkg It declares all additional CALLs and LINKs, only CALL LINK("MOVE",...) I renamed to "CALL LINE", as CALL MOVE is allready taken by XB II itself. Same for MOVETO got LINETO for consistency. It makes programs possible like this translation from the manual: REM CIRCULAR DIAGRAMS REM ***************** CALL GRAFIC(0) CALL WINDOW(3,8) FOR N=1 TO 13 STEP 2 CALL SETCOL(N,16,2,N+1,14,2,N+14,9,2,N+15,13,2) NEXT N CALL CRCDIA(64,60,38,180,276) CALL CRCDIA(68,60,38,276,450) CALL CRCDIA(68,64,38,90,180) CALL WRITE(14,2,"CIRC-DIAGRAMS") CALL WAITKEY
  2. SteveB
    I scanned the German manual of Extended BASIC II+ ... enjoy. Extended BASIC II+ German.pdf
  3. SteveB
    Given the 16 bit architecture of the CPU, wouldn't be a two byte per character table more efficient? First byte the character and second byte the colors?
  4. SteveB
    A wise man once said : "If I wanted to spend my life fighting an OS, I would be using VMS..."
  5. SteveB
    Correction: PRINT BIN$("414243") gets saved as PRINT "ABC" ... you get the idea ... >00, >0B, >0D, >FF all have special meanings, but are not interpreted by the TI in a quoted string. The preceding length byte makes control characters superfluous.
  6. SteveB
    I learned about mode 3 only some years ago, as the manuals in German and English both state "Values of 3, 4, and 5 are reserved for possible future uses." That CALL KEY(3,K,S) also affects a following INPUT was totally new to me ... never stop learning.
  7. SteveB
    In January the MuseScore team released version 4 with a lot of changes and improvements. I revised the documentation for MuseScore 4 and added two features: Auto-Copy to Clipboard is now an option (as suggested by @Vorticon) Create XB256 Soundlists to be played in the background of program Harry @senior_falcon helped me very much in getting this to work. Please be aware, this option provides only very basic soundlist-functionality: Play the list once or in endless repetition. For more complex arrangements use the very versatile SLCOMPILER tool from Harry included in XB256, where you can have muliple, named sections and finite loops etc. and can pack multiple soundlists into one binary. I use the BIN$() pseudo-function of LibXBTKN to get the 8bit binary soundlist to the TI. During tokenization, the BIN$("hex-string") gets replaced with the binary representation of the supplied hex-string, i.e. PRINT BIN$("424344") gets saved as PRINT "ABC". Therefore you should use the "Export to FIAD" for saving the XB256 Soundlist (requires line-numbers to be enabled to have a valid XB program) or copy the created code over to TiCodEd, where BIN$ also works. The EXAMPLE256 is the FIAD soundlist of the provided example. Enjoy! TI-MuseScore4a_V11.zip
  8. SteveB
    Have you tried it on a fresh installation and with a locally stored fresh XB 2.9 and TMLDEMO?
  9. SteveB
    This is somehow double-edged ... for one, I would love to have as many ports to the TI as possible, so very much favour the "Don't do it twice". On the other hand, I keep my projects private until the end, as I do not want to create a "hype" or an "obligation to deliver" either. It is my hobby and I decide how much time goes into which project and which to postpone indefitely. If I lose interest or something does not work out as planned - and most of us want to push some kind of boundary, either personal or technical - I want to bury the attempt under a mantle of silence and definately don't want to elucidate "woran's geleesche hett". @grammostola and I are working on one classic since last August (not full-time, for sure), again in compiled XB256. We would be disappointed if i.e. @Asmusr would come up now with an assembler version, which would certainly outperform our game. But this is a risk we are taking to keep our freedom and independence.
  10. SteveB
    Accurately emulated overheated RAM chip ... ???
  11. SteveB
    How can we submit new cartridges to be included in future compilations?
  12. SteveB
    There is a reason that there is not "THE ONE[tm]" sorting algorithm. It depends very much on data, hardware, programming language ... you just need to find the niche where VORTSORT outperforms the others. The O() logic also looks at infinity ... most data we are dealing with is finite. A simple O(N^3) may outperform a O(n*log(n)) on a small dataset on a real machine. And coding time is also important 🙃
  13. SteveB
    Exactly ... and Quicksort is O(n*log(n)) and therefore better than Bubblesort with O(n^2) .. my above Bucketsort variant has only O(n+m) ... linear, but with a very limited use-case.
  14. SteveB
    Just register at https://www.spamgourmet.com/index.pl for specialized "one-time" passwords and keep control of what you want to receive ...
  15. SteveB
    Middle-of-Three is usually a good compromise ... still some Quicksort implementation totally freak out when handed an already sorted list ... The language for the implementation should support recursions, I wouldn't do it in TI BASIC. When implementing it in assembly you need to implement the recursion manually. A whole new science is sorting datasets larger than your RAM, which has been a big issue in the early mainframe world... tape-to-tape sorting.
  16. SteveB
    I revive foldable Microsoft Mice with Propyl-Alcohol (Iso-Propanol) ... Usually it is just the upper coating desolving, which gave the plastic a better haptic ... but not anymore. I use clear varnish on the mice after cleaning them. Perhaps that works on the body of your camera as well?
  17. SteveB
    given the array 3,6,4,2,4 to be sorted and you know, there are just values from 0 to 10 ... you make an initial list (0,0,0,0,0,0,0,0,0,0) and then count the occurences .. one time the 3, two times the 4, ... using the number as the index to your sort-array (0,0,1,1,2,0,1,0,0,0) now you unroll again ... there is a no 0 and no 1, but one 2 and one 3 and two 4 and one 6 ... 2,3,4,4,6 Sorted!
  18. SteveB
    Ok, I was thinking of some kind of bucket-sort for a limited range of integers from 0 to m. Just make a second array size [0..m] or use CALL LOAD with LowMen for a fake Byte-Array and just count the occurences of all n values, then go over this list from 0 to m, you have a linear O(n+m) complexity ... unbeatable, but not applicable to your task.
  19. SteveB
    I used Bubble-Sort in the past ... quite good for smaller arrays. I recently read about Gnome Sort but haven't tried it yet. I don't really get what you are doing with DLIST(x,1) and DLIST(x,2) ... you swap them independently? You are talking about an integer array ... in which range are the integers to be sorted? 0 to 255 or much bigger?
  20. SteveB
    I only have two ... one of them is the unmodified console I bought in 1983 ... Perhaps I could use a third one ... perhaps when @Schmitzi runs out of space...
  21. SteveB
    Funny .. I picked up my MuseScore/4a code some weeks ago and started working on creating a XB256 soundlist. I am also thinking of implementing some kind of decay, as you are right, two subsequent quarters get "merged" to a half note at the moment ... Would sound better to have some attack and decay for sure, How do you deal with high <divisions> values in some MIDI files? This drove me mad at first ...
  22. SteveB
    It works like a charm ... but I still have no clue why this works and my attempts failed.
  23. SteveB
    Check out https://www.imdb.com/title/tt4846340/ . A must-see movie I really enjoyed. Very interesting trivia from IMDB: Astronaut John Glenn did specifically request that Katherine Johnson [co-worker of Dorothy] review all of the calculations for the Friendship 7 mission - (his dialogue in the film based on actual NASA transcripts*) - before he could be confident enough to proceed, but which in reality actually occurred a few weeks before launch: not as depicted in the film whilst awaiting the actual launch. And Katherine Johnson's calculations (more realistically) actually took (just!) three days to confirm.
  24. SteveB
    this is on my virtual disk ... I hear some emulated loading noise ... and then nothing ... sometimes above error, sometimes just a hanging system... I tried running Altirra as Admin and with deactivated virus scan ... same result.
  25. SteveB
    Hi Folks, I did manage to get Altirra to boot from a virtual disk some months ago ... but for some time it it refuses to do so. I resetted my config, updated to the latest Altirra release ... to no avail. I had it working with PICO DOS and tried now with MYPICO DOS 4.06 and Atari DOS 2.5 ... I extracted the boot sector anew .. after two evenings I give up and ask for help, as I could not find any step-by-step manual for this. I tried different settings, firmware etc. I just get this error after some seconds: Any hints would be appreciated! Steve
AtariAge
Forums
Store
General
Follow AtariAge

Copyright ©1998-2021 AtariAge

×
×
  • Create New...