Re: [PATCH] typo at Chp 7.

[Yubin Ruan <ablacktshirt@gmail.com>]

On Fri, Oct 27, 2017 at 04:05:49PM -0700, Paul E. McKenney wrote:
> On Sat, Oct 28, 2017 at 12:02:19AM +0900, Akira Yokosawa wrote:
> > Hi Yubin,
> > 
> > On 2017/10/27 18:23, Yubin Ruan wrote:
> > > Hi paul,
> > > 
> > > I finish chapter 7 and find some typo. Fixed in the patch below.
> > > 
> > > Yubin
> > > 
> > > diff --git a/locking/locking-existence.tex b/locking/locking-existence.tex
> > > index 9fcbbf9..c7c4ae8 100644
> > > --- a/locking/locking-existence.tex
> > > +++ b/locking/locking-existence.tex
> > > @@ -174,7 +174,7 @@ single partitionable data structure such as the hash table shown in the
> > >  figure, it can be problematic if a given data element can be a member
> > >  of multiple hash tables or given more-complex data structures such
> > >  as trees or graphs.
> > > -These problems can be solved, in fact, such solutions form the basis
> > > +These problems can be solved. In fact, such solutions form the basis
> > 
> > I'd suggest the following:
> > 
> > +These problems can be solved, in fact, and such solutions form the basis
> 
> How about this?
> 
> 	Not only can these problems be solved, but the solutions also
> 	form the basis of lock-based software transactional memory [...].

Thanks for your suggestion. I think Akira's approach looks more nature to me.
So, let me finish this little patch ;-)

Yubin

--------------------------------------------------------------------------
From aede1ef2fe8c5213c8aec9581192c5915e69010c Mon Sep 17 00:00:00 2001
From: Yubin Ruan <ablacktshirt@gmail.com>
Date: Sat, 28 Oct 2017 16:00:43 +0800
Subject: [PATCH] locking: a typo fixed

Signed-off-by: Yubin Ruan <ablacktshirt@gmail.com>
---
 locking/locking-existence.tex | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/locking/locking-existence.tex b/locking/locking-existence.tex
index 9fcbbf9..2be69d8 100644
--- a/locking/locking-existence.tex
+++ b/locking/locking-existence.tex
@@ -174,7 +174,7 @@ single partitionable data structure such as the hash table shown in the
 figure, it can be problematic if a given data element can be a member
 of multiple hash tables or given more-complex data structures such
 as trees or graphs.
-These problems can be solved, in fact, such solutions form the basis
+These problems can be solved, in fact, and such solutions form the basis
 of lock-based software transactional memory
 implementations~\cite{Shavit95,DaveDice2006DISC}.
 However,
-- 
2.7.4