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

Change HTML4 entities to HTML5

Browse source 
&lt to <
&gt to >
&amp to &
This commit is contained in:
James Gregory 2013-12-30 14:33:39 +11:00
commit b8e7ce7165
105 changed files with 1117 additions and 1117 deletions
Download patch file Download diff file Expand all files Collapse all files

20
14-04.html
View file

@ -46,7 +46,7 @@
no match is found.
Tested with Borland C++ in C mode and the small model. */
#include &ltstdio.h&gt
#include <stdio.h>
unsigned char * FindString(unsigned char * BufferPtr,
unsigned int BufferLength, unsigned char * PatternPtr,
@ -57,7 +57,7 @@ unsigned char * FindString(unsigned char * BufferPtr,
int i;
/* Reject if the buffer is too small */
if (BufferLength &lt PatternLength) return(NULL);
if (BufferLength < PatternLength) return(NULL);
/* Return an instant match if the pattern is 0-length */
if (PatternLength == 0) return(BufferPtr);
@ -66,7 +66,7 @@ unsigned char * FindString(unsigned char * BufferPtr,
mismatches for every possible byte value */
/* Initialize all skips to the pattern length; this is the skip
distance for bytes that don’t appear in the pattern */
for (i = 0; i &lt 256; i++) SkipTable[i] = PatternLength;
for (i = 0; i < 256; i++) SkipTable[i] = PatternLength;
/*Set the skip values for the bytes that do appear in the pattern
to the distance from the byte location to the end of the
pattern. When there are multiple instances of the same byte,
@ -75,7 +75,7 @@ unsigned char * FindString(unsigned char * BufferPtr,
if we get that value for a mismatch, we know for sure that the
right end of the pattern has already passed the mismatch
location, so this is not a relevant byte for skipping purposes */
for (i = 0; i &lt (PatternLength - 1); i++)
for (i = 0; i < (PatternLength - 1); i++)
SkipTable[PatternPtr[i]] = PatternLength - i - 1;
/* Point to rightmost byte of the pattern */
@ -110,7 +110,7 @@ unsigned char * FindString(unsigned char * BufferPtr,
just advance by 1 to the next potential match; otherwise,
skip ahead from the mismatch location by the skip distance
for the mismatch character */
if (SkipTable[*WorkingBufferPtr] &lt= DistanceMatched)
if (SkipTable[*WorkingBufferPtr] <= DistanceMatched)
Skip = 1; /* skip doesn’t do any good, advance by 1 */
else
/* Use skip value, accounting for distance covered by the
@ -118,7 +118,7 @@ unsigned char * FindString(unsigned char * BufferPtr,
Skip = SkipTable[*WorkingBufferPtr] - DistanceMatched;
/* If skipping ahead would exhaust the buffer, we’re done
without a match */
if (Skip &gt= BufferLength) return(NULL);
if (Skip >= BufferLength) return(NULL);
/* Skip ahead and perform the next comparison */
BufferLength -= Skip;
BufferPtr += Skip;
@ -129,13 +129,13 @@ unsigned char * FindString(unsigned char * BufferPtr,
<P><B>LISTING 14.2 L14-2.C</B></P>
<!-- CODE //-->
<PRE>
/* Program to exercise buffer-search routines in Listings 14.1 &amp 14.3.
/* Program to exercise buffer-search routines in Listings 14.1 &amp; 14.3.
(Must be modified to put copy of pattern as sentinel at end of the
search buffer in order to be used with Listing 14.4.) */
#include &ltstdio.h&gt
#include &ltstring.h&gt
#include &ltfcntl.h&gt
#include &lt;stdio.h&gt;
#include &lt;string.h&gt;
#include &lt;fcntl.h&gt;
#define DISPLAY_LENGTH 40
#define BUFFER_SIZE 0x8000