doBinary illustrates first-order function capability in Go. It invokes invokes any function that takes two ints and return an integer as a result (i.e

doUnary uses first-order functionality of Go to implement a function that can apply unary operation to any given integer (i.e. sqr(3), log(1000), etc)

fib is a simple interative implementation of a function that lists all fibonacci numbers up to n position in the sequence

filter uses Go's first-order function support to build a functional idiom where the provided number list by applying f()

modify the value referenced by pointer

handle client connection

isPrime tests number n for primality using the "trial division" method to test all factors up to Sqrt(n)

load loads the content of the specified file's name into memory as an slice (array) of strings. Notice the function also returns an error value that

load loads the content of the specified file's name into memory as an slice (array) of strings. Notice the function also returns an error value that

load loads the content of the specified file's name into memory as an slice (array) of strings. Notice the function also returns an error value that

makeAnagrams creates the anagram and writes them to a file. It also capture any panic situtaion and recovers gracefully.

mapWords maps each word to its associate signature

mapWords loads the content of the specified file's name into and uses the specified function to generate a tuple containng the word-class signature an

mapWords maps each word to its associated signature

finds # of moles

find #moles and atoms

printPi prints Go's internal representation of Pi.

recip return reciprocal of a value val as 1/val.

reduceWords creates a map of the array of tuples produced the mapping step. Each word is collected and mapped to its associated signature.

removes an entry, error if not found

sortRunes is a simple insertion sort that sorts the runes of the given string. By sorting the unicode chars of the string (i.e. "morning" -> "gimnnor"

sortRunes is a simple insertion sort that sorts the runes of the given string. By sorting the unicode chars of the string (i.e. "morning" -> "gimnnor"

sortRunes is a simple insertion sort that sorts the runes of the given string. By sorting the unicode chars of the string (i.e. "morning" -> "gimnnor"

sortRunes is a simple insertion sort that sorts the runes of the given string. By sorting the unicode chars of the string (i.e. "morning" -> "gimnnor"

sum demonstrates variadic parameters it returns the sum of all numers passed to function