From 1e1c03aa00bc79251720a37285aa21b4b36c6826 Mon Sep 17 00:00:00 2001 From: khizmax Date: Fri, 15 Apr 2016 23:22:03 +0300 Subject: [PATCH] Fixed doc --- cds/container/ellen_bintree_map_rcu.h | 2 +- cds/container/ellen_bintree_set_rcu.h | 2 +- cds/container/impl/ellen_bintree_map.h | 2 +- cds/container/impl/ellen_bintree_set.h | 2 +- cds/intrusive/ellen_bintree_rcu.h | 2 +- cds/intrusive/impl/ellen_bintree.h | 2 +- 6 files changed, 6 insertions(+), 6 deletions(-) diff --git a/cds/container/ellen_bintree_map_rcu.h b/cds/container/ellen_bintree_map_rcu.h index 9363f6af..e1e7c70c 100644 --- a/cds/container/ellen_bintree_map_rcu.h +++ b/cds/container/ellen_bintree_map_rcu.h @@ -58,7 +58,7 @@ namespace cds { namespace container { the priority value plus some uniformly distributed random value. @warning Recall the tree is unbalanced. The complexity of operations is O(log N) - for uniformly distributed random keys, but in worst case the complexity is O(N). + for uniformly distributed random keys, but in the worst case the complexity is O(N). @note In the current implementation we do not use helping technique described in original paper. So, the current implementation is near to fine-grained lock-based tree. diff --git a/cds/container/ellen_bintree_set_rcu.h b/cds/container/ellen_bintree_set_rcu.h index cc74ee23..4ede50a2 100644 --- a/cds/container/ellen_bintree_set_rcu.h +++ b/cds/container/ellen_bintree_set_rcu.h @@ -58,7 +58,7 @@ namespace cds { namespace container { the priority value plus some uniformly distributed random value. @warning Recall the tree is unbalanced. The complexity of operations is O(log N) - for uniformly distributed random keys, but in worst case the complexity is O(N). + for uniformly distributed random keys, but in the worst case the complexity is O(N). @note In the current implementation we do not use helping technique described in original paper. So, the current implementation is near to fine-grained lock-based tree. diff --git a/cds/container/impl/ellen_bintree_map.h b/cds/container/impl/ellen_bintree_map.h index a8afa81c..d2931f71 100644 --- a/cds/container/impl/ellen_bintree_map.h +++ b/cds/container/impl/ellen_bintree_map.h @@ -60,7 +60,7 @@ namespace cds { namespace container { the priority value plus some uniformly distributed random value. @warning Recall the tree is unbalanced. The complexity of operations is O(log N) - for uniformly distributed random keys, but in worst case the complexity is O(N). + for uniformly distributed random keys, but in the worst case the complexity is O(N). @note In the current implementation we do not use helping technique described in the original paper. In Hazard Pointer schema helping is too complicated and does not give any observable benefits. diff --git a/cds/container/impl/ellen_bintree_set.h b/cds/container/impl/ellen_bintree_set.h index 9884e33a..538e447e 100644 --- a/cds/container/impl/ellen_bintree_set.h +++ b/cds/container/impl/ellen_bintree_set.h @@ -60,7 +60,7 @@ namespace cds { namespace container { the priority value plus some uniformly distributed random value. @warning Recall the tree is unbalanced. The complexity of operations is O(log N) - for uniformly distributed random keys, but in worst case the complexity is O(N). + for uniformly distributed random keys, but in the worst case the complexity is O(N). @note In the current implementation we do not use helping technique described in the original paper. In Hazard Pointer schema helping is too complicated and does not give any observable benefits. diff --git a/cds/intrusive/ellen_bintree_rcu.h b/cds/intrusive/ellen_bintree_rcu.h index ccc684b7..fc3cfbc5 100644 --- a/cds/intrusive/ellen_bintree_rcu.h +++ b/cds/intrusive/ellen_bintree_rcu.h @@ -83,7 +83,7 @@ namespace cds { namespace intrusive { the priority value plus some uniformly distributed random value. @attention Recall the tree is unbalanced. The complexity of operations is O(log N) - for uniformly distributed random keys, but in worst case the complexity is O(N). + for uniformly distributed random keys, but in the worst case the complexity is O(N). @note In the current implementation we do not use helping technique described in the original paper. Instead of helping, when a thread encounters a concurrent operation it just spins waiting for diff --git a/cds/intrusive/impl/ellen_bintree.h b/cds/intrusive/impl/ellen_bintree.h index bc572b56..fa1e1c68 100644 --- a/cds/intrusive/impl/ellen_bintree.h +++ b/cds/intrusive/impl/ellen_bintree.h @@ -66,7 +66,7 @@ namespace cds { namespace intrusive { the operation done. Such solution allows greatly simplify implementation of the tree. @attention Recall the tree is unbalanced. The complexity of operations is O(log N) - for uniformly distributed random keys, but in worst case the complexity is O(N). + for uniformly distributed random keys, but in the worst case the complexity is O(N). @note Do not include header file explicitly. There are header file for each GC type: -- 2.34.1