priority_queue::priority_queue (STL/CLR)

项目
02/21/2013

构造容器适配器对象。

    priority_queue();
    priority_queue(priority_queue<Value, Container> right);
    priority_queue(priority_queue<Value, Container> right);
    explicit priority_queue(value_compare^ pred);
    priority_queue(value_compare^ pred, container_type% cont);
    template<typename InIt>
        priority_queue(InIt first, InIt last);
    template<typename InIt>
        priority_queue(InIt first, InIt last,
            value_compare^ pred);
    template<typename InIt>
        priority_queue(InIt first, InIt last,
            value_compare^ pred, container_type% cont);

参数

继续
复制的容器。
首先
范围开头插入的。
last
范围的末尾插入的。
pred
控件序列的排序的性质。
right
对象或范围插入。

备注

构造函数:

priority_queue();

使用默认排序的谓词创建一个空的包装，容器。使用它指定空的初始控件序列，其默认值为排序的性质。

构造函数:

priority_queue(priority_queue<Value, Container>% right);

使用排序的谓词 right.value_comp()创建一 right.get_container()副本的一个包装，容器。将它指定为的复制序列控件由队列对象 right的初始控件序列，与同一排序的性质。

构造函数:

priority_queue(priority_queue<Value, Container>^ right);

使用排序的谓词 right->value_comp()创建一 right->get_container()副本的一个包装，容器。将它指定为的复制序列控件由队列对象 *right的初始控件序列，与同一排序的性质。

构造函数:

explicit priority_queue(value_compare^ pred);

使用排序的谓词 pred创建一个空的包装，容器。使用它指定空的初始控件序列，与指定的排序的性质。

构造函数:

priority_queue(value_compare^ pred, container_type cont);

使用排序的谓词 pred创建一个空的包装容器，驱动器，然后将它指定从现有的容器的初始控件 cont 序列的所有元素，与指定的排序的性质。

构造函数:

template<typename InIt>

priority_queue(InIt first, InIt last);

使用默认排序的谓词创建一个空的包装，容器，然后按顺序 [first,last)。您使用它来指定从指定的 eqeuence 的初始控件序列，与指定的排序的性质。

构造函数:

template<typename InIt>

priority_queue(InIt first, InIt last,

value_compare^ pred);

使用排序的谓词 pred创建一个空的包装，容器，然后按顺序 [first,last)。您使用它来指定从指定的 seqeuence 的初始控件序列，与指定的排序的性质。

构造函数:

template<typename InIt>

priority_queue(InIt first, InIt last,

value_compare^ pred, container_type% cont);

使用排序的谓词 pred创建一个空的包装，容器，然后驱动器 cont 的所有元素以及顺序 [first,last)。您使用它来指定从现有的容器和指定的 seqeuence 的初始控件序列，与指定的排序的性质。

示例

// cliext_priority_queue_construct.cpp 
// compile with: /clr 
#include <cliext/queue> 
#include <cliext/deque> 
 
typedef cliext::priority_queue<wchar_t> Mypriority_queue; 
typedef cliext::deque<wchar_t> Mydeque; 
int main() 
    { 
// construct an empty container 
    Mypriority_queue c1; 
    Mypriority_queue::container_type^ wc1 = c1.get_container(); 
    System::Console::WriteLine("size() = {0}", c1.size()); 
 
    c1.push(L'a'); 
    c1.push(L'b'); 
    c1.push(L'c'); 
    for each (wchar_t elem in wc1) 
        System::Console::Write(" {0}", elem); 
    System::Console::WriteLine(); 
 
// construct with an ordering rule 
    Mypriority_queue c2 = cliext::greater<wchar_t>(); 
    System::Console::WriteLine("size() = {0}", c2.size()); 
 
    for each (wchar_t elem in wc1) 
        c2.push(elem); 
    for each (wchar_t elem in c2.get_container()) 
        System::Console::Write(" {0}", elem); 
    System::Console::WriteLine(); 
 
// construct with an ordering rule by copying an underlying container 
    Mypriority_queue c2x = 
        gcnew Mypriority_queue(cliext::greater<wchar_t>(), *wc1); 
   for each (wchar_t elem in c2x.get_container()) 
        System::Console::Write(" {0}", elem); 
    System::Console::WriteLine(); 
 
// construct with an iterator range 
    Mypriority_queue c3(wc1->begin(), wc1->end()); 
    for each (wchar_t elem in c3.get_container()) 
        System::Console::Write(" {0}", elem); 
    System::Console::WriteLine(); 
 
// construct with an iterator range and an ordering rule 
    Mypriority_queue c4(wc1->begin(), wc1->end(), 
        cliext::greater<wchar_t>()); 
    for each (wchar_t elem in c4.get_container()) 
        System::Console::Write(" {0}", elem); 
    System::Console::WriteLine(); 
 
// construct with an iterator range, another container, and an ordering rule 
    Mypriority_queue c5(wc1->begin(), wc1->end(), 
        cliext::greater<wchar_t>(), *wc1); 
    for each (wchar_t elem in c5.get_container()) 
        System::Console::Write(" {0}", elem); 
    System::Console::WriteLine(); 
 
// construct from a generic container 
    Mypriority_queue c6(c3); 
    for each (wchar_t elem in c6.get_container()) 
        System::Console::Write(" {0}", elem); 
    System::Console::WriteLine(); 
 
// construct by copying another container 
    Mypriority_queue c7(%c3); 
    for each (wchar_t elem in c7.get_container()) 
        System::Console::Write(" {0}", elem); 
    System::Console::WriteLine(); 
 
// construct with an ordering rule, by copying an underlying container 
    Mypriority_queue c8 = 
        gcnew Mypriority_queue(cliext::greater<wchar_t>(), *wc1); 
    for each (wchar_t elem in c8.get_container()) 
        System::Console::Write(" {0}", elem); 
    System::Console::WriteLine(); 
 
    return (0); 
    }