palindrome: move to palindrome package

Dependencies

• [2] ZQFONDI4 Add simple version
• [3] MCHVA5DY Palindrome initial import

Change contents

• replacement in snippets/palindrome/palindrome.go at line 1
  [3.42]→[3.43:231](∅→∅),[3.231]→[2.0:126](∅→∅),[2.126]→[3.359:455](∅→∅),[3.359]→[3.359:455](∅→∅)
  − // Palindrome is a string that is the same forward and backward

  −

  − package main

  −

  − import (

  − "bufio"

  − "fmt"

  − "os"

  − )

  −

  − func main() {

  − scanner := bufio.NewScanner(os.Stdin)

  − for scanner.Scan() {

  − if len(scanner.Text()) > 3 {

  − fmt.Println(Palindrome(scanner.Text()))

  − } else {

  − fmt.Println("Input string too short")

  − }

  − }

  − if scanner.Err() != nil {

  − fmt.Fprintln(os.Stderr, "Error reading console input")

  − }

  − }
  [3.42]

  [3.455]
  + /*

  + Package palindrome is for finding palindromes

  + */

  + package palindrome
• replacement in snippets/palindrome/palindrome.go at line 6
  [3.456]→[3.456:497](∅→∅)
  − // Returns the longest palindrome in str
  [3.456]

  [2.127]
  + // Single searches for the longest palindrome in the input string.
• replacement in snippets/palindrome/palindrome.go at line 8
  [2.152]→[2.152:196](∅→∅)
  − func palindrome_single(str string) string {
  [2.152]

  [2.196]
  + func Single(str string) string {
• replacement in snippets/palindrome/palindrome.go at line 34
  [2.627]→[2.627:668](∅→∅)
  − // Returns the longest palindrome in str
  [2.627]

  [2.668]
  + // Concurrent returns the longest palindrome in str
• replacement in snippets/palindrome/palindrome.go at line 36
  [2.690]→[2.690:727](∅→∅)
  − func Palindrome(str string) string {
  [2.690]

  [3.534]
  + func Concurrent(str string) string {