GLib.Queue – glib-2.0 Reference Manual
Packages
glib-2.0
GLib
Queue
Queue
clear
copy
delete_link
find
find_custom
get_length
index
insert_after
insert_before
insert_sorted
is_empty
peek_head
peek_nth
peek_tail
pop_head
pop_nth
pop_tail
push_head
push_nth
push_tail
remove
remove_all
reverse
search
sort
unlink
head
length
tail
Queue
Object Hierarchy:
Description:
[
Compact
]
public
class
Queue
<
G
>
Namespace:
GLib
Package:
glib-2.0
Content:
Creation methods:
public
Queue
()
Methods:
public
void
clear
()
public
bool
is_empty
()
public
uint
get_length
()
public
void
reverse
()
public
Queue
copy
()
public
unowned
List
<
G
>
find
(
G
data)
public
unowned
List
<
G
>
find_custom
(
G
data,
CompareFunc
<
G
> func)
public
unowned
List
<
G
>
search
<
T
> (
T
data,
SearchFunc
<
G
,
T
> func)
public
void
sort
(
CompareDataFunc
<
G
> compare_func)
public
void
push_head
(
owned
G
data)
public
void
push_tail
(
owned
G
data)
public
void
push_nth
(
owned
G
data,
int
n)
public
G
pop_head
()
public
G
pop_tail
()
public
G
pop_nth
(
uint
n)
public
weak
G
peek_head
()
public
weak
G
peek_tail
()
public
weak
G
peek_nth
(
uint
n)
public
int
index
(
G
data)
public
void
remove
(
G
data)
public
void
remove_all
(
G
data)
public
void
delete_link
(
List
<
G
> link)
public
void
unlink
(
List
<
G
> link)
public
void
insert_before
(
List
<
G
> sibling,
owned
G
data)
public
void
insert_after
(
List
<
G
> sibling,
owned
G
data)
public
void
insert_sorted
(
owned
G
data,
CompareDataFunc
<
G
> func)
Fields:
public
unowned
List
<
G
>
head
public
unowned
List
<
G
>
tail
public
uint
length