Fabio/brouter
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions 1

minor performance patch

Browse source
This commit is contained in:
Arndt 2015-02-07 08:14:48 +01:00
parent e0dbb0eb66
commit 4797ce1368
1 changed files with 9 additions and 4 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

13
brouter-util/src/main/java/btools/util/SortedHeap.java
View file

@ -167,16 +167,21 @@ public class SortedHeap<V>
// now merge the contents of arrays 0...idx-1 into idx // now merge the contents of arrays 0...idx-1 into idx
while ( cnt > 0 ) while ( cnt > 0 )
{ {
int maxId = 0; int i=0;
int maxIdx = -1; while( pa[i] == lp[i] )
{
i++;
}
int maxId = al[i][pa[i]-1];
int maxIdx = i;
for ( int i=0; i<=idx; i++ ) for ( i++; i<=idx; i++ )
{ {
int p = pa[i]; int p = pa[i];
if ( p > lp[i] ) if ( p > lp[i] )
{ {
int currentId = al[i][p-1]; int currentId = al[i][p-1];
if ( maxIdx < 0 || currentId > maxId ) if ( currentId > maxId )
{ {
maxIdx = i; maxIdx = i;
maxId = currentId; maxId = currentId;