priority_queue::size
The document is archived and information here might be outdated

priority_queue::size (STL/CLR)

Counts the number of elements.

    size_type size();

The member function returns the length of the controlled sequence. You use it to determine the number of elements currently in the controlled sequence. If all you care about is whether the sequence has nonzero size, see priority_queue::empty (STL/CLR)().

// cliext_priority_queue_size.cpp 
// compile with: /clr 
#include <cliext/queue> 
 
typedef cliext::priority_queue<wchar_t> Mypriority_queue; 
int main() 
    { 
    Mypriority_queue c1; 
    c1.push(L'a'); 
    c1.push(L'b'); 
    c1.push(L'c'); 
 
// display initial contents " a b c" 
    for each (wchar_t elem in c1.get_container()) 
        System::Console::Write(" {0}", elem); 
    System::Console::WriteLine(); 
    System::Console::WriteLine("size() = {0} starting with 3", c1.size()); 
 
// pop an item and reinspect 
    c1.pop(); 
    System::Console::WriteLine("size() = {0} after popping", c1.size()); 
 
// add two elements and reinspect 
    c1.push(L'a'); 
    c1.push(L'b'); 
    System::Console::WriteLine("size() = {0} after adding 2", c1.size()); 
    return (0); 
    } 
 
c a b size() = 3 starting with 3 size() = 2 after popping size() = 4 after adding 2

Header: <cliext/queue>

Namespace: cliext

Show:
© 2016 Microsoft