new-gui/structs.go

260 lines
5.7 KiB
Go

package gui
import (
"log"
"reflect"
)
import toolkit "git.wit.org/wit/gui/toolkit/andlabs"
//
// All GUI Data Structures and functions that are external
// within the toolkit/ abstraction layer
//
// More than one Window is not supported in a cross platform
// sense & may never be. On many toolkits you have to have 'tabs'
// Native Windows and MacOS toolkits work with tabs
//
// If that is the case, this code should abstract the concept of
// windows and make everything 'tabs'
//
var Config GuiConfig
func SetDebugToolkit (s bool) {
toolkit.DebugToolkit = s
}
func GetDebugToolkit () bool {
return toolkit.DebugToolkit
}
func ShowDebugValues() {
log.Println("\t wit/gui Debug =", Config.Debug)
log.Println("\t wit/gui DebugDump =", Config.DebugDump)
log.Println("\t wit/gui DebugNode =", Config.DebugNode)
log.Println("\t wit/gui DebugTabs =", Config.DebugTabs)
log.Println("\t wit/gui DebugTable =", Config.DebugTable)
log.Println("\t wit/gui DebugWindow =", Config.DebugWindow)
log.Println("\t wit/gui DebugWindow =", Config.DebugWindow)
log.Println("\t wit/gui DebugToolkit =", toolkit.DebugToolkit)
}
type GuiConfig struct {
// This is the master node. The Binary Tree starts here
master *Node
// These are shortcuts to pass default values to make a new window
Title string
Width int
Height int
Exit func(*Node)
// These are global debugging settings
// TODO: move to a standard logging system
Debug bool
DebugDump bool
DebugNode bool
DebugTabs bool
DebugTable bool
DebugWindow bool
// hacks
depth int
counter int // used to make unique ID's
prefix string
}
type Widget int
// https://ieftimov.com/post/golang-datastructures-trees/
const (
Unknown Widget = iota
Window
Tab
Frame
Dropbox
Spinner
Label
)
func (s Widget) String() string {
switch s {
case Window:
return "Window"
case Tab:
return "Tab"
case Frame:
return "Frame"
case Label:
return "Label"
case Dropbox:
return "Dropbox"
}
return "unknown"
}
// The Node is simply the name and the size of whatever GUI element exists
type Node struct {
id string
Name string
Width int
Height int
parent *Node
// TODO: make children a double linked list since some toolkits require order
children []*Node
// things that may not really be needed (?)
custom func()
OnChanged func(*Node)
checked bool
text string
toolkit *toolkit.Toolkit
}
func (n *Node) Parent() *Node {
return n.parent
}
func (n *Node) Window() *Node {
return n.parent
}
func (n *Node) Dump() {
if ! Config.DebugDump {
return
}
IndentPrintln("NODE DUMP START")
IndentPrintln("id = ", n.id)
IndentPrintln("Name = ", n.Name)
IndentPrintln("Width = ", n.Width)
IndentPrintln("Height = ", n.Height)
if (n.parent == nil) {
IndentPrintln("parent = nil")
} else {
IndentPrintln("parent.id =", n.parent.id)
}
if (n.children != nil) {
IndentPrintln("children = ", n.children)
}
if (n.custom != nil) {
IndentPrintln("custom = ", n.custom)
}
IndentPrintln("checked = ", n.checked)
if (n.OnChanged != nil) {
IndentPrintln("OnChanged = ", n.OnChanged)
}
IndentPrintln("text = ", reflect.ValueOf(n.text).Kind(), n.text)
if (n.toolkit != nil) {
IndentPrintln("toolkit = ", reflect.ValueOf(n.toolkit).Kind())
n.toolkit.Dump()
}
if (n.id == "") {
// Node structs should never have a nil id.
// I probably shouldn't panic here, but this is just to check the sanity of
// the gui package to make sure it's not exiting
panic("gui.Node.Dump() id == nil TODO: make a unigue id here in the golang gui library")
}
IndentPrintln("NODE DUMP END")
}
func (n *Node) SetName(name string) {
n.toolkit.SetWindowTitle(name)
return
}
func (n *Node) Append(child *Node) {
n.children = append(n.children, child)
if (Config.Debug) {
log.Println("child node:")
child.Dump()
log.Println("parent node:")
n.Dump()
}
// time.Sleep(3 * time.Second)
}
/*
func (n *Node) List() {
findByIdDFS(n, "test")
}
*/
var listChildrenParent *Node
var listChildrenDepth int = 0
var defaultPadding = " "
func IndentPrintln(a ...interface{}) {
indentPrintln(listChildrenDepth, defaultPadding, a)
}
func indentPrintln(depth int, format string, a ...interface{}) {
var tabs string
for i := 0; i < depth; i++ {
tabs = tabs + format
}
// newFormat := tabs + strconv.Itoa(depth) + " " + format
newFormat := tabs + format
log.Println(newFormat, a)
}
func (n *Node) ListChildren(dump bool) {
indentPrintln(listChildrenDepth, defaultPadding, n.id, n.Width, n.Height, n.Name)
if (dump == true) {
n.Dump()
}
if len(n.children) == 0 {
if (n.parent == nil) {
} else {
if (Config.DebugNode) {
log.Println("\t\t\tparent =",n.parent.id)
}
if (listChildrenParent != nil) {
if (Config.DebugNode) {
log.Println("\t\t\tlistChildrenParent =",listChildrenParent.id)
}
if (listChildrenParent.id != n.parent.id) {
log.Println("parent.child does not match child.parent")
panic("parent.child does not match child.parent")
}
}
}
if (Config.DebugNode) {
log.Println("\t\t", n.id, "has no children")
}
return
}
for _, child := range n.children {
// log.Println("\t\t", child.id, child.Width, child.Height, child.Name)
if (child.parent != nil) {
if (Config.DebugNode) {
log.Println("\t\t\tparent =",child.parent.id)
}
} else {
log.Println("\t\t\tno parent")
panic("no parent")
}
if (dump == true) {
child.Dump()
}
if (Config.DebugNode) {
if (child.children == nil) {
log.Println("\t\t", child.id, "has no children")
} else {
log.Println("\t\t\tHas children:", child.children)
}
}
listChildrenParent = n
listChildrenDepth += 1
child.ListChildren(dump)
listChildrenDepth -= 1
}
return
}