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

24
62-02.md
View file

@ -43,7 +43,7 @@
FIXEDPOINT screenytopstart, screenybottomstart;
FIXEDPOINT screenytopend, screenybottomend;
} NODE, *PNODE;
char * pDIB; // pointer to DIB section we’ll draw into
char * pDIB; // pointer to DIB section we'll draw into
HBITMAP hDIBSection; // handle of DIB section
HPALETTE hpalDIB;
int iteration = 0, WorldIsRunning = 1;
@ -158,7 +158,7 @@
VERTEX *pextravertex = pextravertexlist;
pwall = pnodelist;
for (wall = 0; wall < numnodes; wall++) {
// Assume the wall won’t be visible
// Assume the wall won't be visible
pwall->isVisible = 0;
// Generate the wall endpoints, accounting for t values and
// clipping
@ -299,7 +299,7 @@
// Outside view triangle, trivially clipped
goto NextWall;
}
// Partially clipped in Y; we’ll do Y clipping at
// Partially clipped in Y; we'll do Y clipping at
// drawing time
}
// The wall is visible; mark it as such and project it.
@ -349,15 +349,15 @@
// remembering the nodes we pass through on the way.
// Figure whether this wall is facing frontward or
// backward; do in viewspace because non-visible walls
// aren’t projected into screenspace, and we need to
// aren't projected into screenspace, and we need to
// traverse all walls in the BSP tree, visible or not,
// in order to find all the visible walls
if (WallFacingViewer(pwall)) {
// We’re on the forward side of this wall, do the back
// We're on the forward side of this wall, do the back
// children first
pFarChildren = pwall->backtree;
} else {
// We’re on the back side of this wall, do the front
// We're on the back side of this wall, do the front
// children first
pFarChildren = pwall->fronttree;
}
@ -384,21 +384,21 @@
FillConvexPolygon(apoint, pwall->color);
}
}
// If there’s a near tree from this node, draw it;
// If there's a near tree from this node, draw it;
// otherwise, work back up to the last-pushed parent
// node of the branch we just finished; we’re done if
// node of the branch we just finished; we're done if
// there are no pending parent nodes.
// Figure whether this wall is facing frontward or
// backward; do in viewspace because non-visible walls
// aren’t projected into screenspace, and we need to
// aren't projected into screenspace, and we need to
// traverse all walls in the BSP tree, visible or not,
// in order to find all the visible walls
if (WallFacingViewer(pwall)) {
// We’re on the forward side of this wall, do the
// We're on the forward side of this wall, do the
// front children now
pNearChildren = pwall->fronttree;
} else {
// We’re on the back side of this wall, do the back
// We're on the back side of this wall, do the back
// children now
pNearChildren = pwall->backtree;
}
@ -429,7 +429,7 @@
TransformVertices();
ClipWalls();
DrawWallsBackToFront();
// We’ve drawn the frame; copy it to the screen
// We've drawn the frame; copy it to the screen
hdcScreen = GetDC(hwndOutput);
holdpal = SelectPalette(hdcScreen, hpalDIB, FALSE);
RealizePalette(hdcScreen);