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

mering

Browse source
This commit is contained in:
Dennis Yurichev 2016-08-11 03:07:57 +03:00
commit c92b4e7d49
2 changed files with 3 additions and 4 deletions
Download patch file Download diff file Expand all files Collapse all files

3
src/chapter-15.md
View file

@ -302,8 +302,7 @@ the pike. The success or failure of the search can then be determined
outside the loop, if necessary, by checking for the tail node's special outside the loop, if necessary, by checking for the tail node's special
pointer—but the inside of the loop is streamlined to just one test, as pointer—but the inside of the loop is streamlined to just one test, as
shown in Listing 15.5. Not all linked lists lend themselves to shown in Listing 15.5. Not all linked lists lend themselves to
sentinels, but the performance benefits are considerable for those lend sentinels, but the performance benefits are considerable
themselves to sentinels, but the performance benefits are considerable
for those that do. for those that do.
![**Figure 15.3**  *Representing an empty list.*](images/15-03.jpg) ![**Figure 15.3**  *Representing an empty list.*](images/15-03.jpg)

4
src/chapter-21.md
View file

@ -236,8 +236,8 @@ contention. Happily, write-after-read operations do *not* cause
contention. Such operations, as in contention. Such operations, as in
```nasm ```nasm
mov eax,edx ;U-pipe cycle 1 mov eax,edx ;U-pipe cycle 1
sub edx,edxX ;V-pipe cycle 1 sub edx,edx ;V-pipe cycle 1
``` ```
are free of charge. are free of charge.