Functions | LIZIU Golang

Functions in Go

Why Go Functions Matters

The Problem: Repeated logic without functions becomes a maintenance nightmare and a bug factory.

The Solution: Go functions are first-class, support multiple return values (idiomatic for `(value, error)`), variadic args, closures, and named return values — without inheritance or default-arg overloading complexity.

Real Impact: Returning errors as values forces you to handle them at the call site, eliminating an entire class of hidden control flow.

Real-World Analogy

Think of a Go function as a vending machine with two slots:

Parameters = the coin slot — what you put in
Return values = the snack slot AND the receipt slot — value and error
Variadic ...args = a coin slot that accepts any number of coins
Closure = a machine that remembers what you bought yesterday
Named returns = labels on the snack slots so you don't mix them up

Functions are the building blocks of Go programs. Go's approach to functions is simple yet powerful, with support for multiple return values, closures, and functions as first-class citizens.

Go's Function Philosophy

Go functions embody key language principles:

Simplicity: Clear syntax with no function overloading
Composition over inheritance: Small functions that compose well
Explicit error handling: Errors as return values, not exceptions
Performance: Inlining, escape analysis, and efficient calling conventions

Function Fundamentals

Functions in Go are typed entities that encapsulate behavior. Unlike object-oriented languages, Go separates data (structs) from behavior (functions and methods), promoting cleaner design.

Concept	Go Approach	Benefits
Multiple Returns	Built-in language feature	Clean error handling, no need for tuples
First-class Functions	Functions are values	Higher-order programming, callbacks
Closures	Lexical scoping with capture	Stateful functions, encapsulation
Defer	Guaranteed cleanup	Resource management, panic recovery

Function Basics

Function Anatomy and Calling Convention

Go functions follow a consistent structure: func name(parameters) (returns) { body }. The calling convention is stack-based with efficient parameter passing.

Pass by Value Semantics

Go always passes arguments by value (copies). For large structs or when mutation is needed, pass pointers. This makes function behavior predictable and side-effect free by default.

Primitives: Always copied (int, float, bool, string)
Arrays: Entire array is copied (use slices instead)
Structs: All fields copied (consider pointers for large structs)
Slices/Maps/Channels: Header copied, underlying data shared

Function Declaration

// Basic function
func greet() {
    fmt.Println("Hello, World!")
}

// Function with parameters
func add(x int, y int) int {
    return x + y
}

// Shortened parameter declaration
func multiply(x, y int) int {
    return x * y
}

