import "github.com/maksimru/go-hpds"
import "github.com/maksimru/go-hpds/singlylinkedlist"

var list = NewSinglyLinkedList()
list.Append(1)
list.Append(2)
list.Append(3)
var list2 = NewSinglyLinkedList()
list2.Append(5)
list2.Append(6)
list2.Append(7)
list.GetTail().AppendList(list2)
list.Print() //returns "1 -> 2 -> 3 -> 5 -> 6 -> 7"

import "github.com/maksimru/go-hpds"
import "github.com/maksimru/go-hpds/doublylinkedlist"

var list = NewDoublyLinkedList()
list.Append(1)
n := list.Append(2)
list.Append(3)
n.Remove()
list.Print() //returns "1 <-> 3"

import "github.com/maksimru/go-hpds"
import "github.com/maksimru/go-hpds/queue"

queue := NewQueue()
queue.Enqueue(1)
queue.Enqueue(2)
queue.Enqueue(3)
queue.Enqueue(4)
for !queue.IsEmpty() {
    value := queue.Dequeue()
    // process the queue
}

import "github.com/maksimru/go-hpds"
import "github.com/maksimru/go-hpds/stack"

stack := NewStack()
stack.Push(1)
stack.Push(2)
stack.Push(3)
stack.Push(4)
for !stack.IsEmpty() {
    value := stack.Pop()
    // process the stack
}

import "github.com/maksimru/go-hpds"
import "github.com/maksimru/go-hpds/maxheap"

arrSlice := []int{0,5,1,6,8,3,5,9,2,6}
heap := NewMaxHeap(arraylist.NewIntArrayList(arrSlice), comparator.NewIntComparator())
heap.Remove() //returns 9

import "github.com/maksimru/go-hpds"
import "github.com/maksimru/go-hpds/minheap"

arrSlice := []int{0,5,1,6,8,3,5,9,2,6}
heap := NewMinHeap(arraylist.NewIntArrayList(arrSlice), comparator.NewIntComparator())
heap.Remove() //returns 0

import "github.com/maksimru/go-hpds"
import "github.com/maksimru/go-hpds/priorityqueue"

arr := []IntPrioritizedValue{NewIntPrioritizedValue(21,5),NewIntPrioritizedValue(2,7),NewIntPrioritizedValue(432,1)}
pq := NewPriorityQueue(NewIntPrioritizedValueList(arr), NewIntPriorityComparator())
for !pq.IsEmpty() {
    value := pq.Dequeue() //returns instance of IntPrioritizedValue value = 2, priority = 7
}

import "github.com/maksimru/go-hpds"
import "github.com/maksimru/go-hpds/trie"

var trie = NewTrie()
trie.Add("word", 1)
trie.Add("work", 2)
trie.Add("wor", 3)
trie.Add("war", 4)
trie.Add("won", 5)
v, s := trie.SearchPattern("w?r") //s will return 3 and 4

import "github.com/maksimru/go-hpds"
import "github.com/maksimru/go-hpds/unionfind"

union := NewUnionFind()
union.Union(1,2)
union.Union(2,3)
union.Union(4,3)
node := union.FindInSet(4)  //returns Node with value 1 and rank 4, meaning that all four nodes are in union

go test ./...