[mkgmap-dev] Infinite loop splitter

Sat Mar 8 15:17:49 GMT 2014

Hi Minko,

the order of input files would be 
java ... splitter.jar [options] europe.o5m  adres.o5m vlaanderen-adres.o5m

Your approach with osmconvert is probably faster because you have to use 
osmconvert anyway to convert to o5m.

Gerd

ligfietser wrote
> Hi Gerd,
> Thanks for the fix, I will test it out.
> I tried Hennings approach but splitting seemed to last much longer because
> it analyses the whole EU extract and I only need the Benelux plus a small
> area of France and Germany.
> 
> Splitting wasn't completed and threw out this error:
> 
> warning: --keep-complete is only used for the first input file.
> New way id 195314 is not higher than last id 264955883
> Maybe the IDs are not sorted. This is not supported with
> keep-complete=true or --problem-list
> 
> I'll try now  r320.
> 
> 
>> I've committed r320 to fix the loop problem.
>> 
>> You can specify multiplie input files, but you have to make
>> sure that each file contains ids which are higher than all
>> previous ones. I think this is the case with your address files.
>> 
>> The reason for the loop was a way in a mp-relation
>> for which no nodes were found.
>> I guess this is caused by using osmconvert without the parameters
>> --complete-ways --complex-ways
>> 
>> I am not sure what's faster: Using osmconvert with polygon first or
>> only splitter with multiple input files. When all files are in o5m
>> format,
>> single run with splitter should be quite fast.
>> 
>> Gerd
> _______________________________________________
> mkgmap-dev mailing list

> mkgmap-dev at .org

> http://www.mkgmap.org.uk/mailman/listinfo/mkgmap-dev

--
View this message in context: http://gis.19327.n5.nabble.com/Infinite-loop-splitter-tp5799076p5799107.html
Sent from the Mkgmap Development mailing list archive at Nabble.com.