Index: /applications/editors/josm/plugins/public_transport/LICENSE
===================================================================
--- /applications/editors/josm/plugins/public_transport/LICENSE	(revision 19968)
+++ /applications/editors/josm/plugins/public_transport/LICENSE	(revision 19968)
@@ -0,0 +1,345 @@
+		    GNU GENERAL PUBLIC LICENSE
+		       Version 2, June 1991
+
+ Copyright (C) 1989, 1991 Free Software Foundation, Inc.
+	51 Franklin St, Fifth Floor, Boston, MA  02110-1301  USA
+ Everyone is permitted to copy and distribute verbatim copies
+ of this license document, but changing it is not allowed.
+
+			    Preamble
+
+  The licenses for most software are designed to take away your
+freedom to share and change it.  By contrast, the GNU General Public
+License is intended to guarantee your freedom to share and change free
+software--to make sure the software is free for all its users.  This
+General Public License applies to most of the Free Software
+Foundation's software and to any other program whose authors commit to
+using it.  (Some other Free Software Foundation software is covered by
+the GNU Library General Public License instead.)  You can apply it to
+your programs, too.
+
+  When we speak of free software, we are referring to freedom, not
+price.  Our General Public Licenses are designed to make sure that you
+have the freedom to distribute copies of free software (and charge for
+this service if you wish), that you receive source code or can get it
+if you want it, that you can change the software or use pieces of it
+in new free programs; and that you know you can do these things.
+
+  To protect your rights, we need to make restrictions that forbid
+anyone to deny you these rights or to ask you to surrender the rights.
+These restrictions translate to certain responsibilities for you if you
+distribute copies of the software, or if you modify it.
+
+  For example, if you distribute copies of such a program, whether
+gratis or for a fee, you must give the recipients all the rights that
+you have.  You must make sure that they, too, receive or can get the
+source code.  And you must show them these terms so they know their
+rights.
+
+  We protect your rights with two steps: (1) copyright the software, and
+(2) offer you this license which gives you legal permission to copy,
+distribute and/or modify the software.
+
+  Also, for each author's protection and ours, we want to make certain
+that everyone understands that there is no warranty for this free
+software.  If the software is modified by someone else and passed on, we
+want its recipients to know that what they have is not the original, so
+that any problems introduced by others will not reflect on the original
+authors' reputations.
+
+  Finally, any free program is threatened constantly by software
+patents.  We wish to avoid the danger that redistributors of a free
+program will individually obtain patent licenses, in effect making the
+program proprietary.  To prevent this, we have made it clear that any
+patent must be licensed for everyone's free use or not licensed at all.
+
+  The precise terms and conditions for copying, distribution and
+modification follow.
+
+
+		    GNU GENERAL PUBLIC LICENSE
+   TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION
+
+  0. This License applies to any program or other work which contains
+a notice placed by the copyright holder saying it may be distributed
+under the terms of this General Public License.  The "Program", below,
+refers to any such program or work, and a "work based on the Program"
+means either the Program or any derivative work under copyright law:
+that is to say, a work containing the Program or a portion of it,
+either verbatim or with modifications and/or translated into another
+language.  (Hereinafter, translation is included without limitation in
+the term "modification".)  Each licensee is addressed as "you".
+
+Activities other than copying, distribution and modification are not
+covered by this License; they are outside its scope.  The act of
+running the Program is not restricted, and the output from the Program
+is covered only if its contents constitute a work based on the
+Program (independent of having been made by running the Program).
+Whether that is true depends on what the Program does.
+
+  1. You may copy and distribute verbatim copies of the Program's
+source code as you receive it, in any medium, provided that you
+conspicuously and appropriately publish on each copy an appropriate
+copyright notice and disclaimer of warranty; keep intact all the
+notices that refer to this License and to the absence of any warranty;
+and give any other recipients of the Program a copy of this License
+along with the Program.
+
+You may charge a fee for the physical act of transferring a copy, and
+you may at your option offer warranty protection in exchange for a fee.
+
+  2. You may modify your copy or copies of the Program or any portion
+of it, thus forming a work based on the Program, and copy and
+distribute such modifications or work under the terms of Section 1
+above, provided that you also meet all of these conditions:
+
+    a) You must cause the modified files to carry prominent notices
+    stating that you changed the files and the date of any change.
+
+    b) You must cause any work that you distribute or publish, that in
+    whole or in part contains or is derived from the Program or any
+    part thereof, to be licensed as a whole at no charge to all third
+    parties under the terms of this License.
+
+    c) If the modified program normally reads commands interactively
+    when run, you must cause it, when started running for such
+    interactive use in the most ordinary way, to print or display an
+    announcement including an appropriate copyright notice and a
+    notice that there is no warranty (or else, saying that you provide
+    a warranty) and that users may redistribute the program under
+    these conditions, and telling the user how to view a copy of this
+    License.  (Exception: if the Program itself is interactive but
+    does not normally print such an announcement, your work based on
+    the Program is not required to print an announcement.)
+
+
+These requirements apply to the modified work as a whole.  If
+identifiable sections of that work are not derived from the Program,
+and can be reasonably considered independent and separate works in
+themselves, then this License, and its terms, do not apply to those
+sections when you distribute them as separate works.  But when you
+distribute the same sections as part of a whole which is a work based
+on the Program, the distribution of the whole must be on the terms of
+this License, whose permissions for other licensees extend to the
+entire whole, and thus to each and every part regardless of who wrote it.
+
+Thus, it is not the intent of this section to claim rights or contest
+your rights to work written entirely by you; rather, the intent is to
+exercise the right to control the distribution of derivative or
+collective works based on the Program.
+
+In addition, mere aggregation of another work not based on the Program
+with the Program (or with a work based on the Program) on a volume of
+a storage or distribution medium does not bring the other work under
+the scope of this License.
+
+  3. You may copy and distribute the Program (or a work based on it,
+under Section 2) in object code or executable form under the terms of
+Sections 1 and 2 above provided that you also do one of the following:
+
+    a) Accompany it with the complete corresponding machine-readable
+    source code, which must be distributed under the terms of Sections
+    1 and 2 above on a medium customarily used for software interchange; or,
+
+    b) Accompany it with a written offer, valid for at least three
+    years, to give any third party, for a charge no more than your
+    cost of physically performing source distribution, a complete
+    machine-readable copy of the corresponding source code, to be
+    distributed under the terms of Sections 1 and 2 above on a medium
+    customarily used for software interchange; or,
+
+    c) Accompany it with the information you received as to the offer
+    to distribute corresponding source code.  (This alternative is
+    allowed only for noncommercial distribution and only if you
+    received the program in object code or executable form with such
+    an offer, in accord with Subsection b above.)
+
+The source code for a work means the preferred form of the work for
+making modifications to it.  For an executable work, complete source
+code means all the source code for all modules it contains, plus any
+associated interface definition files, plus the scripts used to
+control compilation and installation of the executable.  However, as a
+special exception, the source code distributed need not include
+anything that is normally distributed (in either source or binary
+form) with the major components (compiler, kernel, and so on) of the
+operating system on which the executable runs, unless that component
+itself accompanies the executable.
+
+If distribution of executable or object code is made by offering
+access to copy from a designated place, then offering equivalent
+access to copy the source code from the same place counts as
+distribution of the source code, even though third parties are not
+compelled to copy the source along with the object code.
+
+
+  4. You may not copy, modify, sublicense, or distribute the Program
+except as expressly provided under this License.  Any attempt
+otherwise to copy, modify, sublicense or distribute the Program is
+void, and will automatically terminate your rights under this License.
+However, parties who have received copies, or rights, from you under
+this License will not have their licenses terminated so long as such
+parties remain in full compliance.
+
+  5. You are not required to accept this License, since you have not
+signed it.  However, nothing else grants you permission to modify or
+distribute the Program or its derivative works.  These actions are
+prohibited by law if you do not accept this License.  Therefore, by
+modifying or distributing the Program (or any work based on the
+Program), you indicate your acceptance of this License to do so, and
+all its terms and conditions for copying, distributing or modifying
+the Program or works based on it.
+
+  6. Each time you redistribute the Program (or any work based on the
+Program), the recipient automatically receives a license from the
+original licensor to copy, distribute or modify the Program subject to
+these terms and conditions.  You may not impose any further
+restrictions on the recipients' exercise of the rights granted herein.
+You are not responsible for enforcing compliance by third parties to
+this License.
+
+  7. If, as a consequence of a court judgment or allegation of patent
+infringement or for any other reason (not limited to patent issues),
+conditions are imposed on you (whether by court order, agreement or
+otherwise) that contradict the conditions of this License, they do not
+excuse you from the conditions of this License.  If you cannot
+distribute so as to satisfy simultaneously your obligations under this
+License and any other pertinent obligations, then as a consequence you
+may not distribute the Program at all.  For example, if a patent
+license would not permit royalty-free redistribution of the Program by
+all those who receive copies directly or indirectly through you, then
+the only way you could satisfy both it and this License would be to
+refrain entirely from distribution of the Program.
+
+If any portion of this section is held invalid or unenforceable under
+any particular circumstance, the balance of the section is intended to
+apply and the section as a whole is intended to apply in other
+circumstances.
+
+It is not the purpose of this section to induce you to infringe any
+patents or other property right claims or to contest validity of any
+such claims; this section has the sole purpose of protecting the
+integrity of the free software distribution system, which is
+implemented by public license practices.  Many people have made
+generous contributions to the wide range of software distributed
+through that system in reliance on consistent application of that
+system; it is up to the author/donor to decide if he or she is willing
+to distribute software through any other system and a licensee cannot
+impose that choice.
+
+This section is intended to make thoroughly clear what is believed to
+be a consequence of the rest of this License.
+
+
+  8. If the distribution and/or use of the Program is restricted in
+certain countries either by patents or by copyrighted interfaces, the
+original copyright holder who places the Program under this License
+may add an explicit geographical distribution limitation excluding
+those countries, so that distribution is permitted only in or among
+countries not thus excluded.  In such case, this License incorporates
+the limitation as if written in the body of this License.
+
+  9. The Free Software Foundation may publish revised and/or new versions
+of the General Public License from time to time.  Such new versions will
+be similar in spirit to the present version, but may differ in detail to
+address new problems or concerns.
+
+Each version is given a distinguishing version number.  If the Program
+specifies a version number of this License which applies to it and "any
+later version", you have the option of following the terms and conditions
+either of that version or of any later version published by the Free
+Software Foundation.  If the Program does not specify a version number of
+this License, you may choose any version ever published by the Free Software
+Foundation.
+
+  10. If you wish to incorporate parts of the Program into other free
+programs whose distribution conditions are different, write to the author
+to ask for permission.  For software which is copyrighted by the Free
+Software Foundation, write to the Free Software Foundation; we sometimes
+make exceptions for this.  Our decision will be guided by the two goals
+of preserving the free status of all derivatives of our free software and
+of promoting the sharing and reuse of software generally.
+
+			    NO WARRANTY
+
+  11. BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY
+FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW.  EXCEPT WHEN
+OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES
+PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED
+OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
+MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.  THE ENTIRE RISK AS
+TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU.  SHOULD THE
+PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING,
+REPAIR OR CORRECTION.
+
+  12. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
+WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR
+REDISTRIBUTE THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES,
+INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING
+OUT OF THE USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED
+TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY
+YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER
+PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE
+POSSIBILITY OF SUCH DAMAGES.
+
+		     END OF TERMS AND CONDITIONS
+
+
+	    How to Apply These Terms to Your New Programs
+
+  If you develop a new program, and you want it to be of the greatest
+possible use to the public, the best way to achieve this is to make it
+free software which everyone can redistribute and change under these terms.
+
+  To do so, attach the following notices to the program.  It is safest
+to attach them to the start of each source file to most effectively
+convey the exclusion of warranty; and each file should have at least
+the "copyright" line and a pointer to where the full notice is found.
+
+    <one line to give the program's name and a brief idea of what it does.>
+    Copyright (C) <year>  <name of author>
+
+    This program is free software; you can redistribute it and/or modify
+    it under the terms of the GNU General Public License as published by
+    the Free Software Foundation; either version 2 of the License, or
+    (at your option) any later version.
+
+    This program is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU General Public License for more details.
+
+    You should have received a copy of the GNU General Public License
+    along with this program; if not, write to the Free Software
+    Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA  02110-1301 USA
+
+
+Also add information on how to contact you by electronic and paper mail.
+
+If the program is interactive, make it output a short notice like this
+when it starts in an interactive mode:
+
+    Gnomovision version 69, Copyright (C) year  name of author
+    Gnomovision comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
+    This is free software, and you are welcome to redistribute it
+    under certain conditions; type `show c' for details.
+
+The hypothetical commands `show w' and `show c' should show the appropriate
+parts of the General Public License.  Of course, the commands you use may
+be called something other than `show w' and `show c'; they could even be
+mouse-clicks or menu items--whatever suits your program.
+
+You should also get your employer (if you work as a programmer) or your
+school, if any, to sign a "copyright disclaimer" for the program, if
+necessary.  Here is a sample; alter the names:
+
+  Yoyodyne, Inc., hereby disclaims all copyright interest in the program
+  `Gnomovision' (which makes passes at compilers) written by James Hacker.
+
+  <signature of Ty Coon>, 1 April 1989
+  Ty Coon, President of Vice
+
+This General Public License does not permit incorporating your program into
+proprietary programs.  If your program is a subroutine library, you may
+consider it more useful to permit linking proprietary applications with the
+library.  If this is what you want to do, use the GNU Library General
+Public License instead of this License.
Index: /applications/editors/josm/plugins/public_transport/README
===================================================================
--- /applications/editors/josm/plugins/public_transport/README	(revision 19968)
+++ /applications/editors/josm/plugins/public_transport/README	(revision 19968)
@@ -0,0 +1,123 @@
+
+The JOSM Plugin "Public Transport" is designed to simplify the mapping and editing of public transport routes according to the Oxmoa scheme (see USED NOTIONS). In the first section, we will describe how to create a line from scratch. If there exists already one or more lines running partly or completely parallel, you can take advantage of this (see third section). Also, you can easily convert lines from older mapping formats to the Oxmoa scheme (see fourth section). The last section contains a reference of all items in the plugin.
+
+This manual refers to the prototype version of 2010-01-30. This is not even a beta version, so DON'T FORGET TO SAVE YOUR WORK BEFORE you use this plugin. Later versions may simplify the steps explained below. Feel free to make suggestions for simplications or extra functionality or report bugs to me (mailto:roland.olbricht(at)gmx.de). From the first mature version on, the plugin source code should appear in the OSM SVN and thus the plugin won't any more require any special installation procedures.
+
+
+HOW TO INSTALL
+
+In JOSM: Bearbeiten > Einstellungen, dort Plugins (Stecker) -> Liste laden
+cp public_transport.jar ~/.josm/plugins/
+In JOSM: Bearbeiten > Einstellungen, dort Plugins (Stecker): Public Transport aus der Liste wählen
+JOSM neustarten, Aktualisierung überspringen
+
+
+MAP A BUS LINE FROM SCRATCH
+
+The Oxmoa schema consists of a relation per direction (details see USED NOTIONS) and contains the itinerary (the way a bus actually takes from its starting stop to its terminus) and the stops served by the bus. You need to specify one half of the itinerary, the stops and the back direction can mostly be derived by the software.
+
+Download the area where your bus route takes place. Create a new relation with the standard relation editor and set the tags "type=route", "route=bus" and "ref" set to the line number. Then choose the menue item "Public Transport > Route patterns". Now you can find your route in the list of the main window. Select it and change to the tab "Itinerary". Now select on the map the first way that belongs to your line and press "Add". Mark the second item and press "Add" again. You can select several ways at once and press "Add". If your ways are added in the wrong order or with wrong roles, mark them (click the first entry in the window, then shift-click the last entry in the window) and press "Sort". If there appear one or more lines "[gap]", then your ways don't fit together. If sorting won't solve that, there are gaps in your itinerary and you need to add the missing links or split ways (mark the way, the node where to split at and then use menu "Tools > Split Way") if your bus service only partly uses them. You can delete one or more items from the list by marking them and clicking on "Delete". You can also move one or more items by marking them, clicking on "Mark" (this copies them to the clipboard, like the middle mouse button on X servers), then "Delete", then mark the first item before which you want to insert the items and click "Add".
+
+Now you can add the bus stops in a convienient way: change to the tab "Meta" and press "Suggest Stops". This will compile a list of stops that are near the itinerary. You can choose up to which distance from the itinerary stops should be considered and whether stops only the right hand side, only on the left hand side or on both sides are possible. Now change to the tab "Stops". You can identify stops by marking them and then click "Mark" and/or "Show". Delete spurious stops by marking them and pressing "Delete". Add missing stops by marking them on the map, marking the entry before which you want to insert the stop (unmark all entries if you want to append stops to the end), then press "Add".
+
+
+REUSE A PARTLY PARALLEL LINE
+
+The plugin has an internal clipboard to simplify copying parts of the itinerary or the stops from one bus route to another. Data is put into the clipboard in the X server paradigm. Mark one or more entry from the itinerary list or stops list and click the respective button "Copy". The objects themselves are kept by they state being marked on the map. The plugin additionally saves their order and role. You can paste data from clipboard by using the respective button "Add".
+
+To do this, first choose the source relation at the tab "Overview" and change to the tab "Itinerary". Mark there the entries you want to copy and click "Mark". Then choose at the tab "Overview" your destination relation and mark at the tab "Itinerary" the entry before which you want to paste the entries or unmark all entries if you want to append the data from clipboard.
+
+Stops can be copied in the same way: first choose the source relation at the tab "Overview" and change to the tab "Stops". Mark there the entries you want to copy and click "Mark". Then choose at the tab "Overview" your destination relation and mark at the tab "Stops" the entry before which you want to paste the entries or unmark all entries if you want to append the data from clipboard.
+
+
+REUSE AN OLD RELATION
+
+If you have a bus route in an old format, you can with the help of the plugin spread it into separate relations for both (or more) directions. First, use the standard relation editor of JOSM to duplicate the relation: click on the most lower but one icon on the left toolbar. this opens the relation window on the right. Choose there the relation to duplicate. Click then there on the third button to duplicate the relation, then change "to" and "from" in the opening dialog.
+
+Now open "Public transport > Route patterns ..." and select there the new relation. Change to the tab "Itinerary" and click "Reflect" to reflect the itinerary. If this does not work properly, first click "Sort" to sort the itinerary, then if necessary again "Reflect" to bring them in their proper order.
+
+To edit the bus stops, use one of the functions described above: "Suggest Stops" to have a clean restart from scratch. Or use the buttons in the tab "Stops".
+
+
+USED NOTIONS
+
+Note: I'm not a native English speaker. So if you have suggestions for better wording, please send them to me (mailto:roland.olbricht(at)gmx.de).
+
+...
+http://wiki.openstreetmap.org/wiki/User:Oxomoa/Public_transport_schema#Network_information_.28lines_and_routes.29
+
+
+REFERENCE MANUAL
+
+* Tab "Overview"
+
+- List "Existing route patterns"
+The large list in the center contains all relations that are recognised as bus routes. They are listed with the value of their tag "ref" and the ID of their relation. A relation is considered as bus service if it has the tags "type=route" and "route=bus".
+
+- Button "Refresh"
+This button refreshes the list "Existing route patterns".
+
+
+* Tab "Tags"
+
+The content of this tag is not yet implemented.
+
+
+* Tab "Itinerary"
+
+- List of member ways
+This list contains all the current members of the relation you are editing that are ways. The intended format of a route relation (see Oxmoa scheme at USED NOTIONS above) expects a continuos list of ways that represents the itinerary the bus takes in reality. Whenever two ways don't fit head on tail, a marker "[gap]" is put between them in an extra line to make breaks clearly visible. This is not a member of the relation but just a marker. You can change the role of a way in the right column. To achieve maximum backward compability, you should choose "forward" or "backward". To properly display relations that don't follow the Oxmoa scheme, all other roles including the empty are also displayed and you can choose despite "forward" and "backward" also an empty role.
+
+- Button "Show"
+Ths button changes the view on the map such that all marked entries are visible.
+
+- Button "Mark"
+Ths button marks all entries that are marked in the list as objects on the map and unmarks all other ways. It also copies a list of the marked entries to the plugin's internal clipboard, such that roles and the order can be reconstructed.
+
+- Button "Add"
+This button adds all ways that are currently marked on the map as entries in the list. The entries are added in arbitrary order before the first marked entry. You can order the just added elements by marking them and clicking "Sort".
+
+- Button "Delete"
+This button deletes all currently marked entries.
+
+- Button "Sort"
+If one or more entries are marked, all marked entries are sorted. I.e. their order and role is changed such that they form a continuous itinerary. If this is not possible, the plugin tries to construct long series of continuous sections. If no entries are marked, the entire list are sorted.
+
+- Button "Reflect"
+If one or more entries are marked, their order is reflected and their roles get flipped. I.e. every entry it put after its successor and its role is changed from "backward" to "forward", from "forward" to "backward" or left unchanged if it is empty.
+
+
+* Tab "Stops"
+
+- List of member nodes
+This list contains all the current members of the relation you are editing that are nodes. The intended format of a route relation (see Oxmoa scheme at USED NOTIONS above) expects a list of nodes that represents the stops in the order the bus takes them in reality. The roles can be changed to "forward" or "backward" but due to Oxmoa scheme, they should remain empty.
+
+- Button "Show"
+Ths button changes the view on the map such that all marked entries are visible.
+
+- Button "Mark"
+Ths button marks all entries that are marked in the list as objects on the map and unmarks all other nodes. It also copies a list of the marked entries to the plugin's internal clipboard, such that roles and the order can be reconstructed.
+
+- Button "Add"
+This button adds all ways that are currently marked on the map as entries in the list. The entries are added in arbitrary order before the first marked entry. You can order the just added elements by marking them and clicking "Sort".
+
+- Button "Delete"
+This button deletes all currently marked entries.
+
+- Button "Sort"
+If one or more entries are marked, all marked entries are sorted. The sorting order depends on the itinerary and the settings for the distance limit, the right hand side and the left hand side in the meta "tab": the sorting algorithm attaches each stop to the nearest segment of the itinerary and then orders them in the order they are passed on the itinerary. Then all stops that can't be attached are added to the end of the list.
+
+- Button "Reflect"
+If one or more entries are marked, their order is reflected. I.e. every entry it put after its successor.
+
+
+* Tab "Meta"
+
+- Checkbox "Stops are possible"
+This checkbox controls the behaviour of the button "Suggest stops" and the button "Sort" in the tab "Stops". If you mark only one of the boxes "Right hand side" or "Left hand side", only stops on the respective side are taken into account. If you mark both boxes, stops on both sides are taken into account.
+
+- Text field "Maximum distance from route"
+This textfield also controls the behaviour of the button "Suggest stops" and the button "Sort" in the tab "Stops". Only stops that have a distance less or equal the limit set here are taken into account.
+
+- Button "Suggest stops"
+This button replaces the current list of stops by a list of all stops that are on the itinerary with regard to the setting of the checkboxes and the text field described above.
Index: /applications/editors/josm/plugins/public_transport/README.template
===================================================================
--- /applications/editors/josm/plugins/public_transport/README.template	(revision 19968)
+++ /applications/editors/josm/plugins/public_transport/README.template	(revision 19968)
@@ -0,0 +1,75 @@
+README 
+======
+
+This is a template project structure for a JOSM plugin.
+
+Layout
+======
++--- src                                source of your plugin
+  |- images                             images your plugin needs
+  |- resources                          resources your plugin needs
+
+  LICENSE                               license file 
+  README                                README for your plugin
+  
+  README.template                       this file 
+  
+  
+Build
+=====  
+A JOSM plugin is built as a single jar. We use ant to build.
+
+See build.xml in this directory and update the plugin specific properties in the
+configuration section.
+  
+
+Maintaining versions
+====================
+There are two versions maintained with each plugin:
+   1) the main version
+      You have to manually set the plugins main version in the build script.
+      Set the property plugin.main.version in build.xml accordingly. 
+
+   2) the build version
+      The build version is unique for every build of the plugin. It is equal
+      to the SVN revision of your plugin directory. 
+
+ Both the main version and the build version are included in properties of the plugins
+ manifest:
+    Plugin-Version      the build version
+    Plugin-Mainversion  the main version
+
+ JOSM automatically detects whether a plugin needs to be upgraded. It compares the build
+ version of the currently installed plugin jar with the build version of the plugin jar in 
+ the SVN. The main version is irrelevant for this process.  
+ 
+ Making your plugin available to JOSM users
+ ===========================================
+ When a plugin jar is checked into SVN a script updates the plugins list on the JOSM wiki:
+   http://josm.openstreetmap.de/wiki/Plugins
+ JOSM retrieves the list of available plugins and their build versions from this list.
+
+            commit      publish               read
+                       meta data              meta data 
+      Build  ==>  SVN  =======>  JOSM Wiki   <======= JOSM 
+                   ^ 
+                   ==================================
+                            fetch current plugin jar 
+ 
+ Note that you have to manually publish (commit) your plugin jar. There is no nightly build
+ in place. Everything else (pulishing meta data, updating plugins in the client) is then handled 
+ by automatic processes. 
+
+See also
+========
+* Developing Plugins 
+  http://josm.openstreetmap.de/wiki/DevelopingPlugins
+  
+* List of JOSM Plugins
+  http://josm.openstreetmap.de/wiki/Plugins
+  
+  
+ 
+     
+
+ 
Index: /applications/editors/josm/plugins/public_transport/build.xml
===================================================================
--- /applications/editors/josm/plugins/public_transport/build.xml	(revision 19968)
+++ /applications/editors/josm/plugins/public_transport/build.xml	(revision 19968)
@@ -0,0 +1,137 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<!--
+** Usage
+** =====
+** To build it run
+**
+**    > ant  dist
+**
+** To install the generated plugin locally (in you default plugin directory) run
+**
+**    > ant  install
+**
+** The generated plugin jar is not automatically available in JOSMs plugin configuration
+** dialog. You have to check it in first.
+**
+-->
+<project name="public_transport" default="dist" basedir=".">
+    <property name="josm.basedir" location="../.."/>
+    <!--
+      ************************************************
+      ** should not be necessary to change the following properties
+     -->
+    <property name="josm"                   location="${josm.basedir}/core/dist/josm-custom.jar"/>
+    <property name="plugin.build.dir"       value="build"/>
+    <property name="plugin.src.dir"         value="src"/>
+    <!-- this is the directory where the plugin jar is copied to -->
+    <property name="plugin.dist.dir"        value="${josm.basedir}/dist"/>
+    <property name="ant.build.javac.target" value="1.5"/>
+    <property name="plugin.dist.dir"        value="${josm.basedir}/dist"/>
+    <property name="plugin.jar"             value="${plugin.dist.dir}/${ant.project.name}.jar"/>
+
+    <!--
+    **********************************************************
+    ** init - initializes the build
+    **********************************************************
+    -->
+    <target name="init">
+        <mkdir dir="${plugin.build.dir}"/>
+    </target>
+
+    <!--
+    **********************************************************
+    ** compile - complies the source tree
+    **********************************************************
+    -->
+    <target name="compile" depends="init">
+        <echo message="compiling sources for  ${plugin.jar} ... "/>
+        <javac srcdir="src" classpath="${josm}" debug="true" destdir="${plugin.build.dir}">
+            <compilerarg value="-Xlint:deprecation"/>
+            <compilerarg value="-Xlint:unchecked"/>
+        </javac>
+    </target>
+
+    <!--
+    **********************************************************
+    ** dist - creates the plugin jar
+    **********************************************************
+    -->
+    <target name="dist" depends="compile,revision">
+        <echo message="creating ${plugin.jar.name} ... "/>
+        <copy todir="${plugin.build.dir}/resources">
+            <fileset dir="resources"/>
+        </copy>
+        <copy todir="${plugin.build.dir}/images">
+            <fileset dir="images"/>
+        </copy>
+        <copy todir="${plugin.build.dir}">
+            <fileset dir=".">
+                <include name="README" />
+                <include name="LICENSE" />
+            </fileset>
+        </copy>
+        <jar destfile="${plugin.jar}" basedir="${plugin.build.dir}">
+    <!--
+        ************************************************
+        ** configure these properties. Most of them will be copied to the plugins
+        ** manifest file. Property values will also show up in the list available
+        ** plugins: http://josm.openstreetmap.de/wiki/Plugins.
+        **
+        ************************************************
+    -->
+            <manifest>
+                <attribute name="Author" value="Roland M. Olbricht"/>
+		<attribute name="Plugin-Class" value="public_transport.PublicTransportPlugin"/>
+                <attribute name="Plugin-Date" value="${version.entry.commit.date}"/>
+                <attribute name="Plugin-Description" value="This plugin simplifies the mapping and editing of public transport routes."/>
+                <attribute name="Plugin-Link" value="http://svn.openstreetmap.org/applications/editors/josm/plugins/public_transport"/>
+                <attribute name="Plugin-Mainversion" value="${plugin.main.version}"/>
+                <attribute name="Plugin-Version" value="${version.entry.commit.revision}"/>
+            </manifest>
+        </jar>
+    </target>
+
+    <!--
+    **********************************************************
+    ** revision - extracts the current revision number for the
+    **    file build.number and stores it in the XML property
+    **    version.*
+    **********************************************************
+    -->
+    <target name="revision">
+
+        <exec append="false" output="REVISION" executable="svn" failifexecutionfails="false">
+            <env key="LANG" value="C"/>
+            <arg value="info"/>
+            <arg value="--xml"/>
+            <arg value="${josm.basedir}"/>
+        </exec>
+        <xmlproperty file="REVISION" prefix="version" keepRoot="false" collapseAttributes="true"/>
+        <delete file="REVISION"/>
+    </target>
+
+    <!--
+    **********************************************************
+    ** clean - clean up the build environment
+    **********************************************************
+    -->
+    <target name="clean">
+        <delete dir="${plugin.build.dir}"/>
+        <delete file="${plugin.jar}"/>
+    </target>
+
+    <!--
+    **********************************************************
+    ** install - install the plugin in your local JOSM installation
+    **********************************************************
+    -->
+    <target name="install" depends="dist">
+        <property environment="env"/>
+        <condition property="josm.plugins.dir" value="${env.APPDATA}/JOSM/plugins" else="${user.home}/.josm/plugins">
+            <and>
+                <os family="windows"/>
+            </and>
+        </condition>
+        <copy file="${plugin.jar}" todir="${josm.plugins.dir}"/>
+    </target>
+</project>
Index: /applications/editors/josm/plugins/public_transport/build/LICENSE
===================================================================
--- /applications/editors/josm/plugins/public_transport/build/LICENSE	(revision 19968)
+++ /applications/editors/josm/plugins/public_transport/build/LICENSE	(revision 19968)
@@ -0,0 +1,345 @@
+		    GNU GENERAL PUBLIC LICENSE
+		       Version 2, June 1991
+
+ Copyright (C) 1989, 1991 Free Software Foundation, Inc.
+	51 Franklin St, Fifth Floor, Boston, MA  02110-1301  USA
+ Everyone is permitted to copy and distribute verbatim copies
+ of this license document, but changing it is not allowed.
+
+			    Preamble
+
+  The licenses for most software are designed to take away your
+freedom to share and change it.  By contrast, the GNU General Public
+License is intended to guarantee your freedom to share and change free
+software--to make sure the software is free for all its users.  This
+General Public License applies to most of the Free Software
+Foundation's software and to any other program whose authors commit to
+using it.  (Some other Free Software Foundation software is covered by
+the GNU Library General Public License instead.)  You can apply it to
+your programs, too.
+
+  When we speak of free software, we are referring to freedom, not
+price.  Our General Public Licenses are designed to make sure that you
+have the freedom to distribute copies of free software (and charge for
+this service if you wish), that you receive source code or can get it
+if you want it, that you can change the software or use pieces of it
+in new free programs; and that you know you can do these things.
+
+  To protect your rights, we need to make restrictions that forbid
+anyone to deny you these rights or to ask you to surrender the rights.
+These restrictions translate to certain responsibilities for you if you
+distribute copies of the software, or if you modify it.
+
+  For example, if you distribute copies of such a program, whether
+gratis or for a fee, you must give the recipients all the rights that
+you have.  You must make sure that they, too, receive or can get the
+source code.  And you must show them these terms so they know their
+rights.
+
+  We protect your rights with two steps: (1) copyright the software, and
+(2) offer you this license which gives you legal permission to copy,
+distribute and/or modify the software.
+
+  Also, for each author's protection and ours, we want to make certain
+that everyone understands that there is no warranty for this free
+software.  If the software is modified by someone else and passed on, we
+want its recipients to know that what they have is not the original, so
+that any problems introduced by others will not reflect on the original
+authors' reputations.
+
+  Finally, any free program is threatened constantly by software
+patents.  We wish to avoid the danger that redistributors of a free
+program will individually obtain patent licenses, in effect making the
+program proprietary.  To prevent this, we have made it clear that any
+patent must be licensed for everyone's free use or not licensed at all.
+
+  The precise terms and conditions for copying, distribution and
+modification follow.
+
+
+		    GNU GENERAL PUBLIC LICENSE
+   TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION
+
+  0. This License applies to any program or other work which contains
+a notice placed by the copyright holder saying it may be distributed
+under the terms of this General Public License.  The "Program", below,
+refers to any such program or work, and a "work based on the Program"
+means either the Program or any derivative work under copyright law:
+that is to say, a work containing the Program or a portion of it,
+either verbatim or with modifications and/or translated into another
+language.  (Hereinafter, translation is included without limitation in
+the term "modification".)  Each licensee is addressed as "you".
+
+Activities other than copying, distribution and modification are not
+covered by this License; they are outside its scope.  The act of
+running the Program is not restricted, and the output from the Program
+is covered only if its contents constitute a work based on the
+Program (independent of having been made by running the Program).
+Whether that is true depends on what the Program does.
+
+  1. You may copy and distribute verbatim copies of the Program's
+source code as you receive it, in any medium, provided that you
+conspicuously and appropriately publish on each copy an appropriate
+copyright notice and disclaimer of warranty; keep intact all the
+notices that refer to this License and to the absence of any warranty;
+and give any other recipients of the Program a copy of this License
+along with the Program.
+
+You may charge a fee for the physical act of transferring a copy, and
+you may at your option offer warranty protection in exchange for a fee.
+
+  2. You may modify your copy or copies of the Program or any portion
+of it, thus forming a work based on the Program, and copy and
+distribute such modifications or work under the terms of Section 1
+above, provided that you also meet all of these conditions:
+
+    a) You must cause the modified files to carry prominent notices
+    stating that you changed the files and the date of any change.
+
+    b) You must cause any work that you distribute or publish, that in
+    whole or in part contains or is derived from the Program or any
+    part thereof, to be licensed as a whole at no charge to all third
+    parties under the terms of this License.
+
+    c) If the modified program normally reads commands interactively
+    when run, you must cause it, when started running for such
+    interactive use in the most ordinary way, to print or display an
+    announcement including an appropriate copyright notice and a
+    notice that there is no warranty (or else, saying that you provide
+    a warranty) and that users may redistribute the program under
+    these conditions, and telling the user how to view a copy of this
+    License.  (Exception: if the Program itself is interactive but
+    does not normally print such an announcement, your work based on
+    the Program is not required to print an announcement.)
+
+
+These requirements apply to the modified work as a whole.  If
+identifiable sections of that work are not derived from the Program,
+and can be reasonably considered independent and separate works in
+themselves, then this License, and its terms, do not apply to those
+sections when you distribute them as separate works.  But when you
+distribute the same sections as part of a whole which is a work based
+on the Program, the distribution of the whole must be on the terms of
+this License, whose permissions for other licensees extend to the
+entire whole, and thus to each and every part regardless of who wrote it.
+
+Thus, it is not the intent of this section to claim rights or contest
+your rights to work written entirely by you; rather, the intent is to
+exercise the right to control the distribution of derivative or
+collective works based on the Program.
+
+In addition, mere aggregation of another work not based on the Program
+with the Program (or with a work based on the Program) on a volume of
+a storage or distribution medium does not bring the other work under
+the scope of this License.
+
+  3. You may copy and distribute the Program (or a work based on it,
+under Section 2) in object code or executable form under the terms of
+Sections 1 and 2 above provided that you also do one of the following:
+
+    a) Accompany it with the complete corresponding machine-readable
+    source code, which must be distributed under the terms of Sections
+    1 and 2 above on a medium customarily used for software interchange; or,
+
+    b) Accompany it with a written offer, valid for at least three
+    years, to give any third party, for a charge no more than your
+    cost of physically performing source distribution, a complete
+    machine-readable copy of the corresponding source code, to be
+    distributed under the terms of Sections 1 and 2 above on a medium
+    customarily used for software interchange; or,
+
+    c) Accompany it with the information you received as to the offer
+    to distribute corresponding source code.  (This alternative is
+    allowed only for noncommercial distribution and only if you
+    received the program in object code or executable form with such
+    an offer, in accord with Subsection b above.)
+
+The source code for a work means the preferred form of the work for
+making modifications to it.  For an executable work, complete source
+code means all the source code for all modules it contains, plus any
+associated interface definition files, plus the scripts used to
+control compilation and installation of the executable.  However, as a
+special exception, the source code distributed need not include
+anything that is normally distributed (in either source or binary
+form) with the major components (compiler, kernel, and so on) of the
+operating system on which the executable runs, unless that component
+itself accompanies the executable.
+
+If distribution of executable or object code is made by offering
+access to copy from a designated place, then offering equivalent
+access to copy the source code from the same place counts as
+distribution of the source code, even though third parties are not
+compelled to copy the source along with the object code.
+
+
+  4. You may not copy, modify, sublicense, or distribute the Program
+except as expressly provided under this License.  Any attempt
+otherwise to copy, modify, sublicense or distribute the Program is
+void, and will automatically terminate your rights under this License.
+However, parties who have received copies, or rights, from you under
+this License will not have their licenses terminated so long as such
+parties remain in full compliance.
+
+  5. You are not required to accept this License, since you have not
+signed it.  However, nothing else grants you permission to modify or
+distribute the Program or its derivative works.  These actions are
+prohibited by law if you do not accept this License.  Therefore, by
+modifying or distributing the Program (or any work based on the
+Program), you indicate your acceptance of this License to do so, and
+all its terms and conditions for copying, distributing or modifying
+the Program or works based on it.
+
+  6. Each time you redistribute the Program (or any work based on the
+Program), the recipient automatically receives a license from the
+original licensor to copy, distribute or modify the Program subject to
+these terms and conditions.  You may not impose any further
+restrictions on the recipients' exercise of the rights granted herein.
+You are not responsible for enforcing compliance by third parties to
+this License.
+
+  7. If, as a consequence of a court judgment or allegation of patent
+infringement or for any other reason (not limited to patent issues),
+conditions are imposed on you (whether by court order, agreement or
+otherwise) that contradict the conditions of this License, they do not
+excuse you from the conditions of this License.  If you cannot
+distribute so as to satisfy simultaneously your obligations under this
+License and any other pertinent obligations, then as a consequence you
+may not distribute the Program at all.  For example, if a patent
+license would not permit royalty-free redistribution of the Program by
+all those who receive copies directly or indirectly through you, then
+the only way you could satisfy both it and this License would be to
+refrain entirely from distribution of the Program.
+
+If any portion of this section is held invalid or unenforceable under
+any particular circumstance, the balance of the section is intended to
+apply and the section as a whole is intended to apply in other
+circumstances.
+
+It is not the purpose of this section to induce you to infringe any
+patents or other property right claims or to contest validity of any
+such claims; this section has the sole purpose of protecting the
+integrity of the free software distribution system, which is
+implemented by public license practices.  Many people have made
+generous contributions to the wide range of software distributed
+through that system in reliance on consistent application of that
+system; it is up to the author/donor to decide if he or she is willing
+to distribute software through any other system and a licensee cannot
+impose that choice.
+
+This section is intended to make thoroughly clear what is believed to
+be a consequence of the rest of this License.
+
+
+  8. If the distribution and/or use of the Program is restricted in
+certain countries either by patents or by copyrighted interfaces, the
+original copyright holder who places the Program under this License
+may add an explicit geographical distribution limitation excluding
+those countries, so that distribution is permitted only in or among
+countries not thus excluded.  In such case, this License incorporates
+the limitation as if written in the body of this License.
+
+  9. The Free Software Foundation may publish revised and/or new versions
+of the General Public License from time to time.  Such new versions will
+be similar in spirit to the present version, but may differ in detail to
+address new problems or concerns.
+
+Each version is given a distinguishing version number.  If the Program
+specifies a version number of this License which applies to it and "any
+later version", you have the option of following the terms and conditions
+either of that version or of any later version published by the Free
+Software Foundation.  If the Program does not specify a version number of
+this License, you may choose any version ever published by the Free Software
+Foundation.
+
+  10. If you wish to incorporate parts of the Program into other free
+programs whose distribution conditions are different, write to the author
+to ask for permission.  For software which is copyrighted by the Free
+Software Foundation, write to the Free Software Foundation; we sometimes
+make exceptions for this.  Our decision will be guided by the two goals
+of preserving the free status of all derivatives of our free software and
+of promoting the sharing and reuse of software generally.
+
+			    NO WARRANTY
+
+  11. BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY
+FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW.  EXCEPT WHEN
+OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES
+PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED
+OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
+MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.  THE ENTIRE RISK AS
+TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU.  SHOULD THE
+PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING,
+REPAIR OR CORRECTION.
+
+  12. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
+WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR
+REDISTRIBUTE THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES,
+INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING
+OUT OF THE USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED
+TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY
+YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER
+PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE
+POSSIBILITY OF SUCH DAMAGES.
+
+		     END OF TERMS AND CONDITIONS
+
+
+	    How to Apply These Terms to Your New Programs
+
+  If you develop a new program, and you want it to be of the greatest
+possible use to the public, the best way to achieve this is to make it
+free software which everyone can redistribute and change under these terms.
+
+  To do so, attach the following notices to the program.  It is safest
+to attach them to the start of each source file to most effectively
+convey the exclusion of warranty; and each file should have at least
+the "copyright" line and a pointer to where the full notice is found.
+
+    <one line to give the program's name and a brief idea of what it does.>
+    Copyright (C) <year>  <name of author>
+
+    This program is free software; you can redistribute it and/or modify
+    it under the terms of the GNU General Public License as published by
+    the Free Software Foundation; either version 2 of the License, or
+    (at your option) any later version.
+
+    This program is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU General Public License for more details.
+
+    You should have received a copy of the GNU General Public License
+    along with this program; if not, write to the Free Software
+    Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA  02110-1301 USA
+
+
+Also add information on how to contact you by electronic and paper mail.
+
+If the program is interactive, make it output a short notice like this
+when it starts in an interactive mode:
+
+    Gnomovision version 69, Copyright (C) year  name of author
+    Gnomovision comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
+    This is free software, and you are welcome to redistribute it
+    under certain conditions; type `show c' for details.
+
+The hypothetical commands `show w' and `show c' should show the appropriate
+parts of the General Public License.  Of course, the commands you use may
+be called something other than `show w' and `show c'; they could even be
+mouse-clicks or menu items--whatever suits your program.
+
+You should also get your employer (if you work as a programmer) or your
+school, if any, to sign a "copyright disclaimer" for the program, if
+necessary.  Here is a sample; alter the names:
+
+  Yoyodyne, Inc., hereby disclaims all copyright interest in the program
+  `Gnomovision' (which makes passes at compilers) written by James Hacker.
+
+  <signature of Ty Coon>, 1 April 1989
+  Ty Coon, President of Vice
+
+This General Public License does not permit incorporating your program into
+proprietary programs.  If your program is a subroutine library, you may
+consider it more useful to permit linking proprietary applications with the
+library.  If this is what you want to do, use the GNU Library General
+Public License instead of this License.
Index: /applications/editors/josm/plugins/public_transport/build/README
===================================================================
--- /applications/editors/josm/plugins/public_transport/build/README	(revision 19968)
+++ /applications/editors/josm/plugins/public_transport/build/README	(revision 19968)
@@ -0,0 +1,123 @@
+
+The JOSM Plugin "Public Transport" is designed to simplify the mapping and editing of public transport routes according to the Oxmoa scheme (see USED NOTIONS). In the first section, we will describe how to create a line from scratch. If there exists already one or more lines running partly or completely parallel, you can take advantage of this (see third section). Also, you can easily convert lines from older mapping formats to the Oxmoa scheme (see fourth section). The last section contains a reference of all items in the plugin.
+
+This manual refers to the prototype version of 2010-01-30. This is not even a beta version, so DON'T FORGET TO SAVE YOUR WORK BEFORE you use this plugin. Later versions may simplify the steps explained below. Feel free to make suggestions for simplications or extra functionality or report bugs to me (mailto:roland.olbricht(at)gmx.de). From the first mature version on, the plugin source code should appear in the OSM SVN and thus the plugin won't any more require any special installation procedures.
+
+
+HOW TO INSTALL
+
+In JOSM: Bearbeiten > Einstellungen, dort Plugins (Stecker) -> Liste laden
+cp public_transport.jar ~/.josm/plugins/
+In JOSM: Bearbeiten > Einstellungen, dort Plugins (Stecker): Public Transport aus der Liste wählen
+JOSM neustarten, Aktualisierung überspringen
+
+
+MAP A BUS LINE FROM SCRATCH
+
+The Oxmoa schema consists of a relation per direction (details see USED NOTIONS) and contains the itinerary (the way a bus actually takes from its starting stop to its terminus) and the stops served by the bus. You need to specify one half of the itinerary, the stops and the back direction can mostly be derived by the software.
+
+Download the area where your bus route takes place. Create a new relation with the standard relation editor and set the tags "type=route", "route=bus" and "ref" set to the line number. Then choose the menue item "Public Transport > Route patterns". Now you can find your route in the list of the main window. Select it and change to the tab "Itinerary". Now select on the map the first way that belongs to your line and press "Add". Mark the second item and press "Add" again. You can select several ways at once and press "Add". If your ways are added in the wrong order or with wrong roles, mark them (click the first entry in the window, then shift-click the last entry in the window) and press "Sort". If there appear one or more lines "[gap]", then your ways don't fit together. If sorting won't solve that, there are gaps in your itinerary and you need to add the missing links or split ways (mark the way, the node where to split at and then use menu "Tools > Split Way") if your bus service only partly uses them. You can delete one or more items from the list by marking them and clicking on "Delete". You can also move one or more items by marking them, clicking on "Mark" (this copies them to the clipboard, like the middle mouse button on X servers), then "Delete", then mark the first item before which you want to insert the items and click "Add".
+
+Now you can add the bus stops in a convienient way: change to the tab "Meta" and press "Suggest Stops". This will compile a list of stops that are near the itinerary. You can choose up to which distance from the itinerary stops should be considered and whether stops only the right hand side, only on the left hand side or on both sides are possible. Now change to the tab "Stops". You can identify stops by marking them and then click "Mark" and/or "Show". Delete spurious stops by marking them and pressing "Delete". Add missing stops by marking them on the map, marking the entry before which you want to insert the stop (unmark all entries if you want to append stops to the end), then press "Add".
+
+
+REUSE A PARTLY PARALLEL LINE
+
+The plugin has an internal clipboard to simplify copying parts of the itinerary or the stops from one bus route to another. Data is put into the clipboard in the X server paradigm. Mark one or more entry from the itinerary list or stops list and click the respective button "Copy". The objects themselves are kept by they state being marked on the map. The plugin additionally saves their order and role. You can paste data from clipboard by using the respective button "Add".
+
+To do this, first choose the source relation at the tab "Overview" and change to the tab "Itinerary". Mark there the entries you want to copy and click "Mark". Then choose at the tab "Overview" your destination relation and mark at the tab "Itinerary" the entry before which you want to paste the entries or unmark all entries if you want to append the data from clipboard.
+
+Stops can be copied in the same way: first choose the source relation at the tab "Overview" and change to the tab "Stops". Mark there the entries you want to copy and click "Mark". Then choose at the tab "Overview" your destination relation and mark at the tab "Stops" the entry before which you want to paste the entries or unmark all entries if you want to append the data from clipboard.
+
+
+REUSE AN OLD RELATION
+
+If you have a bus route in an old format, you can with the help of the plugin spread it into separate relations for both (or more) directions. First, use the standard relation editor of JOSM to duplicate the relation: click on the most lower but one icon on the left toolbar. this opens the relation window on the right. Choose there the relation to duplicate. Click then there on the third button to duplicate the relation, then change "to" and "from" in the opening dialog.
+
+Now open "Public transport > Route patterns ..." and select there the new relation. Change to the tab "Itinerary" and click "Reflect" to reflect the itinerary. If this does not work properly, first click "Sort" to sort the itinerary, then if necessary again "Reflect" to bring them in their proper order.
+
+To edit the bus stops, use one of the functions described above: "Suggest Stops" to have a clean restart from scratch. Or use the buttons in the tab "Stops".
+
+
+USED NOTIONS
+
+Note: I'm not a native English speaker. So if you have suggestions for better wording, please send them to me (mailto:roland.olbricht(at)gmx.de).
+
+...
+http://wiki.openstreetmap.org/wiki/User:Oxomoa/Public_transport_schema#Network_information_.28lines_and_routes.29
+
+
+REFERENCE MANUAL
+
+* Tab "Overview"
+
+- List "Existing route patterns"
+The large list in the center contains all relations that are recognised as bus routes. They are listed with the value of their tag "ref" and the ID of their relation. A relation is considered as bus service if it has the tags "type=route" and "route=bus".
+
+- Button "Refresh"
+This button refreshes the list "Existing route patterns".
+
+
+* Tab "Tags"
+
+The content of this tag is not yet implemented.
+
+
+* Tab "Itinerary"
+
+- List of member ways
+This list contains all the current members of the relation you are editing that are ways. The intended format of a route relation (see Oxmoa scheme at USED NOTIONS above) expects a continuos list of ways that represents the itinerary the bus takes in reality. Whenever two ways don't fit head on tail, a marker "[gap]" is put between them in an extra line to make breaks clearly visible. This is not a member of the relation but just a marker. You can change the role of a way in the right column. To achieve maximum backward compability, you should choose "forward" or "backward". To properly display relations that don't follow the Oxmoa scheme, all other roles including the empty are also displayed and you can choose despite "forward" and "backward" also an empty role.
+
+- Button "Show"
+Ths button changes the view on the map such that all marked entries are visible.
+
+- Button "Mark"
+Ths button marks all entries that are marked in the list as objects on the map and unmarks all other ways. It also copies a list of the marked entries to the plugin's internal clipboard, such that roles and the order can be reconstructed.
+
+- Button "Add"
+This button adds all ways that are currently marked on the map as entries in the list. The entries are added in arbitrary order before the first marked entry. You can order the just added elements by marking them and clicking "Sort".
+
+- Button "Delete"
+This button deletes all currently marked entries.
+
+- Button "Sort"
+If one or more entries are marked, all marked entries are sorted. I.e. their order and role is changed such that they form a continuous itinerary. If this is not possible, the plugin tries to construct long series of continuous sections. If no entries are marked, the entire list are sorted.
+
+- Button "Reflect"
+If one or more entries are marked, their order is reflected and their roles get flipped. I.e. every entry it put after its successor and its role is changed from "backward" to "forward", from "forward" to "backward" or left unchanged if it is empty.
+
+
+* Tab "Stops"
+
+- List of member nodes
+This list contains all the current members of the relation you are editing that are nodes. The intended format of a route relation (see Oxmoa scheme at USED NOTIONS above) expects a list of nodes that represents the stops in the order the bus takes them in reality. The roles can be changed to "forward" or "backward" but due to Oxmoa scheme, they should remain empty.
+
+- Button "Show"
+Ths button changes the view on the map such that all marked entries are visible.
+
+- Button "Mark"
+Ths button marks all entries that are marked in the list as objects on the map and unmarks all other nodes. It also copies a list of the marked entries to the plugin's internal clipboard, such that roles and the order can be reconstructed.
+
+- Button "Add"
+This button adds all ways that are currently marked on the map as entries in the list. The entries are added in arbitrary order before the first marked entry. You can order the just added elements by marking them and clicking "Sort".
+
+- Button "Delete"
+This button deletes all currently marked entries.
+
+- Button "Sort"
+If one or more entries are marked, all marked entries are sorted. The sorting order depends on the itinerary and the settings for the distance limit, the right hand side and the left hand side in the meta "tab": the sorting algorithm attaches each stop to the nearest segment of the itinerary and then orders them in the order they are passed on the itinerary. Then all stops that can't be attached are added to the end of the list.
+
+- Button "Reflect"
+If one or more entries are marked, their order is reflected. I.e. every entry it put after its successor.
+
+
+* Tab "Meta"
+
+- Checkbox "Stops are possible"
+This checkbox controls the behaviour of the button "Suggest stops" and the button "Sort" in the tab "Stops". If you mark only one of the boxes "Right hand side" or "Left hand side", only stops on the respective side are taken into account. If you mark both boxes, stops on both sides are taken into account.
+
+- Text field "Maximum distance from route"
+This textfield also controls the behaviour of the button "Suggest stops" and the button "Sort" in the tab "Stops". Only stops that have a distance less or equal the limit set here are taken into account.
+
+- Button "Suggest stops"
+This button replaces the current list of stops by a list of all stops that are on the itinerary with regard to the setting of the checkboxes and the text field described above.
Index: /applications/editors/josm/plugins/public_transport/src/public_transport/PublicTransportPlugin.java
===================================================================
--- /applications/editors/josm/plugins/public_transport/src/public_transport/PublicTransportPlugin.java	(revision 19968)
+++ /applications/editors/josm/plugins/public_transport/src/public_transport/PublicTransportPlugin.java	(revision 19968)
@@ -0,0 +1,55 @@
+package public_transport;
+
+import static org.openstreetmap.josm.tools.I18n.marktr;
+import static org.openstreetmap.josm.tools.I18n.tr;
+
+import java.awt.event.KeyEvent;
+
+import javax.swing.JMenu;
+import javax.swing.JMenuItem;
+
+import org.openstreetmap.josm.Main;
+import org.openstreetmap.josm.actions.JosmAction;
+import org.openstreetmap.josm.data.ProjectionBounds;
+import org.openstreetmap.josm.gui.IconToggleButton;
+import org.openstreetmap.josm.gui.MainMenu;
+import org.openstreetmap.josm.gui.MapFrame;
+import org.openstreetmap.josm.gui.MapView;
+import org.openstreetmap.josm.gui.preferences.PreferenceSetting;
+import org.openstreetmap.josm.io.CacheFiles;
+import org.openstreetmap.josm.io.MirroredInputStream;
+import org.openstreetmap.josm.plugins.Plugin;
+
+public class PublicTransportPlugin extends Plugin {
+    
+  static JMenu jMenu;
+
+  public PublicTransportPlugin()
+  {
+    super(null);
+    refreshMenu();
+  }
+
+  public static void refreshMenu()
+  {
+    MainMenu menu = Main.main.menu;
+
+    if (jMenu == null)
+      jMenu = menu.addMenu(marktr("Public Transport"), KeyEvent.VK_P, menu.defaultMenuPos, "help");
+    else
+      jMenu.removeAll();
+
+    jMenu.addSeparator();
+    jMenu.add(new JMenuItem(new RoutePatternAction()));
+    setEnabledAll(true);
+  }
+
+  private static void setEnabledAll(boolean isEnabled)
+  {
+    for(int i=0; i < jMenu.getItemCount(); i++) {
+      JMenuItem item = jMenu.getItem(i);
+
+      if(item != null) item.setEnabled(isEnabled);
+    }
+  }
+}
Index: /applications/editors/josm/plugins/public_transport/src/public_transport/RoutePatternAction.java
===================================================================
--- /applications/editors/josm/plugins/public_transport/src/public_transport/RoutePatternAction.java	(revision 19968)
+++ /applications/editors/josm/plugins/public_transport/src/public_transport/RoutePatternAction.java	(revision 19968)
@@ -0,0 +1,1801 @@
+package public_transport;
+
+import static org.openstreetmap.josm.tools.I18n.marktr;
+import static org.openstreetmap.josm.tools.I18n.tr;
+
+import java.awt.BorderLayout;
+import java.awt.Container;
+import java.awt.Frame;
+import java.awt.GridBagConstraints;
+import java.awt.GridBagLayout;
+import java.awt.event.ActionEvent;
+import java.util.Collection;
+import java.util.Collections;
+import java.util.Iterator;
+import java.util.LinkedList;
+import java.util.List;
+import java.util.Map;
+import java.util.TreeMap;
+import java.util.TreeSet;
+import java.util.Vector;
+
+import javax.swing.DefaultCellEditor;
+import javax.swing.DefaultListModel;
+import javax.swing.JButton;
+import javax.swing.JCheckBox;
+import javax.swing.JComboBox;
+import javax.swing.JDialog;
+import javax.swing.JLabel;
+import javax.swing.JList;
+import javax.swing.JOptionPane;
+import javax.swing.JPanel;
+import javax.swing.JScrollPane;
+import javax.swing.JTabbedPane;
+import javax.swing.JTable;
+import javax.swing.JTextField;
+import javax.swing.ListSelectionModel;
+import javax.swing.event.ListSelectionEvent;
+import javax.swing.event.ListSelectionListener;
+import javax.swing.event.TableModelEvent;
+import javax.swing.event.TableModelListener;
+import javax.swing.table.DefaultTableModel;
+
+import org.openstreetmap.josm.Main;
+import org.openstreetmap.josm.actions.JosmAction;
+import org.openstreetmap.josm.data.osm.DataSet;
+import org.openstreetmap.josm.data.osm.Node;
+import org.openstreetmap.josm.data.osm.OsmPrimitive;
+import org.openstreetmap.josm.data.osm.Relation;
+import org.openstreetmap.josm.data.osm.RelationMember;
+import org.openstreetmap.josm.data.osm.Way;
+import org.openstreetmap.josm.data.osm.visitor.BoundingXYVisitor;
+import org.openstreetmap.josm.gui.ExtendedDialog;
+import org.openstreetmap.josm.tools.GBC;
+import org.openstreetmap.josm.tools.Shortcut;
+import org.openstreetmap.josm.tools.UrlLabel;
+
+public class RoutePatternAction extends JosmAction {
+  
+  private class RoutesLSL implements ListSelectionListener {
+    RoutePatternAction root = null;
+    
+    public RoutesLSL(RoutePatternAction rpa) {
+      root = rpa;
+    }
+    
+    public void valueChanged(ListSelectionEvent e) {
+      root.routesSelectionChanged();
+    }
+  };
+  
+  private class ItineraryTableModel extends DefaultTableModel {
+    public Vector<Way> ways = new Vector<Way>();
+    
+    public boolean isCellEditable(int row, int column) {
+      if (column != 1)
+	return false;
+      if (ways.elementAt(row) == null)
+	return false;
+      return true;
+    }
+  
+    public void addRow(Object[] obj) {
+      ways.addElement(null);
+      super.addRow(obj);
+    }
+    
+    public void insertRow(int insPos, Object[] obj) {
+      if (insPos == -1)
+      {
+	ways.addElement(null);
+	super.addRow(obj);
+      }
+      else
+      {
+	ways.insertElementAt(null, insPos);
+	super.insertRow(insPos, obj);
+      }
+    }
+    
+    public void addRow(Way way, String role) {
+      insertRow(-1, way, role);
+    }
+    
+    public void insertRow(int insPos, Way way, String role) {
+      String[] buf = { "", "" };
+      String curName = way.get("name");
+      if (way.isIncomplete())
+      {
+	buf[0] = "[incomplete]";
+      }
+      else if (way.getNodesCount() < 1)
+      {
+	buf[0] = "[empty way]";
+      }
+      else if (curName != null)
+      {
+	buf[0] = curName;
+      }
+      else
+      {
+	buf[0] = "[ID] " + (new Long(way.getId())).toString();
+      }
+      buf[1] = role;
+      if (insPos == -1)
+      {
+	ways.addElement(way);
+	super.addRow(buf);
+      }
+      else
+      {
+	ways.insertElementAt(way, insPos);
+	super.insertRow(insPos, buf);
+      }
+    }
+    
+    public void clear()
+    {
+      ways.clear();
+      super.setRowCount(0);
+    }
+  };
+  
+  private class ItineraryTableModelListener implements TableModelListener {
+    public void tableChanged(TableModelEvent e)
+    {
+      if (e.getType() == TableModelEvent.UPDATE)
+      {
+	cleanupGaps();
+	rebuildWays();
+      }
+    }
+  };
+  
+  private class StoplistTableModel extends DefaultTableModel {
+    public Vector<Node> nodes = new Vector<Node>();
+    
+    public boolean isCellEditable(int row, int column) {
+      if (column != 1)
+	return false;
+      return true;
+    }
+  
+    public void addRow(Object[] obj) {
+      throw new UnsupportedOperationException();
+    }
+    
+    public void insertRow(int insPos, Object[] obj) {
+      throw new UnsupportedOperationException();
+    }
+    
+    public void addRow(Node node, String role) {
+      insertRow(-1, node, role);
+    }
+    
+    public void insertRow(int insPos, Node node, String role) {
+      String[] buf = { "", "" };
+      String curName = node.get("name");
+      if (curName != null)
+      {
+	buf[0] = curName;
+      }
+      else
+      {
+	buf[0] = "[ID] " + (new Long(node.getId())).toString();
+      }
+      buf[1] = role;
+      if (insPos == -1)
+      {
+	nodes.addElement(node);
+	super.addRow(buf);
+      }
+      else
+      {
+	nodes.insertElementAt(node, insPos);
+	super.insertRow(insPos, buf);
+      }
+    }
+    
+    public void clear()
+    {
+      nodes.clear();
+      super.setRowCount(0);
+    }
+  };
+  
+  private class StoplistTableModelListener implements TableModelListener {
+    public void tableChanged(TableModelEvent e)
+    {
+      if (e.getType() == TableModelEvent.UPDATE)
+      {
+	rebuildNodes();
+      }
+    }
+  };
+  
+  private class SegmentMetric {
+    public double aLat, aLon;
+    public double length;
+    public double d1, d2, o1, o2;
+    
+    public SegmentMetric(double fromLat, double fromLon, double toLat, double toLon) {
+      aLat = fromLat;
+      aLon = fromLon;
+      
+      //Compute length and direction
+      //length is in units of latitude degrees
+      d1 = toLat - fromLat;
+      d2 = (toLon - fromLon) * Math.cos(fromLat * Math.PI/180.0);
+      length = Math.sqrt(d1*d1 + d2*d2);
+    
+      //Normalise direction
+      d1 = d1 / length;
+      d2 = d2 / length;
+    
+      //Compute orthogonal direction (right hand size is positive)
+      o1 = - d2;
+      o2 = d1;
+    
+      //Prepare lon direction to reduce the number of necessary multiplications
+      d2 = d2 * Math.cos(fromLat * Math.PI/180.0);
+      o2 = o2 * Math.cos(fromLat * Math.PI/180.0);
+    }
+  };
+  
+  private class StopReference implements Comparable< StopReference > {
+    public int index = 0;
+    public double pos = 0;
+    public double distance = 0;
+    public String name = "";
+    public String role = "";
+    public Node node;
+    
+    public StopReference(int inIndex, double inPos, double inDistance,
+			 String inName, String inRole, Node inNode) {
+      index = inIndex;
+      pos = inPos;
+      distance = inDistance;
+      name = inName;
+      role = inRole;
+      node = inNode;
+    }
+    
+    public int compareTo(StopReference sr) {
+      if (this.index < sr.index)
+	return -1;
+      if (this.index > sr.index)
+	return 1;
+      if (this.pos < sr.pos)
+	return -1;
+      if (this.pos > sr.pos)
+	return 1;
+      return 0;
+    }
+  };
+  
+  private static JDialog jDialog = null;
+  private static JTabbedPane tabbedPane = null;
+  private static DefaultListModel dlm = null;
+  private static ItineraryTableModel itineraryData = null;
+  private static JTable itineraryTable = null;
+  private static StoplistTableModel stoplistData = null;
+  private static JTable stoplistTable = null;
+  private static JList rpJList = null;
+  private static JCheckBox cbRight = null;
+  private static JCheckBox cbLeft = null;
+  private static JTextField tfSuggestStopsLimit = null;
+  private static Vector< Relation > routes = new Vector< Relation >();
+  private static Relation currentRoute = null;
+  private static Vector< RelationMember > markedWays = new Vector< RelationMember >();
+  private static Vector< RelationMember > markedNodes = new Vector< RelationMember >();
+  
+  public RoutePatternAction() {
+    super(tr("Route patterns ..."), null,
+	  tr("Edit Route patterns for public transport"), null, true);
+  }
+
+  public void actionPerformed(ActionEvent event) {
+    Frame frame = JOptionPane.getFrameForComponent(Main.parent);
+    DataSet mainDataSet = Main.main.getCurrentDataSet();
+    
+    if (jDialog == null)
+    {
+      jDialog = new JDialog(frame, "Route Patterns", false);
+      tabbedPane = new JTabbedPane();
+      JPanel tabOverview = new JPanel();
+      tabbedPane.addTab(marktr("Overview"), tabOverview);
+      JPanel tabTags = new JPanel();
+      tabbedPane.addTab(marktr("Tags"), tabTags);
+      JPanel tabItinerary = new JPanel();
+      tabbedPane.addTab(marktr("Itinerary"), tabItinerary);
+      JPanel tabStoplist = new JPanel();
+      tabbedPane.addTab(marktr("Stops"), tabStoplist);
+      JPanel tabMeta = new JPanel();
+      tabbedPane.addTab(marktr("Meta"), tabMeta);
+      tabbedPane.setEnabledAt(0, true);
+      tabbedPane.setEnabledAt(1, false);
+      tabbedPane.setEnabledAt(2, false);
+      tabbedPane.setEnabledAt(3, false);
+      tabbedPane.setEnabledAt(4, false);
+      jDialog.add(tabbedPane);
+      
+      //Overview Tab
+      Container contentPane = tabOverview;
+      GridBagLayout gridbag = new GridBagLayout();
+      GridBagConstraints layoutCons = new GridBagConstraints();
+      contentPane.setLayout(gridbag);
+      
+      JLabel headline = new JLabel("Existing route patterns:");
+	
+      layoutCons.gridx = 0;
+      layoutCons.gridy = 0;
+      layoutCons.weightx = 0.0;
+      layoutCons.weighty = 0.0;
+      layoutCons.fill = GridBagConstraints.BOTH;
+      gridbag.setConstraints(headline, layoutCons);
+      contentPane.add(headline);
+	
+      dlm = new DefaultListModel();
+      rpJList = new JList(dlm);
+      JScrollPane rpListSP = new JScrollPane(rpJList);
+      String[] data = {"1", "2", "3", "4", "5", "6"};
+      dlm.copyInto(data);
+      rpJList.setSelectionMode(ListSelectionModel.SINGLE_SELECTION);
+      rpJList.addListSelectionListener(new RoutesLSL(this));
+      
+      layoutCons.gridx = 0;
+      layoutCons.gridy = 1;
+      layoutCons.weightx = 1.0;
+      layoutCons.weighty = 1.0;
+      layoutCons.fill = GridBagConstraints.BOTH;
+      gridbag.setConstraints(rpListSP, layoutCons);
+      contentPane.add(rpListSP);
+	
+      JButton bRefresh = new JButton("Refresh");
+      bRefresh.setActionCommand("routePattern.refresh");
+      bRefresh.addActionListener(this);
+	
+      layoutCons.gridx = 0;
+      layoutCons.gridy = 2;
+      layoutCons.weightx = 1.0;
+      layoutCons.weighty = 0.0;
+      layoutCons.fill = GridBagConstraints.BOTH;
+      gridbag.setConstraints(bRefresh, layoutCons);
+      contentPane.add(bRefresh);
+	
+      //Itinerary Tab
+      contentPane = tabItinerary;
+      gridbag = new GridBagLayout();
+      layoutCons = new GridBagConstraints();
+      contentPane.setLayout(gridbag);
+      
+      itineraryTable = new JTable();
+      itineraryData = new ItineraryTableModel();
+      itineraryData.addColumn("Name/Id");
+      itineraryData.addColumn("Role");
+      itineraryTable.setModel(itineraryData);
+      JScrollPane tableSP = new JScrollPane(itineraryTable);
+      JComboBox comboBox = new JComboBox();
+      comboBox.addItem("");
+      comboBox.addItem("forward");
+      comboBox.addItem("backward");
+      itineraryTable.getColumnModel().getColumn(1)
+	  .setCellEditor(new DefaultCellEditor(comboBox));
+      itineraryData.addTableModelListener(new ItineraryTableModelListener());
+      
+      layoutCons.gridx = 0;
+      layoutCons.gridy = 0;
+      layoutCons.gridwidth = 3;
+      layoutCons.weightx = 1.0;
+      layoutCons.weighty = 1.0;
+      layoutCons.fill = GridBagConstraints.BOTH;
+      gridbag.setConstraints(tableSP, layoutCons);
+      contentPane.add(tableSP);
+	
+      JButton bShow = new JButton("Show");
+      bShow.setActionCommand("routePattern.itineraryShow");
+      bShow.addActionListener(this);
+	
+      layoutCons.gridx = 0;
+      layoutCons.gridy = 1;
+      layoutCons.gridwidth = 1;
+      layoutCons.weightx = 1.0;
+      layoutCons.weighty = 0.0;
+      layoutCons.fill = GridBagConstraints.BOTH;
+      gridbag.setConstraints(bShow, layoutCons);
+      contentPane.add(bShow);
+	
+      JButton bMark = new JButton("Mark");
+      bMark.setActionCommand("routePattern.itineraryMark");
+      bMark.addActionListener(this);
+	
+      layoutCons.gridx = 0;
+      layoutCons.gridy = 2;
+      layoutCons.gridwidth = 1;
+      layoutCons.weightx = 1.0;
+      layoutCons.weighty = 0.0;
+      layoutCons.fill = GridBagConstraints.BOTH;
+      gridbag.setConstraints(bMark, layoutCons);
+      contentPane.add(bMark);
+	
+      JButton bAdd = new JButton("Add");
+      bAdd.setActionCommand("routePattern.itineraryAdd");
+      bAdd.addActionListener(this);
+	
+      layoutCons.gridx = 1;
+      layoutCons.gridy = 1;
+      layoutCons.gridwidth = 1;
+      layoutCons.weightx = 1.0;
+      layoutCons.weighty = 0.0;
+      layoutCons.fill = GridBagConstraints.BOTH;
+      gridbag.setConstraints(bAdd, layoutCons);
+      contentPane.add(bAdd);
+	
+      JButton bDelete = new JButton("Delete");
+      bDelete.setActionCommand("routePattern.itineraryDelete");
+      bDelete.addActionListener(this);
+	
+      layoutCons.gridx = 1;
+      layoutCons.gridy = 2;
+      layoutCons.gridwidth = 1;
+      layoutCons.weightx = 1.0;
+      layoutCons.weighty = 0.0;
+      layoutCons.fill = GridBagConstraints.BOTH;
+      gridbag.setConstraints(bDelete, layoutCons);
+      contentPane.add(bDelete);
+	
+      JButton bSort = new JButton("Sort");
+      bSort.setActionCommand("routePattern.itinerarySort");
+      bSort.addActionListener(this);
+	
+      layoutCons.gridx = 2;
+      layoutCons.gridy = 1;
+      layoutCons.gridwidth = 1;
+      layoutCons.weightx = 1.0;
+      layoutCons.weighty = 0.0;
+      layoutCons.fill = GridBagConstraints.BOTH;
+      gridbag.setConstraints(bSort, layoutCons);
+      contentPane.add(bSort);
+	
+      JButton bReflect = new JButton("Reflect");
+      bReflect.setActionCommand("routePattern.itineraryReflect");
+      bReflect.addActionListener(this);
+      
+      layoutCons.gridx = 2;
+      layoutCons.gridy = 2;
+      layoutCons.gridwidth = 1;
+      layoutCons.weightx = 1.0;
+      layoutCons.weighty = 0.0;
+      layoutCons.fill = GridBagConstraints.BOTH;
+      gridbag.setConstraints(bReflect, layoutCons);
+      contentPane.add(bReflect);
+	
+      //Stoplist Tab
+      contentPane = tabStoplist;
+      gridbag = new GridBagLayout();
+      layoutCons = new GridBagConstraints();
+      contentPane.setLayout(gridbag);
+      
+      stoplistTable = new JTable();
+      stoplistData = new StoplistTableModel();
+      stoplistData.addColumn("Name/Id");
+      stoplistData.addColumn("Role");
+      stoplistTable.setModel(stoplistData);
+      /*JScrollPane*/ tableSP = new JScrollPane(stoplistTable);
+      /*JComboBox*/ comboBox = new JComboBox();
+      comboBox.addItem("");
+      comboBox.addItem("forward");
+      comboBox.addItem("backward");
+      stoplistTable.getColumnModel().getColumn(1)
+	  .setCellEditor(new DefaultCellEditor(comboBox));
+      stoplistData.addTableModelListener(new StoplistTableModelListener());
+      
+      layoutCons.gridx = 0;
+      layoutCons.gridy = 0;
+      layoutCons.gridwidth = 3;
+      layoutCons.weightx = 1.0;
+      layoutCons.weighty = 1.0;
+      layoutCons.fill = GridBagConstraints.BOTH;
+      gridbag.setConstraints(tableSP, layoutCons);
+      contentPane.add(tableSP);
+	
+      /*JButton*/ bShow = new JButton("Show");
+      bShow.setActionCommand("routePattern.stoplistShow");
+      bShow.addActionListener(this);
+	
+      layoutCons.gridx = 0;
+      layoutCons.gridy = 1;
+      layoutCons.gridwidth = 1;
+      layoutCons.weightx = 1.0;
+      layoutCons.weighty = 0.0;
+      layoutCons.fill = GridBagConstraints.BOTH;
+      gridbag.setConstraints(bShow, layoutCons);
+      contentPane.add(bShow);
+	
+      /*JButton*/ bMark = new JButton("Mark");
+      bMark.setActionCommand("routePattern.stoplistMark");
+      bMark.addActionListener(this);
+	
+      layoutCons.gridx = 0;
+      layoutCons.gridy = 2;
+      layoutCons.gridwidth = 1;
+      layoutCons.weightx = 1.0;
+      layoutCons.weighty = 0.0;
+      layoutCons.fill = GridBagConstraints.BOTH;
+      gridbag.setConstraints(bMark, layoutCons);
+      contentPane.add(bMark);
+	
+      /*JButton*/ bAdd = new JButton("Add");
+      bAdd.setActionCommand("routePattern.stoplistAdd");
+      bAdd.addActionListener(this);
+	
+      layoutCons.gridx = 1;
+      layoutCons.gridy = 1;
+      layoutCons.gridwidth = 1;
+      layoutCons.weightx = 1.0;
+      layoutCons.weighty = 0.0;
+      layoutCons.fill = GridBagConstraints.BOTH;
+      gridbag.setConstraints(bAdd, layoutCons);
+      contentPane.add(bAdd);
+	
+      /*JButton*/ bDelete = new JButton("Delete");
+      bDelete.setActionCommand("routePattern.stoplistDelete");
+      bDelete.addActionListener(this);
+	
+      layoutCons.gridx = 1;
+      layoutCons.gridy = 2;
+      layoutCons.gridwidth = 1;
+      layoutCons.weightx = 1.0;
+      layoutCons.weighty = 0.0;
+      layoutCons.fill = GridBagConstraints.BOTH;
+      gridbag.setConstraints(bDelete, layoutCons);
+      contentPane.add(bDelete);
+	
+      /*JButton*/ bSort = new JButton("Sort");
+      bSort.setActionCommand("routePattern.stoplistSort");
+      bSort.addActionListener(this);
+	
+      layoutCons.gridx = 2;
+      layoutCons.gridy = 1;
+      layoutCons.gridwidth = 1;
+      layoutCons.weightx = 1.0;
+      layoutCons.weighty = 0.0;
+      layoutCons.fill = GridBagConstraints.BOTH;
+      gridbag.setConstraints(bSort, layoutCons);
+      contentPane.add(bSort);
+	
+      /*JButton*/ bReflect = new JButton("Reflect");
+      bReflect.setActionCommand("routePattern.stoplistReflect");
+      bReflect.addActionListener(this);
+      
+      layoutCons.gridx = 2;
+      layoutCons.gridy = 2;
+      layoutCons.gridwidth = 1;
+      layoutCons.weightx = 1.0;
+      layoutCons.weighty = 0.0;
+      layoutCons.fill = GridBagConstraints.BOTH;
+      gridbag.setConstraints(bReflect, layoutCons);
+      contentPane.add(bReflect);
+	
+      //Meta Tab
+      contentPane = tabMeta;
+      gridbag = new GridBagLayout();
+      layoutCons = new GridBagConstraints();
+      contentPane.setLayout(gridbag);
+      
+      JLabel rightleft = new JLabel("Stops are possible on the");
+      
+      layoutCons.gridx = 0;
+      layoutCons.gridy = 1;
+      layoutCons.gridwidth = 2;
+      layoutCons.weightx = 0.0;
+      layoutCons.weighty = 0.0;
+      layoutCons.fill = GridBagConstraints.BOTH;
+      gridbag.setConstraints(rightleft, layoutCons);
+      contentPane.add(rightleft);
+	
+      cbRight = new JCheckBox("right hand side", true);
+      
+      layoutCons.gridx = 0;
+      layoutCons.gridy = 2;
+      layoutCons.gridwidth = 2;
+      layoutCons.weightx = 0.0;
+      layoutCons.weighty = 0.0;
+      layoutCons.fill = GridBagConstraints.BOTH;
+      gridbag.setConstraints(cbRight, layoutCons);
+      contentPane.add(cbRight);
+	
+      cbLeft = new JCheckBox("left hand side", false);
+      
+      layoutCons.gridx = 0;
+      layoutCons.gridy = 3;
+      layoutCons.gridwidth = 2;
+      layoutCons.weightx = 0.0;
+      layoutCons.weighty = 0.0;
+      layoutCons.fill = GridBagConstraints.BOTH;
+      gridbag.setConstraints(cbLeft, layoutCons);
+      contentPane.add(cbLeft);
+      
+      JLabel maxdist = new JLabel("Maximum distance from route");
+      
+      layoutCons.gridx = 0;
+      layoutCons.gridy = 4;
+      layoutCons.gridwidth = 2;
+      layoutCons.weightx = 0.0;
+      layoutCons.weighty = 0.0;
+      layoutCons.fill = GridBagConstraints.BOTH;
+      gridbag.setConstraints(maxdist, layoutCons);
+      contentPane.add(maxdist);
+      
+      tfSuggestStopsLimit = new JTextField("20", 4);
+      
+      layoutCons.gridx = 0;
+      layoutCons.gridy = 5;
+      layoutCons.gridwidth = 1;
+      layoutCons.weightx = 0.0;
+      layoutCons.weighty = 0.0;
+      layoutCons.fill = GridBagConstraints.BOTH;
+      gridbag.setConstraints(tfSuggestStopsLimit, layoutCons);
+      contentPane.add(tfSuggestStopsLimit);
+      
+      JLabel meters = new JLabel("meters");
+      
+      layoutCons.gridx = 1;
+      layoutCons.gridy = 5;
+      layoutCons.gridwidth = 1;
+      layoutCons.weightx = 0.0;
+      layoutCons.weighty = 0.0;
+      layoutCons.fill = GridBagConstraints.BOTH;
+      gridbag.setConstraints(meters, layoutCons);
+      contentPane.add(meters);
+      
+      JButton bSuggestStops = new JButton("Suggest Stops");
+      bSuggestStops.setActionCommand("routePattern.metaSuggestStops");
+      bSuggestStops.addActionListener(this);
+	
+      layoutCons.gridx = 0;
+      layoutCons.gridy = 6;
+      layoutCons.gridwidth = 3;
+      layoutCons.weightx = 1.0;
+      layoutCons.weighty = 0.0;
+      layoutCons.fill = GridBagConstraints.BOTH;
+      gridbag.setConstraints(bSuggestStops, layoutCons);
+      contentPane.add(bSuggestStops);
+	
+      jDialog.pack();
+    }
+      
+    if ("routePattern.refresh".equals(event.getActionCommand()))
+    {
+      refreshData();
+    }
+    else if ("routePattern.itineraryShow".equals(event.getActionCommand()))
+    {
+      BoundingXYVisitor box = new BoundingXYVisitor();
+      if (itineraryTable.getSelectedRowCount() > 0)
+      {
+	for (int i = 0; i < itineraryData.getRowCount(); ++i)
+	{
+	  if ((itineraryTable.isRowSelected(i)) && (itineraryData.ways.elementAt(i) != null))
+	  {
+	    itineraryData.ways.elementAt(i).visit(box);
+	  }
+	}
+      }
+      else
+      {
+	for (int i = 0; i < itineraryData.getRowCount(); ++i)
+	{
+	  if (itineraryData.ways.elementAt(i) != null)
+	  {
+	    itineraryData.ways.elementAt(i).visit(box);
+	  }
+	}
+      }
+      if (box.getBounds() == null)
+	return;
+      box.enlargeBoundingBox();
+      Main.map.mapView.recalculateCenterScale(box);
+    }
+    else if ("routePattern.itineraryMark".equals(event.getActionCommand()))
+    {
+      OsmPrimitive[] osmp = { null };
+      Main.main.getCurrentDataSet().setSelected(osmp);
+      markedWays.clear();
+      if (itineraryTable.getSelectedRowCount() > 0)
+      {
+	for (int i = 0; i < itineraryData.getRowCount(); ++i)
+	{
+	  if ((itineraryTable.isRowSelected(i)) && (itineraryData.ways.elementAt(i) != null))
+	  {
+	    mainDataSet.addSelected(itineraryData.ways.elementAt(i));
+	    
+	    RelationMember markedWay = new RelationMember
+		((String)(itineraryData.getValueAt(i, 1)), itineraryData.ways.elementAt(i));
+	    markedWays.addElement(markedWay);
+	  }
+	}
+      }
+      else
+      {
+	for (int i = 0; i < itineraryData.getRowCount(); ++i)
+	{
+	  if (itineraryData.ways.elementAt(i) != null)
+	  {
+	    mainDataSet.addSelected(itineraryData.ways.elementAt(i));
+	    
+	    RelationMember markedWay = new RelationMember
+		((String)(itineraryData.getValueAt(i, 1)), itineraryData.ways.elementAt(i));
+	    markedWays.addElement(markedWay);
+	  }
+	}
+      }
+    }
+    else if ("routePattern.itineraryAdd".equals(event.getActionCommand()))
+    {
+      int insPos = itineraryTable.getSelectedRow();
+      Iterator<RelationMember> relIter = markedWays.iterator();
+      TreeSet<Way> addedWays = new TreeSet<Way>();
+      if (mainDataSet == null)
+	return;
+      
+      while (relIter.hasNext())
+      {
+	RelationMember curMember = relIter.next();
+	if ((curMember.isWay()) && (mainDataSet.isSelected(curMember.getWay())))
+	{
+	  itineraryData.insertRow(insPos, curMember.getWay(), curMember.getRole());
+	  if (insPos >= 0)
+	    ++insPos;
+	  
+	  addedWays.add(curMember.getWay());
+	}
+      }
+      
+      Collection<Way> selectedWays = mainDataSet.getSelectedWays();
+      Iterator<Way> wayIter = selectedWays.iterator();
+      
+      while (wayIter.hasNext())
+      {
+	Way curMember = wayIter.next();
+	if (!(addedWays.contains(curMember)))
+	{
+	  itineraryData.insertRow(insPos, curMember, "");
+	  if (insPos >= 0)
+	    ++insPos;
+	}
+      }
+      
+      if ((insPos > 0) && (insPos < itineraryData.getRowCount()))
+      {
+	while ((insPos < itineraryData.getRowCount())
+		       && (itineraryData.ways.elementAt(insPos) == null))
+	  ++insPos;
+	itineraryTable.removeRowSelectionInterval(0, itineraryData.getRowCount()-1);
+	if (insPos < itineraryData.getRowCount())
+	  itineraryTable.addRowSelectionInterval(insPos, insPos);
+      }
+
+      cleanupGaps();
+      rebuildWays();
+    }
+    else if ("routePattern.itineraryDelete".equals(event.getActionCommand()))
+    {
+      for (int i = itineraryData.getRowCount()-1; i >=0; --i)
+      {
+	if ((itineraryTable.isRowSelected(i)) && (itineraryData.ways.elementAt(i) != null))
+	{
+	  itineraryData.ways.removeElementAt(i);
+	  itineraryData.removeRow(i);
+	}
+      }
+    
+      cleanupGaps();
+      rebuildWays();
+    }
+    else if ("routePattern.itinerarySort".equals(event.getActionCommand()))
+    {
+      TreeSet<Way> usedWays = new TreeSet<Way>();
+      TreeMap<Node, LinkedList<RelationMember> > frontNodes =
+	  new TreeMap<Node, LinkedList<RelationMember> >();
+      TreeMap<Node, LinkedList<RelationMember> > backNodes =
+	  new TreeMap<Node, LinkedList<RelationMember> >();
+      Vector< LinkedList<RelationMember> > loops =
+	  new Vector< LinkedList<RelationMember> >();
+      int insPos = itineraryTable.getSelectedRow();
+      
+      if (itineraryTable.getSelectedRowCount() > 0)
+      {
+	for (int i = itineraryData.getRowCount()-1; i >=0; --i)
+	{
+	  if ((itineraryTable.isRowSelected(i)) && (itineraryData.ways.elementAt(i) != null))
+	  {
+	    if (!(usedWays.contains(itineraryData.ways.elementAt(i))))
+	    {
+	      addWayToSortingData
+		  (itineraryData.ways.elementAt(i), frontNodes, backNodes, loops);
+	      usedWays.add(itineraryData.ways.elementAt(i));
+	    }
+	    
+	    itineraryData.ways.removeElementAt(i);
+	    itineraryData.removeRow(i);
+	  }
+	}
+      }
+      else
+      {
+	for (int i = itineraryData.getRowCount()-1; i >=0; --i)
+	{
+	  if (itineraryData.ways.elementAt(i) != null)
+	  {
+	    if (!(usedWays.contains(itineraryData.ways.elementAt(i))))
+	    {
+	      addWayToSortingData
+		  (itineraryData.ways.elementAt(i), frontNodes, backNodes, loops);
+	      usedWays.add(itineraryData.ways.elementAt(i));
+	    }
+	  }
+	}
+	
+	itineraryData.clear();
+      }
+
+      Iterator< Map.Entry< Node, LinkedList<RelationMember> > > entryIter
+	  = frontNodes.entrySet().iterator();
+      while (entryIter.hasNext())
+      {
+	Iterator<RelationMember> relIter = entryIter.next().getValue().iterator();
+	while (relIter.hasNext())
+	{
+	  RelationMember curMember = relIter.next();
+	  itineraryData.insertRow(insPos, curMember.getWay(), curMember.getRole());
+	  if (insPos >= 0)
+	    ++insPos;
+	}
+      }
+      
+      Iterator< LinkedList<RelationMember> > listIter = loops.iterator();
+      while (listIter.hasNext())
+      {
+	Iterator<RelationMember> relIter = listIter.next().iterator();
+	while (relIter.hasNext())
+	{
+	  RelationMember curMember = relIter.next();
+	  itineraryData.insertRow(insPos, curMember.getWay(), curMember.getRole());
+	  if (insPos >= 0)
+	    ++insPos;
+	}
+      }
+      
+      cleanupGaps();
+      rebuildWays();
+    }
+    else if ("routePattern.itineraryReflect".equals(event.getActionCommand()))
+    {
+      Vector<RelationMember> itemsToReflect = new Vector<RelationMember>();
+      int insPos = itineraryTable.getSelectedRow();
+      
+      if (itineraryTable.getSelectedRowCount() > 0)
+      {
+	for (int i = itineraryData.getRowCount()-1; i >=0; --i)
+	{
+	  if ((itineraryTable.isRowSelected(i)) && (itineraryData.ways.elementAt(i) != null))
+	  {
+	    String role = (String)(itineraryData.getValueAt(i, 1));
+	    if ("backward".equals(role))
+	      role = "forward";
+	    else if ("forward".equals(role))
+	      role = "backward";
+	    else
+	      role = "backward";
+	    RelationMember markedWay = new RelationMember
+		(role, itineraryData.ways.elementAt(i));
+	    itemsToReflect.addElement(markedWay);
+	    
+	    itineraryData.ways.removeElementAt(i);
+	    itineraryData.removeRow(i);
+	  }
+	}
+      }
+      else
+      {
+	for (int i = itineraryData.getRowCount()-1; i >=0; --i)
+	{
+	  if (itineraryData.ways.elementAt(i) != null)
+	  {
+	    String role = (String)(itineraryData.getValueAt(i, 1));
+	    if ("backward".equals(role))
+	      role = "forward";
+	    else if ("forward".equals(role))
+	      role = "backward";
+	    else
+	      role = "backward";
+	    RelationMember markedWay = new RelationMember
+		(role, itineraryData.ways.elementAt(i));
+	    itemsToReflect.addElement(markedWay);
+	  }
+	}
+	
+	itineraryData.clear();
+      }
+
+      int startPos = insPos;
+      Iterator<RelationMember> relIter = itemsToReflect.iterator();
+      while (relIter.hasNext())
+      {
+	RelationMember curMember = relIter.next();
+	if (curMember.isWay())
+	{
+	  itineraryData.insertRow(insPos, curMember.getWay(), curMember.getRole());
+	  if (insPos >= 0)
+	    ++insPos;
+	}
+      }
+      if (insPos >= 0)
+	itineraryTable.addRowSelectionInterval(startPos, insPos-1);
+      
+      cleanupGaps();
+      rebuildWays();
+    }
+    else if ("routePattern.stoplistShow".equals(event.getActionCommand()))
+    {
+      BoundingXYVisitor box = new BoundingXYVisitor();
+      if (stoplistTable.getSelectedRowCount() > 0)
+      {
+	for (int i = 0; i < stoplistData.getRowCount(); ++i)
+	{
+	  if (stoplistTable.isRowSelected(i))
+	  {
+	    stoplistData.nodes.elementAt(i).visit(box);
+	  }
+	}
+      }
+      else
+      {
+	for (int i = 0; i < stoplistData.getRowCount(); ++i)
+	{
+	  stoplistData.nodes.elementAt(i).visit(box);
+	}
+      }
+      if (box.getBounds() == null)
+	return;
+      box.enlargeBoundingBox();
+      Main.map.mapView.recalculateCenterScale(box);
+    }
+    else if ("routePattern.stoplistMark".equals(event.getActionCommand()))
+    {
+      OsmPrimitive[] osmp = { null };
+      Main.main.getCurrentDataSet().setSelected(osmp);
+      markedNodes.clear();
+      if (stoplistTable.getSelectedRowCount() > 0)
+      {
+	for (int i = 0; i < stoplistData.getRowCount(); ++i)
+	{
+	  if (stoplistTable.isRowSelected(i))
+	  {
+	    mainDataSet.addSelected(stoplistData.nodes.elementAt(i));
+	    
+	    RelationMember markedNode = new RelationMember
+		((String)(stoplistData.getValueAt(i, 1)), stoplistData.nodes.elementAt(i));
+	    markedNodes.addElement(markedNode);
+	  }
+	}
+      }
+      else
+      {
+	for (int i = 0; i < stoplistData.getRowCount(); ++i)
+	{
+	  mainDataSet.addSelected(stoplistData.nodes.elementAt(i));
+	    
+	  RelationMember markedNode = new RelationMember
+	      ((String)(stoplistData.getValueAt(i, 1)), stoplistData.nodes.elementAt(i));
+	  markedNodes.addElement(markedNode);
+	}
+      }
+    }
+    else if ("routePattern.stoplistAdd".equals(event.getActionCommand()))
+    {
+      int insPos = stoplistTable.getSelectedRow();
+      Iterator<RelationMember> relIter = markedNodes.iterator();
+      TreeSet<Node> addedNodes = new TreeSet<Node>();
+      if (mainDataSet == null)
+	return;
+      
+      while (relIter.hasNext())
+      {
+	RelationMember curMember = relIter.next();
+	if ((curMember.isNode()) && (mainDataSet.isSelected(curMember.getNode())))
+	{
+	  stoplistData.insertRow(insPos, curMember.getNode(), curMember.getRole());
+	  if (insPos >= 0)
+	    ++insPos;
+	  
+	  addedNodes.add(curMember.getNode());
+	}
+      }
+      
+      Collection<Node> selectedNodes = mainDataSet.getSelectedNodes();
+      Iterator<Node> nodeIter = selectedNodes.iterator();
+      
+      while (nodeIter.hasNext())
+      {
+	Node curMember = nodeIter.next();
+	if (!(addedNodes.contains(curMember)))
+	{
+	  stoplistData.insertRow(insPos, curMember, "");
+	  if (insPos >= 0)
+	    ++insPos;
+	}
+      }
+      
+      if ((insPos > 0) && (insPos < stoplistData.getRowCount()))
+      {
+	while ((insPos < stoplistData.getRowCount())
+		       && (stoplistData.nodes.elementAt(insPos) == null))
+	  ++insPos;
+	stoplistTable.removeRowSelectionInterval(0, stoplistData.getRowCount()-1);
+	if (insPos < stoplistData.getRowCount())
+	  stoplistTable.addRowSelectionInterval(insPos, insPos);
+      }
+
+      rebuildNodes();
+    }
+    else if ("routePattern.stoplistDelete".equals(event.getActionCommand()))
+    {
+      for (int i = stoplistData.getRowCount()-1; i >=0; --i)
+      {
+	if (stoplistTable.isRowSelected(i))
+	{
+	  stoplistData.nodes.removeElementAt(i);
+	  stoplistData.removeRow(i);
+	}
+      }
+    
+      rebuildNodes();
+    }
+    else if ("routePattern.stoplistSort".equals(event.getActionCommand()))
+    {
+      // Prepare Segments: The segments of all usable ways are arranged in a linear
+      // list such that a coor can directly be checked concerning position and offset
+      Vector<SegmentMetric> segmentMetrics = new Vector<SegmentMetric>();
+      for (int i = 0; i < itineraryData.getRowCount(); ++i)
+      {
+	if (itineraryData.ways.elementAt(i) != null)
+	{
+	  Way way = itineraryData.ways.elementAt(i);
+	  if (!(way.isIncomplete()))
+	  {
+	    if ("backward".equals((String)(itineraryData.getValueAt(i, 1))))
+	    {
+	      for (int j = way.getNodesCount()-2; j >= 0; --j)
+	      {
+		SegmentMetric sm = new SegmentMetric
+		    (way.getNode(j+1).getCoor().lat(), way.getNode(j+1).getCoor().lon(),
+		     way.getNode(j).getCoor().lat(), way.getNode(j).getCoor().lon());
+		segmentMetrics.add(sm);
+	      }
+	    }
+	    else
+	    {
+	      for (int j = 0; j < way.getNodesCount()-1; ++j)
+	      {
+		SegmentMetric sm = new SegmentMetric
+		    (way.getNode(j).getCoor().lat(), way.getNode(j).getCoor().lon(),
+		     way.getNode(j+1).getCoor().lat(), way.getNode(j+1).getCoor().lon());
+		segmentMetrics.add(sm);
+	      }
+	    }
+	  }
+	}
+	else
+	{
+	  segmentMetrics.add(null);
+	}
+      }
+      
+      Vector< StopReference > srm = new Vector< StopReference >();
+      int insPos = stoplistTable.getSelectedRow();
+      if (stoplistTable.getSelectedRowCount() > 0)
+      {
+        // Determine for each member its position on the itinerary: position means here the
+        // point on the itinerary that has minimal distance to the coor
+	for (int i = stoplistData.getRowCount()-1; i >= 0; --i)
+	{
+	  if (stoplistTable.isRowSelected(i))
+	  {
+	    StopReference sr = detectMinDistance
+		(stoplistData.nodes.elementAt(i), segmentMetrics,
+		 cbRight.isSelected(), cbLeft.isSelected());
+	    if (sr != null)
+	    {
+	      if (sr.distance <
+			 Double.parseDouble(tfSuggestStopsLimit.getText()) * 9.0 / 1000000.0 )
+	      {
+		sr.role = (String)stoplistData.getValueAt(i, 1);
+		srm.addElement(sr);
+	      }
+	      else
+	      {
+		sr.role = (String)stoplistData.getValueAt(i, 1);
+		sr.index = segmentMetrics.size()*2;
+		sr.pos = 0;
+		srm.addElement(sr);
+	      }
+	      
+	      stoplistData.nodes.removeElementAt(i);
+	      stoplistData.removeRow(i);
+	    }
+	  
+	  }
+	}
+      }
+      else
+      {
+	// Determine for each member its position on the itinerary: position means here the
+        // point on the itinerary that has minimal distance to the coor
+	for (int i = stoplistData.getRowCount()-1; i >= 0; --i)
+	{
+	  StopReference sr = detectMinDistance
+	      (stoplistData.nodes.elementAt(i), segmentMetrics,
+	       cbRight.isSelected(), cbLeft.isSelected());
+	  if (sr != null)
+	  {
+	    if (sr.distance <
+		       Double.parseDouble(tfSuggestStopsLimit.getText()) * 9.0 / 1000000.0 )
+	    {
+	      sr.role = (String)stoplistData.getValueAt(i, 1);
+	      srm.addElement(sr);
+	    }
+	    else
+	    {
+	      sr.role = (String)stoplistData.getValueAt(i, 1);
+	      sr.index = segmentMetrics.size()*2;
+	      sr.pos = 0;
+	      srm.addElement(sr);
+	    }
+	  }
+	}
+      
+	stoplistData.clear();
+      }
+
+      Collections.sort(srm);
+      
+      for (int i = 0; i < srm.size(); ++i)
+      {
+	stoplistData.insertRow(insPos, srm.elementAt(i).node, srm.elementAt(i).role);
+	if (insPos >= 0)
+	  ++insPos;
+      }
+      
+      rebuildNodes();
+    }
+    else if ("routePattern.stoplistReflect".equals(event.getActionCommand()))
+    {
+      Vector<RelationMember> itemsToReflect = new Vector<RelationMember>();
+      int insPos = stoplistTable.getSelectedRow();
+      
+      if (stoplistTable.getSelectedRowCount() > 0)
+      {
+	for (int i = stoplistData.getRowCount()-1; i >=0; --i)
+	{
+	  if (stoplistTable.isRowSelected(i))
+	  {
+	    String role = (String)(stoplistData.getValueAt(i, 1));
+	    RelationMember markedNode = new RelationMember
+		(role, stoplistData.nodes.elementAt(i));
+	    itemsToReflect.addElement(markedNode);
+	    
+	    stoplistData.nodes.removeElementAt(i);
+	    stoplistData.removeRow(i);
+	  }
+	}
+      }
+      else
+      {
+	for (int i = stoplistData.getRowCount()-1; i >=0; --i)
+	{
+	  String role = (String)(stoplistData.getValueAt(i, 1));
+	  RelationMember markedNode = new RelationMember
+	      (role, stoplistData.nodes.elementAt(i));
+	  itemsToReflect.addElement(markedNode);
+	}
+	
+	stoplistData.clear();
+      }
+
+      int startPos = insPos;
+      Iterator<RelationMember> relIter = itemsToReflect.iterator();
+      while (relIter.hasNext())
+      {
+	RelationMember curMember = relIter.next();
+	if (curMember.isNode())
+	{
+	  stoplistData.insertRow(insPos, curMember.getNode(), curMember.getRole());
+	  if (insPos >= 0)
+	    ++insPos;
+	}
+      }
+      if (insPos >= 0)
+	stoplistTable.addRowSelectionInterval(startPos, insPos-1);
+      
+      rebuildNodes();
+    }
+    else if ("routePattern.metaSuggestStops".equals(event.getActionCommand()))
+    {
+      // Prepare Segments: The segments of all usable ways are arranged in a linear
+      // list such that a coor can directly be checked concerning position and offset
+      Vector<SegmentMetric> segmentMetrics = new Vector<SegmentMetric>();
+      for (int i = 0; i < itineraryData.getRowCount(); ++i)
+      {
+	if (itineraryData.ways.elementAt(i) != null)
+	{
+	  Way way = itineraryData.ways.elementAt(i);
+	  if (!(way.isIncomplete()))
+	  {
+	    if ("backward".equals((String)(itineraryData.getValueAt(i, 1))))
+	    {
+	      for (int j = way.getNodesCount()-2; j >= 0; --j)
+	      {
+		SegmentMetric sm = new SegmentMetric
+		    (way.getNode(j+1).getCoor().lat(), way.getNode(j+1).getCoor().lon(),
+		     way.getNode(j).getCoor().lat(), way.getNode(j).getCoor().lon());
+		segmentMetrics.add(sm);
+	      }
+	    }
+	    else
+	    {
+	      for (int j = 0; j < way.getNodesCount()-1; ++j)
+	      {
+		SegmentMetric sm = new SegmentMetric
+		    (way.getNode(j).getCoor().lat(), way.getNode(j).getCoor().lon(),
+		     way.getNode(j+1).getCoor().lat(), way.getNode(j+1).getCoor().lon());
+		segmentMetrics.add(sm);
+	      }
+	    }
+	  }
+	}
+	else
+	{
+	  segmentMetrics.add(null);
+	}
+      }
+      
+      Vector< StopReference > srm = new Vector< StopReference >();
+      // Determine for each member its position on the itinerary: position means here the
+      // point on the itinerary that has minimal distance to the coor
+      mainDataSet = Main.main.getCurrentDataSet();
+      if (mainDataSet != null)
+      {
+	Collection< Node > nodeCollection = mainDataSet.getNodes();
+	Iterator< Node > nodeIter = nodeCollection.iterator();
+	while (nodeIter.hasNext())
+	{
+	  Node currentNode = nodeIter.next();
+	  if ("bus_stop".equals(currentNode.get("highway")))
+	  {
+	    StopReference sr = detectMinDistance
+		(currentNode, segmentMetrics,
+		 cbRight.isSelected(), cbLeft.isSelected());
+	    if ((sr != null) && (sr.distance < 
+			Double.parseDouble(tfSuggestStopsLimit.getText()) * 9.0 / 1000000.0 ))
+	      srm.addElement(sr);
+	  }
+	}
+      }
+      else
+      {
+	JOptionPane.showMessageDialog(null, "There exists no dataset."
+	    + " Try to download data from the server or open an OSM file.",
+     "No data found", JOptionPane.ERROR_MESSAGE);
+      
+	System.out.println("Public Transport: No data found");
+      }
+      
+      for (int i = 0; i < stoplistData.getRowCount(); ++i)
+      {
+      }
+
+      Collections.sort(srm);
+      
+      stoplistData.clear();
+      for (int i = 0; i < srm.size(); ++i)
+      {
+	stoplistData.addRow(srm.elementAt(i).node, srm.elementAt(i).role);
+      }
+      
+      rebuildNodes();
+    }
+    else
+    {
+      refreshData();
+      
+      jDialog.setLocationRelativeTo(frame);
+      jDialog.setVisible(true);
+    }
+  }
+  
+  private void refreshData() {
+    dlm.clear();
+	
+    DataSet mainDataSet = Main.main.getCurrentDataSet();
+    if (mainDataSet != null)
+    {
+      routes.clear();
+      Vector<String> rpLines = new Vector<String>();
+      Collection<Relation> relCollection = mainDataSet.getRelations();
+      Iterator<Relation> relIter = relCollection.iterator();
+      while (relIter.hasNext())
+      {
+	Relation currentRel = relIter.next();
+	String routeVal = currentRel.get("route");
+	if ("bus".equals(routeVal))
+	{
+	  routes.addElement(currentRel);
+	  String relDesc = currentRel.get("ref");
+	  if (relDesc == null)
+	    relDesc = "";
+	  relDesc = "bus: " + relDesc + " ["+ currentRel.getId() + "]";
+	  rpLines.addElement(relDesc);
+	}
+      }
+      Iterator<String> rplIter = rpLines.iterator();
+      while (rplIter.hasNext())
+      {
+	dlm.addElement(rplIter.next());
+      }
+    }
+    else
+    {
+      JOptionPane.showMessageDialog(null, "There exists no dataset."
+	  + " Try to download data from the server or open an OSM file.",
+   "No data found", JOptionPane.ERROR_MESSAGE);
+      
+      System.out.println("Public Transport: No data found");
+    }
+  }
+  
+  //Rebuild ways in the relation currentRoute
+  private void rebuildWays() {
+    currentRoute.setModified(true);
+    for (int i = currentRoute.getMembersCount()-1; i >=0; --i)
+    {
+      if (currentRoute.getMember(i).isWay())
+      {
+	currentRoute.removeMember(i);
+      }
+    }
+    for (int i = 0; i < itineraryData.getRowCount(); ++i)
+    {
+      if (itineraryData.ways.elementAt(i) != null)
+      {
+	RelationMember member = new RelationMember
+	    ((String)(itineraryData.getValueAt(i, 1)), itineraryData.ways.elementAt(i));
+	currentRoute.addMember(member);
+      }
+    }
+  }
+  
+  //Rebuild nodes in the relation currentRoute
+  private void rebuildNodes() {
+    currentRoute.setModified(true);
+    for (int i = currentRoute.getMembersCount()-1; i >=0; --i)
+    {
+      if (currentRoute.getMember(i).isNode())
+      {
+	currentRoute.removeMember(i);
+      }
+    }
+    for (int i = 0; i < stoplistData.getRowCount(); ++i)
+    {
+      RelationMember member = new RelationMember
+	  ((String)(stoplistData.getValueAt(i, 1)), stoplistData.nodes.elementAt(i));
+      currentRoute.addMember(member);
+    }
+  }
+  
+  private void addWayToSortingData
+      (Way way, TreeMap<Node, LinkedList<RelationMember> > frontNodes,
+       TreeMap<Node, LinkedList<RelationMember> > backNodes,
+       Vector< LinkedList<RelationMember> > loops)
+  {
+    if (way.getNodesCount() < 1)
+      return;
+    
+    Node firstNode = way.getNode(0);
+    Node lastNode = way.getNode(way.getNodesCount() - 1);
+    
+    if (frontNodes.get(firstNode) != null)
+    {
+      LinkedList<RelationMember> list = frontNodes.get(firstNode);
+      list.addFirst(new RelationMember("backward", way));
+      frontNodes.remove(firstNode);
+      
+      Node lastListNode = null;
+      if ("backward".equals(list.getLast().getRole()))
+	lastListNode = list.getLast().getWay().getNode(0);
+      else
+	lastListNode = list.getLast().getWay().getNode
+	    (list.getLast().getWay().getNodesCount() - 1);
+      if (lastNode.equals(lastListNode))
+      {
+	backNodes.remove(lastListNode);
+	loops.add(list);
+      }
+      else if (frontNodes.get(lastNode) != null)
+      {
+	backNodes.remove(lastListNode);
+	LinkedList<RelationMember> listToAppend = frontNodes.get(lastNode);
+	Iterator<RelationMember> memberIter = list.iterator();
+	while (memberIter.hasNext())
+	{
+	  RelationMember member = memberIter.next();
+	  if ("backward".equals(member.getRole()))
+	    listToAppend.addFirst(new RelationMember("forward", member.getWay()));
+	  else
+	    listToAppend.addFirst(new RelationMember("backward", member.getWay()));
+	}
+	frontNodes.remove(lastNode);
+	frontNodes.put(lastListNode, listToAppend);
+      }
+      else if (backNodes.get(lastNode) != null)
+      {
+	backNodes.remove(lastListNode);
+	LinkedList<RelationMember> listToAppend = backNodes.get(lastNode);
+	Iterator<RelationMember> memberIter = list.iterator();
+	while (memberIter.hasNext())
+	{
+	  RelationMember member = memberIter.next();
+	  listToAppend.addLast(member);
+	}
+	backNodes.remove(lastNode);
+	backNodes.put(lastListNode, listToAppend);
+      }
+      else
+	frontNodes.put(lastNode, list);
+    }
+    else if (backNodes.get(firstNode) != null)
+    {
+      LinkedList<RelationMember> list = backNodes.get(firstNode);
+      list.addLast(new RelationMember("forward", way));
+      backNodes.remove(firstNode);
+      
+      Node firstListNode = null;
+      if ("backward".equals(list.getFirst().getRole()))
+	firstListNode = list.getFirst().getWay().getNode
+	    (list.getFirst().getWay().getNodesCount() - 1);
+      else
+	firstListNode = list.getFirst().getWay().getNode(0);
+      if (lastNode.equals(firstListNode))
+      {
+	frontNodes.remove(firstListNode);
+	loops.add(list);
+      }
+      else if (frontNodes.get(lastNode) != null)
+      {
+	frontNodes.remove(firstListNode);
+	LinkedList<RelationMember> listToAppend = frontNodes.get(lastNode);
+	Iterator<RelationMember> memberIter = list.descendingIterator();
+	while (memberIter.hasNext())
+	{
+	  RelationMember member = memberIter.next();
+	  listToAppend.addFirst(member);
+	}
+	frontNodes.remove(lastNode);
+	frontNodes.put(firstListNode, listToAppend);
+      }
+      else if (backNodes.get(lastNode) != null)
+      {
+	frontNodes.remove(firstListNode);
+	LinkedList<RelationMember> listToAppend = backNodes.get(lastNode);
+	Iterator<RelationMember> memberIter = list.descendingIterator();
+	while (memberIter.hasNext())
+	{
+	  RelationMember member = memberIter.next();
+	  if ("backward".equals(member.getRole()))
+	    listToAppend.addLast(new RelationMember("forward", member.getWay()));
+	  else
+	    listToAppend.addLast(new RelationMember("backward", member.getWay()));
+	}
+	backNodes.remove(lastNode);
+	backNodes.put(firstListNode, listToAppend);
+      }
+      else
+	backNodes.put(lastNode, list);
+    }
+    else if (frontNodes.get(lastNode) != null)
+    {
+      LinkedList<RelationMember> list = frontNodes.get(lastNode);
+      list.addFirst(new RelationMember("forward", way));
+      frontNodes.remove(lastNode);
+      frontNodes.put(firstNode, list);
+    }
+    else if (backNodes.get(lastNode) != null)
+    {
+      LinkedList<RelationMember> list = backNodes.get(lastNode);
+      list.addLast(new RelationMember("backward", way));
+      backNodes.remove(lastNode);
+      backNodes.put(firstNode, list);
+    }
+    else
+    {
+      LinkedList<RelationMember> newList = new LinkedList<RelationMember>();
+      newList.add(new RelationMember("forward", way));
+      frontNodes.put(firstNode, newList);
+      backNodes.put(lastNode, newList);
+    }
+  }
+  
+  private void routesSelectionChanged() {
+    int selectedPos = rpJList.getAnchorSelectionIndex();
+    if (rpJList.isSelectedIndex(selectedPos))
+    {
+      currentRoute = routes.elementAt(selectedPos);
+      tabbedPane.setEnabledAt(1, true);
+      tabbedPane.setEnabledAt(2, true);
+      tabbedPane.setEnabledAt(3, true);
+      tabbedPane.setEnabledAt(4, true);
+      
+      //Prepare Itinerary
+      itineraryData.clear();
+      List<RelationMember> relMembers = currentRoute.getMembers();
+      Iterator<RelationMember> relIter = relMembers.iterator();
+      fillItineraryTable(relIter, 0, -1);
+    
+      //Prepare Stoplist
+      stoplistData.clear();
+      /*List<RelationMember>*/ relMembers = currentRoute.getMembers();
+      /*Iterator<RelationMember>*/ relIter = relMembers.iterator();
+      fillStoplistTable(relIter, -1);
+    }
+    else
+    {
+      currentRoute = null;
+      tabbedPane.setEnabledAt(1, false);
+      tabbedPane.setEnabledAt(2, false);
+      tabbedPane.setEnabledAt(3, false);
+      tabbedPane.setEnabledAt(4, false);
+    }
+  }
+  
+  private void fillItineraryTable
+      (Iterator<RelationMember> relIter, long lastNodeId, int insPos) {
+    while (relIter.hasNext())
+    {
+      RelationMember curMember = relIter.next();
+      if (curMember.isWay())
+      {
+	insPos = insertGapIfNecessary(curMember.getWay(), curMember.getRole(), lastNodeId, insPos);
+	
+	itineraryData.insertRow(insPos, curMember.getWay(), curMember.getRole());
+	if (insPos >= 0)
+	  ++insPos;
+	
+	lastNodeId = getLastNodeId(curMember.getWay(), curMember.getRole());
+      }
+    }
+  }
+  
+  private void fillStoplistTable
+      (Iterator<RelationMember> relIter, int insPos) {
+    while (relIter.hasNext())
+    {
+      RelationMember curMember = relIter.next();
+      if (curMember.isNode())
+      {
+	stoplistData.insertRow(insPos, curMember.getNode(), curMember.getRole());
+	if (insPos >= 0)
+	  ++insPos;
+      }
+    }
+  }
+  
+  private void cleanupGaps()
+  {
+    long lastNodeId = 0;
+    
+    for (int i = 0; i < itineraryData.getRowCount(); ++i)
+    {
+      if (itineraryData.ways.elementAt(i) == null)
+      {
+	++i;
+	if (i >= itineraryData.getRowCount())
+	  break;
+      }
+      while ((itineraryData.ways.elementAt(i) == null) &&
+	      ((i == 0) || (itineraryData.ways.elementAt(i-1) == null)))
+      {
+	itineraryData.ways.removeElementAt(i);
+	itineraryData.removeRow(i);
+	if (i >= itineraryData.getRowCount())
+	  break;
+      }
+      if (i >= itineraryData.getRowCount())
+	break;
+      
+      boolean gapRequired = gapNecessary
+	  (itineraryData.ways.elementAt(i), (String)(itineraryData.getValueAt(i, 1)),
+	   lastNodeId);
+      if ((i > 0) && (!gapRequired) && (itineraryData.ways.elementAt(i-1) == null))
+      {
+	itineraryData.ways.removeElementAt(i-1);
+	itineraryData.removeRow(i-1);
+	--i;
+      }
+      else if ((i > 0) && gapRequired && (itineraryData.ways.elementAt(i-1) != null))
+      {
+	String[] buf = { "", "" };
+	buf[0] = "[gap]";
+	itineraryData.insertRow(i, buf);
+	++i;
+      }
+      lastNodeId = getLastNodeId
+	  (itineraryData.ways.elementAt(i), (String)(itineraryData.getValueAt(i, 1)));
+    }
+    while (itineraryData.ways.elementAt(itineraryData.getRowCount()-1) == null)
+    {
+      itineraryData.ways.removeElementAt(itineraryData.getRowCount()-1);
+      itineraryData.removeRow(itineraryData.getRowCount()-1);
+    }
+  }
+  
+  private int insertGapIfNecessary(Way way, String role, long lastNodeId, int insPos)
+  {
+    String[] buf = { "", "" };
+    if (gapNecessary(way, role, lastNodeId))
+    {
+      buf[0] = "[gap]";
+      itineraryData.insertRow(insPos, buf);
+      if (insPos >= 0)
+	++insPos;
+    }
+    return insPos;
+  }
+  
+  private boolean gapNecessary(Way way, String role, long lastNodeId)
+  {
+    if ((way != null) && (!(way.isIncomplete())) && (way.getNodesCount() >= 1))
+    {
+      if ("backward".equals(role))
+      {
+	long firstNodeId = way.getNode(way.getNodesCount() - 1).getId();
+	if ((lastNodeId != 0) && (lastNodeId != firstNodeId))
+	  return true;
+      }
+      else
+      {
+	long firstNodeId = way.getNode(0).getId();
+	if ((lastNodeId != 0) && (lastNodeId != firstNodeId))
+	  return true;
+      }
+    }
+    return false;
+  }
+  
+  private long getLastNodeId(Way way, String role)
+  {
+    if ((way == null) || (way.isIncomplete()) || (way.getNodesCount() < 1))
+    {
+      return 0;
+    }
+    else
+    {
+      if ("backward".equals(role))
+      {
+	return way.getNode(0).getId();
+      }
+      else
+      {
+	return way.getNode(way.getNodesCount() - 1).getId();
+      }
+    }
+  }
+  
+  private StopReference detectMinDistance
+      (Node node, Vector< SegmentMetric > segmentMetrics,
+       boolean rhsPossible, boolean lhsPossible) {
+    int minIndex = -1;
+    double position = -1.0;
+    double distance = 180.0;
+    double lat = node.getCoor().lat();
+    double lon = node.getCoor().lon();
+	
+    int curIndex = -2;
+    double angleLat = 100.0;
+    double angleLon = 200.0;
+    Iterator<SegmentMetric> iter = segmentMetrics.iterator();
+    while (iter.hasNext())
+    {
+      curIndex += 2;
+      SegmentMetric sm = iter.next();
+	  
+      if (sm == null)
+      {
+	angleLat = 100.0;
+	angleLon = 200.0;
+	    
+	continue;
+      }
+	  
+      double curPosition = (lat - sm.aLat)*sm.d1 + (lon - sm.aLon)*sm.d2;
+	  
+      if (curPosition < 0)
+      {
+	if (angleLat <= 90.0)
+	{
+	  double lastSegAngle = Math.atan2(angleLat - sm.aLat, angleLon - sm.aLon);
+	  double segAngle = Math.atan2(sm.d1, -sm.o1);
+	  double vertexAngle = Math.atan2(lat - sm.aLat, lon - sm.aLon);
+
+	  boolean vertexOnSeg = (vertexAngle == segAngle) ||
+	      (vertexAngle == lastSegAngle);
+	  boolean vertexOnTheLeft = (!vertexOnSeg) &&
+	      (((lastSegAngle > vertexAngle) && (vertexAngle > segAngle))
+	      || ((vertexAngle > segAngle) && (segAngle > lastSegAngle))
+	      || ((segAngle > lastSegAngle) && (lastSegAngle > vertexAngle)));
+
+	  double currentDistance = Math.sqrt((lat - sm.aLat)*(lat - sm.aLat)
+		+ (lon - sm.aLon)*(lon - sm.aLon)
+		*Math.cos(sm.aLat * Math.PI/180.0)*Math.cos(sm.aLat * Math.PI/180.0));
+	  curPosition = vertexAngle - segAngle;
+	  if (vertexOnTheLeft)
+	    curPosition = -curPosition;
+	  if (curPosition < 0)
+	    curPosition += 2*Math.PI;
+	  if ((Math.abs(currentDistance) < distance)
+	    && (((!vertexOnTheLeft) && (rhsPossible))
+		|| ((vertexOnTheLeft) && (lhsPossible))
+	       || (vertexOnSeg)))
+	  {
+/*	    System.out.print("A");
+	    System.out.print(" ");
+	    System.out.print(node);
+	    System.out.print(" ");
+	    System.out.println(currentDistance);*/
+	    distance = Math.abs(currentDistance);
+	    minIndex = curIndex-1;
+	    position = curPosition;
+	  }
+	}
+	angleLat = 100.0;
+	angleLon = 200.0;
+      }
+      else if (curPosition > sm.length)
+      {
+	angleLat = sm.aLat;
+	angleLon = sm.aLon;
+      }
+      else
+      {
+	double currentDistance = (lat - sm.aLat)*sm.o1 + (lon - sm.aLon)*sm.o2;
+	if ((Math.abs(currentDistance) < distance)
+		    && (((currentDistance >= 0) && (rhsPossible))
+		    || ((currentDistance <= 0) && (lhsPossible))))
+	{
+/*	  System.out.print("B");
+	  System.out.print(" ");
+	  System.out.print(sm.aLat);
+	  System.out.print(" ");
+	  System.out.print(sm.aLon);
+	  System.out.print(" ");
+	  System.out.print(node);
+	  System.out.print(" ");
+	  System.out.println(currentDistance);*/
+	  distance = Math.abs(currentDistance);
+	  minIndex = curIndex;
+	  position = curPosition;
+	}
+	    
+	angleLat = 100.0;
+	angleLon = 200.0;
+      }
+    }
+	
+    if (minIndex == -1)
+      return new StopReference(segmentMetrics.size()*2, 0, 180.0, node.get("name"),
+			       "", node);
+	  
+    return new StopReference(minIndex, position, distance, node.get("name"),
+			     "", node);
+  }
+}