Skip to content

Fix C++ deque demo and Deque/Dequeue title #1160

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
pearcej merged 2 commits into from
Oct 12, 2026
Merged

Fix C++ deque demo and Deque/Dequeue title #1160

Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
f454a10
Fix early return in C++ deque demo
wrigjl Oct 12, 2026
fee67c4
Use "Deque" rather than "Dequeue" in exploration title
wrigjl Oct 12, 2026
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
8 changes: 5 additions & 3 deletions pretext/LinearBasic/ImplementingaDequeCpp.ptx
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -7,7 +7,7 @@
the front of the deque is at position 0 in the array.</p>

<exploration xml:id="expl-lst-dequecode-cpp">
<title>Dequeue Implementation</title>
<title>Deque Implementation</title>
<task xml:id="lst-dequecode-cpp" label="lst-dequecode-cpp">
<title>C++ Implementation</title>
<statement><program xml:id="dequecode_cpp" interactive="activecode" language="cpp" label="dequecode_cpp-prog"><code>
Expand Down Expand Up @@ -47,17 +47,19 @@ int main() {
d.pop_front();

cout &lt;&lt; endl &lt;&lt; &quot;Item at the front: &quot; &lt;&lt; d.front() &lt;&lt; endl;
cout &lt;&lt; &quot;Itm at the back: &quot; &lt;&lt; d.back() &lt;&lt; endl;
cout &lt;&lt; &quot;Item at the back: &quot; &lt;&lt; d.back() &lt;&lt; endl;
cout &lt;&lt; &quot;Deque Size: &quot; &lt;&lt; d.size() &lt;&lt; endl;

cout &lt;&lt; endl &lt;&lt; &quot;Items in the Deque: &quot; &lt;&lt; endl;
int dsize2 = d.size();
for(int i = 0; i &lt; dsize2; i++){
//prints each item in the deque.
cout &lt;&lt; d.at(i) &lt;&lt; &quot; &quot;;
}

cout &lt;&lt; endl;

return 0;
}
}
</code></program></statement>
</task>
Expand Down
Loading