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
///////////////////////////////////////////////////////////////////////////// // // (C) Copyright Ion Gaztanaga 2007 // // 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) // // See http://www.boost.org/libs/intrusive for documentation. // ///////////////////////////////////////////////////////////////////////////// #ifndef BOOST_INTRUSIVE_BS_SET_HOOK_HPP #define BOOST_INTRUSIVE_BS_SET_HOOK_HPP #include
#include
#include
#include
#include
#include
#include
namespace boost { namespace intrusive { /// @cond template
struct get_bs_set_node_algo { typedef detail::tree_algorithms
> type; }; /// @endcond //! Helper metafunction to define a \c bs_set_base_hook that yields to the same //! type when the same options (either explicitly or implicitly) are used. #ifdef BOOST_INTRUSIVE_DOXYGEN_INVOKED template
#else template
#endif struct make_bs_set_base_hook { /// @cond typedef typename pack_options < hook_defaults, O1, O2, O3>::type packed_options; //Scapegoat trees can't be auto unlink trees BOOST_STATIC_ASSERT(((int)packed_options::link_mode != (int)auto_unlink)); typedef detail::generic_hook < get_bs_set_node_algo
, typename packed_options::tag , packed_options::link_mode , detail::BsSetBaseHook > implementation_defined; /// @endcond typedef implementation_defined type; }; //! Derive a class from bs_set_base_hook in order to store objects in //! in a bs_set/bs_multiset. bs_set_base_hook holds the data necessary to maintain //! the bs_set/bs_multiset and provides an appropriate value_traits class for bs_set/bs_multiset. //! //! The hook admits the following options: \c tag<>, \c void_pointer<>, //! \c link_mode<>. //! //! \c tag<> defines a tag to identify the node. //! The same tag value can be used in different classes, but if a class is //! derived from more than one \c list_base_hook, then each \c list_base_hook needs its //! unique tag. //! //! \c void_pointer<> is the pointer type that will be used internally in the hook //! and the the container configured to use this hook. //! //! \c link_mode<> will specify the linking mode of the hook (\c normal_link, //! \c auto_unlink or \c safe_link). #ifdef BOOST_INTRUSIVE_DOXYGEN_INVOKED template
#else template
#endif class bs_set_base_hook : public make_bs_set_base_hook
::type { #ifdef BOOST_INTRUSIVE_DOXYGEN_INVOKED //!
Effects
: If link_mode is \c auto_unlink or \c safe_link //! initializes the node to an unlinked state. //! //!
Throws
: Nothing. bs_set_base_hook(); //!
Effects
: If link_mode is \c auto_unlink or \c safe_link //! initializes the node to an unlinked state. The argument is ignored. //! //!
Throws
: Nothing. //! //!
Rationale
: Providing a copy-constructor //! makes classes using the hook STL-compliant without forcing the //! user to do some additional work. \c swap can be used to emulate //! move-semantics. bs_set_base_hook(const bs_set_base_hook& ); //!
Effects
: Empty function. The argument is ignored. //! //!
Throws
: Nothing. //! //!
Rationale
: Providing an assignment operator //! makes classes using the hook STL-compliant without forcing the //! user to do some additional work. \c swap can be used to emulate //! move-semantics. bs_set_base_hook& operator=(const bs_set_base_hook& ); //!
Effects
: If link_mode is \c normal_link, the destructor does //! nothing (ie. no code is generated). If link_mode is \c safe_link and the //! object is stored in a set an assertion is raised. If link_mode is //! \c auto_unlink and \c is_linked() is true, the node is unlinked. //! //!
Throws
: Nothing. ~bs_set_base_hook(); //!
Effects
: Swapping two nodes swaps the position of the elements //! related to those nodes in one or two containers. That is, if the node //! this is part of the element e1, the node x is part of the element e2 //! and both elements are included in the containers s1 and s2, then after //! the swap-operation e1 is in s2 at the position of e2 and e2 is in s1 //! at the position of e1. If one element is not in a container, then //! after the swap-operation the other element is not in a container. //! Iterators to e1 and e2 related to those nodes are invalidated. //! //!
Complexity
: Constant //! //!
Throws
: Nothing. void swap_nodes(bs_set_base_hook &other); //!
Precondition
: link_mode must be \c safe_link or \c auto_unlink. //! //!
Returns
: true, if the node belongs to a container, false //! otherwise. This function can be used to test whether \c set::iterator_to //! will return a valid iterator. //! //!
Complexity
: Constant bool is_linked() const; //!
Effects
: Removes the node if it's inserted in a container. //! This function is only allowed if link_mode is \c auto_unlink. //! //!
Throws
: Nothing. void unlink(); #endif }; //! Helper metafunction to define a \c bs_set_member_hook that yields to the same //! type when the same options (either explicitly or implicitly) are used. #ifdef BOOST_INTRUSIVE_DOXYGEN_INVOKED template
#else template
#endif struct make_bs_set_member_hook { /// @cond typedef typename pack_options < hook_defaults, O1, O2, O3>::type packed_options; //Scapegoat trees can't be auto unlink trees BOOST_STATIC_ASSERT(((int)packed_options::link_mode != (int)auto_unlink)); typedef detail::generic_hook < get_bs_set_node_algo
, member_tag , packed_options::link_mode , detail::NoBaseHook > implementation_defined; /// @endcond typedef implementation_defined type; }; //! Put a public data member bs_set_member_hook in order to store objects of this class in //! a bs_set/bs_multiset. bs_set_member_hook holds the data necessary for maintaining the //! bs_set/bs_multiset and provides an appropriate value_traits class for bs_set/bs_multiset. //! //! The hook admits the following options: \c void_pointer<>, \c link_mode<>. //! //! \c void_pointer<> is the pointer type that will be used internally in the hook //! and the the container configured to use this hook. //! //! \c link_mode<> will specify the linking mode of the hook (\c normal_link, //! \c auto_unlink or \c safe_link). #ifdef BOOST_INTRUSIVE_DOXYGEN_INVOKED template
#else template
#endif class bs_set_member_hook : public make_bs_set_member_hook
::type { #ifdef BOOST_INTRUSIVE_DOXYGEN_INVOKED //!
Effects
: If link_mode is \c auto_unlink or \c safe_link //! initializes the node to an unlinked state. //! //!
Throws
: Nothing. bs_set_member_hook(); //!
Effects
: If link_mode is \c auto_unlink or \c safe_link //! initializes the node to an unlinked state. The argument is ignored. //! //!
Throws
: Nothing. //! //!
Rationale
: Providing a copy-constructor //! makes classes using the hook STL-compliant without forcing the //! user to do some additional work. \c swap can be used to emulate //! move-semantics. bs_set_member_hook(const bs_set_member_hook& ); //!
Effects
: Empty function. The argument is ignored. //! //!
Throws
: Nothing. //! //!
Rationale
: Providing an assignment operator //! makes classes using the hook STL-compliant without forcing the //! user to do some additional work. \c swap can be used to emulate //! move-semantics. bs_set_member_hook& operator=(const bs_set_member_hook& ); //!
Effects
: If link_mode is \c normal_link, the destructor does //! nothing (ie. no code is generated). If link_mode is \c safe_link and the //! object is stored in a set an assertion is raised. If link_mode is //! \c auto_unlink and \c is_linked() is true, the node is unlinked. //! //!
Throws
: Nothing. ~bs_set_member_hook(); //!
Effects
: Swapping two nodes swaps the position of the elements //! related to those nodes in one or two containers. That is, if the node //! this is part of the element e1, the node x is part of the element e2 //! and both elements are included in the containers s1 and s2, then after //! the swap-operation e1 is in s2 at the position of e2 and e2 is in s1 //! at the position of e1. If one element is not in a container, then //! after the swap-operation the other element is not in a container. //! Iterators to e1 and e2 related to those nodes are invalidated. //! //!
Complexity
: Constant //! //!
Throws
: Nothing. void swap_nodes(bs_set_member_hook &other); //!
Precondition
: link_mode must be \c safe_link or \c auto_unlink. //! //!
Returns
: true, if the node belongs to a container, false //! otherwise. This function can be used to test whether \c set::iterator_to //! will return a valid iterator. //! //!
Complexity
: Constant bool is_linked() const; //!
Effects
: Removes the node if it's inserted in a container. //! This function is only allowed if link_mode is \c auto_unlink. //! //!
Throws
: Nothing. void unlink(); #endif }; /// @cond template
struct internal_default_bs_set_hook { template
static detail::one test(...); template
static detail::two test(typename U::default_bs_set_hook* = 0); static const bool value = sizeof(test
(0)) == sizeof(detail::two); }; template
struct get_default_bs_set_hook { typedef typename T::default_bs_set_hook type; }; /// @endcond } //namespace intrusive } //namespace boost #include
#endif //BOOST_INTRUSIVE_BS_SET_HOOK_HPP
bs_set_hook.hpp
Page URL
File URL
Prev
5/34
Next
Download
( 10 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.