pmn

func getConnectionInfo() string {
	// Prompt the user for connection string info
	var servername, username, password string

	fmt.Print("Enter Server Name:")
	fmt.Scanf("%s", &servername)

	fmt.Print("Enter User Name:")
	fmt.Scanf("%s", &username)

pmn

func getConnectionInfo() string {
	// Prompt the user for connection string info
	var servername, username, password string
	reader := bufio.NewReader(os.Stdin)
	fmt.Print("Enter Server Name:")
	servername, _ = reader.ReadString('\n')
	servername = strings.TrimRight(servername, "\r\n")

	fmt.Print("Enter User Name:")
	username, _ = reader.ReadString('\n')

pmn

// Convert an interface{} containing a slice of structs into [][]string.
func recordize(input interface{}) [][]string {
	var records [][]string
	var header []string // The first record in records will contain the names of the fields
	object := reflect.ValueOf(input)

	// The first record in the records slice should contain headers / field names
	if object.Len() > 0 {
		first := object.Index(0)
		typ := first.Type()

pmn

package main

import (
  "fmt"
	"github.com/gorilla/mux"
	"html/template"
	"mywebsite/api"
	"log"
	"net/http"
	"os"

pmn

// The following iterative sequence is defined for the set of positive integers:
//
// n -> n/2 (n is even)
// n -> 3n + 1 (n is odd)
//
// Using the rule above and starting with 13, we generate the following sequence:
//
// 13  40  20  10  5  16  8  4  2  1
//
// It can be seen that this sequence (starting at 13 and finishing at 1) contains 10 terms.

pmn

packages:
  yum:
    git: []
    htop: []

pmn

Keybase proof

I hereby claim:

• I am pmn on github.
• I am pmn (https://keybase.io/pmn) on keybase.
• I have a public key ASBLRbYKu4nzVF40UbQf3YVB15mdd1AzGjlULl8hv9s_vwo

To claim this, I am signing this object: