Files
forego/procfile.go
Enrico ComitiandDavid Dollar d42165a186 Fix longest name length (#90)
Hi @ddollar,
thanks for your work on Forego.

Just an aesthetical issue: there is a wrong alignement when the longest name of processes has length 6.

A Procfile:

```
qwerty: echo 'hi'
```

Output with current version:

```
forego  | starting qwerty.1 on port 5000
qwerty.1 | hi
```

Output applying this commit:

```
forego   | starting qwerty.1 on port 5000
qwerty.1 | hi
```
2016-10-09 10:36:27 -04:00

75 lines
1.4 KiB
Go

package main
import (
"bufio"
"fmt"
"io"
"math"
"os"
"regexp"
)
var procfileEntryRegexp = regexp.MustCompile("^([A-Za-z0-9_-]+):\\s*(.+)$")
type ProcfileEntry struct {
Name string
Command string
}
type Procfile struct {
Entries []ProcfileEntry
}
func ReadProcfile(filename string) (*Procfile, error) {
fd, err := os.Open(filename)
if err != nil {
return nil, err
}
defer fd.Close()
return parseProcfile(fd)
}
func (pf *Procfile) HasProcess(name string) (exists bool) {
for _, entry := range pf.Entries {
if name == entry.Name {
return true
}
}
return false
}
func (pf *Procfile) LongestProcessName(concurrency map[string]int) (longest int) {
longest = 6 // length of forego
for _, entry := range pf.Entries {
thisLen := len(entry.Name)
// The "."
thisLen += 1
if c, ok := concurrency[entry.Name]; ok {
// Add the number of digits
thisLen += int(math.Log10(float64(c))) + 1
} else {
// The index number after the dot.
thisLen += 1
}
if thisLen > longest {
longest = thisLen
}
}
return
}
func parseProcfile(r io.Reader) (*Procfile, error) {
pf := new(Procfile)
scanner := bufio.NewScanner(r)
for scanner.Scan() {
parts := procfileEntryRegexp.FindStringSubmatch(scanner.Text())
if len(parts) > 0 {
pf.Entries = append(pf.Entries, ProcfileEntry{parts[1], parts[2]})
}
}
if err := scanner.Err(); err != nil {
return nil, fmt.Errorf("Reading Procfile: %s", err)
}
return pf, nil
}