libpostal-sys 0.1.1

Low-level wrappers for libpostal address normalization (with locks to support thread-safe initialization)
Documentation 
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

#include "cartesian_product.h"
#include <stdarg.h>

cartesian_product_iterator_t *cartesian_product_iterator_new_vargs(size_t n, va_list args) {
    cartesian_product_iterator_t *iter = malloc(sizeof(cartesian_product_iterator_t));
    if (iter == NULL) return NULL;

    iter->lengths = uint32_array_new_size(n);
    if (iter->lengths == NULL) {
        goto exit_iter_created;
    }

    size_t remaining = 1;
    for (size_t i = 0; i < n; i++) {
        uint32_t arg = va_arg(args, uint32_t);
        uint32_array_push(iter->lengths, arg);
        if (arg > 0) {
            remaining *= arg;
        }
    }
    iter->remaining = remaining;

    iter->state = uint32_array_new_zeros(n);
    if (iter->state == NULL) {
        goto exit_iter_created;
    }

    return iter;

exit_iter_created:
    cartesian_product_iterator_destroy(iter);
    return NULL;
}

cartesian_product_iterator_t *cartesian_product_iterator_new(size_t n, ...) {
    va_list args;
    va_start(args, n);
    cartesian_product_iterator_t *iter = cartesian_product_iterator_new_vargs(n, args);
    va_end(args);
    return iter;
}

uint32_t *cartesian_product_iterator_start(cartesian_product_iterator_t *self) {
    return self->state->a;
}

bool cartesian_product_iterator_done(cartesian_product_iterator_t *self) {
    return self->remaining == 0;
}

uint32_t *cartesian_product_iterator_next(cartesian_product_iterator_t *self) {
    if (self == NULL) return NULL;

    uint32_t *lengths = self->lengths->a;
    uint32_t *state = self->state->a;

    if (self->remaining > 0) {
        ssize_t i;
        ssize_t n = self->lengths->n;
        for (i = n - 1; i >= 0; i--) {
            state[i]++;
            if (state[i] == lengths[i]) {
                state[i] = 0;
            } else {
                self->remaining--;
                break;
            }
        }
        if (i < 0) {
            self->remaining = 0;
        }
    } else {
        return NULL;
    }

    return state;
}

void cartesian_product_iterator_destroy(cartesian_product_iterator_t *self) {
    if (self == NULL) return;

    if (self->lengths != NULL) {
        uint32_array_destroy(self->lengths);
    }

    if (self->state != NULL) {
        uint32_array_destroy(self->state);
    }

    free(self);
}