Per Witte wrote:
Dave Westbury writes:
...different data structures in Qlib'd programs, perhaps it wasn't.
Probably not. Arrays are treated identically to the parser in Qlib :)
I think the problem was that the functions first scanned the name table for
specific integer array names (and
Dave Westbury writes:
Now that rings a bell. In early coding days I wrote some array handling
SBASIC
commands (which, given a channel, filled arrays directly from a MIDI data
dump).
They worked well under SMSQ but failed when I qliberated the program. I
just put
it down to different data
Tony Firshman wrote:
QA.RESRI.
I haven't tried QDOS/Minerva on this yet, I hope they do the
same.
Ask Laurence Reeves ([EMAIL PROTECTED])
In the usual tradition of asking first before RTFM I found Minerva manual page
ASM.6 details how BV.CHxxx is dealt with. If enough memory can not be
P Witte wrote:
All good stuff this, thank you, but what is the status of this sort of
information?
No idea.
Is there a particular reason why it is so sparse and hard to come
by?
Tony generally doesn't publish much, I'm afraid.
Marcel
Dave Westbury wrote:
Thanks Marcel, any chance of posting SMSQ sources in weekly
installments?
No problem, if I'd only be allowed to do so... but even when posting
one source file per day I think it would need about 5 years to get a
working SMSQ/E together ;-)
Only joking :-)
Sure :) But
Photon is very fast indeed. But (same question for PhotoQL) does it takes
care and maintains proportions ? I think pixel shape is different in said
512x256 and 800x600. And why is there only 1024x600 and 1024x768 screen in
QPC2 (I think 1024x512 is best to preserve standard screen ratio)
Claude
I forgot the positioning of the Blue bits. That would mean another16 bit 64k table.a0 points to RG table and a1 to B.m33RGBmove.w(a4)+,d2 get B0 move.w(a4)+,d3 get RG move.w(a0,d3.w),d3 use lookup table to sort RG move.w(a1,d2.w),d2 also sort
On 26 Feb 2001, at 15:00, Dave Westbury wrote:
That is just task waiting on pointer (ie. suspended), and if no movement or
pointer action in certain time pop up a bubble. Nice feature though.
Actually, this feature was introduced by FiFi
(Sorry, couldn't resist that).
Wolfgang
Hi Dave
Just a thought on speeding things up.
How about using a 16 bit lookup table to rearrange the red and green bits some like this:
m33RGBmove.w(a4)+,d2 get B0 move.w(a4)+,d3 get RG move.w(a0,d3.w),d3 use lookup table to sort RG andi.w
On 24 Feb 2001, at 16:16, Dilwyn Jones wrote:
There's so many of these useful bits
of OS information which exist, but seem to be covered by an unofficial
QL 'official secrets act'
--
Dilwyn Jones
[EMAIL PROTECTED]
http://www.soft.net.uk/dj/index.html
I don't agree with that
Dave Westbury wrote:
QPTR able to use events under SMSQ v2.71+
As I said I haven't seen FiFi so don't know how it works on QDOS+PE.
Other
programs I have seen hang waiting for event (from SMS.SEVT) that
never occurs
(though the operation can be aborted through another terminating
pointer event).
A stated in the last QL2D, new release of Photon (from Dave Westbury) as
found on DJ's web page is fast (for QL hardware) : on QPC2 it takes less
than 20seconds to display a 200k file. Compared (not a criticism) to PhotoQL
v0.18 (from Roberto Porro) found on Thierry Godegroy'site it is 5 or 6
12 matches
Mail list logo
