Applying Maps to Real-World Challenges in Go

Hello there! In this lesson, we will apply maps to real-world challenges. Our focus will be on solving tasks such as cataloging books in a library, counting votes in an election, and tracking inventories.

Maps are beneficial in real-life applications, such as the ones mentioned above, due to their ability to rapidly retrieve data with unique keys and efficiently handle larger datasets. Let's understand their efficiency with some actual examples.

Suppose you're asked to manage the cataloging of books in a library. Here, the book ID serves as the key, while the details of the book, such as the title, author, and year of publication, are stored as values.

This approach allows us to add, search for, and remove books from our library catalog using Go's maps.

package main

import "fmt"

func main() {
    // Initializing a map with nested maps
    libraryCatalog := make(map[string]map[string]string)

    // Details of a book
    bookId := "123"
    // Creating a map to store details of the book
    bookDetails := map[string]string{
        "title":           "To Kill a Mockingbird",
        "author":          "Harper Lee",
        "year_published": "1960",
    }

    libraryCatalog[bookId] = bookDetails // Adding a book to library catalog

    // Searching for a book
    if details, ok := libraryCatalog[bookId]; ok {
        fmt.Printf("Title: %s, Author: %s, Year Published: %s\n",
            details["title"], details["author"], details["year_published"])
    }

    // Removing a book from the library
    delete(libraryCatalog, bookId)
}

make() is a built-in Go function used to initialize maps, slices, and channels. For example, libraryCatalog := make(map[string]map[string]string) initializes an empty map where string keys map to nested maps, ready for storing key-value pairs.

As you can see, maps make the task of cataloging books in the library simpler and more efficient!

Imagine a scenario in which we need to count votes in an election. We employ a map, where each name is a unique key, and the frequency of that name serves as the associated value. Let's write some Go code to better understand this.

package main

import "fmt"

func main() {
    // Cast votes
    votesList := []string{"Alice", "Bob", "Alice", "Charlie", "Bob", "Alice"}

    // Initializing a map
    voteCounts := make(map[string]int)

    // Counting the votes
    for _, name := range votesList {
        voteCounts[name]++
    }

    for name, count := range voteCounts {
        fmt.Printf("%s: %d\n", name, count)
    }
    // Prints: Alice: 3, Bob: 2, Charlie: 1
}

Maps facilitate the efficient counting of votes.