[UBsan] Added proper alignment for EllenBinTree node

[libcds.git] / cds / intrusive / striped_set / boost_slist.h

diff --git a/cds/intrusive/striped_set/boost_slist.h b/cds/intrusive/striped_set/boost_slist.h
index 9b9e372194f5513e96913a998637722285194c50..2d7596d8f7cfb82a65133edda321a5db4e2698c3 100644 (file)
--- a/cds/intrusive/striped_set/boost_slist.h
+++ b/cds/intrusive/striped_set/boost_slist.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/
@@ -63,9 +63,9 @@ namespace cds { namespace intrusive { namespace striped_set {
                     iterator itPrev = m_List.before_begin();
                     iterator itEnd = m_List.end();
                     for ( iterator it = m_List.begin(); it != itEnd; ++it ) {
-                        if ( pred( key, *it ) )
+                        if ( pred( key, *it ))
                             itPrev = it;
-                        else if ( pred( *it, key ) )
+                        else if ( pred( *it, key ))
                             break;
                         else
                             return std::make_pair( itPrev, true );
@@ -76,7 +76,7 @@ namespace cds { namespace intrusive { namespace striped_set {
                 template <typename Q>
                 std::pair< iterator, bool > find_prev_item( Q const& key )
                 {
-                    return find_prev_item_cmp( key, key_comparator() );
+                    return find_prev_item_cmp( key, key_comparator());
                 }
 
                 template <typename Q, typename Compare>