From 34bd32e225e2a8a94104489b31c42e5801cc1f4a Mon Sep 17 00:00:00 2001 From: DongHun Kwak Date: Wed, 13 Sep 2017 11:05:34 +0900 Subject: Imported Upstream version 1.63.0 Change-Id: Iac85556a04b7e58d63ba636dedb0986e3555714a Signed-off-by: DongHun Kwak --- doc/html/boost/heap/priority_queue.html | 112 ++++++++++++++++---------------- 1 file changed, 56 insertions(+), 56 deletions(-) (limited to 'doc/html/boost/heap/priority_queue.html') diff --git a/doc/html/boost/heap/priority_queue.html b/doc/html/boost/heap/priority_queue.html index 5a44945bb1..fcfacb3d52 100644 --- a/doc/html/boost/heap/priority_queue.html +++ b/doc/html/boost/heap/priority_queue.html @@ -49,34 +49,34 @@ typedef implementation_defined::const_iterator const_iterator; // construct/copy/destruct - explicit priority_queue(value_compare const & = value_compare()); - priority_queue(priority_queue const &); - priority_queue(priority_queue &&) noexcept(boost::is_nothrow_move_constructible< super_t >::value)); + explicit priority_queue(value_compare const & = value_compare()); + priority_queue(priority_queue const &); + priority_queue(priority_queue &&) noexcept(boost::is_nothrow_move_constructible< super_t >::value)); priority_queue & - operator=(priority_queue &&) noexcept(boost::is_nothrow_move_assignable< super_t >::value)); - priority_queue & operator=(priority_queue const &); + operator=(priority_queue &&) noexcept(boost::is_nothrow_move_assignable< super_t >::value)); + priority_queue & operator=(priority_queue const &); - // public member functions - bool empty(void) const noexcept; - size_type size(void) const noexcept; - size_type max_size(void) const noexcept; - void clear(void) noexcept; - allocator_type get_allocator(void) const; - const_reference top(void) const; - void push(value_type const &); - template<class... Args> void emplace(Args &&...); - void pop(void); - void swap(priority_queue &) noexcept(boost::is_nothrow_move_constructible< super_t >::value &&boost::is_nothrow_move_assignable< super_t >::value)); - iterator begin(void) const noexcept; - iterator end(void) const noexcept; - void reserve(size_type); - value_compare const & value_comp(void) const; - template<typename HeapType> bool operator<(HeapType const &) const; - template<typename HeapType> bool operator>(HeapType const &) const; - template<typename HeapType> bool operator>=(HeapType const &) const; - template<typename HeapType> bool operator<=(HeapType const &) const; - template<typename HeapType> bool operator==(HeapType const &) const; - template<typename HeapType> bool operator!=(HeapType const &) const; + // public member functions + bool empty(void) const noexcept; + size_type size(void) const noexcept; + size_type max_size(void) const noexcept; + void clear(void) noexcept; + allocator_type get_allocator(void) const; + const_reference top(void) const; + void push(value_type const &); + template<class... Args> void emplace(Args &&...); + void pop(void); + void swap(priority_queue &) noexcept(boost::is_nothrow_move_constructible< super_t >::value &&boost::is_nothrow_move_assignable< super_t >::value)); + iterator begin(void) const noexcept; + iterator end(void) const noexcept; + void reserve(size_type); + value_compare const & value_comp(void) const; + template<typename HeapType> bool operator<(HeapType const &) const; + template<typename HeapType> bool operator>(HeapType const &) const; + template<typename HeapType> bool operator>=(HeapType const &) const; + template<typename HeapType> bool operator<=(HeapType const &) const; + template<typename HeapType> bool operator==(HeapType const &) const; + template<typename HeapType> bool operator!=(HeapType const &) const; // public data members static const bool constant_time_size; @@ -86,7 +86,7 @@ static const bool has_reserve; };
-

Description

+

Description

The priority_queue class is a wrapper for the stl heap functions.
The template parameter T is the type to be managed by the container. The user can specify additional options and if no options are provided default options are used.

The container supports the following options:

@@ -99,7 +99,7 @@

-

+

priority_queue public types

@@ -110,140 +110,140 @@
-

+

priority_queue public construct/copy/destruct

  1. -
    explicit priority_queue(value_compare const & cmp = value_compare());
    +
    explicit priority_queue(value_compare const & cmp = value_compare());

    Effects: constructs an empty priority queue.

    Complexity: Constant.

  2. -
    priority_queue(priority_queue const & rhs);
    +
    priority_queue(priority_queue const & rhs);

    Effects: copy-constructs priority queue from rhs.

    Complexity: Linear.

  3. -
    priority_queue(priority_queue && rhs) noexcept(boost::is_nothrow_move_constructible< super_t >::value));
    +
    priority_queue(priority_queue && rhs) noexcept(boost::is_nothrow_move_constructible< super_t >::value));

    Effects: C++11-style move constructor.

    Complexity: Constant.

    Note: Only available, if BOOST_NO_CXX11_RVALUE_REFERENCES is not defined 

  4. priority_queue & 
