Attempted another optimization to speed up the short-finding
algorithm, but it's clear it needs a lot more than that.
This commit is contained in:
parent
abc4b263a5
commit
cb27fba5ab
|
|
@ -488,6 +488,7 @@ donesides:
|
|||
{
|
||||
tp = SelectDef->cd_planes[p]->pl_hint;
|
||||
GOTOPOINT(tp, &tile->ti_ll);
|
||||
SelectDef->cd_planes[p]->pl_hint = tp;
|
||||
if (tp->ti_client == (ClientData)CLIENTDEFAULT) continue;
|
||||
if ((int)tp->ti_client < mincost)
|
||||
{
|
||||
|
|
@ -765,6 +766,7 @@ donesrch:
|
|||
{
|
||||
tp = SelectDef->cd_planes[p]->pl_hint;
|
||||
GOTOPOINT(tp, &tile->ti_ll);
|
||||
SelectDef->cd_planes[p]->pl_hint = tp;
|
||||
if (TiGetTypeExact(tp) != TT_SPACE)
|
||||
{
|
||||
sd = NewSD(cost + 1, tp, p, GEO_CENTER, lmask);
|
||||
|
|
|
|||
Loading…
Reference in New Issue