You are an expert in writing code in many different languages. Your goal is to perform code completion for the following code, keeping in mind the rest of the code and the file meta data.
    Metadata details:
    filename: dirs.go
    path of file: ./repos/dep-tree/internal/entropy
    
    the code of the file until where you have to start completion: package entropy

import (
	"math"
	"os"
	"path/filepath"
	"strings"

	"github.com/elliotchance/orderedmap/v2"
	"github.com/gabotechs/dep-tree/internal/language"
	"github.com/gabotechs/dep-tree/internal/utils"
)

type DirTreeEntry struct {
	entry *DirTree
	index int
}
type DirTree orderedmap.OrderedMap[string, DirTreeEntry]

func NewDirTree() *DirTree {
	return (*DirTree)(orderedmap.NewOrderedMap[string, DirTreeEntry]())
}

func (d *DirTree) inner() *orderedmap.OrderedMap[string, DirTreeEntry] {
	return (*orderedmap.OrderedMap[string, DirTreeEntry])(d)
}

func splitFullPaths(dir string) []string {
	var result []string
	for strings.Contains(dir, string(os.Path
    
func HSVToRGB(h, s, v float64) (r, g, b uint8) {
	if h < 0 || h >= 360 ||
		s < 0 || s > 1 ||
		v < 0 || v > 1 {
		return 0, 0, 0
	}
	// When 0 ≤ h < 360, 0 ≤ s ≤ 1 and 0 ≤ v ≤ 1:
	C := v * s
	X := C * (1 - math.Abs(math.Mod(h/60, 2)-1))
	m := v - C
	var Rnot, Gnot, Bnot float64
	switch {
	case 0 <= h && h < 60:
		Rnot, Gnot, Bnot = C, X, 0
	case 60 <= h && h < 120:
		Rnot, Gnot, Bnot = X, C, 0
	case 120 <= h && h < 180:
		Rnot, Gnot, Bnot = 0, C, X
	case 180 <= h && h < 240:
		Rnot, Gnot, Bnot = 0, X, C
	case 240 <= h && h < 300:
		Rnot, Gnot, Bnot = X, 0, C
	case 300 <= h && h < 360:
		Rnot, Gnot, Bnot = C, 0, X
	}
	r = uint8(math.Round((Rnot + m) * 255))
	g = uint8(math.Round((Gnot + m) * 255))
	b = uint8(math.Round((Bnot + m) * 255))
	return r, g, b
}