From: khizmax Date: Fri, 3 Feb 2017 21:01:17 +0000 (+0300) Subject: BronsonAVLTreeMap: docfix X-Git-Tag: v2.3.0~179 X-Git-Url: http://demsky.eecs.uci.edu/git/?a=commitdiff_plain;h=ab6c1cbb8e004cd509e2156e883ff067276ad06f;p=libcds.git BronsonAVLTreeMap: docfix --- diff --git a/cds/container/bronson_avltree_map_rcu.h b/cds/container/bronson_avltree_map_rcu.h index a4696481..b99081af 100644 --- a/cds/container/bronson_avltree_map_rcu.h +++ b/cds/container/bronson_avltree_map_rcu.h @@ -479,7 +479,7 @@ namespace cds { namespace container { @note Due the concurrent nature of the map, the function extracts nearly maximal key. It means that the function gets rightmost leaf of the tree and tries to unlink it. - During unlinking, a concurrent thread may insert an item with key great than leftmost item's key. + During unlinking, a concurrent thread may insert an item with key greater than rightmost item's key. So, the function returns the item with maximum key at the moment of tree traversing. RCU \p synchronize method can be called. RCU should NOT be locked. @@ -510,7 +510,7 @@ namespace cds { namespace container { @note Due the concurrent nature of the map, the function extracts nearly maximal key. It means that the function gets rightmost leaf of the tree and tries to unlink it. - During unlinking, a concurrent thread may insert an item with key great than leftmost item's key. + During unlinking, a concurrent thread may insert an item with key greater than rightmost item's key. So, the function returns the item with maximum key at the moment of tree traversing. RCU \p synchronize method can be called. RCU should NOT be locked. diff --git a/cds/container/impl/bronson_avltree_map_rcu.h b/cds/container/impl/bronson_avltree_map_rcu.h index a7d682fe..6fea4738 100644 --- a/cds/container/impl/bronson_avltree_map_rcu.h +++ b/cds/container/impl/bronson_avltree_map_rcu.h @@ -494,7 +494,7 @@ namespace cds { namespace container { @note Due the concurrent nature of the map, the function extracts nearly maximal key. It means that the function gets rightmost leaf of the tree and tries to unlink it. - During unlinking, a concurrent thread may insert an item with key great than leftmost item's key. + During unlinking, a concurrent thread may insert an item with key greater than rightmost item's key. So, the function returns the item with maximum key at the moment of tree traversing. RCU \p synchronize method can be called. RCU should NOT be locked. @@ -525,7 +525,7 @@ namespace cds { namespace container { @note Due the concurrent nature of the map, the function extracts nearly maximal key. It means that the function gets rightmost leaf of the tree and tries to unlink it. - During unlinking, a concurrent thread may insert an item with key great than leftmost item's key. + During unlinking, a concurrent thread may insert an item with key greater than rightmost item's key. So, the function returns the item with maximum key at the moment of tree traversing. RCU \p synchronize method can be called. RCU should NOT be locked.