golang_collections

Queue (using Linked list)

This package implements generic queue, we can have data in node of any type we want. Queue is a data structure that follows FIFO (First in First out).

Examples of stacks are:

1. Queue at the ticket counter
2. Patients waiting outside the doctor’s clinic

Quick Start

package main

import (

  "github.com/architagr/golang_collections/queue"
)

func main() {
  newQueue := NewQueue[int]()
  newQueue.Enqueue(10)
  newQueue.Enqueue(11)
  data, err := newQueue.Dequeue()
  if err != nil{
    panic(fmt.Errorf("Error in pop: %s", err.Error()))
  }
  fmt.Printf("data poped %d\n", data)

  data, err = newQueue.Peep()
  if err != nil{
    panic(fmt.Errorf("Error in top: %s", err.Error()))
  }
  fmt.Printf("data at top %d\n", data)
  fmt.Printf("Queue contains #%d nodes\n", newQueue.Count())
  fmt.Printf("Is Queue empty? #%t\n", newQueue.IsEmpty())
}

Functions available

the package exposes below listed functions

NewQueue[T any]

created a new queue that can have nodes that can hold data of type T. T can be of any data type from basic data type like int, string, etc. to any user created data type like structs

Enqueue(value T)

this is a function been implemented by type struct and helps in adding new node with data been passed as argument to this function. The new node is always added on the tail (FIFO)

Dequeue() (value T, err error)

this function returns error if we do not have any data/node in the queue, i.e. the queue is empty. if queue is not empty then it removes the first node that was added and returns the data of the node that was removed.

Top() T

This function returns first value that was added, without removing the value from the queue.

Count() int

This function returns the number of nodes in the queue

IsEmpty() bool

This function returns ture if the queue is empty, i.e. count is 0, and return false if we have some data in queue, i.e. count > 0.

Benchmarks

This benchmarking was done against emirpasic’s GODS package (v1.18.1)

System configuration used while doing these benchmark
goos: darwin
goarch: arm64
pkg: github.com/architagr/golang_collections/test/benchmark
cpu: Apple M1 Pro

Function name	Package name	# operation	Time taken per operation
Enqueue	architagr/golang_collections	30,853,053	43.30 ns/op	16 B/op	1 allocs/op
	emirpasic/gods	19,681,999	64.10 ns/op	31 B/op	1 allocs/op

This site is open source. Improve this page.