X-Git-Url: http://plrg.eecs.uci.edu/git/?a=blobdiff_plain;f=cds%2Fintrusive%2Fimpl%2Fskip_list.h;h=ccab53ce810eda4230f45c665940874d805868c7;hb=40e34e6d0b104b6f5aff506ad67d43fd410e52bc;hp=df92274980f0a93f03441ab1b71c713002a8e675;hpb=8225a7c70037fd2374bf9e277f05ff44a1bfbb3b;p=libcds.git

diff --git a/cds/intrusive/impl/skip_list.h b/cds/intrusive/impl/skip_list.h
index df922749..ccab53ce 100644
--- a/cds/intrusive/impl/skip_list.h
+++ b/cds/intrusive/impl/skip_list.h
@@ -1,7 +1,7 @@
 /*
     This file is a part of libcds - Concurrent Data Structures library
 
-    (C) Copyright Maxim Khizhinsky (libcds.dev@gmail.com) 2006-2016
+    (C) Copyright Maxim Khizhinsky (libcds.dev@gmail.com) 2006-2017
 
     Source code repo: http://github.com/khizmax/libcds/
     Download: http://sourceforge.net/projects/libcds/files/
@@ -1359,7 +1359,7 @@ namespace cds { namespace intrusive {
                     marked_node_ptr pSucc( pos.pSucc[nLevel] );
 
                     // Set pNode->next
-                    // pNode->next must be null but can have a "logical deleted" flag if another thread is removing pNode right now
+                    // pNode->next can have a "logical deleted" flag if another thread is removing pNode right now
                     if ( !pNode->next( nLevel ).compare_exchange_strong( p, pSucc,
                         memory_model::memory_order_acq_rel, atomics::memory_order_acquire ) )
                     {