Fix its it's and its

list/list.go

@@ -1,6 +1,6 @@
 // Package list allows you to build lists, as simple or complicated as you need.
 //
-// Simply, define a list with some items and set it's rendering properties, like
+// Simply, define a list with some items and set its rendering properties, like
 // enumerator and styling:
 //
 //	groceries := list.New(

table/table.go

@@ -96,13 +96,13 @@ func (t *Table) ClearRows() *Table {
 	return t
 }
 
-// StyleFunc sets the style for a cell based on it's position (row, column).
+// StyleFunc sets the style for a cell based on its position (row, column).
 func (t *Table) StyleFunc(style StyleFunc) *Table {
 	t.styleFunc = style
 	return t
 }
 
-// style returns the style for a cell based on it's position (row, column).
+// style returns the style for a cell based on its position (row, column).
 func (t *Table) style(row, col int) lipgloss.Style {
 	if t.styleFunc == nil {
 		return lipgloss.NewStyle()
@@ -293,7 +293,7 @@ func (t *Table) String() string {
 		Render(sb.String())
 }
 
-// computeHeight computes the height of the table in it's current configuration.
+// computeHeight computes the height of the table in its current configuration.
 func (t *Table) computeHeight() int {
 	hasHeaders := len(t.headers) > 0
 	return sum(t.heights) - 1 + btoi(hasHeaders) +
@@ -306,7 +306,7 @@ func (t *Table) Render() string {
 	return t.String()
 }
 
-// constructTopBorder constructs the top border for the table given it's current
+// constructTopBorder constructs the top border for the table given its current
 // border configuration and data.
 func (t *Table) constructTopBorder() string {
 	var s strings.Builder
@@ -325,7 +325,7 @@ func (t *Table) constructTopBorder() string {
 	return s.String()
 }
 
-// constructBottomBorder constructs the bottom border for the table given it's current
+// constructBottomBorder constructs the bottom border for the table given its current
 // border configuration and data.
 func (t *Table) constructBottomBorder() string {
 	var s strings.Builder
@@ -344,7 +344,7 @@ func (t *Table) constructBottomBorder() string {
 	return s.String()
 }
 
-// constructHeaders constructs the headers for the table given it's current
+// constructHeaders constructs the headers for the table given its current
 // header configuration and data.
 func (t *Table) constructHeaders() string {
 	height := t.heights[HeaderRow+1]

table/table_test.go

@@ -374,7 +374,7 @@ func TestTableHeights(t *testing.T) {
 	rows := [][]string{
 		{"Chutar o balde", `Literally translates to "kick the bucket." It's used when someone gives up or loses patience.`},
 		{"Engolir sapos", `Literally means "to swallow frogs." It's used to describe someone who has to tolerate or endure unpleasant situations.`},
-		{"Arroz de festa", `Literally means "party rice." It´s used to refer to someone who shows up everywhere.`},
+		{"Arroz de festa", `Literally means "party rice." It's used to refer to someone who shows up everywhere.`},
 	}
 
 	table := New().
@@ -404,7 +404,7 @@ func TestTableMultiLineRowSeparator(t *testing.T) {
 		BorderRow(true).
 		Row("Chutar o balde", `Literally translates to "kick the bucket." It's used when someone gives up or loses patience.`).
 		Row("Engolir sapos", `Literally means "to swallow frogs." It's used to describe someone who has to tolerate or endure unpleasant situations.`).
-		Row("Arroz de festa", `Literally means "party rice." It´s used to refer to someone who shows up everywhere.`)
+		Row("Arroz de festa", `Literally means "party rice." It's used to refer to someone who shows up everywhere.`)
 
 	golden.RequireEqual(t, []byte(table.String()))
 }

tree/renderer.go

@@ -49,15 +49,15 @@ func (r *renderer) render(node Node, root bool, prefix string) string {
 	enumerator := r.enumerator
 	indenter := r.indenter
 
-	// print the root node name if its not empty.
+	// print the root node name if it's not empty.
 	if name := node.Value(); name != "" && root {
 		strs = append(strs, r.style.root.Render(name))
 	}
 
 	for i := 0; i < children.Length(); i++ {
 		if i < children.Length()-1 {
 			if child := children.At(i + 1); child.Hidden() {
-				// Don't count the last child if its hidden. This renders the
+				// Don't count the last child if it's hidden. This renders the
 				// last visible element with the right prefix
 				//
 				// The only type of Children is NodeChildren.

tree/tree.go

@@ -154,7 +154,7 @@ func (t *Tree) String() string {
 
 // Child adds a child to this Tree.
 //
-// If a Child Tree is passed without a root, it will be parented to it's sibling
+// If a Child Tree is passed without a root, it will be parented to its sibling
 // child (auto-nesting).
 //
 //	tree.Root("Foo").Child("Bar", tree.New().Child("Baz"), "Qux")