@@ -115,8 +115,8 @@ private boolean placeChild(Node node) {
115
115
116
116
/**
117
117
* Tries to find a free position where a rectangle with the given size can fit.
118
- * <p >
119
- * This is a variant of the bin packing problem, and my algorithm is awesome for it: Slow and finds not even a
118
+ * <br >
119
+ * <br> This is a variant of the bin packing problem, and my algorithm is awesome for it: Slow and finds not even a
120
120
* local maximum.
121
121
*
122
122
* @param width the width of the space to find
@@ -190,9 +190,9 @@ public enum Alignment {
190
190
/**
191
191
* Aligns children in a center-first fashion. It will check the middle of the row and then expand to the two
192
192
* sides, going left first.
193
- * <p >
193
+ * <br >
194
194
* Example (Inserting A, B, C):
195
- * <p >
195
+ * <br >
196
196
* <pre>
197
197
* ___
198
198
*
@@ -223,9 +223,9 @@ Pair<Integer, Integer> findFreeSpace(FlowPane pane, int width, int height) {
223
223
},
224
224
/**
225
225
* Aligns children from left to right, top to bottom
226
- * <p >
226
+ * <br >
227
227
* Example (Inserting A, B, C):
228
- * <p >
228
+ * <br >
229
229
* <pre>
230
230
* ___
231
231
*
@@ -253,12 +253,12 @@ Pair<Integer, Integer> findFreeSpace(FlowPane pane, int width, int height) {
253
253
},
254
254
/**
255
255
* Aligns children from top to bottom, left to right
256
- * <p >
256
+ * <br >
257
257
* Example (Inserting A, B, C):
258
- * <p >
258
+ * <br >
259
259
* <pre>
260
260
* _ A A A
261
- * _ ==> _ ==> B ==> B
261
+ * _ ==> _ ==> B ==> B
262
262
* _ _ _ C
263
263
* </pre>
264
264
*/
0 commit comments