246     uint8_t new_min;  in nn_trie_subscribe()  local
329             new_min = (*node)->u.dense.min < c ? (*node)->u.dense.min : c;  in nn_trie_subscribe()
332                 (new_max - new_min + 1) * sizeof (struct nn_trie_node*));  in nn_trie_subscribe()
335             new_children = new_max - new_min + 1;  in nn_trie_subscribe()
336             if ((*node)->u.dense.min != new_min) {  in nn_trie_subscribe()
337                 inserted = (*node)->u.dense.min - new_min;  in nn_trie_subscribe()
349             (*node)->u.dense.min = new_min;  in nn_trie_subscribe()
364         new_min = 255;  in nn_trie_subscribe()
368             new_min = new_min < c2 ? new_min : c2;  in nn_trie_subscribe()
371         new_min = new_min < *data ? new_min : *data;  in nn_trie_subscribe()
377             (new_max - new_min + 1) * sizeof (struct nn_trie_node*),  in nn_trie_subscribe()
386         (*node)->u.dense.min = new_min;  in nn_trie_subscribe()
389         memset (*node + 1, 0, (new_max - new_min + 1) *  in nn_trie_subscribe()
392             *nn_node_child (*node, old_node->u.sparse.children [i] - new_min) =  in nn_trie_subscribe()
483     int new_min;  in nn_node_unsubscribe()  local
569              new_min = i + (*self)->u.dense.min;  in nn_node_unsubscribe()
571                  ((*self)->u.dense.max - new_min + 1) *  in nn_node_unsubscribe()
573              (*self)->u.dense.min = new_min;  in nn_node_unsubscribe()
576                  ((*self)->u.dense.max - new_min + 1) *  in nn_node_unsubscribe()