small refactor

main.go

@@ -10,6 +10,7 @@ import (
 )
 
 const usage = "bdb <(w)rite|(r)ead> <db>"
+const queued = "queued"
 
 func main() {
 	log.SetFlags(log.Lshortfile)
@@ -30,8 +31,11 @@ func main() {
 		panic(err)
 	}
 	defer db.Close()
+
+	switch os.Args[1] {
+	case "write", "w":
 		err = db.Update(func(tx *bolt.Tx) error {
-		_, err := tx.CreateBucketIfNotExists([]byte("queue"))
+			_, err := tx.CreateBucketIfNotExists([]byte(queued))
 			if err != nil {
 				return err
 			}
@@ -40,12 +44,9 @@ func main() {
 		if err != nil {
 			panic(err)
 		}
-
-	switch os.Args[1] {
-	case "write", "w":
 		err := db.Update(func(tx *bolt.Tx) error {
 			s := bufio.NewScanner(os.Stdin)
-			b := tx.Bucket([]byte("queue"))
+			b := tx.Bucket([]byte(queued))
 			for s.Scan() {
 				err := b.Put(s.Bytes(), s.Bytes())
 				if err != nil {
@@ -58,8 +59,18 @@ func main() {
 			panic(err)
 		}
 	case "read", "r":
+		err = db.Update(func(tx *bolt.Tx) error {
+			_, err := tx.CreateBucketIfNotExists([]byte(queued))
+			if err != nil {
+				return err
+			}
+			return nil
+		})
+		if err != nil {
+			panic(err)
+		}
 		db.View(func(tx *bolt.Tx) error {
-			b := tx.Bucket([]byte("queue"))
+			b := tx.Bucket([]byte(queued))
 			c := b.Cursor()
 
 			for k, v := c.First(); k != nil; k, v = c.Next() {