The Sinclair QL Forum

I suspected the possibility regarding hardware addresses. So let me be more specific: A user RAM request will never, ever return a "negative" address, right? I guess that by the time we see systems sporting 2 gig or more - in about 2029 Jan 19 03:14:08 (or more likely around 2097 Feb 06 06...

Can it safely be assumed that a RAM address can never be "negative" in a SMSQ/E system? Ie, that so much of the system relies on the assumption that RAM will never exceed 2GB, that any negative return from some function can be taken to be an error code rather than a valid address..? Asking...

tofro wrote:<>
Let's say you want a number between 50 and 100:

RANDOM gives you a number -32768-32767

Am I missing something here? What about RND(50 TO 100)? or RND(-50 TO 50)? RND already does all the hard work for you..

Hi Ralf, Quite enlightening with regards to the Pointer Environment integration into Qliberator. Yes, indeed. All the indications are that there was a close working relationship between Liberation Software and QJump. @ Ralf, Good idea about your enlightenment project. I hope it is a success! BTW, d...

tcat wrote:Good idea. I was also thinking to put as many razors 1,9mm appart, as fit across VHS tape width, but then it would reuquire a lot more force to pull tape through the blades.

Just remember to change the blades every few thousand feet

S-O-S, any luck, ideas out there? A vice, a rubber eraser, a razor blade or surgical knife. Cut the eraser into two pieces of the required thickness, jam the razor blade between the two pieces of rubber in the vice. The gap between the vice jaws must be the width of the tape to be cut. Gently draw ...

.. May be of interest - Silvester on here wrote a piece of code for SMSQ/E so that the pixel colour read should work in modes beyond 4 and 8, this should allow the equivalent basic functions in other toolkits such as RPXL% of Easyptr 4 to work now too. (not tried it myself, and can't remember if it...

the above algorithm is (from a pure FILL perspective) actually one of the most efficient ones - It guarantees that every pixel to be filled is only visited exactly once. Youre right: Its fantastic! No need to look further ;) To check out your claim that it visits each pixel only once, I did some (n...

Fiddled a bit just for the fun of it.... Very nice! :) Something to work with. Theres also something called QuickFill which by all accounts seems to be one of the more efficient and versatile algorithms around. Unfortunately, I dont know enough C++ to understand in detail how it works or to transla...

If you can define a shape as a blob, theres an inbuilt routine to fill it with any colour or texture, in any mode. I dont know what limitations the routine has re size, memory or efficiency, but it might be worth investigating.