Files
Compsys-2021-Assignments/A1/id_query_indexed.c
Nikolaj 3f3346d22c 🐛
2021-10-04 15:13:57 +02:00

56 lines
1.3 KiB
C

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <sys/time.h>
#include <stdint.h>
#include <errno.h>
#include <assert.h>
#include "record.h"
#include "id_query.h"
struct index_record {
int64_t osm_id;
const struct record* record;
};
struct indexed_data {
struct index_record* irs;
int n;
};
struct indexed_data* mk_indexed(struct record* rs, int n) {
struct index_record irs[n];
for (int i = 0 ; i < n ; i++) {
struct record* rec = &rs[i];
struct index_record irec = { .osm_id = rec->osm_id, .record = rec };
irs[i] = irec;
}
struct indexed_data* data = malloc(sizeof(struct indexed_data*));
data->irs = irs;
data->n = n;
return data;
}
void free_indexed(struct indexed_data* data) {
free(data);
}
const struct record* lookup_indexed(struct indexed_data *data, int64_t needle) {
int n = data->n;
for (int i = 0 ; i < n ; i++) {
struct index_record* irec = &data->irs[i];
if (irec->osm_id == needle) {
return irec->record;
}
}
return NULL;
}
int main(int argc, char** argv) {
return id_query_loop(argc, argv,
(mk_index_fn)mk_indexed,
(free_index_fn)free_indexed,
(lookup_fn)lookup_indexed);
}