FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
OnJava8-Examples/collections/QueueDemo.java at master · CSapprenticeWT/OnJava8-Examples · GitHub
CSapprenticeWT
OnJava8-Examples
Repository navigation
Code
Pull requests
Actions
Projects
Security and quality
Insights
Expand file tree
Breadcrumbs
OnJava8-Examples
/
collections
/
QueueDemo.java
Copy path
More file actions
More file actions
Latest commit
History
History
History
29 lines (28 loc) · 840 Bytes
Breadcrumbs
OnJava8-Examples
/
collections
/
QueueDemo.java
Copy path
File metadata and controls
29 lines (28 loc) · 840 Bytes
Raw
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
// collections/QueueDemo.java
// (c)2021 MindView LLC: see Copyright.txt
// We make no guarantees that this code is fit for any purpose.
// Visit http://OnJava8.com for more book information.
// Upcasting to a Queue from a LinkedList
import
java
.
util
.*;
public
class
QueueDemo
{
public
static
void
printQ
(
Queue
queue
) {
while
(
queue
.
peek
() !=
null
)
System
.
out
.
print
(
queue
.
remove
() +
" "
);
System
.
out
.
println
();
}
public
static
void
main
(
String
[]
args
) {
Queue
<
Integer
>
queue
=
new
LinkedList
<>();
Random
rand
=
new
Random
(
47
);
for
(
int
i
=
0
;
i
<
10
;
i
++)
queue
.
offer
(
rand
.
nextInt
(
i
+
10
));
printQ
(
queue
);
Queue
<
Character
>
qc
=
new
LinkedList
<>();
for
(
char
c
:
"Brontosaurus"
.
toCharArray
())
qc
.
offer
(
c
);
printQ
(
qc
);
}
}
/* Output:
8 1 1 1 5 14 3 1 0 1
B r o n t o s a u r u s
*/
Back
|
FazBrowse Home
|
New Git URL