Routino SVN Repository Browser

Make sure that all complete routes have finish_node and last_segment
filled in.

Summary: Bug fix and clarification for previous change.

Don't merge the end of the route with the middle part of the route
before combining with the beginning of the route - combine beginning,
middle and end all in one function.

Add updated German translations submitted via http://www.routino.org/translations/ on 2014-01-31.

Add updated German translations submitted via http://www.routino.org/translations/ on 2014-01-16.

Add updated German translations submitted via http://www.routino.org/translations/ on 2014-01-13.

Add updated Dutch translations submitted via http://www.routino.org/translations/ on 2014-01-08.

Remove cycle_barrier and bicycle_barrier since these don't always
block bicycles.

Increase MAX_SEG_PER_NODE to avoid further problems.

Include typesx.h to get the definition of MAX_SEG_PER_NODE rather than having
another one.

Updated for version 2.7.3.

Translation of the final German word missing from the XML file.

Sort the data geographically before pruning so that the data points physically
close together are close together in memory which reduces swapping/paging and
therefore runs much faster when memory is limited.

Comment fixes, tidy-up and one bug fixed.

Use the waysx->idata array instead of wayx->id when logging node errors during
the segment creation.

Correct errors in wayx->id usage when compacting ways.

Improve the message printed at the end when using --logtime or --logmemory.

Clarify some comments.

Use the waysx->idata array when logging duplicate segments rather than looking
up the wayx and using its id, also saves mapping the ways into memory.

Use the nodesx->idata array when logging duplicate segments rather than looking
up the nodex and using its id.

Shrink the size of the nodesx->idata array when removing non-highway nodes.

Free memory that it allocated by IndexSegments() when no longer needed rather
than holding on to it.

Speed up the database generation when pruning by reducing the amount of random
memory accesses are required by compacting the database after each step.  Unless
there is enough RAM to hold all the memory mapped files this should be faster.

Try to speed up the search for the closest node/segment by minimising the number
of nodes that are examined in detail.

Record the memory used by the node, segment, way and relation caches in the slim
mode router.