GLib.List – glib-2.0 Reference Manual
Packages
glib-2.0
GLib
List
List
@foreach
append
concat
copy
copy_deep
delete_link
find
find_custom
first
index
insert
insert_before
insert_sorted
insert_sorted_with_data
last
length
nth
nth_data
nth_prev
position
prepend
remove
remove_all
remove_link
reverse
search
sort
sort_with_data
data
next
prev
List
Object Hierarchy:
Description:
[
Compact
]
public
class
List
<
G
>
Namespace:
GLib
Package:
glib-2.0
Content:
Creation methods:
public
List
()
Methods:
public
void
append
(
owned
G
data)
public
void
prepend
(
owned
G
data)
public
void
insert
(
owned
G
data,
int
position)
public
void
insert_before
(
List
<
G
> sibling,
owned
G
data)
public
void
insert_sorted
(
owned
G
data,
CompareFunc
<
G
> compare_func)
public
void
remove
(
G
data)
public
void
remove_link
(
List
<
G
> llink)
public
void
delete_link
(
List
<
G
> link_)
public
void
remove_all
(
G
data)
public
uint
length
()
public
List
<
weak
G
>
copy
()
public
List
<
G
>
copy_deep
(
CopyFunc
<
G
> func)
public
void
reverse
()
public
void
sort
(
CompareFunc
<
G
> compare_func)
public
void
insert_sorted_with_data
(
owned
G
data,
CompareDataFunc
<
G
> compare_func)
public
void
sort_with_data
(
CompareDataFunc
<
G
> compare_func)
public
void
concat
(
owned
List
<
G
> list2)
public
void
@foreach
(
Func
<
G
> func)
public
unowned
List
<
G
>
first
()
public
unowned
List
<
G
>
last
()
public
unowned
List
<
G
>
nth
(
uint
n)
public
weak
G
nth_data
(
uint
n)
public
unowned
List
<
G
>
nth_prev
(
uint
n)
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
int
position
(
List
<
G
> llink)
public
int
index
(
G
data)
Fields:
public
G
data
public
List
<
G
>
next
public
unowned
List
<
G
>
prev