@@ -151,11 +151,11 @@ public void actionPerformed(ActionEvent e) {
151
151
/**
152
152
* Tag node as roundabout
153
153
*
154
- * @TODO direction as well?
155
- *
156
154
* This method is overloaded with (Way circle)
155
+ * @param node node
157
156
*/
158
157
public void tagAsRoundabout (Node node ) {
158
+ // TODO direction as well?
159
159
Main .main .undoRedo .add (new ChangePropertyCommand (node , "junction" , "roundabout" ));
160
160
Main .main .undoRedo .add (new ChangePropertyCommand (node , "highway" , "mini_roundabout" ));
161
161
int d = Main .pref .getInt ("rex.diameter_meter" , 12 );
@@ -166,6 +166,7 @@ public void tagAsRoundabout(Node node) {
166
166
* Tag closed way as roundabout
167
167
*
168
168
* This method is overloaded with (Node node)
169
+ * @param circle way
169
170
*/
170
171
public void tagAsRoundabout (Way circle ) {
171
172
DataSet ds = circle .getDataSet ();
@@ -194,10 +195,10 @@ public void tagAsRoundabout(Way circle) {
194
195
/**
195
196
* Create a roundabout way
196
197
*
197
- * @param Node node Node to expand to Roundabout
198
- * @param double radi Radius of roundabout in meter
199
- * @param boolean lefthandtraffic Direction of roundabout
200
- * @param double max_gap Max gap in radians between nodes to make it pretty
198
+ * @param node Node to expand to Roundabout
199
+ * @param radi Radius of roundabout in meter
200
+ * @param lefthandtraffic Direction of roundabout
201
+ * @param max_gap Max gap in radians between nodes to make it pretty
201
202
*/
202
203
public void makeRoundabout (Node node , double radi , boolean lefthandtraffic , double max_gap ) {
203
204
//Store center for later use
@@ -396,9 +397,9 @@ private Way modifyWay(Node originalNode, Way originalWay, List<Node> newNodes) {
396
397
/**
397
398
* Sort nodes angular in relation to center
398
399
*
399
- * @param List<Node> nodes
400
- * @param Node center
401
- * @param boolean clockwise
400
+ * @param nodes nodes
401
+ * @param center center
402
+ * @param clockwise clockwise?
402
403
*/
403
404
private void angularSort (List <Node > nodes , LatLon center , boolean clockwise ) {
404
405
Collections .sort (nodes , new AngComp (center ));
@@ -501,8 +502,8 @@ public int compare(Way a, Way b) {
501
502
* Move a node it distance meter in the heading of
502
503
* the next node in the way it is the last node in.
503
504
*
504
- * @param Node node Node to be moved
505
- * @param double distance Distance to move node in meter
505
+ * @param node Node to be moved
506
+ * @param distance Distance to move node in meter
506
507
*/
507
508
public boolean moveWayEndNodeTowardsNextNode (Node node , double distance ) {
508
509
//some verification:
@@ -522,9 +523,9 @@ public boolean moveWayEndNodeTowardsNextNode(Node node, double distance) {
522
523
* Move a node it distance meter in the heading of
523
524
* the next node in the way it is the last node in.
524
525
*
525
- * @param Node node Node to be moved
526
- * @param double distance Distance to move node in meter
527
- * @param Way way Way
526
+ * @param node Node to be moved
527
+ * @param distance Distance to move node in meter
528
+ * @param way Way
528
529
*/
529
530
public boolean moveWayEndNodeTowardsNextNode (Node node , double distance , Way way ) {
530
531
//Node must be first or last node in way
@@ -553,9 +554,9 @@ public boolean moveWayEndNodeTowardsNextNode(Node node, double distance, Way way
553
554
/**
554
555
* Return a LatLon moved distance meter in heading from start
555
556
*
556
- * @param LatLon start point
557
- * @param double heading in radians
558
- * @param double distance in Meter
557
+ * @param start point
558
+ * @param heading in radians
559
+ * @param distance in Meter
559
560
*
560
561
* @return LatLon New position
561
562
*/
@@ -577,7 +578,7 @@ private LatLon moveHeadingDistance(LatLon start, double heading, double distance
577
578
/**
578
579
* Output a message
579
580
*
580
- * @param String Message
581
+ * @param str Message
581
582
*/
582
583
public void pri (String str ) {
583
584
Notification t = new Notification (str );
@@ -700,9 +701,9 @@ private boolean wayContainsAllNodes(Way way, List<Node> nodes) {
700
701
}
701
702
702
703
/**
703
- * @param Way iWay incoming way
704
- * @param Way tWay across way
705
- * @param Node cNode common node
704
+ * @param iWay incoming way
705
+ * @param tWay across way
706
+ * @param cNode common node
706
707
*
707
708
* @return boolean Success
708
709
*/
0 commit comments