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
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
|
/* -*- Mode: C; tab-width: 8; indent-tabs-mode: t; c-basic-offset: 8 -*- */
/*
* Authors:
* Christopher James Lahey <clahey@umich.edu>
*
* Copyright (C) 2000 Ximian, Inc.
*/
#include <config.h>
#include "e-list.h"
#include "e-list-iterator.h"
static void e_list_init (EList *list);
static void e_list_class_init (EListClass *klass);
static void e_list_dispose (GObject *object);
G_DEFINE_TYPE (EList, e_list, G_TYPE_OBJECT);
static void
e_list_class_init (EListClass *klass)
{
GObjectClass *object_class;
object_class = G_OBJECT_CLASS(klass);
object_class->dispose = e_list_dispose;
}
/**
* e_list_init:
*/
static void
e_list_init (EList *list)
{
list->list = NULL;
list->iterators = NULL;
}
EList *
e_list_new (EListCopyFunc copy, EListFreeFunc free, void *closure)
{
EList *list = g_object_new (E_TYPE_LIST, NULL);
e_list_construct (list, copy, free, closure);
return list;
}
void
e_list_construct (EList *list, EListCopyFunc copy, EListFreeFunc free, void *closure)
{
list->copy = copy;
list->free = free;
list->closure = closure;
}
EList *
e_list_duplicate (EList *old)
{
EList *list = g_object_new (E_TYPE_LIST, NULL);
list->copy = old->copy;
list->free = old->free;
list->closure = old->closure;
list->list = g_list_copy(old->list);
if (list->copy) {
GList *listlist;
for (listlist = list->list; listlist; listlist = listlist->next) {
listlist->data = list->copy (listlist->data, list->closure);
}
}
return list;
}
EIterator *
e_list_get_iterator (EList *list)
{
EIterator *iterator = NULL;
g_return_val_if_fail (list != NULL, NULL);
iterator = e_list_iterator_new(list);
if (iterator)
list->iterators = g_list_append(list->iterators, iterator);
return iterator;
}
int
e_list_length (EList *list)
{
return g_list_length(list->list);
}
void
e_list_append (EList *list, const void *data)
{
e_list_invalidate_iterators(list, NULL);
if (list->copy)
list->list = g_list_append(list->list, list->copy(data, list->closure));
else
list->list = g_list_append(list->list, (void *) data);
}
void
e_list_remove (EList *list, const void *data)
{
GList *link;
link = g_list_find (list->list, data);
if (link)
e_list_remove_link(list, link);
}
void
e_list_invalidate_iterators (EList *list, EIterator *skip)
{
GList *iterators = list->iterators;
for (; iterators; iterators = iterators->next) {
if (iterators->data != skip) {
e_iterator_invalidate(E_ITERATOR(iterators->data));
}
}
}
/* FIXME: This doesn't work properly if the iterator is the first
iterator in the list. Well, the iterator doesn't continue on after
the next time next is called, at least. */
void
e_list_remove_link (EList *list, GList *link)
{
GList *iterators = list->iterators;
for (; iterators; iterators = iterators->next) {
if (((EListIterator *)iterators->data)->iterator == link) {
e_iterator_prev(iterators->data);
}
}
if (list->free)
list->free(link->data, list->closure);
list->list = g_list_remove_link(list->list, link);
g_list_free_1(link);
}
void
e_list_remove_iterator (EList *list, EIterator *iterator)
{
list->iterators = g_list_remove(list->iterators, iterator);
}
/*
* Virtual functions
*/
static void
e_list_dispose (GObject *object)
{
EList *list = E_LIST(object);
if (list->free)
g_list_foreach(list->list, (GFunc) list->free, list->closure);
g_list_free(list->list);
(* G_OBJECT_CLASS (e_list_parent_class)->dispose) (object);
}
|
