/*
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.
*/
#include <cds/opt/permutation.h>
do {
typename Gen::integer_type i = gen;
++arr[ i ];
- } while ( gen.next() );
+ } while ( gen.next());
for ( size_t i = 0; i < nLen; ++i )
- EXPECT_EQ( arr[i], 1 ) << "i=" << i;
+ EXPECT_EQ( arr[i], 1u ) << "i=" << i;
for ( size_t i = nLen; i < c_nMax; ++i )
- EXPECT_EQ( arr[i], 0 ) << "i=" << i;
+ EXPECT_EQ( arr[i], 0u ) << "i=" << i;
gen.reset();
}