159         size_t nc = __next_prime(2*static_cast<size_t>(__cend_ - __cbeg_) + 1);  in __insert_c()  local
160         __c_node** cbeg = static_cast<__c_node**>(calloc(nc, sizeof(__c_node*)));  in __insert_c()
169                 size_t h = hash<void*>()(q->__c_) % nc;  in __insert_c()
178         __cend_ = __cbeg_ + nc;  in __insert_c()
470         size_t nc = 2*static_cast<size_t>(cap_ - beg_);  in __add()  local
471         if (nc == 0)  in __add()
472             nc = 1;  in __add()
474            static_cast<__i_node**>(malloc(nc * sizeof(__i_node*)));  in __add()
478         if (nc > 1)  in __add()
479             memcpy(beg, beg_, nc/2*sizeof(__i_node*));  in __add()
482         end_ = beg_ + nc/2;  in __add()
483         cap_ = beg_ + nc;  in __add()
496         size_t nc = __next_prime(2*static_cast<size_t>(__iend_ - __ibeg_) + 1);  in __insert_iterator()  local
497         __i_node** ibeg = static_cast<__i_node**>(calloc(nc, sizeof(__i_node*)));  in __insert_iterator()
506                 size_t h = hash<void*>()(q->__i_) % nc;  in __insert_iterator()
515         __iend_ = __ibeg_ + nc;  in __insert_iterator()