X-Git-Url: http://plrg.eecs.uci.edu/git/?p=c11concurrency-benchmarks.git;a=blobdiff_plain;f=gdax-orderbook-hpp%2Fdemo%2Fdependencies%2Flibcds-2.3.2%2Ftest%2Funit%2Flist%2Ftest_kv_list_hp.h;fp=gdax-orderbook-hpp%2Fdemo%2Fdependencies%2Flibcds-2.3.2%2Ftest%2Funit%2Flist%2Ftest_kv_list_hp.h;h=ee75eadd2c2a491838057ba3f554cb7237136bc6;hp=0000000000000000000000000000000000000000;hb=4223430d9168223029c7639149025c79e69b4f37;hpb=7ea7751a31c0388bf888052517be181a2989b113

diff --git a/gdax-orderbook-hpp/demo/dependencies/libcds-2.3.2/test/unit/list/test_kv_list_hp.h b/gdax-orderbook-hpp/demo/dependencies/libcds-2.3.2/test/unit/list/test_kv_list_hp.h
new file mode 100644
index 0000000..ee75ead
--- /dev/null
+++ b/gdax-orderbook-hpp/demo/dependencies/libcds-2.3.2/test/unit/list/test_kv_list_hp.h
@@ -0,0 +1,135 @@
+/*
+    This file is a part of libcds - Concurrent Data Structures library
+
+    (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:
+
+    * 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 CDSUNIT_LIST_TEST_KV_LIST_HP_H
+#define CDSUNIT_LIST_TEST_KV_LIST_HP_H
+
+#include "test_kv_list.h"
+
+namespace cds_test {
+
+    class kv_list_hp : public kv_list_common
+    {
+    protected:
+        template <typename List>
+        void test_hp( List& l )
+        {
+            // Precondition: list is empty
+            // Postcondition: list is empty
+
+            static const size_t nSize = 20;
+            typedef typename List::guarded_ptr guarded_ptr;
+
+            struct key_val {
+                int key;
+                int val;
+            };
+            key_val arr[nSize];
+
+            for ( size_t i = 0; i < nSize; ++i ) {
+                arr[i].key = static_cast<int>(i);
+                arr[i].val = arr[i].key * 10;
+            }
+            shuffle( arr, arr + nSize );
+
+            ASSERT_TRUE( l.empty());
+            ASSERT_CONTAINER_SIZE( l, 0 );
+
+            guarded_ptr gp;
+            size_t nCount = 0;
+
+            // get() test
+            for ( auto& i : arr ) {
+                gp = l.get( i.key );
+                EXPECT_TRUE( !gp );
+                gp = l.get_with( other_key( i.key ), other_less());
+                EXPECT_TRUE( !gp );
+
+                EXPECT_TRUE( l.insert( i.key, i.val ));
+
+                gp = l.get( i.key );
+                ASSERT_FALSE( !gp );
+                EXPECT_EQ( gp->first.nKey, i.key );
+                EXPECT_EQ( gp->second.val, gp->first.nKey * 10 );
+                gp->second.val = gp->first.nKey * 5;
+
+                gp = l.get_with( other_key( i.key ), other_less());
+                ASSERT_FALSE( !gp );
+                EXPECT_EQ( gp->first.nKey, i.key );
+                EXPECT_EQ( gp->second.val, gp->first.nKey * 5 );
+                gp->second.val = gp->first.nKey * 10;
+
+                ++nCount;
+                ASSERT_FALSE( l.empty());
+                ASSERT_CONTAINER_SIZE( l, nCount );
+            }
+
+            ASSERT_FALSE( l.empty());
+            ASSERT_CONTAINER_SIZE( l, nSize );
+
+            // extract() test
+            for ( auto const& i : arr ) {
+                ASSERT_FALSE( l.empty());
+                ASSERT_CONTAINER_SIZE( l, nCount );
+                --nCount;
+
+                gp = l.get( i.key );
+                ASSERT_FALSE( !gp );
+                EXPECT_EQ( gp->first.nKey, i.key );
+
+                switch ( i.key & 1 ) {
+                    case 0:
+                        gp = l.extract( i.key );
+                        break;
+                    case 1:
+                        gp = l.extract_with( other_key( i.key ), other_less());
+                        break;
+                }
+                ASSERT_FALSE( !gp );
+                EXPECT_EQ( gp->first.nKey, i.key );
+                EXPECT_EQ( gp->second.val, gp->first.nKey * 10 );
+
+                gp = l.get( i.key );
+                EXPECT_FALSE( gp );
+
+                gp = l.extract( i.key );
+                EXPECT_FALSE( gp );
+                gp = l.extract_with( other_key( i.key ), other_less());
+                EXPECT_FALSE( gp );
+            }
+
+            ASSERT_TRUE( l.empty());
+            ASSERT_CONTAINER_SIZE( l, 0 );
+        }
+    };
+
+} // namespace cds_list
+
+#endif // CDSUNIT_LIST_TEST_KV_LIST_HP_H