// Function with multiple parameters
func printInfo(name string, age int, city string) {
    fmt.Printf("%s is %d years old and lives in %s
", name, age, city)
}

Multiple Return Values

The Power of Multiple Returns

Multiple return values are a cornerstone of Go's design, eliminating the need for special error types, exceptions, or tuple unpacking found in other languages.

Error Handling Pattern

The idiomatic Go pattern is to return (result, error) where the last return value indicates success or failure. This makes error handling explicit and impossible to ignore accidentally.

⚠️ Named Returns: Use with Caution

Named returns can improve documentation but may reduce clarity in longer functions. Naked returns (return without values) should be avoided in functions longer than a few lines as they harm readability.

// Return multiple values
func divmod(a, b int) (int, int) {
    return a / b, a % b
}

// Using multiple returns
quotient, remainder := divmod(10, 3)

// Error handling pattern
func sqrt(x float64) (float64, error) {
    if x < 0 {
        return 0, fmt.Errorf("cannot take sqrt of negative number: %v", x)
    }
    return math.Sqrt(x), nil
}

// Named return values
func getCoordinates() (x, y int) {
    x = 10
    y = 20
    return  // Naked return
}

Variadic Functions

Variable Arguments

Variadic functions accept a variable number of arguments of the same type, making APIs more flexible. The variadic parameter must be the last in the parameter list.

Variadic Implementation Details

Variadic parameters are received as a slice internally
Empty calls create an empty slice, not nil
Use ... to forward variadic arguments
Performance: No heap allocation for small argument counts

// Variadic function
func sum(nums ...int) int {
    total := 0
    for _, n := range nums {
        total += n
    }
    return total
}

// Calling variadic function
result := sum(1, 2, 3, 4, 5)

// Passing slice to variadic function
numbers := []int{10, 20, 30}
result = sum(numbers...)  // Spread operator

// Printf is variadic
fmt.Printf("%s has %d items
", "Cart", 5)

Anonymous Functions and Closures

Understanding Closures

Closures are functions that capture variables from their surrounding scope. Go implements closures through escape analysis, determining whether variables need heap allocation.

Closure Mechanics

Variable Capture: Closures capture variables by reference, not value
Escape Analysis: Compiler determines if captured variables escape to heap
Lifetime Extension: Captured variables live as long as the closure
Goroutine Safety: Be careful with concurrent access to captured variables

⚠️ Loop Variable Capture

A common pitfall is capturing loop variables in goroutines or closures. The variable is shared across iterations, leading to unexpected behavior. Always copy the variable or use it as a function parameter.

// Anonymous function
func() {
    fmt.Println("Anonymous function")
}()

// Assign to variable
greet := func(name string) {
    fmt.Printf("Hello, %s!
", name)
}
greet("Alice")

// Closure
func counter() func() int {
    count := 0
    return func() int {
        count++
        return count
    }
}

c := counter()
fmt.Println(c())  // 1
fmt.Println(c())  // 2
fmt.Println(c())  // 3

Functions as First-Class Citizens

Functional Programming in Go

Go treats functions as first-class values: they can be assigned to variables, passed as arguments, returned from functions, and stored in data structures. This enables functional programming patterns while maintaining Go's simplicity.

Higher-Order Function Patterns

Map/Filter/Reduce: Process collections functionally
Middleware: Wrap handlers with cross-cutting concerns
Strategy Pattern: Select algorithms at runtime
Dependency Injection: Pass behaviors as functions

Function Types and Signatures

Function types allow you to define the signature of functions that can be used interchangeably, enabling polymorphic behavior without inheritance.

// Function type
type operation func(int, int) int

// Higher-order function
func calculate(x, y int, op operation) int {
    return op(x, y)
}

// Using function as parameter
add := func(a, b int) int { return a + b }
mul := func(a, b int) int { return a * b }

fmt.Println(calculate(5, 3, add))  // 8
fmt.Println(calculate(5, 3, mul))  // 15

// Map of functions
operations := map[string]operation{
    "add": func(a, b int) int { return a + b },
    "sub": func(a, b int) int { return a - b },
    "mul": func(a, b int) int { return a * b },
}

Recursion

Recursive Functions in Go

Go supports recursion but doesn't optimize tail calls. For deep recursion, consider iterative approaches or explicit stack management to avoid stack overflow.

⚠️ Recursion Considerations

No Tail Call Optimization: Go doesn't optimize tail-recursive calls
Stack Limits: Default stack size starts small but grows dynamically
Performance: Function call overhead can be significant
Alternative: Consider iterative solutions for performance-critical code

// Factorial recursion
func factorial(n int) int {
    if n <= 1 {
        return 1
    }
    return n * factorial(n-1)
}

// Fibonacci with memoization
func fibonacci() func() int {
    a, b := 0, 1
    return func() int {
        a, b = b, a+b
        return a
    }
}

fib := fibonacci()
for i := 0; i < 10; i++ {
    fmt.Println(fib())
}

Function Best Practices

Design Guidelines

Function Design Principles

Single Responsibility: Each function should do one thing well
Predictable Behavior: Avoid side effects when possible
Clear Naming: Use verb phrases that describe the action
Appropriate Length: If it doesn't fit on a screen, consider breaking it up
Consistent Error Handling: Always return errors as the last value

Performance Optimization

Technique	When to Use	Trade-off
Inline Functions	Small, frequently called functions	Larger binary size
Avoid Allocations	Hot paths, tight loops	More complex code
Buffer Pooling	Frequent temporary allocations	Memory overhead
Batch Operations	Multiple similar operations	Higher latency

Common Patterns

// Option Pattern for configuration
type Option func(*Config)

func WithTimeout(d time.Duration) Option {
    return func(c *Config) {
        c.Timeout = d
    }
}

func NewClient(opts ...Option) *Client {
    cfg := &Config{
        Timeout: 30 * time.Second,  // defaults
    }
    for _, opt := range opts {
        opt(cfg)
    }
    return &Client{config: cfg}
}

// Middleware Pattern
type Handler func(ctx context.Context, req Request) Response
type Middleware func(Handler) Handler

func Logging(next Handler) Handler {
    return func(ctx context.Context, req Request) Response {
        start := time.Now()
        resp := next(ctx, req)
        log.Printf("Request took %v", time.Since(start))
        return resp
    }
}

Error Handling Patterns

Idiomatic Error Handling

// Check errors immediately
result, err := doSomething()
if err != nil {
    return fmt.Errorf("failed to do something: %w", err)
}

// Error wrapping for context
if err := validateInput(input); err != nil {
    return fmt.Errorf("validation failed for %q: %w", input, err)
}

// Sentinel errors for specific conditions
var ErrNotFound = errors.New("item not found")

func find(id string) (*Item, error) {
    // ...
    return nil, ErrNotFound
}

Practice Exercises

Exercise 1: Function Composition

Create a compose function that combines two functions into one.

Exercise 2: Curry Function

Implement function currying for a function that takes multiple parameters.

Exercise 3: Memoization

Create a generic memoization wrapper for expensive functions.