Contents

= Tree flow 

== Algorithm

Preconditions::
 * No padding
 * Left-to-right filling
 * 1 sublevel
 * Width for outer box is fixed, height is variable

Outer box = B [bx, by, bw, bh]
Inner boxes = In [In_x, In_y, In_w, In_h]

Horizontal strips = Sn

foreach In in I
  if In_w > S_free_width
    S = S(n+1)
  end
  In_coord = S_free_coord
end

Version data entries

11 entries across 11 versions & 1 rubygems

Version	Path
giblish-2.2.2	docs/reference/box_flow_spec.adoc
giblish-2.2.1	docs/reference/box_flow_spec.adoc
giblish-2.2.0	docs/reference/box_flow_spec.adoc
giblish-2.1.2	docs/reference/box_flow_spec.adoc
giblish-2.1.1	docs/reference/box_flow_spec.adoc
giblish-2.1.0	docs/reference/box_flow_spec.adoc
giblish-2.0.1	docs/reference/box_flow_spec.adoc
giblish-2.0.0	docs/reference/box_flow_spec.adoc
giblish-2.0.0.pre.alpha1	docs/reference/box_flow_spec.adoc
giblish-1.0.0	docs/reference/box_flow_spec.adoc
giblish-1.0.0.rc2	docs/reference/box_flow_spec.adoc