Cacher is the code snippet organizer for pro developers

package main
//file to implement expanding/shrinking intlist with a map
import (
	"fmt"
	"strconv"
)
type IntList struct {
	list map[int]int
	//for keeping track of placement indices and insertion spots
	record map[string]int
}

//creates an IntList and returns it
func createIntList() IntList {
	lst := IntList{list:make(map[int]int), record:make(map[string]int)}
	lst.record["insert"] = 0
	lst.record["last"] = -1
	return lst
}
//appends a new element to the end of the list, and updates the insertion and last element positions
func (il IntList) push(elem int) {
	il.list[il.record["insert"]] = elem
	il.record["insert"] += 1
	il.record["last"] += 1
}
//removes the last element from the intlist and returns it
func (il IntList) pop() int {
	popped, has := il.list[il.record["last"]]
	if has {
		delete(il.list, il.record["last"])
		il.record["last"] -= 1
		il.record["insert"] -= 1
		return popped
	}
	return 0
}
//gets an element in the inlist by the given int key
func (il IntList) get(key int) int {
	got, has := il.list[key]
	if has {
		return got
	}
	return 0
}
//appends a new integer to the left side of the list, by moving all current elements up by one
func (il IntList) pushleft(elem int) {
	for i:=il.record["last"] ;i>=0;i-- {
		il.list[i+1] = il.list[i]
	}
	il.list[0] = elem
	il.record["last"] += 1
	il.record["insert"] += 1
}

//gets a pretty string form of the IntList
func (il IntList) tostring() string {
	lststr := "[ "
	for key := range il.list {
		lststr += strconv.Itoa(il.list[key]) + " "
	}
	lststr += "]"
	return lststr
}


func main() {
  tester := createIntList()
  tester.push(5)
  tester.push(8)
  tester.pushleft(1)
  fmt.Println(tester)
  fmt.Println(tester.tostring())
}