package timer

import (
	"fmt"
)

//定义节点
type Node struct {
	data interface{}
	prev *Node
	next *Node
}

type LinkedList struct {
	head   *Node
	last   *Node
	length uint
}

func NewLinkedList() *LinkedList {
	var list *LinkedList = new(LinkedList)
	list.head = nil
	list.last = nil
	list.length = 0
	return list
}

/**
 * 获取表头
 */
func (this LinkedList) GetHead() *Node {
	return this.head
}

/**
 * 获取表尾
 */
func (this LinkedList) GetLast() *Node {
	return this.last
}

func (this LinkedList) Length() uint {
	return this.length
}

func (this *LinkedList) PushBack(node Node) *Node {
	node.next = nil
	if nil == this.head { //空表
		this.head = &node
		this.head.prev = nil
		this.last = this.head
	} else {
		node.prev = this.last
		this.last.next = &node
		this.last = this.last.next
	}
	fmt.Printf("insert %d %d\n", this.length, this.last.Data)
	this.length++
	return this.last
}

func Delete(node *Node) {
	if nil == node {
		return
	} else if nil == node.prev { //该元素处于表头，不删除，默认表头不存元素
		return
	} else if nil == node.next { //该元素处于表尾
		node.prev.next = nil
		node.prev = nil
	} else {
		node.next.prev = node.prev
		node.prev.next = node.next
		node.prev = nil
		node.next = nil
	}
}

func (this *Node) InsertHead(node Node) *Node { //从表头插入
	if nil == this || nil != this.prev { //为空，或者不是表头(表头的prev为空)
		return nil
	} else {
		if nil != this.next {
			this.next.prev = &node
			node.next = this.next
		}
		this.next = &node
		node.prev = this
	}
	return &node
}

func (this *Node) Next() (node *Node) {
	return this.next
}

func (this *Node) Prev() (node *Node) {
	return this.prev
}

func (this *Node) Data() (data interface{}) {
	return this.data
}

func (this *Node) SetData(data interface{}) {
	this.data = data
}

/////test

/*var n1 Node
n1.data = 12345
var n2 Node
n2.data = 78459
var n3 Node
n3.data = 12


var l1 = NewLinkedList()
var pn1 *Node = l1.PushBack(n1)

var l2 = NewLinkedList()
var pn2 *Node = l2.PushBack(n2)
l2.PushBack(n1)
l2.PushBack(n3)


fmt.Println("pn2",pn2)
fmt.Println("pn1",pn1)
//l2.erase(pn2)
//l2.erase(pn1)


for i:=l1.head; i!=nil; i = i.next {
	fmt.Println(i.data, l1.length)
}
for i:=l2.head; i!=nil; i = i.next {
	fmt.Println(i.data, l2.length)
}*/

/*
	var head util.Node
	var head1 util.Node
	var n3 util.Node
	n3.SetData(11113)
	var n4 util.Node
	n4.SetData(11114)
	var n5 util.Node
	n5.SetData(22225)
	var n6 util.Node
	n6.SetData(33336)
	var n7 util.Node
	n7.SetData(77777)

	timerMap["h_n4"] = head.InsertHead(n4)
	head.InsertHead(n5)
	head.InsertHead(n6)

	timerMap["h1_n7"] = head1.InsertHead(n7)
	timerMap["h1_n4"] = head1.InsertHead(n4)
	head1.InsertHead(n5)
	head1.InsertHead(n3)

	fmt.Println(head)
	fmt.Println(n6)
	fmt.Println(n5)
	fmt.Println(n4)


	util.Delete(&head)
	util.Delete(timerMap["h_n4"])

	for i:=head.Next(); i!=nil; i = i.Next() {
		fmt.Println(i.Data())
	}

	util.Delete(timerMap["h1_n7"])
	fmt.Println(n7)
	for i:=head1.Next(); i!=nil; i = i.Next() {
		fmt.Println(i.Data())
	}
*/