Docfix

diff --git a/cds/intrusive/free_list.h b/cds/intrusive/free_list.h
index 0ac727b36786830af55e2311e9e504549be8d7e9..c309d7d11e00e8dca1eb16c0b64748fedcc8274b 100644 (file)
--- a/cds/intrusive/free_list.h
+++ b/cds/intrusive/free_list.h
@@ -5,7 +5,7 @@
 
     Source code repo: http://github.com/khizmax/libcds/
     Download: http://sourceforge.net/projects/libcds/files/
-    
+
     Redistribution and use in source and binary forms, with or without
     modification, are permitted provided that the following conditions are met:
 
@@ -45,7 +45,7 @@ namespace cds { namespace intrusive {
         The algorithm is taken from <a href="http://moodycamel.com/blog/2014/solving-the-aba-problem-for-lock-free-free-lists">this article</a>.
         The algo does not require any SMR like Hazard Pointer to prevent ABA problem.
 
-        There is \ref TaggedFreeList "tagged pointers" variant of free list for processors which support double-width CAS.
+        There is \ref TaggedFreeList "tagged pointers" variant of free list for processors with double-width CAS support.
 
         \b How to use
         \code

diff --git a/cds/intrusive/free_list_tagged.h b/cds/intrusive/free_list_tagged.h
index d8b93767776040cfbcbb3671007696d1dc5df110..af3e7875261eca99d2a4f0df28f58ec64fa31a98 100644 (file)
--- a/cds/intrusive/free_list_tagged.h
+++ b/cds/intrusive/free_list_tagged.h
@@ -5,7 +5,7 @@
 
     Source code repo: http://github.com/khizmax/libcds/
     Download: http://sourceforge.net/projects/libcds/files/
-    
+
     Redistribution and use in source and binary forms, with or without
     modification, are permitted provided that the following conditions are met: