摘自PHP的HASH算法实现(7) } if (p->conflict_next) { p->conflict_next->conflict_previous = p->conflict_previous; } if (p->previous) { p->previous->next = p->next; } if (p->next) { p->next->previous = p->previous; } if (pht->buckets[index] == p) { pht->buckets[index] = p->conflict_previous; } if (pht->head == p) { pht->head = p->next; } if (pht->tail == p)