Misc/abrash-black-book
Watch
1
0
Fork
You've already forked abrash-black-book
 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

Normal quotes

Browse source
This commit is contained in:
James Gregory 2013-12-30 18:34:31 +11:00
commit 18011c595a
352 changed files with 6040 additions and 6040 deletions
Download patch file Download diff file Expand all files Collapse all files

26
46-02.md
View file

@ -46,7 +46,7 @@
/* If set to 1, ignore dirty rectangle list and copy the whole screen. */
int DrawWholeScreen = 0;
/* pixels and masks for the two internally animated versions of the image
we’ll animate */
we'll animate */
#define IMAGE-WIDTH 13
#define IMAGE-HEIGHT 11
char ImagePixels0[] = {
@ -108,7 +108,7 @@
/* Animated entities */
#define NUM-ENTITIES 15
Entity Entities[NUM-ENTITIES];
/* pointer to system buffer into which we’ll draw */
/* pointer to system buffer into which we'll draw */
char far *SystemBufferPtr;
/* pointer to screen */
char far *ScreenPtr;
@ -126,10 +126,10 @@
unsigned int TempCount;
char far *TempPtr;
union REGS regs;
/* Allocate memory for the system buffer into which we’ll draw */
/* Allocate memory for the system buffer into which we'll draw */
if (!(SystemBufferPtr = farmalloc((unsigned int)SCREEN-WIDTH*
SCREEN-HEIGHT))) {
printf(”Couldn’t get memory\n”);
printf("Couldn't get memory\n");
exit(1);
}
/* Clear the system buffer */
@ -139,7 +139,7 @@
}
/* Point to the screen */
ScreenPtr = MK-FP(SCREEN-SEGMENT, 0);
/* Set up the entities we’ll animate, at random locations */
/* Set up the entities we'll animate, at random locations */
randomize();
for (= 0; < NUM-ENTITIES; i++) {
Entities[i].X = random(SCREEN-WIDTH - IMAGE-WIDTH);
@ -237,7 +237,7 @@
SCREEN-WIDTH, SCREEN-WIDTH);
} else {
/* Copy only the dirty rectangles, in the YX-sorted order in which
they’re linked */
they're linked */
DirtyPtr = DirtyHead.Next;
for (= 0; < NumDirtyRectangles; i++) {
/* Offset in both system buffer and screen of image */
@ -303,12 +303,12 @@
(TempPtr->Top < (pEntity->Y + ImageHeight)) &&
(TempPtr->Bottom > pEntity->Y)) {
/* We’ve found an overlapping rectangle. Calculate the
/* We've found an overlapping rectangle. Calculate the
rectangles, if any, remaining after subtracting out the
overlapped areas, and add them to the dirty list */
/* Check for a nonoverlapped left portion */
if (TempPtr->Left > pEntity->X) {
/* There’s definitely a nonoverlapped portion at the left; add
/* There's definitely a nonoverlapped portion at the left; add
it, but only to at most the top and bottom of the overlapping
rect; top and bottom strips are taken care of below */
TempEntity.X = pEntity->X;
@ -320,7 +320,7 @@
}
/* Check for a nonoverlapped right portion */
if (TempPtr->Right < (pEntity->X + ImageWidth)) {
/* There’s definitely a nonoverlapped portion at the right; add
/* There's definitely a nonoverlapped portion at the right; add
it, but only to at most the top and bottom of the overlapping
rect; top and bottom strips are taken care of below */
TempEntity.X = TempPtr->Right;
@ -332,25 +332,25 @@
}
/* Check for a nonoverlapped top portion */
if (TempPtr->Top > pEntity->Y) {
/* There’s a top portion that’s not overlapped */
/* There's a top portion that's not overlapped */
TempEntity.X = pEntity->X;
TempEntity.Y = pEntity->Y;
AddDirtyRect(&TempEntity, TempPtr->Top - pEntity->Y, ImageWidth);
}
/* Check for a nonoverlapped bottom portion */
if (TempPtr->Bottom < (pEntity->Y + ImageHeight)) {
/* There’s a bottom portion that’s not overlapped */
/* There's a bottom portion that's not overlapped */
TempEntity.X = pEntity->X;
TempEntity.Y = TempPtr->Bottom;
AddDirtyRect(&TempEntity,
(pEntity->Y + ImageHeight) - TempPtr->Bottom, ImageWidth);
}
/* We’ve added all non-overlapped portions to the dirty list */
/* We've added all non-overlapped portions to the dirty list */
return;
}
}
#endif /* CHECK-OVERLAP */
/* There’s no overlap with any existing rectangle, so we can just
/* There's no overlap with any existing rectangle, so we can just
add this rectangle as-is */
/* Find the YX-sorted insertion point. Searches will always terminate,
because the head/tail rectangle is set to the maximum values */