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

Replace invalid characters with HTML entities

Browse source 
— with —
’ with ’
+ with +
× with x
ç with ç
“ with “
” with ”
‘ with ‘
• with •
– with -
µ with µ
† with †
Fix C++
θ with θ
Yen symbol instead of times
Fix broken apos
Bullet again
E-circumflex
This commit is contained in:
James Gregory 2013-12-30 12:50:32 +11:00
commit 500e7f5654
353 changed files with 5091 additions and 5091 deletions
Download patch file Download diff file Expand all files Collapse all files

20
60-03.html
View file

@ -68,7 +68,7 @@ static int NumCompiledLinesegs = 0;
static LINESEG *pCompiledLinesegs;
// Builds a BSP tree from the specified line list. List must contain
// at least one entry. If pCurrentTree is NULL, then this is the root
// node, otherwise pCurrentTree is the tree that’s been build so far.
// node, otherwise pCurrentTree is the tree that’s been build so far.
// Returns NULL for errors.
LINESEG * SelectBSPTree(LINESEG * plineseghead,
LINESEG * pCurrentTree, LINESEG ** pParentsChildPointer)
@ -80,7 +80,7 @@ LINESEG * SelectBSPTree(LINESEG * plineseghead,
LINESEG *pcurrentline;
double nx, ny, numer, denom, t;
// Pick a line as the root, and remove it from the list of lines
// to be categorized. The line we’ll select is the one of those in
// to be categorized. The line we’ll select is the one of those in
// the list that splits the fewest of the other lines in the list
minsplits = MAX_INT;
prootline = plineseghead;
@ -93,7 +93,7 @@ LINESEG * SelectBSPTree(LINESEG * plineseghead,
pvertexlist[prootline->endvertex].y;
ny = -(pvertexlist[prootline->startvertex].x -
pvertexlist[prootline->endvertex].x);
// Calculate the dot products we’ll need for line
// Calculate the dot products we’ll need for line
// intersection and spatial relationship
numer = (nx * (pvertexlist[pcurrentline->startvertex].x -
pvertexlist[prootline->startvertex].x)) +
@ -137,7 +137,7 @@ LINESEG * SelectBSPTree(LINESEG * plineseghead,
// appropriate
pminsplit->pfronttree = NULL;
pminsplit->pbacktree = NULL;
// Point the parent’s child pointer to this node, so we can
// Point the parent’s child pointer to this node, so we can
// track the currently-build tree
*pParentsChildPointer = pminsplit;
return BuildBSPTree(plineseghead, pminsplit, pCurrentTree);
@ -154,9 +154,9 @@ LINESEG * BuildBSPTree(LINESEG * plineseghead, LINESEG * prootline,
LINESEG *psplitline;
double nx, ny, numer, denom, t;
int Done;
// Categorize all non-root lines as either in front of the root’s
// infinite line, behind the root’s infinite line, or split by the
// root’s infinite line, in which case we split it into two lines
// Categorize all non-root lines as either in front of the root’s
// infinite line, behind the root’s infinite line, or split by the
// root’s infinite line, in which case we split it into two lines
pfrontlines = NULL;
pbacklines = NULL;
pcurrentline = plineseghead;
@ -170,7 +170,7 @@ LINESEG * BuildBSPTree(LINESEG * plineseghead, LINESEG * prootline,
pvertexlist[prootline->endvertex].y;
ny = -(pvertexlist[prootline->startvertex].x -
pvertexlist[prootline->endvertex].x);
// Calculate the dot products we’ll need for line intersection
// Calculate the dot products we’ll need for line intersection
// and spatial relationship
numer = (nx * (pvertexlist[pcurrentline->startvertex].x -
pvertexlist[prootline->startvertex].x)) +
@ -209,8 +209,8 @@ LINESEG * BuildBSPTree(LINESEG * plineseghead, LINESEG * prootline,
// The line segment must be split; add one split
// segment to each list
if (NumCompiledLinesegs > (MAX_NUM_LINESEGS - 1)) {
DisplayMessageBox(“Out of space for line segs;”
“increase MAX_NUM_LINESEGS”);
DisplayMessageBox(“Out of space for line segs;”
“increase MAX_NUM_LINESEGS”);
return NULL;
}
// Make a new line entry for the split part of line