Keith OHara writes:
> mike apollinemike.com apollinemike.com> writes:
>
>> Currently, I've written the function Grob::vertical_less such that
>> it returns true for a grob that is higher than another grob.
>
> Then just call it vertical_higher() or just higher().
above/below
> Then when y
mike apollinemike.com apollinemike.com> writes:
> Currently, I've written the function Grob::vertical_less such that
> it returns true for a grob that is higher than another grob.
Then just call it vertical_higher() or just higher().
Then when you pass it to a sort function as the compariso
"m...@apollinemike.com" writes:
> I think that it'd be good to scrub this inconsistency from the code
> base such that "lower on the page" always means "numerically lower"
> (so the contrabass, for example, would be the 0th vertical axis group
> in an elements list). Thoughts?
In the input, sta
> I think that it'd be good to scrub this inconsistency from the code
> base such that "lower on the page" always means "numerically lower"
> (so the contrabass, for example, would be the 0th vertical axis group
> in an elements list). Thoughts?
+1, assuming that it is orthogonal with the rest o
Hey all,
Currently, I've written the function Grob::vertical_less such that it returns
true for a grob that is higher than another grob. This is because the ordering
of a vertical alignment's element list goes from top to bottom, so the vertical
axis groups with lower indices in the list are h
