summaryrefslogtreecommitdiff
path: root/support/texlab/crates/bibutils_sys/src/slist.h
blob: e63f7e404ae1b21c3d374b945ba229f0b86391f3 (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
/*
 * slist.h
 *
 * version: 2019-01-14
 *
 * Copyright (c) Chris Putnam 2004-2019
 *
 * Source code released under the GPL version 2
 *
 */

#ifndef SLIST_H
#define SLIST_H

#include <stdio.h>
#include <stdlib.h>
#include <stdarg.h>
#include <string.h>
#include "str.h"

#define SLIST_OK            (0)
#define SLIST_ERR_MEMERR   (-1)
#define SLIST_ERR_CANTOPEN (-2)
#define SLIST_ERR_BADPARAM (-3)

#define SLIST_CHR (0)
#define SLIST_STR (1)

typedef int slist_index;

typedef struct slist {
	slist_index n, max;
	int sorted;
	str *strs;
} slist;


void    slists_init( slist *a, ... );
void    slists_free( slist *a, ... );
void    slists_empty( slist *a, ... );


void    slist_init( slist *a );
int     slist_init_values ( slist *a, ... );
int     slist_init_valuesc( slist *a, ... );
void    slist_free( slist *a );
void    slist_empty( slist *a );

slist * slist_new( void );
void    slist_delete( slist * );
void    slist_deletev( void *v );

slist * slist_dup( slist *a );
int     slist_copy( slist *to, slist *from );
int     slist_copy_ret( slist *to, slist *from, int retok, int reterr );
void    slist_swap( slist *a, slist_index n1, slist_index n2 );

int     slist_addvp( slist *a, int mode, void *vp );
int     slist_addc( slist *a, const char *value );
int     slist_add( slist *a, str *value );

int     slist_addvp_ret( slist *a, int mode, void *vp, int retok, int reterr );
int     slist_addc_ret( slist *a, const char *value, int retok, int reterr );
int     slist_add_ret( slist *a, str *value, int retok, int reterr );

int     slist_addvp_all( slist *a, int mode, ... );
int     slist_addc_all( slist *a, ... );
int     slist_add_all( slist *a, ... );

int     slist_addvp_unique( slist *a, int mode, void *vp );
int     slist_addc_unique( slist *a, const char *value );
int     slist_add_unique( slist *a, str *value );

int     slist_addvp_unique_ret( slist *a, int mode, void *vp, int retok, int reterr );
int     slist_addc_unique_ret( slist *a, const char *value, int retok, int reterr );
int     slist_add_unique_ret( slist *a, str *value, int retok, int reterr );

int     slist_append( slist *a, slist *toadd );
int     slist_append_ret( slist *a, slist *toadd, int retok, int reterr );
int     slist_append_unique( slist *a, slist *toadd );
int     slist_append_unique_ret( slist *a, slist *toadd, int retok, int reterr );

int     slist_remove( slist *a, slist_index n );

str *   slist_str( slist *a, slist_index n );
char *  slist_cstr( slist *a, slist_index n );

str *   slist_set( slist *a, slist_index n, str *s );
str *   slist_setc( slist *a, slist_index n, const char *s );

void    slist_sort( slist *a );
void    slist_revsort( slist *a );

int     slist_find( slist *a, str *searchstr );
int     slist_findc( slist *a, const char *searchstr );
int     slist_findnocase( slist *a, str *searchstr );
int     slist_findnocasec( slist *a, const char *searchstr );
int     slist_wasfound( slist *a, slist_index n );
int     slist_wasnotfound( slist *a, slist_index n );

int     slist_match_entry( slist *a, slist_index n, const char *s );
void    slist_trimend( slist *a, slist_index n );

unsigned long slist_get_maxlen( slist *a );
void    slist_dump( slist *a, FILE *fp, int newline );

int     slist_fill( slist *a, const char *filename, unsigned char skip_blank_lines );
int     slist_fillfp( slist *a, FILE *fp, unsigned char skip_blank_lines );
int     slist_tokenize( slist *tokens, str *in, const char *delim, int merge_delim );
int     slist_tokenizec( slist *tokens, char *p, const char *delim, int merge_delim );

#endif