quantile_llist_insert()

static struct quantile_llist_element* quantile_llist_insert ( struct quantile_llist_element *  element, double  value, uint32_t *  idx  )

static

Definition at line 796 of file rt_statistics.c.

References quantile_llist_element::count, quantile_llist_element::next, quantile_llist_element::prev, RASTER_DEBUGF, rtalloc(), genraster::value, and quantile_llist_element::value.

Referenced by rt_band_get_quantiles_stream().

  {
        struct quantile_llist_element *qle = NULL;

        if (NULL == element) {
                qle = rtalloc(sizeof(struct quantile_llist_element));
                RASTER_DEBUGF(4, "qle @ %p is only element in list", qle);
                if (NULL == qle) return NULL;

                qle->value = value;
                qle->count = 1;

                qle->prev = NULL;
                qle->next = NULL;

                if (NULL != idx) *idx = 0;
                return qle;
        }
        else if (value > element->value) {
                if (NULL != idx) *idx += 1;
                if (NULL != element->next)
                        return quantile_llist_insert(element->next, value, idx);
                /* insert as last element in list */
                else {
                        qle = rtalloc(sizeof(struct quantile_llist_element));
                        RASTER_DEBUGF(4, "insert qle @ %p as last element", qle);
                        if (NULL == qle) return NULL;

                        qle->value = value;
                        qle->count = 1;

                        qle->prev = element;
                        qle->next = NULL;
                        element->next = qle;

                        return qle;
                }
        }
        /* insert before current element */
        else {
                qle = rtalloc(sizeof(struct quantile_llist_element));
                RASTER_DEBUGF(4, "insert qle @ %p before current element", qle);
                if (NULL == qle) return NULL;

                qle->value = value;
                qle->count = 1;

                if (NULL != element->prev) element->prev->next = qle;
                qle->next = element;
                qle->prev = element->prev;
                element->prev = qle;

                return qle;
        }
}

Here is the call graph for this function:

Here is the caller graph for this function: