blob: 9e5d2388cb5f5c6fdeb5f97b2a6d570884189487 (
plain)
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
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
|
<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html4/loose.dtd">
<html>
<!-- Copyright (C) 2017-2023 David Thompson dthompson2@worcester.edu
Permission is granted to copy, distribute and/or modify this document
under the terms of the GNU Free Documentation License, Version 1.3
or any later version published by the Free Software Foundation;
with no Invariant Sections, no Front-Cover Texts, and no Back-Cover Texts.
A copy of the license is included in the section entitled "GNU
Free Documentation License".
A copy of the license is also available from the Free Software
Foundation Web site at http://www.gnu.org/licenses/fdl.html.
* Chickadee: (chickadee). Game programming toolkit for Guile.
The document was typeset with
http://www.texinfo.org/ (GNU Texinfo).
-->
<!-- Created by GNU Texinfo 6.7, http://www.gnu.org/software/texinfo/ -->
<head>
<meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
<title>Queues (The Chickadee Game Toolkit)</title>
<meta name="description" content="Queues (The Chickadee Game Toolkit)" />
<meta name="keywords" content="Queues (The Chickadee Game Toolkit)" />
<meta name="resource-type" content="document" />
<meta name="distribution" content="global" />
<meta name="Generator" content="makeinfo" />
<link href="index.html" rel="start" title="Top" />
<link href="Index.html" rel="index" title="Index" />
<link href="index.html#SEC_Contents" rel="contents" title="Table of Contents" />
<link href="Data-Structures.html" rel="up" title="Data Structures" />
<link href="Heaps.html" rel="next" title="Heaps" />
<link href="Array-Lists.html" rel="prev" title="Array Lists" />
<style type="text/css">
<!--
a.summary-letter {text-decoration: none}
blockquote.indentedblock {margin-right: 0em}
div.display {margin-left: 3.2em}
div.example {margin-left: 3.2em}
div.lisp {margin-left: 3.2em}
kbd {font-style: oblique}
pre.display {font-family: inherit}
pre.format {font-family: inherit}
pre.menu-comment {font-family: serif}
pre.menu-preformatted {font-family: serif}
span.nolinebreak {white-space: nowrap}
span.roman {font-family: initial; font-weight: normal}
span.sansserif {font-family: sans-serif; font-weight: normal}
ul.no-bullet {list-style: none}
@media (min-width: 1140px) {
body {
margin-left: 14rem;
margin-right: 4rem;
max-width: 52rem;
}
}
@media (min-width: 800px) and (max-width: 1140px) {
body {
margin-left: 6rem;
margin-right: 4rem;
max-width: 52rem;
}
}
@media (max-width: 800px) {
body {
margin: 1rem;
}
}
-->
</style>
<link rel="stylesheet" type="text/css" href="https://dthompson.us/css/dthompson.css" />
</head>
<body lang="en">
<span id="Queues"></span><div class="header">
<p>
Next: <a href="Heaps.html" accesskey="n" rel="next">Heaps</a>, Previous: <a href="Array-Lists.html" accesskey="p" rel="prev">Array Lists</a>, Up: <a href="Data-Structures.html" accesskey="u" rel="up">Data Structures</a> [<a href="index.html#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="Index.html" title="Index" rel="index">Index</a>]</p>
</div>
<hr />
<span id="Queues-1"></span><h4 class="subsection">5.6.2 Queues</h4>
<p>The <code>(chickadee data queue)</code> module provides a mutable queue that
is more memory efficient than Guile’s built-in <code>(ice-9 q)</code>
module.
</p>
<dl>
<dt id="index-make_002dqueue">Procedure: <strong>make-queue</strong></dt>
<dd><p>Return a new, empty queue.
</p></dd></dl>
<dl>
<dt id="index-queue_003f">Procedure: <strong>queue?</strong> <em>obj</em></dt>
<dd><p>Return <code>#t</code> if <var>obj</var> is a queue.
</p></dd></dl>
<dl>
<dt id="index-queue_002dempty_003f">Procedure: <strong>queue-empty?</strong> <em>queue</em></dt>
<dd><p>Return <code>#t</code> if <var>queue</var> is empty.
</p></dd></dl>
<dl>
<dt id="index-queue_002dlength">Procedure: <strong>queue-length</strong> <em>queue</em></dt>
<dd><p>Return the current length of <var>queue</var>.
</p></dd></dl>
<dl>
<dt id="index-enqueue_0021">Procedure: <strong>enqueue!</strong> <em>queue item</em></dt>
<dd><p>Add <var>item</var> to <var>queue</var>.
</p></dd></dl>
<dl>
<dt id="index-dequeue_0021">Procedure: <strong>dequeue!</strong> <em>queue</em></dt>
<dd><p>Remove and return the first item in <var>queue</var>.
</p></dd></dl>
<dl>
<dt id="index-queue_002dclear_0021">Procedure: <strong>queue-clear!</strong> <em>queue</em></dt>
<dd><p>Remove all items from <var>queue</var>.
</p></dd></dl>
</body>
</html>
|
