On dev: MIchaelList

[libcds.git] / cds / intrusive / split_list.h

diff --git a/cds/intrusive/split_list.h b/cds/intrusive/split_list.h
index acab1ea388f0765eb6a9d90f92a29e2d21dd6c6c..ed9f5111c5b0064d865a51d07a1063cacca71574 100644 (file)
--- a/cds/intrusive/split_list.h
+++ b/cds/intrusive/split_list.h
@@ -17,7 +17,7 @@ namespace cds { namespace intrusive {
 
         The split-ordered list is a lock-free implementation of an extensible unbounded hash table. It uses original
         recursive split-ordering algorithm discovered by Ori Shalev and Nir Shavit that allows to split buckets
-        without moving an item on resizing.
+        without items moving on resizing.
 
         \anchor cds_SplitList_algo_desc
         <b>Short description</b>