DriveHQ Start Menu
Cloud Drive Mapping
Folder Sync
Cloud Backup
True Drop Box
FTP/SFTP Hosting
Group Account
DriveHQ Start Menu
Online File Server
My Storage
|
Manage Shares
|
Publishes
|
Drop Boxes
|
Group Account
WebDAV Drive Mapping
Cloud Drive Home
|
WebDAV Guide
|
Drive Mapping Tool
|
Drive Mapping URL
Complete Data Backup
Backup Guide
|
Online Backup Tool
|
Cloud-to-Cloud Backup
FTP, Email & Web Service
FTP Home
|
FTP Hosting FAQ
|
Email Hosting
|
EmailManager
|
Web Hosting
Help & Resources
About
|
Enterprise Service
|
Partnership
|
Comparisons
|
Support
Quick Links
Security and Privacy
Download Software
Service Manual
Use Cases
Group Account
Online Help
Blog
Contact
Cloud Surveillance
Sign Up
Login
Features
Business Features
Online File Server
FTP Hosting
Cloud Drive Mapping
Cloud File Backup
Email Backup & Hosting
Cloud File Sharing
Folder Synchronization
Group Management
True Drop Box
Full-text Search
AD Integration/SSO
Mobile Access
IP Camera & DVR Solution
More...
Personal Features
Personal Cloud Drive
Backup All Devices
Mobile APPs
Personal Web Hosting
Sub-Account (for Kids)
Home/PC/Kids Monitoring
More...
Software
DriveHQ Drive Mapping Tool
DriveHQ FileManager
DriveHQ Online Backup
DriveHQ Mobile Apps
Pricing
Business Plans & Pricing
Personal Plans & Pricing
Price Comparison with Others
Feature Comparison with Others
Install Mobile App
Sign up
Creating account...
Invalid character in username! Only 0-9, a-z, A-Z, _, -, . allowed.
Username is required!
Invalid email address!
E-mail is required!
Password is required!
Password is invalid!
Password and confirmation do not match.
Confirm password is required!
I accept
Membership Agreement
Please read the Membership Agreement and check "I accept"!
Free Quick Sign-up
Sign-up Page
Log in
Signing in...
Username or e-mail address is required!
Password is required!
Keep me logged in
Quick Login
Forgot Password
Up
Upload
Download
Share
Publish
New Folder
New File
Copy
Cut
Delete
Paste
Rate
Upgrade
Rotate
Effect
Edit
Slide
History
// Boost.Bimap // // Copyright (c) 2006-2007 Matias Capeletto // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) /// \file multiset_of.hpp /// \brief Include support for multiset constrains for the bimap container #ifndef BOOST_BIMAP_MULTISET_OF_HPP #define BOOST_BIMAP_MULTISET_OF_HPP #if defined(_MSC_VER) && (_MSC_VER>=1200) #pragma once #endif #include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
namespace boost { namespace bimaps { /// \brief Set Type Specification /** This struct is used to specify a multiset specification. It is not a container, it is just a metaprogramming facility to express the type of a set. Generally, this specification will be used in other place to create a container. It has the same syntax that an std::set instantiation, except that the allocator cannot be specified. The rationale behind this difference is that the allocator is not part of the set type specification, rather it is a container configuration parameter. The first parameter is the type of the objects in the multiset, and the second one is a Functor that compares them. Bimap binding metafunctions can be used with this class in the following way: \code using namespace support; BOOST_STATIC_ASSERT( is_set_type_of< multiset_of
>::value ) BOOST_STATIC_ASSERT ( is_same < compute_index_type < multiset_of
, KeyExtractor, Tag >::type , ordered_nonunique< tag
, KeyExtractor, KeyCompare > >::value ) typedef bimap < multiset_of
, RightKeyType > bimap_with_left_type_as_multiset; BOOST_STATIC_ASSERT ( is_same < compute_map_view_type < member_at::left, bimap_with_left_type_as_multiset >::type, multimap_view< member_at::left, bimap_with_left_type_as_multiset > >::value ) \endcode See also multiset_of_relation. **/ template < class KeyType, class KeyCompare = std::less< BOOST_DEDUCED_TYPENAME ::boost::bimaps::tags::support::value_type_of
::type > > struct multiset_of : public ::boost::bimaps::detail::set_type_of_tag { /// User type, can be tagged typedef KeyType user_type; /// Type of the object that will be stored in the multiset typedef BOOST_DEDUCED_TYPENAME ::boost::bimaps::tags::support:: value_type_of
::type value_type; /// Functor that compare two keys typedef KeyCompare key_compare; struct lazy_concept_checked { BOOST_CLASS_REQUIRE ( value_type, boost, AssignableConcept ); BOOST_CLASS_REQUIRE4( key_compare, bool, value_type, value_type, boost, BinaryFunctionConcept ); typedef multiset_of type; }; BOOST_BIMAP_GENERATE_INDEX_BINDER_1CP( // binds to multi_index::ordered_non_unique, // with key_compare ) BOOST_BIMAP_GENERATE_MAP_VIEW_BINDER( // binds to views::multimap_view ) BOOST_BIMAP_GENERATE_SET_VIEW_BINDER( // binds to views::multiset_view ) typedef mpl::bool_
mutable_key; }; /// \brief Set Of Relation Specification /** This struct is similar to multiset_of but it is bind logically to a relation. It is used in the bimap instantiation to specify the desired type of the main view. This struct implements internally a metafunction named bind_to that manages the quite complicated task of finding the right type of the set for the relation. \code template
struct bind_to { typedef -unspecified- type; }; \endcode See also multiset_of, is_set_type_of_relation. **/ template< class KeyCompare = std::less< _relation > > struct multiset_of_relation : public ::boost::bimaps::detail::set_type_of_relation_tag { /// Functor that compare two keys typedef KeyCompare key_compare; BOOST_BIMAP_GENERATE_RELATION_BINDER_1CP( // binds to multiset_of, // with key_compare ) typedef mpl::bool_
left_mutable_key; typedef mpl::bool_
right_mutable_key; }; } // namespace bimaps } // namespace boost #endif // BOOST_BIMAP_MULTISET_OF_HPP
multiset_of.hpp
Page URL
File URL
Prev
3/8
Next
Download
( 5 KB )
Note: The DriveHQ service banners will NOT be displayed if the file owner is a paid member.
Comments
Total ratings:
0
Average rating:
Not Rated
Would you like to comment?
Join DriveHQ
for a free account, or
Logon
if you are already a member.