X-Git-Url: http://plrg.eecs.uci.edu/git/?a=blobdiff_plain;ds=sidebyside;f=cds%2Fintrusive%2Fmichael_set.h;h=b876b5eda7731a2b676a971ef6d72a7e29c1e077;hb=e891296f3970a4d973ad69d732cb646dbbe820c5;hp=16cac8f94339d7edd697082de28cd9ac7fb3e5f7;hpb=0cb65c4791436f8d395809ec641a7d90f22baec5;p=libcds.git

diff --git a/cds/intrusive/michael_set.h b/cds/intrusive/michael_set.h
index 16cac8f9..b876b5ed 100644
--- a/cds/intrusive/michael_set.h
+++ b/cds/intrusive/michael_set.h
@@ -302,7 +302,7 @@ namespace cds { namespace intrusive {
             The forward iterator for Michael's set is based on \p OrderedList forward iterator and has some features:
             - it has no post-increment operator
             - it iterates items in unordered fashion
-            - The iterator cannot be moved across thread boundary since it may contain GC's guard that is thread-private GC data.
+            - The iterator cannot be moved across thread boundary because it may contain GC's guard that is thread-private GC data.
             - Iterator ensures thread-safety even if you delete the item that iterator points to. However, in case of concurrent
               deleting operations it is no guarantee that you iterate all item in the set.
               Moreover, a crash is possible when you try to iterate the next element that has been deleted by concurrent thread.
@@ -471,7 +471,7 @@ namespace cds { namespace intrusive {
 
             The functor may change non-key fields of the \p item.
 
-            Returns <tt> std::pair<bool, bool> </tt> where \p first is \p true if operation is successfull,
+            Returns <tt> std::pair<bool, bool> </tt> where \p first is \p true if operation is successful,
             \p second is \p true if new item has been added or \p false if the item with \p key
             already is in the set.