This file is indexed.

/usr/include/ladr/glist.h is in libladr-dev 0.0.200911a-2.1.

This file is owned by root:root, with mode 0o644.

The actual contents of the file can be viewed below.

  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
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
/*  Copyright (C) 2006, 2007 William McCune

    This file is part of the LADR Deduction Library.

    The LADR Deduction Library is free software; you can redistribute it
    and/or modify it under the terms of the GNU General Public License,
    version 2.

    The LADR Deduction Library is distributed in the hope that it will be
    useful, but WITHOUT ANY WARRANTY; without even the implied warranty of
    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
    GNU General Public License for more details.

    You should have received a copy of the GNU General Public License
    along with the LADR Deduction Library; if not, write to the Free Software
    Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
*/

#ifndef TP_GLIST_H
#define TP_GLIST_H

#include "order.h"
#include "string.h"

/* INTRODUCTION
This package handles
Plist (singly-linked list of void pointers),
Ilist (singly-linked list of integers),
I2list (singly-linked list of <integer,integer> pairs),
I3list (singly-linked list of <integer,integer,integer> triples).
*/

/* Public definitions */

typedef struct plist * Plist;

struct plist {
  void *v;
  Plist next;
};

typedef struct ilist * Ilist;

struct ilist {
  int i;
  Ilist next;
};

typedef struct i2list * I2list;

struct i2list {
  int i;
  int j;
  I2list next;
};

typedef struct i3list * I3list;

struct i3list {
  int i;
  int j;
  int k;
  I3list next;
};

/* End of public definitions */

/* Public function prototypes from glist.c */

Ilist get_ilist(void);

void free_ilist(Ilist p);

Plist get_plist(void);

void free_plist(Plist p);

I2list get_i2list(void);

void free_i2list(I2list p);

I3list get_i3list(void);

void free_i3list(I3list p);

void fprint_glist_mem(FILE *fp, BOOL heading);

void p_glist_mem();

Plist plist_cat(Plist p1, Plist p2);

Plist plist_cat2(Plist p1, Plist p2);

Plist plist_pop(Plist p);

int plist_count(Plist p);

Plist reverse_plist(Plist p);

Plist copy_plist(Plist p);

void zap_plist(Plist p);

Plist plist_append(Plist lst, void *v);

Plist plist_prepend(Plist lst, void *v);

BOOL plist_member(Plist lst, void *v);

Plist plist_subtract(Plist p1, Plist p2);

BOOL plist_subset(Plist a, Plist b);

Plist plist_remove(Plist p, void *v);

Plist plist_remove_string(Plist p, char *s);

Plist sort_plist(Plist objects,	Ordertype (*comp_proc) (void *, void *));

Plist plist_remove_last(Plist p);

int position_of_string_in_plist(char *s, Plist p);

BOOL string_member_plist(char *s, Plist p);

int longest_string_in_plist(Plist p);

void *ith_in_plist(Plist p, int i);

void *plist_last(Plist p);

Ilist ilist_cat(Ilist p1, Ilist p2);

Ilist ilist_cat2(Ilist p1, Ilist p2);

Ilist ilist_pop(Ilist p);

int ilist_count(Ilist p);

Ilist reverse_ilist(Ilist p);

Ilist copy_ilist(Ilist p);

void zap_ilist(Ilist p);

Ilist ilist_append(Ilist lst, int i);

Ilist ilist_prepend(Ilist lst, int i);

Ilist ilist_last(Ilist lst);

BOOL ilist_member(Ilist lst, int i);

Ilist ilist_subtract(Ilist p1, Ilist p2);

Ilist ilist_removeall(Ilist p, int i);

Ilist ilist_intersect(Ilist a, Ilist b);

Ilist ilist_union(Ilist a, Ilist b);

Ilist ilist_set(Ilist m);

Ilist ilist_rem_dups(Ilist m);

BOOL ilist_is_set(Ilist a);

BOOL ilist_subset(Ilist a, Ilist b);

void fprint_ilist(FILE *fp, Ilist p);

void p_ilist(Ilist p);

Ilist ilist_copy(Ilist p);

Ilist ilist_remove_last(Ilist p);

int ilist_occurrences(Ilist p, int i);

Ilist ilist_insert_up(Ilist p, int i);

int position_in_ilist(int i, Ilist p);

void zap_i2list(I2list p);

I2list i2list_append(I2list lst, int i, int j);

I2list i2list_prepend(I2list lst, int i, int j);

I2list i2list_removeall(I2list p, int i);

I2list i2list_member(I2list lst, int i);

void p_i2list(I2list p);

int i2list_count(I2list p);

BOOL i3list_member(I3list lst, int i, int j, int k);

I3list i3list_append(I3list lst, int i, int j, int k);

I3list i3list_prepend(I3list lst, int i, int j, int k);

void zap_i3list(I3list p);

I3list reverse_i3list(I3list p);

I3list copy_i3list(I3list p);

int i3list_count(I3list p);

I2list alist_insert(I2list p, int key, int val);

int assoc(I2list p, int key);

I3list alist2_insert(I3list p, int key, int a, int b);

int assoc2a(I3list p, int key);

int assoc2b(I3list p, int key);

I3list alist2_remove(I3list p, int key);

BOOL i2list_multimember(I2list b, int i, int n);

BOOL i2list_multisubset(I2list a, I2list b);

I2list multiset_add_n(I2list a, int i, int n);

I2list multiset_add(I2list a, int i);

I2list multiset_union(I2list a, I2list b);

Ilist multiset_to_set(I2list m);

int multiset_occurrences(I2list m, int i);

#endif  /* conditional compilation of whole file */