s) {
+ return boost::hash_range(s.begin(), s.end());
+ }
}
#if 0
diff --git a/operators.htm b/operators.htm
index 993436c..db81fd3 100644
--- a/operators.htm
+++ b/operators.htm
@@ -1586,7 +1586,7 @@ T operator+( T lhs, const T& rhs )
- The operators_test.cpp
+
The operators_test.cpp
program demonstrates the use of the arithmetic operator templates, and
can also be used to verify correct operation. Check the compiler status
report for the test results with selected platforms.
@@ -1998,7 +1998,7 @@ struct function_output_iterator
- The iterators_test.cpp
+
The iterators_test.cpp
program demonstrates the use of the iterator templates, and can also be
used to verify correct operation. The following is the custom iterator
defined in the test program. It demonstrates a correct (though trivial)
@@ -2064,7 +2064,7 @@ public:
Beman Dawes
Contributed operators_test.cpp.
+ "test/operators_test.cpp">operators_test.cpp.
Daryle Walker
diff --git a/test/Jamfile.v2 b/test/Jamfile.v2
index 7fd5b2f..739edc0 100644
--- a/test/Jamfile.v2
+++ b/test/Jamfile.v2
@@ -16,6 +16,7 @@ run binary_test.cpp ;
run call_traits_test.cpp : -u ;
run compressed_pair_test.cpp ;
+run compressed_pair_final_test.cpp ;
run iterators_test.cpp ;
diff --git a/test/compressed_pair_final_test.cpp b/test/compressed_pair_final_test.cpp
new file mode 100644
index 0000000..247f3fc
--- /dev/null
+++ b/test/compressed_pair_final_test.cpp
@@ -0,0 +1,55 @@
+/*
+Copyright 2018 Glen Joseph Fernandes
+(glenjofe@gmail.com)
+
+Distributed under the Boost Software License, Version 1.0.
+(http://www.boost.org/LICENSE_1_0.txt)
+*/
+#include
+#if !defined(BOOST_NO_CXX11_FINAL)
+#include
+#include
+
+struct type1 {
+ operator bool() const {
+ return false;
+ }
+};
+
+struct type2 final {
+ operator bool() const {
+ return false;
+ }
+};
+
+#if !defined(BOOST_IS_FINAL)
+namespace boost {
+
+template<>
+struct is_final
+ : true_type { };
+
+} /* boost*/
+#endif
+
+template
+void test()
+{
+ boost::compressed_pair p;
+ BOOST_TEST(!p.first());
+ BOOST_TEST(!p.second());
+}
+
+int main()
+{
+ test();
+ test();
+ test();
+ return boost::report_errors();
+}
+#else
+int main()
+{
+ return 0;
+}
+#endif
diff --git a/test/string_ref_test2.cpp b/test/string_ref_test2.cpp
index ccb5d6d..d733775 100644
--- a/test/string_ref_test2.cpp
+++ b/test/string_ref_test2.cpp
@@ -93,6 +93,10 @@ void find ( const char *arg ) {
string_ref sr2;
const char *p;
+// When we search for the empty string, we find it at position 0
+ BOOST_TEST ( sr1.find (sr2) == 0 );
+ BOOST_TEST ( sr1.rfind(sr2) == 0 );
+
// Look for each character in the string(searching from the start)
p = arg;
sr1 = arg;
diff --git a/test/string_view_test1.cpp b/test/string_view_test1.cpp
index 9b70a7e..c35bbfa 100644
--- a/test/string_view_test1.cpp
+++ b/test/string_view_test1.cpp
@@ -12,6 +12,7 @@
#include
#include
+#include
#include
@@ -85,6 +86,14 @@ void test_remove ( const std::string &str ) {
}
}
+void test_hash(const std::string& str) {
+ string_view ref = str;
+ BOOST_TEST(boost::hash_value(ref) == boost::hash_value(str));
+ boost::hash hstr;
+ boost::hash hsv;
+ BOOST_TEST(hsv(ref) == hstr(str));
+ }
+
const char *test_strings [] = {
"",
"1",
@@ -102,6 +111,7 @@ int main()
test_substr ( *p );
test_remove ( *p );
null_tests ( *p );
+ test_hash( *p );
p++;
}
diff --git a/test/string_view_test2.cpp b/test/string_view_test2.cpp
index 2549e64..135fd1a 100644
--- a/test/string_view_test2.cpp
+++ b/test/string_view_test2.cpp
@@ -97,6 +97,10 @@ void find ( const char *arg ) {
string_view sr2;
const char *p;
+// When we search for the empty string, we find it at position 0
+ BOOST_TEST ( sr1.find (sr2) == 0 );
+ BOOST_TEST ( sr1.rfind(sr2) == 0 );
+
// Look for each character in the string(searching from the start)
p = arg;
sr1 = arg;