-operator=(priority_queue && rhs) noexcept(boost::is_nothrow_move_assignable< super_t >::value));
    +operator=(priority_queue && rhs) noexcept(boost::is_nothrow_move_assignable< super_t >::value));

    Effects: C++11-style move assignment.

    Complexity: Constant.

    Note: Only available, if BOOST_NO_CXX11_RVALUE_REFERENCES is not defined

  5. -
    priority_queue & operator=(priority_queue const & rhs);
    +
    priority_queue & operator=(priority_queue const & rhs);

    Effects: Assigns priority queue from rhs.

    Complexity: Linear.

-

-priority_queue public member functions

+

+priority_queue public member functions

  1. -
    bool empty(void) const noexcept;
    +
    bool empty(void) const noexcept;

    Effects: Returns true, if the priority queue contains no elements.

    Complexity: Constant.

  2. -
    size_type size(void) const noexcept;
    +
    size_type size(void) const noexcept;

    Effects: Returns the number of elements contained in the priority queue.

    Complexity: Constant.

  3. -
    size_type max_size(void) const noexcept;
    +
    size_type max_size(void) const noexcept;

    Effects: Returns the maximum number of elements the priority queue can contain.

    Complexity: Constant.

  4. -
    void clear(void) noexcept;
    +
    void clear(void) noexcept;

    Effects: Removes all elements from the priority queue.

    Complexity: Linear.

  5. -
    allocator_type get_allocator(void) const;
    +
    allocator_type get_allocator(void) const;

    Effects: Returns allocator.

    Complexity: Constant.

  6. -
    const_reference top(void) const;
    +
    const_reference top(void) const;

    Effects: Returns a const_reference to the maximum element.

    Complexity: Constant.

  7. -
    void push(value_type const & v);
    +
    void push(value_type const & v);

    Effects: Adds a new element to the priority queue.

    Complexity: Logarithmic (amortized). Linear (worst case).

  8. -
    template<class... Args> void emplace(Args &&... args);
    +
    template<class... Args> void emplace(Args &&... args);

    Effects: Adds a new element to the priority queue. The element is directly constructed in-place.

    Complexity: Logarithmic (amortized). Linear (worst case).

  9. -
    void pop(void);
    +
    void pop(void);

    Effects: Removes the top element from the priority queue.

    Complexity: Logarithmic (amortized). Linear (worst case).

  10. -
    void swap(priority_queue & rhs) noexcept(boost::is_nothrow_move_constructible< super_t >::value &&boost::is_nothrow_move_assignable< super_t >::value));
    +
    void swap(priority_queue & rhs) noexcept(boost::is_nothrow_move_constructible< super_t >::value &&boost::is_nothrow_move_assignable< super_t >::value));

    Effects: Swaps two priority queues.

    Complexity: Constant.

  11. -
    iterator begin(void) const noexcept;
    +
    iterator begin(void) const noexcept;

    Effects: Returns an iterator to the first element contained in the priority queue.

    Complexity: Constant.

  12. -
    iterator end(void) const noexcept;
    +
    iterator end(void) const noexcept;

    Effects: Returns an iterator to the end of the priority queue.

    Complexity: Constant.

  13. -
    void reserve(size_type element_count);
    +
    void reserve(size_type element_count);

    Effects: Reserves memory for element_count elements

    Complexity: Linear.

    Node: Invalidates iterators

  14. -
    value_compare const & value_comp(void) const;
    +
    value_compare const & value_comp(void) const;

    Effect: Returns the value_compare object used by the priority queue

  15. -
    template<typename HeapType> bool operator<(HeapType const & rhs) const;
    +
    template<typename HeapType> bool operator<(HeapType const & rhs) const;

    Returns: Element-wise comparison of heap data structures

    Requirement: the value_compare object of both heaps must match.

  16. -
    template<typename HeapType> bool operator>(HeapType const & rhs) const;
    +
    template<typename HeapType> bool operator>(HeapType const & rhs) const;

    Returns: Element-wise comparison of heap data structures

    Requirement: the value_compare object of both heaps must match.

  17. -
    template<typename HeapType> bool operator>=(HeapType const & rhs) const;
    +
    template<typename HeapType> bool operator>=(HeapType const & rhs) const;

    Returns: Element-wise comparison of heap data structures

    Requirement: the value_compare object of both heaps must match.

  18. -
    template<typename HeapType> bool operator<=(HeapType const & rhs) const;
    +
    template<typename HeapType> bool operator<=(HeapType const & rhs) const;

    Returns: Element-wise comparison of heap data structures

    Requirement: the value_compare object of both heaps must match.

  19. -
    template<typename HeapType> bool operator==(HeapType const & rhs) const;
    Equivalent comparison Returns: True, if both heap data structures are equivalent.

    Requirement: the value_compare object of both heaps must match.

    +
    template<typename HeapType> bool operator==(HeapType const & rhs) const;
    Equivalent comparison Returns: True, if both heap data structures are equivalent.

    Requirement: the value_compare object of both heaps must match.

  20. -
    template<typename HeapType> bool operator!=(HeapType const & rhs) const;
    Equivalent comparison Returns: True, if both heap data structures are not equivalent.

    Requirement: the value_compare object of both heaps must match.

    +
    template<typename HeapType> bool operator!=(HeapType const & rhs) const;
    Equivalent comparison Returns: True, if both heap data structures are not equivalent.

    Requirement: the value_compare object of both heaps must match.

-- cgit v1.2.3