aboutsummaryrefslogtreecommitdiff
path: root/man/dbfp_query_location.3
blob: b620283c900cd258457e500b429766edf5caabc8 (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
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
239
240
241
242
.\" Automatically generated by Pod::Man 4.07 (Pod::Simple 3.32)
.\"
.\" Standard preamble:
.\" ========================================================================
.de Sp \" Vertical space (when we can't use .PP)
.if t .sp .5v
.if n .sp
..
.de Vb \" Begin verbatim text
.ft CW
.nf
.ne \\$1
..
.de Ve \" End verbatim text
.ft R
.fi
..
.\" Set up some character translations and predefined strings.  \*(-- will
.\" give an unbreakable dash, \*(PI will give pi, \*(L" will give a left
.\" double quote, and \*(R" will give a right double quote.  \*(C+ will
.\" give a nicer C++.  Capital omega is used to do unbreakable dashes and
.\" therefore won't be available.  \*(C` and \*(C' expand to `' in nroff,
.\" nothing in troff, for use with C<>.
.tr \(*W-
.ds C+ C\v'-.1v'\h'-1p'\s-2+\h'-1p'+\s0\v'.1v'\h'-1p'
.ie n \{\
.    ds -- \(*W-
.    ds PI pi
.    if (\n(.H=4u)&(1m=24u) .ds -- \(*W\h'-12u'\(*W\h'-12u'-\" diablo 10 pitch
.    if (\n(.H=4u)&(1m=20u) .ds -- \(*W\h'-12u'\(*W\h'-8u'-\"  diablo 12 pitch
.    ds L" ""
.    ds R" ""
.    ds C` ""
.    ds C' ""
'br\}
.el\{\
.    ds -- \|\(em\|
.    ds PI \(*p
.    ds L" ``
.    ds R" ''
.    ds C`
.    ds C'
'br\}
.\"
.\" Escape single quotes in literal strings from groff's Unicode transform.
.ie \n(.g .ds Aq \(aq
.el       .ds Aq '
.\"
.\" If the F register is >0, we'll generate index entries on stderr for
.\" titles (.TH), headers (.SH), subsections (.SS), items (.Ip), and index
.\" entries marked with X<> in POD.  Of course, you'll have to process the
.\" output yourself in some meaningful fashion.
.\"
.\" Avoid warning from groff about undefined register 'F'.
.de IX
..
.if !\nF .nr F 0
.if \nF>0 \{\
.    de IX
.    tm Index:\\$1\t\\n%\t"\\$2"
..
.    if !\nF==2 \{\
.        nr % 0
.        nr F 2
.    \}
.\}
.\"
.\" Accent mark definitions (@(#)ms.acc 1.5 88/02/08 SMI; from UCB 4.2).
.\" Fear.  Run.  Save yourself.  No user-serviceable parts.
.    \" fudge factors for nroff and troff
.if n \{\
.    ds #H 0
.    ds #V .8m
.    ds #F .3m
.    ds #[ \f1
.    ds #] \fP
.\}
.if t \{\
.    ds #H ((1u-(\\\\n(.fu%2u))*.13m)
.    ds #V .6m
.    ds #F 0
.    ds #[ \&
.    ds #] \&
.\}
.    \" simple accents for nroff and troff
.if n \{\
.    ds ' \&
.    ds ` \&
.    ds ^ \&
.    ds , \&
.    ds ~ ~
.    ds /
.\}
.if t \{\
.    ds ' \\k:\h'-(\\n(.wu*8/10-\*(#H)'\'\h"|\\n:u"
.    ds ` \\k:\h'-(\\n(.wu*8/10-\*(#H)'\`\h'|\\n:u'
.    ds ^ \\k:\h'-(\\n(.wu*10/11-\*(#H)'^\h'|\\n:u'
.    ds , \\k:\h'-(\\n(.wu*8/10)',\h'|\\n:u'
.    ds ~ \\k:\h'-(\\n(.wu-\*(#H-.1m)'~\h'|\\n:u'
.    ds / \\k:\h'-(\\n(.wu*8/10-\*(#H)'\z\(sl\h'|\\n:u'
.\}
.    \" troff and (daisy-wheel) nroff accents
.ds : \\k:\h'-(\\n(.wu*8/10-\*(#H+.1m+\*(#F)'\v'-\*(#V'\z.\h'.2m+\*(#F'.\h'|\\n:u'\v'\*(#V'
.ds 8 \h'\*(#H'\(*b\h'-\*(#H'
.ds o \\k:\h'-(\\n(.wu+\w'\(de'u-\*(#H)/2u'\v'-.3n'\*(#[\z\(de\v'.3n'\h'|\\n:u'\*(#]
.ds d- \h'\*(#H'\(pd\h'-\w'~'u'\v'-.25m'\f2\(hy\fP\v'.25m'\h'-\*(#H'
.ds D- D\\k:\h'-\w'D'u'\v'-.11m'\z\(hy\v'.11m'\h'|\\n:u'
.ds th \*(#[\v'.3m'\s+1I\s-1\v'-.3m'\h'-(\w'I'u*2/3)'\s-1o\s+1\*(#]
.ds Th \*(#[\s+2I\s-2\h'-\w'I'u*3/5'\v'-.3m'o\v'.3m'\*(#]
.ds ae a\h'-(\w'a'u*4/10)'e
.ds Ae A\h'-(\w'A'u*4/10)'E
.    \" corrections for vroff
.if v .ds ~ \\k:\h'-(\\n(.wu*9/10-\*(#H)'\s-2\u~\d\s+2\h'|\\n:u'
.if v .ds ^ \\k:\h'-(\\n(.wu*10/11-\*(#H)'\v'-.4m'^\v'.4m'\h'|\\n:u'
.    \" for low resolution devices (crt and lpr)
.if \n(.H>23 .if \n(.V>19 \
\{\
.    ds : e
.    ds 8 ss
.    ds o a
.    ds d- d\h'-1'\(ga
.    ds D- D\h'-1'\(hy
.    ds th \o'bp'
.    ds Th \o'LP'
.    ds ae ae
.    ds Ae AE
.\}
.rm #[ #] #H #V #F C
.\" ========================================================================
.\"
.IX Title "DBFP_QUERY_LOCATION 3"
.TH DBFP_QUERY_LOCATION 3 "2016-06-08" "0.1.0" "DB timetable API"
.\" For nroff, turn off justification.  Always turn off hyphenation; it makes
.\" way too many mistakes in technical documents.
.if n .ad l
.nh
.SH "NAME"
dbfp_query_loation \- get a list of stations matching a string from the DB
timetable API
.SH "SYNOPSIS"
.IX Header "SYNOPSIS"
.Vb 1
\&    #include <dbfp.h>
\&
\&    int dbfp_query_location(struct dbfp *dbfp, char *input, size_t *n,
\&                    struct dbfp_location **locations);
.Ve
.SH "DESCRIPTION"
.IX Header "DESCRIPTION"
\&\fBdbfp_query_location\fR queries a list of locations matching the query string
\&\fIinput\fR from the \s-1DB\s0 timetable \s-1API\s0 using the connection metadata stored in
\&\fIdbfp\fR.  The number of results is stored in \fIn\fR.  The results are stored in
\&\fIlocations\fR.  The memory for the \fIlocations\fR is allocated by the function.
The stored array contains exactly \fIn\fR elements, and is not \s-1NULL\s0 terminated.
.PP
\&\fIdbfp\fR, \fIinput\fR, \fIn\fR and \fIlocations\fR must not be \s-1NULL.  \s0\fIdbfp\fR must have
been initialized with \fIdbfp_init\fR.  The elements in \fIlocations\fR should be
closed with \fIdbfp_location_close\fR.  \fIlocations\fR should be freed by the
caller.
.PP
If the query fails, the values of \fIn\fR and \fIlocations\fR are set to 0 and \s-1NULL\s0
respectively.
.PP
The \fBdbfp_location\fR structure is defined as:
.PP
.Vb 6
\&    struct dbfp_location {
\&            char *name;
\&            char *id;
\&            float lon;
\&            float lat;
\&    };
.Ve
.PP
\&\fIname\fR is the name of the station.  \fIid\fR is the \s-1DB\s0 id of the station.  It
seems to be an integer, but this is not guaranteed.  \fIlon\fR and \fIlat\fR are the
coordinates of the station.
.SH "RETURN VALUE"
.IX Header "RETURN VALUE"
\&\fBdbfp_query_location\fR returns zero if successful, or a non-zero error code.
Positive error codes are from \fIerrno.h\fR, negative error codes are specific
to dbfp.
.SH "ERRORS"
.IX Header "ERRORS"
.IP "\s-1EINVAL\s0" 4
.IX Item "EINVAL"
if \fIdbfp\fR, \fIinput\fR, \fIn\fR or \fIlocations\fR is \s-1NULL\s0
.IP "\s-1ENOMEM\s0" 4
.IX Item "ENOMEM"
if there is not enough memory to store the results of the query
.IP "\s-1DBFP_ERROR_CURL\s0" 4
.IX Item "DBFP_ERROR_CURL"
if an error occured during the preparation or execution of the network request
.IP "\s-1DBFP_ERROR_FORMAT\s0" 4
.IX Item "DBFP_ERROR_FORMAT"
if an error occurs during the formatting of the \s-1URL\s0
.IP "\s-1DBFP_ERROR_PARSE\s0" 4
.IX Item "DBFP_ERROR_PARSE"
if an error occurs during the parsing of the \s-1XML\s0 response
.IP "\s-1DBFP_ERROR_STRUCTURE\s0" 4
.IX Item "DBFP_ERROR_STRUCTURE"
if the \s-1API\s0 response has not the expected structure
.SH "EXAMPLE"
.IX Header "EXAMPLE"
.Vb 3
\&    #include <dbfp.h>
\&    #include <stdio.h>
\&    #include <stdlib.h>
\&
\&    int main(int argc, char **argv)
\&    {
\&            int err = 0;
\&            struct dbfp dbfp;
\&            struct dbfp_location *locations = NULL;
\&            size_t n = 0;
\&            size_t i;
\&
\&            err = dbfp_init(&dbfp, "API key");
\&            if (err)
\&                    goto cleanup;
\&            err = dbfp_query_location(&dbfp, "Freibu", &n, &locations);
\&            if (err)
\&                    goto cleanup;
\&
\&            printf("Number of matches: %zu\en", n);
\&            for (i = 0; i < n; i++)
\&                    printf("%s: %s (%.2f, %.2f)", locations[i].id,
\&                                    locations[i].name, locations[i].lon,
\&                                    locations[i].lat);
\&
\&    cleanup:
\&            for (i = 0; i < n; i++)
\&                    dbfp_location_close(&locations[i]);
\&            free(locations);
\&            dbfp_close(&dbfp);
\&
\&            return err ? EXIT_FAILURE : EXIT_SUCCESS;
\&    }
.Ve
.SH "SEE ALSO"
.IX Header "SEE ALSO"
\&\fIdbfp_init\fR\|(3), \fIdbfp_location_close\fR\|(3)