summaryrefslogtreecommitdiffstats
diff options
context:
space:
mode:
authorSam Anthony <sam@samanthony.xyz>2024-09-01 18:55:43 -0400
committerSam Anthony <sam@samanthony.xyz>2024-09-01 18:55:43 -0400
commitb60931fceea5fa0661ff18da13d324c0136897f7 (patch)
treece89c825ddb47958f019b7291fdb457e4b5cb183
parent69c13dc71052e21c953179dc678b0bea10d7f11c (diff)
downloadmarkov-b60931fceea5fa0661ff18da13d324c0136897f7.zip
format comments
-rw-r--r--fmt.go4
-rw-r--r--markov.go10
2 files changed, 7 insertions, 7 deletions
diff --git a/fmt.go b/fmt.go
index 09d223e..1fdee92 100644
--- a/fmt.go
+++ b/fmt.go
@@ -1,5 +1,5 @@
-// This program wraps its input into short lines. It is based on fmt.awk from
-// "The Practice of Programming" by Brian Kernighan and Rob Pike (pp. 229).
+// This program wraps its input into short lines. It is based on fmt.awk from "The
+// Practice of Programming" by Brian Kernighan and Rob Pike (pp. 229).
package main
import (
diff --git a/markov.go b/markov.go
index 3a4e5dc..48a683b 100644
--- a/markov.go
+++ b/markov.go
@@ -1,10 +1,10 @@
// This program implements a Markov chain algorithm. It generates pseudo-random
-// prose based on the given input text. It works by breaking each phrase into two
-// parts: a multi-word prefix, and a single suffix word. It generates output by randomly
+// prose based on the input text. It works by breaking each phrase into two parts:
+// a multi-word prefix, and a single word suffix. It generates output by randomly
// choosing a suffix that follows the prefix.
-//
-// The program is based on Chapter 3 of "The Practice of Programming" by
-// Brian Kernighan and Rob Pike.
+//
+// The program is based on Chapter 3 of "The Practice of Programming" by Brian Kernighan
+// and Rob Pike.
package main
import (