114 |
|
|
115 |
q->heap[pos] = (pq_node *)d; |
q->heap[pos] = (pq_node *)d; |
116 |
prio_t p = ((pq_node *)d)->pri; |
prio_t p = ((pq_node *)d)->pri; |
117 |
positionate(pos,q); |
float_node(pos,q); |
118 |
|
|
119 |
return p; |
return p; |
120 |
} |
} |
125 |
return PQERR; |
return PQERR; |
126 |
|
|
127 |
pq_node **old_heap=q->heap; |
pq_node **old_heap=q->heap; |
128 |
if(!(q->heap=(pq_node**)realloc(q->heap,((q->size<<1)+1)*sizeof(pq_node*)))){ |
if(!(q->heap=(pq_node**)realloc(q->heap,((q->size+1)<<1)*sizeof(pq_node*)))){ |
129 |
q->heap=old_heap; |
q->heap=old_heap; |
130 |
return PQERR; |
return PQERR; |
131 |
} |
} |
132 |
|
|
133 |
q->size<<=1; |
q->size=(q->size<<1)+1; |
134 |
int i=q->csize+1; |
int i=q->csize+1; |
135 |
for(;i<(q->size+1);i++) |
for(;i<(q->size+1);i++) |
136 |
q->heap[i]=NULL; |
q->heap[i]=NULL; |
231 |
int i=1; |
int i=1; |
232 |
void *data; |
void *data; |
233 |
for(;i<(pq->csize+1);i++){ |
for(;i<(pq->csize+1);i++){ |
234 |
if(pq->heap[i] && pq->equals_f((void *)pq->heap[i],data2)){ |
if(pq->equals_f((void *)pq->heap[i],data2)){ |
235 |
data=(void *)pq->heap[i]; |
data=(void *)pq->heap[i]; |
236 |
|
|
237 |
pq->heap[i]=pq->heap[pq->csize]; |
pq->heap[i]=pq->heap[pq->csize]; |
254 |
|
|
255 |
int i=1; |
int i=1; |
256 |
for(;i<(pq->csize+1);i++){ |
for(;i<(pq->csize+1);i++){ |
257 |
if(pq->heap[i] && pq->equals_f((void *)pq->heap[i],data2)) |
if(pq->equals_f((void *)pq->heap[i],data2)) |
258 |
return (void *)pq->heap[i]; |
return (void *)pq->heap[i]; |
259 |
} |
} |
260 |
return NULL; |
return NULL; |