/*
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/
-
+
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
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.
+ OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#ifndef CDSLIB_INTRUSIVE_STRIPED_SET_BOOST_SLIST_ADAPTER_H
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 );
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>