Skip to contentSkip to conversation

defer/hazptr: Fix a typo: updatesa -> updates

PATCH In review SeongJae Park 2 participants 3 messages Jun 1, 2019

lore
Share & tools
lore
#0 lore raw

PATCH 1/2 defer/hazptr: Fix a typo: updatesa -> updates

---
 defer/hazptr.tex | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)
defer/hazptr.tex +1 -1
index b491c59..be93342 100644
@@ -332,7 +332,7 @@ object traversed.
 Therefore, hazard pointers's performance is far short of ideal.
 On the other hand, unlike naive approaches to concurrent reference-counting,
 hazard pointers do operate correctly for workloads
-involving concurrent updatesa.
+involving concurrent updates.
 Additional performance comparisons with other mechanisms may be found in
 Chapter~\ref{chp:Data Structures}
 and in other publications~\cite{ThomasEHart2007a,McKenney:2013:SDS:2483852.2483867,MagedMichael04a}.
Signature · 1 line
2.10.0
#1 lore raw

PATCH 2/2 together: Fix a wrong number of lines

---
 together/applyrcu.tex | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)
together/applyrcu.tex +1 -1
index 9ee770c..d0b1c5d 100644
@@ -283,7 +283,7 @@ Line~69 can then safely free the old \co{countarray} structure.
 \QuickQuiz{}
 	Wow!
 	Listing~\ref{lst:together:RCU and Per-Thread Statistical Counters}
-	contains 69 lines of code, compared to only 42 in
+	contains 70 lines of code, compared to only 42 in
 	Listing~\ref{lst:count:Per-Thread Statistical Counters}.
 	Is this extra complexity really worth it?
 \QuickQuizAnswer{
Signature · 1 line
2.10.0
#2 lore raw
In reply to SeongJae Park
Quoted 1 line · SeongJae Park

Good eyes, applied and pushed, thank you!

Thanx, Paul

Quoted 20 lines
---
 defer/hazptr.tex | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)
defer/hazptr.tex +1 -1
index b491c59..be93342 100644
@@ -332,7 +332,7 @@ object traversed.
 Therefore, hazard pointers's performance is far short of ideal.
 On the other hand, unlike naive approaches to concurrent reference-counting,
 hazard pointers do operate correctly for workloads
-involving concurrent updatesa.
+involving concurrent updates.
 Additional performance comparisons with other mechanisms may be found in
 Chapter~\ref{chp:Data Structures}
 and in other publications~\cite{ThomasEHart2007a,McKenney:2013:SDS:2483852.2483867,MagedMichael04a}.
Signature · 1 line
2.10.0