... Bit lookup table used to place pixels in a byte
... /> 1170 LET adr=16384+yl*256+l*2048+r*32+xc ... bit index
1190 LET byte=peek(adr): REM get current ... br /> 1200 LET v=INT(byte/b(idx)): REM right shift ... POKE adr,b(idx)+byte: REM Check for even and set bit ...

... incorporated a little parameter table for CHARS, UDG and BLOCK ... ; 4: hi-byte = base address adjustment = (256-offset)/256 = 0 or 1 ... e,a ;E =lo-byte of screen address
... d,a ;D =hi-byte of screen address
...

... sprite. The rotation is done on the fly by table ... sprite), a faster draw algorithm is executed that doesn't require table ... is ideal for sprite images that completely ... sprite's individual characters. Mask sprites are the most difficult, SP1_DRAW_MASK2 is for ...

... timer(23672);
// Table Holding Movement Data for Each Sprite

struct ... ( 2, 3)
;Sort Priorities: Mask, Char line, Y char, X ... Outputted: Gfx
;Interleave: Sprite
;Mask: Yes, before graphic

... $d000) and where the heap for dynamic memory is located.
for malloc overhead.

[ ... . Among sp1 functions, only the sprite creation functions use IY. If ... the price of a 257 byte im2 table.

Long story ...

... int mytimer;
// Table Holding Movement Data for Each Sprite

struct ... : ( 2, 3)
;Sort Priorities: Mask, Char line, Y char, X ... Outputted: Gfx
;Interleave: Sprite
;Mask: Yes, before graphic

... more than 257 bytes for the IM2 table
[/quote]

for IM2 mode setup


Use the hex for this one and it will ... the table and 3-byte JP instruction, the table must start on a 256-byte ...

... int mytimer;
// Table Holding Movement Data for Each Sprite

struct ... : ( 2, 3)
;Sort Priorities: Mask, Char line, Y char, X ... Outputted: Gfx
;Interleave: Sprite
;Mask: Yes, before graphic

... int mytimer;
// Table Holding Movement Data for Each Sprite

struct ... : ( 2, 3)
;Sort Priorities: Mask, Char line, Y char, X ... Outputted: Gfx
;Interleave: Sprite
;Mask: Yes, before graphic

... br />
// Table Holding Movement Data for Each Sprite

... struct sprentry {
struct sp1_ss *s; // sprite ...
for(i=0; i 21) // if sprite went off screen ...

... to avoid ROM use for interrupts, you'd almost ... to set up a vector table for IM2, in a worst ... block of more that 256 ff's in the ... jump to the last byte or ram. You can ... there and the first byte of rom will act ... saves having a 257 byte table in your own code.

... a block of more that 256 ff's in the ... to contain all the code for the IF1.

... , Sinclair put the code for the 128K add on numeric ... byte tables and left the first two bytes of each table ... t know what those byte pairs were for and overwrote at least ...

So you have 103 6-byte strings?
Can you include ... that 103/256 is too 'full' for a Pearson hash table to expect ... /> However, take a look here for some perfect hashing hints:

...
;
; Qualify function for STDIO_MSG_EATC
;
; set- ... eg, which I think have 256 byte sectors; you could always do ... if it can do 256/512/1024 byte blocks efficiently.
... to mask off the top bits to identify a (512-byte) ...

For completeness it should read ... sprites
ld A,sprite no.
ld L, ... A ;put sprite no. into HL
... ,DE ;HL now points to sprite

17 ... put the sprite no. in L directly saving 1 byte. Also, ... in DE is at a 256 byte boundary (i.e. E ...

... Editor)
;
; Create lookup table for transferring flat screen to speccy ... br /> add a, 64 ; 64*256 = 16384 = start of screen display ... br /> ld d, a ; line * 256
; find which third of ... by 4
and 224 ; mask off bits we don't ...

... like 128 angles (thus a 256 byte table).

So you take ... an enemy, you need another table, for ARCTAN (the opposite of TANgent ... actaully be a TAN table with one entry for each angle, then ...

... =polomint;773183]So 16K for the map, 36 bytes ... Would need another byte or two for each tile to ... although just an extra byte per tile can give ... go with more than one byte per tile - that' ... keep a separate 256 byte table that holds properties for each tile ...

... go with more than one byte per tile - that's a ... 'd keep a separate 256 byte table that holds properties for each tile type ...

... /> [36..47] - misc information for the tile, for collisions/death/balloon/guitar ... /> you can use 256 byte table for tile description
and another table for action bits ... - 8 action bits per element
and morfing table - for ...

... /> you can use 256 byte table for tile description
and another table for action bits ... per element
and morfing table - for some backround action.[/QUOTE]
256 byte table for tile description[/QUOTE]
Do you mean a table for the ...

... could build a lookup table for each row and ... lo-byte
and %11100000 ;preserve the row, mask ... ;update the destination lo-byte (rrrccccc)
ld ... -byte (010sslll)
and %00011000 ;preserve the segment, mask ...

... if I'm understanding the 256 byte table thing right, you could probably ... a game uses a mirror table, and it's location, just ... by searching the memory for a particular series of bytes ...

... screen

// Table Holding Movement Data for Each Sprite

struct ... ( 2, 3)
;Sort Priorities: Mask, Char line, Y char, X ... Outputted: Gfx
;Interleave: Sprite
;Mask: Yes, before graphic

... top speed, every cycle counts. For this reason I have applied ... /> if (table/256)-((table+15)/256)
error "whole table must be within single 256 byte block ...

... course the table of squares has to be on a 256 byte boundary ... multiplies. This routine is written for these inputs simply because we ...

... binary information I want for relocatable programs etc.[/quote]< ... may have multiple outputs destined for different memory banks).
... (such as: JP HL or 256-byte aligned tables...)
1. ... and then walk through relocation table adding the actual start ...

... binaries to generate the reloc table. Because the same object files ... high byte is checked for, meaning I can only relocate on 256-byte boundaries ... high byte is checked) for two reasons:
1. The relocation table space ...

... two .bin files. Byte by byte. For identical binaries the differences ... load relocation table and binary. Reserve space for both separately ... , use stack to jump, 256-byte boundary allocations, etc...) are ... - release relocation table (no need for it anymore once ...

... HL, use stack to jump, 256-byte boundary allocations, etc...) are used ... to program - release relocation table (no need for it anymore once your ... . sdcc will use JPHL for function pointer calls and sometimes ... statements there will be a table of defw that will ...