Home
last modified time | relevance | path

Searched refs:Vec_QuePrio (Results 1 – 1 of 1) sorted by relevance

/dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/misc/vec/
H A DvecQue.h50 static inline float Vec_QuePrio( Vec_Que_t * p, int v ) { return *p->pCostsFlt ? (*p->pCostsFlt)[v]… in Vec_QuePrio() function
145 return Vec_QueSize(p) > 0 ? Vec_QuePrio(p, p->pHeap[1]) : -ABC_INFINITY; in Vec_QueTopPriority()
161 float Cost = Vec_QuePrio(p, v); in Vec_QueMoveUp()
167 while ( i > 1 && Cost > Vec_QuePrio(p, p->pHeap[parent]) ) in Vec_QueMoveUp()
181 float Cost = Vec_QuePrio(p, v); in Vec_QueMoveDown()
186 … if ( child + 1 < p->nSize && Vec_QuePrio(p, p->pHeap[child]) < Vec_QuePrio(p, p->pHeap[child+1]) ) in Vec_QueMoveDown()
189 if ( Cost >= Vec_QuePrio(p, p->pHeap[child])) in Vec_QueMoveDown()
272 printf( "%-5.0f", Vec_QuePrio(p, p->pHeap[i+m]) ); in Vec_QuePrint()
310 assert( Vec_QuePrio(p, p->pHeap[i]) >= Vec_QuePrio(p, p->pHeap[child]) ); in Vec_QueCheck()
313 assert( Vec_QuePrio(p, p->pHeap[i]) >= Vec_QuePrio(p, p->pHeap[child]) ); in Vec_QueCheck()