diff --git a/cstyle/plugins/inline/main.go b/cstyle/plugins/inline/main.go
index 91fb247..699eeaf 100644
--- a/cstyle/plugins/inline/main.go
+++ b/cstyle/plugins/inline/main.go
@@ -6 +5,0 @@ import (
- "gui/utils"
@@ -28 +27 @@ func Init() cstyle.Plugin {
- if self.X+xCollect+self.Width > (parent.Width+parent.Padding.Right)+parent.X && i > 0 {
+ if self.X+xCollect+self.Width > ((parent.Width-parent.Padding.Left)+parent.Padding.Right)+parent.X && i > 0 {
@@ -33,23 +31,0 @@ func Init() cstyle.Plugin {
- tallest := float32(0)
- endex := 0
- for a := i; a > 0; a-- {
- if s[n.Parent.Children[a].Properties.Id].Y != s[n.Parent.Children[i-1].Properties.Id].Y {
- endex = a
- break
- } else {
- tallest = utils.Max(tallest, s[n.Parent.Children[a].Properties.Id].Height)
- }
- }
- // !ISSUE: Find a better way then -4
- for a := i; a > endex-1; a-- {
- p := (*state)[n.Parent.Children[a].Properties.Id]
- if p.Height != tallest {
- p.Y += (tallest - p.Height) - 5
- (*state)[n.Parent.Children[a].Properties.Id] = p
- }
- }
- for a := i; a < len(n.Parent.Children)-1; a++ {
- p := (*state)[n.Parent.Children[a].Properties.Id]
- p.Y += 7
- (*state)[n.Parent.Children[a].Properties.Id] = p
- }
@@ -58,0 +35,4 @@ func Init() cstyle.Plugin {
+ // sibling := s[n.Parent.Children[i-1].Properties.Id]
+ // if sibling.Height != self.Height {
+ // self.Y += sibling.Height / 4
+ // }
@@ -59,0 +40 @@ func Init() cstyle.Plugin {
+ self.X += parent.Padding.Left
package inline
import (
"gui/cstyle"
"gui/element"
"gui/utils"
)
func Init() cstyle.Plugin {
return cstyle.Plugin{
Styles: map[string]string{
"display": "inline",
},
Level: 1,
Handler: func(n *element.Node, state *map[string]element.State) {
s := *state
self := s[n.Properties.Id]
parent := s[n.Parent.Properties.Id]
copyOfX := self.X
copyOfY := self.Y
xCollect := float32(0)
for i, v := range n.Parent.Children {
vState := s[v.Properties.Id]
if v.Style["display"] != "inline" {
xCollect = 0
} else {
if v.Properties.Id == n.Properties.Id {
if self.X+xCollect+self.Width > (parent.Width+parent.Padding.Right)+parent.X && i > 0 {
// Break Node
sibling := s[n.Parent.Children[i-1].Properties.Id]
self.Y += sibling.Height
self.X = copyOfX
tallest := float32(0)
endex := 0
for a := i; a > 0; a-- {
if s[n.Parent.Children[a].Properties.Id].Y != s[n.Parent.Children[i-1].Properties.Id].Y {
endex = a
break
} else {
tallest = utils.Max(tallest, s[n.Parent.Children[a].Properties.Id].Height)
}
}
// !ISSUE: Find a better way then -4
for a := i; a > endex-1; a-- {
p := (*state)[n.Parent.Children[a].Properties.Id]
if p.Height != tallest {
p.Y += (tallest - p.Height) - 5
(*state)[n.Parent.Children[a].Properties.Id] = p
}
}
for a := i; a < len(n.Parent.Children)-1; a++ {
p := (*state)[n.Parent.Children[a].Properties.Id]
p.Y += 7
(*state)[n.Parent.Children[a].Properties.Id] = p
}
} else if i > 0 {
// Node did not break
self.X += xCollect
}
break
} else {
if n.Parent.Children[i].Style["display"] == "inline" {
if colliderDetection(vState, self) {
xCollect += vState.Width
} else {
xCollect = 0
}
}
}
}
}
propagateOffsets(n, copyOfX, copyOfY, self, state)
(*state)[n.Properties.Id] = self
},
}
}
func propagateOffsets(n *element.Node, copyOfX, copyOfY float32, self element.State, state *map[string]element.State) {
s := *state
for _, v := range n.Children {
vState := s[v.Properties.Id]
vState.X += self.X - copyOfX
vState.Y += self.Y - copyOfY
if len(v.Children) > 0 {
propagateOffsets(&v, copyOfX, copyOfY, self, state)
}
(*state)[v.Properties.Id] = vState
}
}
func colliderDetection(s1, s2 element.State) bool {
s1Min := s1.Y
s1Max := s1.Y + s1.Height
s2Min := s2.Y
s2Max := s2.Y + s2.Height
return s1Min > s2Min && s1Min < s2Max || s1Max > s2Min && s1Min < s2Max || s2Min > s1Min && s2Min < s1Max || s2Max > s1Min && s2Min < s1Max
}