X-Git-Url: http://plrg.eecs.uci.edu/git/?p=libcds.git;a=blobdiff_plain;f=cds%2Fcontainer%2Fstriped_set%2Fboost_stable_vector.h;h=b83508b535601699c02bfbb34f5f95796d2f50a7;hp=dda5c872ab796ee4e5abb28c47ab368d7b2c179e;hb=2402fb1beb25ec532cea91c8dfbb9425eb5bdf48;hpb=4b5852dc7e861bb26c6af06c2a1e058f87f703ae diff --git a/cds/container/striped_set/boost_stable_vector.h b/cds/container/striped_set/boost_stable_vector.h index dda5c872..b83508b5 100644 --- a/cds/container/striped_set/boost_stable_vector.h +++ b/cds/container/striped_set/boost_stable_vector.h @@ -1,4 +1,32 @@ -//$$CDS-header$$ +/* + This file is a part of libcds - Concurrent Data Structures library + + (C) Copyright Maxim Khizhinsky (libcds.dev@gmail.com) 2006-2016 + + Source code repo: http://github.com/khizmax/libcds/ + Download: http://sourceforge.net/projects/libcds/files/ + + Redistribution and use in source and binary forms, with or without + modification, are permitted provided that the following conditions are met: + + * Redistributions of source code must retain the above copyright notice, this + list of conditions and the following disclaimer. + + * Redistributions in binary form must reproduce the above copyright notice, + this list of conditions and the following disclaimer in the documentation + and/or other materials provided with the distribution. + + THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" + AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE + IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE + DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE + FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL + DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR + SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER + CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, + OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE + OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. +*/ #ifndef CDSLIB_CONTAINER_STRIPED_SET_BOOST_STABLE_VECTOR_ADAPTER_H #define CDSLIB_CONTAINER_STRIPED_SET_BOOST_STABLE_VECTOR_ADAPTER_H @@ -128,7 +156,7 @@ namespace cds { namespace intrusive { namespace striped_set { template bool insert( const Q& val, Func f ) { - iterator it = std::lower_bound( m_Vector.begin(), m_Vector.end(), val, find_predicate() ); + iterator it = std::lower_bound( m_Vector.begin(), m_Vector.end(), val, find_predicate()); if ( it == m_Vector.end() || key_comparator()( val, *it ) != 0 ) { value_type newItem( val ); it = m_Vector.insert( it, newItem ); @@ -142,9 +170,9 @@ namespace cds { namespace intrusive { namespace striped_set { bool emplace( Args&&... args ) { value_type val( std::forward(args)... ); - iterator it = std::lower_bound( m_Vector.begin(), m_Vector.end(), val, find_predicate() ); + iterator it = std::lower_bound( m_Vector.begin(), m_Vector.end(), val, find_predicate()); if ( it == m_Vector.end() || key_comparator()( val, *it ) != 0 ) { - it = m_Vector.emplace( it, std::move( val ) ); + it = m_Vector.emplace( it, std::move( val )); return true; } return false; @@ -153,7 +181,7 @@ namespace cds { namespace intrusive { namespace striped_set { template std::pair update( const Q& val, Func func, bool bAllowInsert ) { - iterator it = std::lower_bound( m_Vector.begin(), m_Vector.end(), val, find_predicate() ); + iterator it = std::lower_bound( m_Vector.begin(), m_Vector.end(), val, find_predicate()); if ( it == m_Vector.end() || key_comparator()( val, *it ) != 0 ) { // insert new if ( !bAllowInsert ) @@ -174,7 +202,7 @@ namespace cds { namespace intrusive { namespace striped_set { template bool erase( const Q& key, Func f ) { - iterator it = std::lower_bound( m_Vector.begin(), m_Vector.end(), key, find_predicate() ); + iterator it = std::lower_bound( m_Vector.begin(), m_Vector.end(), key, find_predicate()); if ( it == m_Vector.end() || key_comparator()( key, *it ) != 0 ) return false; @@ -188,7 +216,7 @@ namespace cds { namespace intrusive { namespace striped_set { bool erase( const Q& key, Less pred, Func f ) { iterator it = std::lower_bound( m_Vector.begin(), m_Vector.end(), key, pred ); - if ( it == m_Vector.end() || pred( key, *it ) || pred( *it, key ) ) + if ( it == m_Vector.end() || pred( key, *it ) || pred( *it, key )) return false; // key exists @@ -200,7 +228,7 @@ namespace cds { namespace intrusive { namespace striped_set { template bool find( Q& val, Func f ) { - iterator it = std::lower_bound( m_Vector.begin(), m_Vector.end(), val, find_predicate() ); + iterator it = std::lower_bound( m_Vector.begin(), m_Vector.end(), val, find_predicate()); if ( it == m_Vector.end() || key_comparator()( val, *it ) != 0 ) return false; @@ -213,7 +241,7 @@ namespace cds { namespace intrusive { namespace striped_set { bool find( Q& val, Less pred, Func f ) { iterator it = std::lower_bound( m_Vector.begin(), m_Vector.end(), val, pred ); - if ( it == m_Vector.end() || pred( val, *it ) || pred( *it, val ) ) + if ( it == m_Vector.end() || pred( val, *it ) || pred( *it, val )) return false; // key exists @@ -234,7 +262,7 @@ namespace cds { namespace intrusive { namespace striped_set { void move_item( adapted_container& /*from*/, iterator itWhat ) { - iterator it = std::lower_bound( m_Vector.begin(), m_Vector.end(), *itWhat, find_predicate() ); + iterator it = std::lower_bound( m_Vector.begin(), m_Vector.end(), *itWhat, find_predicate()); assert( it == m_Vector.end() || key_comparator()( *itWhat, *it ) != 0 ); copy_item()( m_Vector, it, itWhat );