A RetroSearch Logo

Home - News ( United States | United Kingdom | Italy | Germany ) - Football scores

Search Query:

Showing content from https://TheAlgorithms.github.io/C-Plus-Plus/df/dd0/queue__using__two__stacks_8cpp_source.html below:

TheAlgorithms/C++: data_structures/queue_using_two_stacks.cpp Source File

Go to the documentation of this file. 42 const

T& peek()

const

;

54void

MyQueue<T>::push(T x) {

70const

T& MyQueue<T>::pop() {

71 const

T& temp = MyQueue::peek();

81const

T& MyQueue<T>::peek()

const

{

85

std::cerr <<

"Queue is empty"

<< std::endl;

93bool

MyQueue<T>::empty()

const

{

94 return

s2.empty() && s1.empty();

103

std::cout <<

"Test #1\n"

;

107

assert(que.peek() == 2);

108

assert(que.pop() == 2);

109

assert(que.peek() == 5);

110

assert(que.pop() == 5);

111

assert(que.peek() == 0);

112

assert(que.pop() == 0);

113

assert(que.empty() ==

true

);

114

std::cout <<

"PASSED\n"

;

116

std::cout <<

"Test #2\n"

;

118

assert(que.empty() ==

false

);

119

assert(que.peek() == -1);

120

assert(que.pop() == -1);

121

std::cout <<

"PASSED\n"

;

123

MyQueue<double> que2;

124

std::cout <<

"Test #3\n"

;

126

que2.push(3.1415926);

129

assert(que2.peek() == 2.31223);

130

assert(que2.pop() == 2.31223);

131

assert(que2.peek() == 3.1415926);

132

assert(que2.pop() == 3.1415926);

133

assert(que2.peek() == 2.92);

134

assert(que2.pop() == 2.92);

135

std::cout <<

"PASSED\n"

;

char pop()

pop a byte out of stack variable

RetroSearch is an open source project built by @garambo | Open a GitHub Issue

Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo

HTML: 3.2 | Encoding: UTF-8 | Version: 0.7.4