X-Git-Url: http://plrg.eecs.uci.edu/git/?a=blobdiff_plain;f=gdax-orderbook-hpp%2Fdemo%2Fdependencies%2Flibcds-2.3.2%2Fcds%2Fcontainer%2Fdetails%2Fiterable_list_base.h;fp=gdax-orderbook-hpp%2Fdemo%2Fdependencies%2Flibcds-2.3.2%2Fcds%2Fcontainer%2Fdetails%2Fiterable_list_base.h;h=699180192b39fac32c59f90585a3ab1594ce140d;hb=4223430d9168223029c7639149025c79e69b4f37;hp=0000000000000000000000000000000000000000;hpb=7ea7751a31c0388bf888052517be181a2989b113;p=c11concurrency-benchmarks.git diff --git a/gdax-orderbook-hpp/demo/dependencies/libcds-2.3.2/cds/container/details/iterable_list_base.h b/gdax-orderbook-hpp/demo/dependencies/libcds-2.3.2/cds/container/details/iterable_list_base.h new file mode 100644 index 0000000..6991801 --- /dev/null +++ b/gdax-orderbook-hpp/demo/dependencies/libcds-2.3.2/cds/container/details/iterable_list_base.h @@ -0,0 +1,152 @@ +/* + 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 CDSLIB_CONTAINER_DETAILS_ITERABLE_LIST_BASE_H +#define CDSLIB_CONTAINER_DETAILS_ITERABLE_LIST_BASE_H + +#include +#include +#include + +namespace cds { namespace container { + + /// \p IterableList ordered list related definitions + /** @ingroup cds_nonintrusive_helper + */ + namespace iterable_list { + + /// \p IterableList internal statistics, see \p cds::intrusive::iterable_list::stat + template ::event_counter > + using stat = cds::intrusive::iterable_list::stat< EventCounter >; + + /// \p IterableList empty internal statistics, see \p cds::intrusive::iterable_list::empty_stat + typedef cds::intrusive::iterable_list::empty_stat empty_stat; + + //@cond + template ::stat_type > + using wrapped_stat = cds::intrusive::iterable_list::wrapped_stat< Stat >; + //@endif + + /// \p IterableList traits + struct traits + { + /// Allocator used to allocate new data + typedef CDS_DEFAULT_ALLOCATOR allocator; + + /// Node allocator + typedef intrusive::iterable_list::traits::node_allocator node_allocator; + + /// Key comparison functor + /** + No default functor is provided. If the option is not specified, the \p less is used. + */ + typedef opt::none compare; + + /// Specifies binary predicate used for key comparison. + /** + Default is \p std::less. + */ + typedef opt::none less; + + /// Back-off strategy + typedef intrusive::iterable_list::traits::back_off back_off; + + /// Item counting feature; by default, disabled. Use \p cds::atomicity::item_counter or \p atomicity::cache_friendly_item_counter to enable item counting + typedef intrusive::iterable_list::traits::item_counter item_counter; + + /// Internal statistics + /** + By default, internal statistics is disabled (\p iterable_list::empty_stat). + Use \p iterable_list::stat to enable it. + */ + typedef intrusive::iterable_list::traits::stat stat; + + /// C++ memory ordering model + /** + Can be \p opt::v::relaxed_ordering (relaxed memory model, the default) + or \p opt::v::sequential_consistent (sequentially consisnent memory model). + */ + typedef opt::v::relaxed_ordering memory_model; + + /// RCU deadlock checking policy (only for \ref cds_intrusive_MichaelList_rcu "RCU-based MichaelList") + /** + List of available options see opt::rcu_check_deadlock + */ + typedef opt::v::rcu_throw_deadlock rcu_check_deadlock; + + //@cond + // IterableKVList: supporting for split-ordered list + // key accessor (opt::none = internal key type is equal to user key type) + typedef opt::none key_accessor; + //@endcond + }; + + /// Metafunction converting option list to \p iterable_list::traits + /** + Supported \p Options are: + - \p opt::compare - key comparison functor. No default functor is provided. + If the option is not specified, the \p opt::less is used. + - \p opt::less - specifies binary predicate used for key comparison. Default is \p std::less. + - \p opt::allocator - an allocator for data, default is \p CDS_DEFAULT_ALLOCATOR + - \p opt::node_allocator - node allocator, default is \p std::allocator. + - \p opt::back_off - back-off strategy used. If the option is not specified, the \p cds::backoff::Default is used. + - \p opt::item_counter - the type of item counting feature. Default is disabled (\p atomicity::empty_item_counter). + To enable item counting use \p atomicity::item_counter or \p atomicity::cache_friendly_item_counter. + - \p opt::stat - internal statistics. By default, it is disabled (\p iterable_list::empty_stat). + To enable it use \p iterable_list::stat + - \p opt::memory_model - C++ memory ordering model. Can be \p opt::v::relaxed_ordering (relaxed memory model, the default) + or \p opt::v::sequential_consistent (sequentially consistent memory model). + */ + template + struct make_traits { +# ifdef CDS_DOXYGEN_INVOKED + typedef implementation_defined type ; ///< Metafunction result +# else + typedef typename cds::opt::make_options< + typename cds::opt::find_type_traits< traits, Options... >::type + ,Options... + >::type type; +#endif + }; + + + } // namespace iterable_list + + // Forward declarations + template + class IterableList; + + template + class IterableKVList; + +}} // namespace cds::container + + +#endif // #ifndef CDSLIB_CONTAINER_DETAILS_ITERABLE_LIST_BASE_H