mirror of https://github.com/grafana/grafana
tech: replace bmizerany/assert with stretchr/testify (#16625)
bmizerany is old and unsupported. so we are replacing it with stretchr which is an drop in replacement and something we want to use more in Grafana.pull/16644/head^2
Carl Bergquist
6 years ago
committed by
GitHub
parent
01fbf972aa
commit
3f136e0da9
@ -1,7 +0,0 @@ |
||||
_go_.* |
||||
_gotest_.* |
||||
_obj |
||||
_test |
||||
_testmain.go |
||||
*.out |
||||
*.[568] |
||||
@ -1,47 +0,0 @@ |
||||
# NO LONGER MAINTAINED - Just use Go's testing package. |
||||
|
||||
# Assert (c) Blake Mizerany and Keith Rarick -- MIT LICENCE |
||||
|
||||
## Assertions for Go tests |
||||
|
||||
## Install |
||||
|
||||
$ go get github.com/bmizerany/assert |
||||
|
||||
## Use |
||||
|
||||
**point.go** |
||||
|
||||
package point |
||||
|
||||
type Point struct { |
||||
x, y int |
||||
} |
||||
|
||||
**point_test.go** |
||||
|
||||
|
||||
package point |
||||
|
||||
import ( |
||||
"testing" |
||||
"github.com/bmizerany/assert" |
||||
) |
||||
|
||||
func TestAsserts(t *testing.T) { |
||||
p1 := Point{1, 1} |
||||
p2 := Point{2, 1} |
||||
|
||||
assert.Equal(t, p1, p2) |
||||
} |
||||
|
||||
**output** |
||||
$ go test |
||||
--- FAIL: TestAsserts (0.00 seconds) |
||||
assert.go:15: /Users/flavio.barbosa/dev/stewie/src/point_test.go:12 |
||||
assert.go:24: ! X: 1 != 2 |
||||
FAIL |
||||
|
||||
## Docs |
||||
|
||||
http://github.com/bmizerany/assert |
||||
@ -1,76 +0,0 @@ |
||||
package assert |
||||
// Testing helpers for doozer.
|
||||
|
||||
import ( |
||||
"github.com/kr/pretty" |
||||
"reflect" |
||||
"testing" |
||||
"runtime" |
||||
"fmt" |
||||
) |
||||
|
||||
func assert(t *testing.T, result bool, f func(), cd int) { |
||||
if !result { |
||||
_, file, line, _ := runtime.Caller(cd + 1) |
||||
t.Errorf("%s:%d", file, line) |
||||
f() |
||||
t.FailNow() |
||||
} |
||||
} |
||||
|
||||
func equal(t *testing.T, exp, got interface{}, cd int, args ...interface{}) { |
||||
fn := func() { |
||||
for _, desc := range pretty.Diff(exp, got) { |
||||
t.Error("!", desc) |
||||
} |
||||
if len(args) > 0 { |
||||
t.Error("!", " -", fmt.Sprint(args...)) |
||||
} |
||||
} |
||||
result := reflect.DeepEqual(exp, got) |
||||
assert(t, result, fn, cd+1) |
||||
} |
||||
|
||||
func tt(t *testing.T, result bool, cd int, args ...interface{}) { |
||||
fn := func() { |
||||
t.Errorf("! Failure") |
||||
if len(args) > 0 { |
||||
t.Error("!", " -", fmt.Sprint(args...)) |
||||
} |
||||
} |
||||
assert(t, result, fn, cd+1) |
||||
} |
||||
|
||||
func T(t *testing.T, result bool, args ...interface{}) { |
||||
tt(t, result, 1, args...) |
||||
} |
||||
|
||||
func Tf(t *testing.T, result bool, format string, args ...interface{}) { |
||||
tt(t, result, 1, fmt.Sprintf(format, args...)) |
||||
} |
||||
|
||||
func Equal(t *testing.T, exp, got interface{}, args ...interface{}) { |
||||
equal(t, exp, got, 1, args...) |
||||
} |
||||
|
||||
func Equalf(t *testing.T, exp, got interface{}, format string, args ...interface{}) { |
||||
equal(t, exp, got, 1, fmt.Sprintf(format, args...)) |
||||
} |
||||
|
||||
func NotEqual(t *testing.T, exp, got interface{}, args ...interface{}) { |
||||
fn := func() { |
||||
t.Errorf("! Unexpected: <%#v>", exp) |
||||
if len(args) > 0 { |
||||
t.Error("!", " -", fmt.Sprint(args...)) |
||||
} |
||||
} |
||||
result := !reflect.DeepEqual(exp, got) |
||||
assert(t, result, fn, 1) |
||||
} |
||||
|
||||
func Panic(t *testing.T, err interface{}, fn func()) { |
||||
defer func() { |
||||
equal(t, err, recover(), 3) |
||||
}() |
||||
fn() |
||||
} |
||||
@ -1,4 +0,0 @@ |
||||
[568].out |
||||
_go* |
||||
_test* |
||||
_obj |
||||
@ -1,9 +0,0 @@ |
||||
package pretty |
||||
|
||||
import "github.com/kr/pretty" |
||||
|
||||
Package pretty provides pretty-printing for Go values. |
||||
|
||||
Documentation |
||||
|
||||
http://godoc.org/github.com/kr/pretty |
||||
@ -1,265 +0,0 @@ |
||||
package pretty |
||||
|
||||
import ( |
||||
"fmt" |
||||
"io" |
||||
"reflect" |
||||
) |
||||
|
||||
type sbuf []string |
||||
|
||||
func (p *sbuf) Printf(format string, a ...interface{}) { |
||||
s := fmt.Sprintf(format, a...) |
||||
*p = append(*p, s) |
||||
} |
||||
|
||||
// Diff returns a slice where each element describes
|
||||
// a difference between a and b.
|
||||
func Diff(a, b interface{}) (desc []string) { |
||||
Pdiff((*sbuf)(&desc), a, b) |
||||
return desc |
||||
} |
||||
|
||||
// wprintfer calls Fprintf on w for each Printf call
|
||||
// with a trailing newline.
|
||||
type wprintfer struct{ w io.Writer } |
||||
|
||||
func (p *wprintfer) Printf(format string, a ...interface{}) { |
||||
fmt.Fprintf(p.w, format+"\n", a...) |
||||
} |
||||
|
||||
// Fdiff writes to w a description of the differences between a and b.
|
||||
func Fdiff(w io.Writer, a, b interface{}) { |
||||
Pdiff(&wprintfer{w}, a, b) |
||||
} |
||||
|
||||
type Printfer interface { |
||||
Printf(format string, a ...interface{}) |
||||
} |
||||
|
||||
// Pdiff prints to p a description of the differences between a and b.
|
||||
// It calls Printf once for each difference, with no trailing newline.
|
||||
// The standard library log.Logger is a Printfer.
|
||||
func Pdiff(p Printfer, a, b interface{}) { |
||||
diffPrinter{w: p}.diff(reflect.ValueOf(a), reflect.ValueOf(b)) |
||||
} |
||||
|
||||
type Logfer interface { |
||||
Logf(format string, a ...interface{}) |
||||
} |
||||
|
||||
// logprintfer calls Fprintf on w for each Printf call
|
||||
// with a trailing newline.
|
||||
type logprintfer struct{ l Logfer } |
||||
|
||||
func (p *logprintfer) Printf(format string, a ...interface{}) { |
||||
p.l.Logf(format, a...) |
||||
} |
||||
|
||||
// Ldiff prints to l a description of the differences between a and b.
|
||||
// It calls Logf once for each difference, with no trailing newline.
|
||||
// The standard library testing.T and testing.B are Logfers.
|
||||
func Ldiff(l Logfer, a, b interface{}) { |
||||
Pdiff(&logprintfer{l}, a, b) |
||||
} |
||||
|
||||
type diffPrinter struct { |
||||
w Printfer |
||||
l string // label
|
||||
} |
||||
|
||||
func (w diffPrinter) printf(f string, a ...interface{}) { |
||||
var l string |
||||
if w.l != "" { |
||||
l = w.l + ": " |
||||
} |
||||
w.w.Printf(l+f, a...) |
||||
} |
||||
|
||||
func (w diffPrinter) diff(av, bv reflect.Value) { |
||||
if !av.IsValid() && bv.IsValid() { |
||||
w.printf("nil != %# v", formatter{v: bv, quote: true}) |
||||
return |
||||
} |
||||
if av.IsValid() && !bv.IsValid() { |
||||
w.printf("%# v != nil", formatter{v: av, quote: true}) |
||||
return |
||||
} |
||||
if !av.IsValid() && !bv.IsValid() { |
||||
return |
||||
} |
||||
|
||||
at := av.Type() |
||||
bt := bv.Type() |
||||
if at != bt { |
||||
w.printf("%v != %v", at, bt) |
||||
return |
||||
} |
||||
|
||||
switch kind := at.Kind(); kind { |
||||
case reflect.Bool: |
||||
if a, b := av.Bool(), bv.Bool(); a != b { |
||||
w.printf("%v != %v", a, b) |
||||
} |
||||
case reflect.Int, reflect.Int8, reflect.Int16, reflect.Int32, reflect.Int64: |
||||
if a, b := av.Int(), bv.Int(); a != b { |
||||
w.printf("%d != %d", a, b) |
||||
} |
||||
case reflect.Uint, reflect.Uint8, reflect.Uint16, reflect.Uint32, reflect.Uint64, reflect.Uintptr: |
||||
if a, b := av.Uint(), bv.Uint(); a != b { |
||||
w.printf("%d != %d", a, b) |
||||
} |
||||
case reflect.Float32, reflect.Float64: |
||||
if a, b := av.Float(), bv.Float(); a != b { |
||||
w.printf("%v != %v", a, b) |
||||
} |
||||
case reflect.Complex64, reflect.Complex128: |
||||
if a, b := av.Complex(), bv.Complex(); a != b { |
||||
w.printf("%v != %v", a, b) |
||||
} |
||||
case reflect.Array: |
||||
n := av.Len() |
||||
for i := 0; i < n; i++ { |
||||
w.relabel(fmt.Sprintf("[%d]", i)).diff(av.Index(i), bv.Index(i)) |
||||
} |
||||
case reflect.Chan, reflect.Func, reflect.UnsafePointer: |
||||
if a, b := av.Pointer(), bv.Pointer(); a != b { |
||||
w.printf("%#x != %#x", a, b) |
||||
} |
||||
case reflect.Interface: |
||||
w.diff(av.Elem(), bv.Elem()) |
||||
case reflect.Map: |
||||
ak, both, bk := keyDiff(av.MapKeys(), bv.MapKeys()) |
||||
for _, k := range ak { |
||||
w := w.relabel(fmt.Sprintf("[%#v]", k)) |
||||
w.printf("%q != (missing)", av.MapIndex(k)) |
||||
} |
||||
for _, k := range both { |
||||
w := w.relabel(fmt.Sprintf("[%#v]", k)) |
||||
w.diff(av.MapIndex(k), bv.MapIndex(k)) |
||||
} |
||||
for _, k := range bk { |
||||
w := w.relabel(fmt.Sprintf("[%#v]", k)) |
||||
w.printf("(missing) != %q", bv.MapIndex(k)) |
||||
} |
||||
case reflect.Ptr: |
||||
switch { |
||||
case av.IsNil() && !bv.IsNil(): |
||||
w.printf("nil != %# v", formatter{v: bv, quote: true}) |
||||
case !av.IsNil() && bv.IsNil(): |
||||
w.printf("%# v != nil", formatter{v: av, quote: true}) |
||||
case !av.IsNil() && !bv.IsNil(): |
||||
w.diff(av.Elem(), bv.Elem()) |
||||
} |
||||
case reflect.Slice: |
||||
lenA := av.Len() |
||||
lenB := bv.Len() |
||||
if lenA != lenB { |
||||
w.printf("%s[%d] != %s[%d]", av.Type(), lenA, bv.Type(), lenB) |
||||
break |
||||
} |
||||
for i := 0; i < lenA; i++ { |
||||
w.relabel(fmt.Sprintf("[%d]", i)).diff(av.Index(i), bv.Index(i)) |
||||
} |
||||
case reflect.String: |
||||
if a, b := av.String(), bv.String(); a != b { |
||||
w.printf("%q != %q", a, b) |
||||
} |
||||
case reflect.Struct: |
||||
for i := 0; i < av.NumField(); i++ { |
||||
w.relabel(at.Field(i).Name).diff(av.Field(i), bv.Field(i)) |
||||
} |
||||
default: |
||||
panic("unknown reflect Kind: " + kind.String()) |
||||
} |
||||
} |
||||
|
||||
func (d diffPrinter) relabel(name string) (d1 diffPrinter) { |
||||
d1 = d |
||||
if d.l != "" && name[0] != '[' { |
||||
d1.l += "." |
||||
} |
||||
d1.l += name |
||||
return d1 |
||||
} |
||||
|
||||
// keyEqual compares a and b for equality.
|
||||
// Both a and b must be valid map keys.
|
||||
func keyEqual(av, bv reflect.Value) bool { |
||||
if !av.IsValid() && !bv.IsValid() { |
||||
return true |
||||
} |
||||
if !av.IsValid() || !bv.IsValid() || av.Type() != bv.Type() { |
||||
return false |
||||
} |
||||
switch kind := av.Kind(); kind { |
||||
case reflect.Bool: |
||||
a, b := av.Bool(), bv.Bool() |
||||
return a == b |
||||
case reflect.Int, reflect.Int8, reflect.Int16, reflect.Int32, reflect.Int64: |
||||
a, b := av.Int(), bv.Int() |
||||
return a == b |
||||
case reflect.Uint, reflect.Uint8, reflect.Uint16, reflect.Uint32, reflect.Uint64, reflect.Uintptr: |
||||
a, b := av.Uint(), bv.Uint() |
||||
return a == b |
||||
case reflect.Float32, reflect.Float64: |
||||
a, b := av.Float(), bv.Float() |
||||
return a == b |
||||
case reflect.Complex64, reflect.Complex128: |
||||
a, b := av.Complex(), bv.Complex() |
||||
return a == b |
||||
case reflect.Array: |
||||
for i := 0; i < av.Len(); i++ { |
||||
if !keyEqual(av.Index(i), bv.Index(i)) { |
||||
return false |
||||
} |
||||
} |
||||
return true |
||||
case reflect.Chan, reflect.UnsafePointer, reflect.Ptr: |
||||
a, b := av.Pointer(), bv.Pointer() |
||||
return a == b |
||||
case reflect.Interface: |
||||
return keyEqual(av.Elem(), bv.Elem()) |
||||
case reflect.String: |
||||
a, b := av.String(), bv.String() |
||||
return a == b |
||||
case reflect.Struct: |
||||
for i := 0; i < av.NumField(); i++ { |
||||
if !keyEqual(av.Field(i), bv.Field(i)) { |
||||
return false |
||||
} |
||||
} |
||||
return true |
||||
default: |
||||
panic("invalid map key type " + av.Type().String()) |
||||
} |
||||
} |
||||
|
||||
func keyDiff(a, b []reflect.Value) (ak, both, bk []reflect.Value) { |
||||
for _, av := range a { |
||||
inBoth := false |
||||
for _, bv := range b { |
||||
if keyEqual(av, bv) { |
||||
inBoth = true |
||||
both = append(both, av) |
||||
break |
||||
} |
||||
} |
||||
if !inBoth { |
||||
ak = append(ak, av) |
||||
} |
||||
} |
||||
for _, bv := range b { |
||||
inBoth := false |
||||
for _, av := range a { |
||||
if keyEqual(av, bv) { |
||||
inBoth = true |
||||
break |
||||
} |
||||
} |
||||
if !inBoth { |
||||
bk = append(bk, bv) |
||||
} |
||||
} |
||||
return |
||||
} |
||||
@ -1,328 +0,0 @@ |
||||
package pretty |
||||
|
||||
import ( |
||||
"fmt" |
||||
"io" |
||||
"reflect" |
||||
"strconv" |
||||
"text/tabwriter" |
||||
|
||||
"github.com/kr/text" |
||||
) |
||||
|
||||
type formatter struct { |
||||
v reflect.Value |
||||
force bool |
||||
quote bool |
||||
} |
||||
|
||||
// Formatter makes a wrapper, f, that will format x as go source with line
|
||||
// breaks and tabs. Object f responds to the "%v" formatting verb when both the
|
||||
// "#" and " " (space) flags are set, for example:
|
||||
//
|
||||
// fmt.Sprintf("%# v", Formatter(x))
|
||||
//
|
||||
// If one of these two flags is not set, or any other verb is used, f will
|
||||
// format x according to the usual rules of package fmt.
|
||||
// In particular, if x satisfies fmt.Formatter, then x.Format will be called.
|
||||
func Formatter(x interface{}) (f fmt.Formatter) { |
||||
return formatter{v: reflect.ValueOf(x), quote: true} |
||||
} |
||||
|
||||
func (fo formatter) String() string { |
||||
return fmt.Sprint(fo.v.Interface()) // unwrap it
|
||||
} |
||||
|
||||
func (fo formatter) passThrough(f fmt.State, c rune) { |
||||
s := "%" |
||||
for i := 0; i < 128; i++ { |
||||
if f.Flag(i) { |
||||
s += string(i) |
||||
} |
||||
} |
||||
if w, ok := f.Width(); ok { |
||||
s += fmt.Sprintf("%d", w) |
||||
} |
||||
if p, ok := f.Precision(); ok { |
||||
s += fmt.Sprintf(".%d", p) |
||||
} |
||||
s += string(c) |
||||
fmt.Fprintf(f, s, fo.v.Interface()) |
||||
} |
||||
|
||||
func (fo formatter) Format(f fmt.State, c rune) { |
||||
if fo.force || c == 'v' && f.Flag('#') && f.Flag(' ') { |
||||
w := tabwriter.NewWriter(f, 4, 4, 1, ' ', 0) |
||||
p := &printer{tw: w, Writer: w, visited: make(map[visit]int)} |
||||
p.printValue(fo.v, true, fo.quote) |
||||
w.Flush() |
||||
return |
||||
} |
||||
fo.passThrough(f, c) |
||||
} |
||||
|
||||
type printer struct { |
||||
io.Writer |
||||
tw *tabwriter.Writer |
||||
visited map[visit]int |
||||
depth int |
||||
} |
||||
|
||||
func (p *printer) indent() *printer { |
||||
q := *p |
||||
q.tw = tabwriter.NewWriter(p.Writer, 4, 4, 1, ' ', 0) |
||||
q.Writer = text.NewIndentWriter(q.tw, []byte{'\t'}) |
||||
return &q |
||||
} |
||||
|
||||
func (p *printer) printInline(v reflect.Value, x interface{}, showType bool) { |
||||
if showType { |
||||
io.WriteString(p, v.Type().String()) |
||||
fmt.Fprintf(p, "(%#v)", x) |
||||
} else { |
||||
fmt.Fprintf(p, "%#v", x) |
||||
} |
||||
} |
||||
|
||||
// printValue must keep track of already-printed pointer values to avoid
|
||||
// infinite recursion.
|
||||
type visit struct { |
||||
v uintptr |
||||
typ reflect.Type |
||||
} |
||||
|
||||
func (p *printer) printValue(v reflect.Value, showType, quote bool) { |
||||
if p.depth > 10 { |
||||
io.WriteString(p, "!%v(DEPTH EXCEEDED)") |
||||
return |
||||
} |
||||
|
||||
switch v.Kind() { |
||||
case reflect.Bool: |
||||
p.printInline(v, v.Bool(), showType) |
||||
case reflect.Int, reflect.Int8, reflect.Int16, reflect.Int32, reflect.Int64: |
||||
p.printInline(v, v.Int(), showType) |
||||
case reflect.Uint, reflect.Uint8, reflect.Uint16, reflect.Uint32, reflect.Uint64, reflect.Uintptr: |
||||
p.printInline(v, v.Uint(), showType) |
||||
case reflect.Float32, reflect.Float64: |
||||
p.printInline(v, v.Float(), showType) |
||||
case reflect.Complex64, reflect.Complex128: |
||||
fmt.Fprintf(p, "%#v", v.Complex()) |
||||
case reflect.String: |
||||
p.fmtString(v.String(), quote) |
||||
case reflect.Map: |
||||
t := v.Type() |
||||
if showType { |
||||
io.WriteString(p, t.String()) |
||||
} |
||||
writeByte(p, '{') |
||||
if nonzero(v) { |
||||
expand := !canInline(v.Type()) |
||||
pp := p |
||||
if expand { |
||||
writeByte(p, '\n') |
||||
pp = p.indent() |
||||
} |
||||
keys := v.MapKeys() |
||||
for i := 0; i < v.Len(); i++ { |
||||
showTypeInStruct := true |
||||
k := keys[i] |
||||
mv := v.MapIndex(k) |
||||
pp.printValue(k, false, true) |
||||
writeByte(pp, ':') |
||||
if expand { |
||||
writeByte(pp, '\t') |
||||
} |
||||
showTypeInStruct = t.Elem().Kind() == reflect.Interface |
||||
pp.printValue(mv, showTypeInStruct, true) |
||||
if expand { |
||||
io.WriteString(pp, ",\n") |
||||
} else if i < v.Len()-1 { |
||||
io.WriteString(pp, ", ") |
||||
} |
||||
} |
||||
if expand { |
||||
pp.tw.Flush() |
||||
} |
||||
} |
||||
writeByte(p, '}') |
||||
case reflect.Struct: |
||||
t := v.Type() |
||||
if v.CanAddr() { |
||||
addr := v.UnsafeAddr() |
||||
vis := visit{addr, t} |
||||
if vd, ok := p.visited[vis]; ok && vd < p.depth { |
||||
p.fmtString(t.String()+"{(CYCLIC REFERENCE)}", false) |
||||
break // don't print v again
|
||||
} |
||||
p.visited[vis] = p.depth |
||||
} |
||||
|
||||
if showType { |
||||
io.WriteString(p, t.String()) |
||||
} |
||||
writeByte(p, '{') |
||||
if nonzero(v) { |
||||
expand := !canInline(v.Type()) |
||||
pp := p |
||||
if expand { |
||||
writeByte(p, '\n') |
||||
pp = p.indent() |
||||
} |
||||
for i := 0; i < v.NumField(); i++ { |
||||
showTypeInStruct := true |
||||
if f := t.Field(i); f.Name != "" { |
||||
io.WriteString(pp, f.Name) |
||||
writeByte(pp, ':') |
||||
if expand { |
||||
writeByte(pp, '\t') |
||||
} |
||||
showTypeInStruct = labelType(f.Type) |
||||
} |
||||
pp.printValue(getField(v, i), showTypeInStruct, true) |
||||
if expand { |
||||
io.WriteString(pp, ",\n") |
||||
} else if i < v.NumField()-1 { |
||||
io.WriteString(pp, ", ") |
||||
} |
||||
} |
||||
if expand { |
||||
pp.tw.Flush() |
||||
} |
||||
} |
||||
writeByte(p, '}') |
||||
case reflect.Interface: |
||||
switch e := v.Elem(); { |
||||
case e.Kind() == reflect.Invalid: |
||||
io.WriteString(p, "nil") |
||||
case e.IsValid(): |
||||
pp := *p |
||||
pp.depth++ |
||||
pp.printValue(e, showType, true) |
||||
default: |
||||
io.WriteString(p, v.Type().String()) |
||||
io.WriteString(p, "(nil)") |
||||
} |
||||
case reflect.Array, reflect.Slice: |
||||
t := v.Type() |
||||
if showType { |
||||
io.WriteString(p, t.String()) |
||||
} |
||||
if v.Kind() == reflect.Slice && v.IsNil() && showType { |
||||
io.WriteString(p, "(nil)") |
||||
break |
||||
} |
||||
if v.Kind() == reflect.Slice && v.IsNil() { |
||||
io.WriteString(p, "nil") |
||||
break |
||||
} |
||||
writeByte(p, '{') |
||||
expand := !canInline(v.Type()) |
||||
pp := p |
||||
if expand { |
||||
writeByte(p, '\n') |
||||
pp = p.indent() |
||||
} |
||||
for i := 0; i < v.Len(); i++ { |
||||
showTypeInSlice := t.Elem().Kind() == reflect.Interface |
||||
pp.printValue(v.Index(i), showTypeInSlice, true) |
||||
if expand { |
||||
io.WriteString(pp, ",\n") |
||||
} else if i < v.Len()-1 { |
||||
io.WriteString(pp, ", ") |
||||
} |
||||
} |
||||
if expand { |
||||
pp.tw.Flush() |
||||
} |
||||
writeByte(p, '}') |
||||
case reflect.Ptr: |
||||
e := v.Elem() |
||||
if !e.IsValid() { |
||||
writeByte(p, '(') |
||||
io.WriteString(p, v.Type().String()) |
||||
io.WriteString(p, ")(nil)") |
||||
} else { |
||||
pp := *p |
||||
pp.depth++ |
||||
writeByte(pp, '&') |
||||
pp.printValue(e, true, true) |
||||
} |
||||
case reflect.Chan: |
||||
x := v.Pointer() |
||||
if showType { |
||||
writeByte(p, '(') |
||||
io.WriteString(p, v.Type().String()) |
||||
fmt.Fprintf(p, ")(%#v)", x) |
||||
} else { |
||||
fmt.Fprintf(p, "%#v", x) |
||||
} |
||||
case reflect.Func: |
||||
io.WriteString(p, v.Type().String()) |
||||
io.WriteString(p, " {...}") |
||||
case reflect.UnsafePointer: |
||||
p.printInline(v, v.Pointer(), showType) |
||||
case reflect.Invalid: |
||||
io.WriteString(p, "nil") |
||||
} |
||||
} |
||||
|
||||
func canInline(t reflect.Type) bool { |
||||
switch t.Kind() { |
||||
case reflect.Map: |
||||
return !canExpand(t.Elem()) |
||||
case reflect.Struct: |
||||
for i := 0; i < t.NumField(); i++ { |
||||
if canExpand(t.Field(i).Type) { |
||||
return false |
||||
} |
||||
} |
||||
return true |
||||
case reflect.Interface: |
||||
return false |
||||
case reflect.Array, reflect.Slice: |
||||
return !canExpand(t.Elem()) |
||||
case reflect.Ptr: |
||||
return false |
||||
case reflect.Chan, reflect.Func, reflect.UnsafePointer: |
||||
return false |
||||
} |
||||
return true |
||||
} |
||||
|
||||
func canExpand(t reflect.Type) bool { |
||||
switch t.Kind() { |
||||
case reflect.Map, reflect.Struct, |
||||
reflect.Interface, reflect.Array, reflect.Slice, |
||||
reflect.Ptr: |
||||
return true |
||||
} |
||||
return false |
||||
} |
||||
|
||||
func labelType(t reflect.Type) bool { |
||||
switch t.Kind() { |
||||
case reflect.Interface, reflect.Struct: |
||||
return true |
||||
} |
||||
return false |
||||
} |
||||
|
||||
func (p *printer) fmtString(s string, quote bool) { |
||||
if quote { |
||||
s = strconv.Quote(s) |
||||
} |
||||
io.WriteString(p, s) |
||||
} |
||||
|
||||
func writeByte(w io.Writer, b byte) { |
||||
w.Write([]byte{b}) |
||||
} |
||||
|
||||
func getField(v reflect.Value, i int) reflect.Value { |
||||
val := v.Field(i) |
||||
if val.Kind() == reflect.Interface && !val.IsNil() { |
||||
val = val.Elem() |
||||
} |
||||
return val |
||||
} |
||||
@ -1,3 +0,0 @@ |
||||
module "github.com/kr/pretty" |
||||
|
||||
require "github.com/kr/text" v0.1.0 |
||||
@ -1,108 +0,0 @@ |
||||
// Package pretty provides pretty-printing for Go values. This is
|
||||
// useful during debugging, to avoid wrapping long output lines in
|
||||
// the terminal.
|
||||
//
|
||||
// It provides a function, Formatter, that can be used with any
|
||||
// function that accepts a format string. It also provides
|
||||
// convenience wrappers for functions in packages fmt and log.
|
||||
package pretty |
||||
|
||||
import ( |
||||
"fmt" |
||||
"io" |
||||
"log" |
||||
"reflect" |
||||
) |
||||
|
||||
// Errorf is a convenience wrapper for fmt.Errorf.
|
||||
//
|
||||
// Calling Errorf(f, x, y) is equivalent to
|
||||
// fmt.Errorf(f, Formatter(x), Formatter(y)).
|
||||
func Errorf(format string, a ...interface{}) error { |
||||
return fmt.Errorf(format, wrap(a, false)...) |
||||
} |
||||
|
||||
// Fprintf is a convenience wrapper for fmt.Fprintf.
|
||||
//
|
||||
// Calling Fprintf(w, f, x, y) is equivalent to
|
||||
// fmt.Fprintf(w, f, Formatter(x), Formatter(y)).
|
||||
func Fprintf(w io.Writer, format string, a ...interface{}) (n int, error error) { |
||||
return fmt.Fprintf(w, format, wrap(a, false)...) |
||||
} |
||||
|
||||
// Log is a convenience wrapper for log.Printf.
|
||||
//
|
||||
// Calling Log(x, y) is equivalent to
|
||||
// log.Print(Formatter(x), Formatter(y)), but each operand is
|
||||
// formatted with "%# v".
|
||||
func Log(a ...interface{}) { |
||||
log.Print(wrap(a, true)...) |
||||
} |
||||
|
||||
// Logf is a convenience wrapper for log.Printf.
|
||||
//
|
||||
// Calling Logf(f, x, y) is equivalent to
|
||||
// log.Printf(f, Formatter(x), Formatter(y)).
|
||||
func Logf(format string, a ...interface{}) { |
||||
log.Printf(format, wrap(a, false)...) |
||||
} |
||||
|
||||
// Logln is a convenience wrapper for log.Printf.
|
||||
//
|
||||
// Calling Logln(x, y) is equivalent to
|
||||
// log.Println(Formatter(x), Formatter(y)), but each operand is
|
||||
// formatted with "%# v".
|
||||
func Logln(a ...interface{}) { |
||||
log.Println(wrap(a, true)...) |
||||
} |
||||
|
||||
// Print pretty-prints its operands and writes to standard output.
|
||||
//
|
||||
// Calling Print(x, y) is equivalent to
|
||||
// fmt.Print(Formatter(x), Formatter(y)), but each operand is
|
||||
// formatted with "%# v".
|
||||
func Print(a ...interface{}) (n int, errno error) { |
||||
return fmt.Print(wrap(a, true)...) |
||||
} |
||||
|
||||
// Printf is a convenience wrapper for fmt.Printf.
|
||||
//
|
||||
// Calling Printf(f, x, y) is equivalent to
|
||||
// fmt.Printf(f, Formatter(x), Formatter(y)).
|
||||
func Printf(format string, a ...interface{}) (n int, errno error) { |
||||
return fmt.Printf(format, wrap(a, false)...) |
||||
} |
||||
|
||||
// Println pretty-prints its operands and writes to standard output.
|
||||
//
|
||||
// Calling Print(x, y) is equivalent to
|
||||
// fmt.Println(Formatter(x), Formatter(y)), but each operand is
|
||||
// formatted with "%# v".
|
||||
func Println(a ...interface{}) (n int, errno error) { |
||||
return fmt.Println(wrap(a, true)...) |
||||
} |
||||
|
||||
// Sprint is a convenience wrapper for fmt.Sprintf.
|
||||
//
|
||||
// Calling Sprint(x, y) is equivalent to
|
||||
// fmt.Sprint(Formatter(x), Formatter(y)), but each operand is
|
||||
// formatted with "%# v".
|
||||
func Sprint(a ...interface{}) string { |
||||
return fmt.Sprint(wrap(a, true)...) |
||||
} |
||||
|
||||
// Sprintf is a convenience wrapper for fmt.Sprintf.
|
||||
//
|
||||
// Calling Sprintf(f, x, y) is equivalent to
|
||||
// fmt.Sprintf(f, Formatter(x), Formatter(y)).
|
||||
func Sprintf(format string, a ...interface{}) string { |
||||
return fmt.Sprintf(format, wrap(a, false)...) |
||||
} |
||||
|
||||
func wrap(a []interface{}, force bool) []interface{} { |
||||
w := make([]interface{}, len(a)) |
||||
for i, x := range a { |
||||
w[i] = formatter{v: reflect.ValueOf(x), force: force} |
||||
} |
||||
return w |
||||
} |
||||
@ -1,41 +0,0 @@ |
||||
package pretty |
||||
|
||||
import ( |
||||
"reflect" |
||||
) |
||||
|
||||
func nonzero(v reflect.Value) bool { |
||||
switch v.Kind() { |
||||
case reflect.Bool: |
||||
return v.Bool() |
||||
case reflect.Int, reflect.Int8, reflect.Int16, reflect.Int32, reflect.Int64: |
||||
return v.Int() != 0 |
||||
case reflect.Uint, reflect.Uint8, reflect.Uint16, reflect.Uint32, reflect.Uint64, reflect.Uintptr: |
||||
return v.Uint() != 0 |
||||
case reflect.Float32, reflect.Float64: |
||||
return v.Float() != 0 |
||||
case reflect.Complex64, reflect.Complex128: |
||||
return v.Complex() != complex(0, 0) |
||||
case reflect.String: |
||||
return v.String() != "" |
||||
case reflect.Struct: |
||||
for i := 0; i < v.NumField(); i++ { |
||||
if nonzero(getField(v, i)) { |
||||
return true |
||||
} |
||||
} |
||||
return false |
||||
case reflect.Array: |
||||
for i := 0; i < v.Len(); i++ { |
||||
if nonzero(v.Index(i)) { |
||||
return true |
||||
} |
||||
} |
||||
return false |
||||
case reflect.Map, reflect.Interface, reflect.Slice, reflect.Ptr, reflect.Chan, reflect.Func: |
||||
return !v.IsNil() |
||||
case reflect.UnsafePointer: |
||||
return v.Pointer() != 0 |
||||
} |
||||
return true |
||||
} |
||||
@ -1,19 +0,0 @@ |
||||
Copyright 2012 Keith Rarick |
||||
|
||||
Permission is hereby granted, free of charge, to any person obtaining a copy |
||||
of this software and associated documentation files (the "Software"), to deal |
||||
in the Software without restriction, including without limitation the rights |
||||
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell |
||||
copies of the Software, and to permit persons to whom the Software is |
||||
furnished to do so, subject to the following conditions: |
||||
|
||||
The above copyright notice and this permission notice shall be included in |
||||
all copies or substantial portions of the Software. |
||||
|
||||
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR |
||||
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, |
||||
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE |
||||
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER |
||||
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, |
||||
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN |
||||
THE SOFTWARE. |
||||
@ -1,3 +0,0 @@ |
||||
This is a Go package for manipulating paragraphs of text. |
||||
|
||||
See http://go.pkgdoc.org/github.com/kr/text for full documentation. |
||||
@ -1,3 +0,0 @@ |
||||
// Package text provides rudimentary functions for manipulating text in
|
||||
// paragraphs.
|
||||
package text |
||||
@ -1,3 +0,0 @@ |
||||
module "github.com/kr/text" |
||||
|
||||
require "github.com/kr/pty" v1.1.1 |
||||
@ -1,74 +0,0 @@ |
||||
package text |
||||
|
||||
import ( |
||||
"io" |
||||
) |
||||
|
||||
// Indent inserts prefix at the beginning of each non-empty line of s. The
|
||||
// end-of-line marker is NL.
|
||||
func Indent(s, prefix string) string { |
||||
return string(IndentBytes([]byte(s), []byte(prefix))) |
||||
} |
||||
|
||||
// IndentBytes inserts prefix at the beginning of each non-empty line of b.
|
||||
// The end-of-line marker is NL.
|
||||
func IndentBytes(b, prefix []byte) []byte { |
||||
var res []byte |
||||
bol := true |
||||
for _, c := range b { |
||||
if bol && c != '\n' { |
||||
res = append(res, prefix...) |
||||
} |
||||
res = append(res, c) |
||||
bol = c == '\n' |
||||
} |
||||
return res |
||||
} |
||||
|
||||
// Writer indents each line of its input.
|
||||
type indentWriter struct { |
||||
w io.Writer |
||||
bol bool |
||||
pre [][]byte |
||||
sel int |
||||
off int |
||||
} |
||||
|
||||
// NewIndentWriter makes a new write filter that indents the input
|
||||
// lines. Each line is prefixed in order with the corresponding
|
||||
// element of pre. If there are more lines than elements, the last
|
||||
// element of pre is repeated for each subsequent line.
|
||||
func NewIndentWriter(w io.Writer, pre ...[]byte) io.Writer { |
||||
return &indentWriter{ |
||||
w: w, |
||||
pre: pre, |
||||
bol: true, |
||||
} |
||||
} |
||||
|
||||
// The only errors returned are from the underlying indentWriter.
|
||||
func (w *indentWriter) Write(p []byte) (n int, err error) { |
||||
for _, c := range p { |
||||
if w.bol { |
||||
var i int |
||||
i, err = w.w.Write(w.pre[w.sel][w.off:]) |
||||
w.off += i |
||||
if err != nil { |
||||
return n, err |
||||
} |
||||
} |
||||
_, err = w.w.Write([]byte{c}) |
||||
if err != nil { |
||||
return n, err |
||||
} |
||||
n++ |
||||
w.bol = c == '\n' |
||||
if w.bol { |
||||
w.off = 0 |
||||
if w.sel < len(w.pre)-1 { |
||||
w.sel++ |
||||
} |
||||
} |
||||
} |
||||
return n, nil |
||||
} |
||||
@ -1,86 +0,0 @@ |
||||
package text |
||||
|
||||
import ( |
||||
"bytes" |
||||
"math" |
||||
) |
||||
|
||||
var ( |
||||
nl = []byte{'\n'} |
||||
sp = []byte{' '} |
||||
) |
||||
|
||||
const defaultPenalty = 1e5 |
||||
|
||||
// Wrap wraps s into a paragraph of lines of length lim, with minimal
|
||||
// raggedness.
|
||||
func Wrap(s string, lim int) string { |
||||
return string(WrapBytes([]byte(s), lim)) |
||||
} |
||||
|
||||
// WrapBytes wraps b into a paragraph of lines of length lim, with minimal
|
||||
// raggedness.
|
||||
func WrapBytes(b []byte, lim int) []byte { |
||||
words := bytes.Split(bytes.Replace(bytes.TrimSpace(b), nl, sp, -1), sp) |
||||
var lines [][]byte |
||||
for _, line := range WrapWords(words, 1, lim, defaultPenalty) { |
||||
lines = append(lines, bytes.Join(line, sp)) |
||||
} |
||||
return bytes.Join(lines, nl) |
||||
} |
||||
|
||||
// WrapWords is the low-level line-breaking algorithm, useful if you need more
|
||||
// control over the details of the text wrapping process. For most uses, either
|
||||
// Wrap or WrapBytes will be sufficient and more convenient.
|
||||
//
|
||||
// WrapWords splits a list of words into lines with minimal "raggedness",
|
||||
// treating each byte as one unit, accounting for spc units between adjacent
|
||||
// words on each line, and attempting to limit lines to lim units. Raggedness
|
||||
// is the total error over all lines, where error is the square of the
|
||||
// difference of the length of the line and lim. Too-long lines (which only
|
||||
// happen when a single word is longer than lim units) have pen penalty units
|
||||
// added to the error.
|
||||
func WrapWords(words [][]byte, spc, lim, pen int) [][][]byte { |
||||
n := len(words) |
||||
|
||||
length := make([][]int, n) |
||||
for i := 0; i < n; i++ { |
||||
length[i] = make([]int, n) |
||||
length[i][i] = len(words[i]) |
||||
for j := i + 1; j < n; j++ { |
||||
length[i][j] = length[i][j-1] + spc + len(words[j]) |
||||
} |
||||
} |
||||
|
||||
nbrk := make([]int, n) |
||||
cost := make([]int, n) |
||||
for i := range cost { |
||||
cost[i] = math.MaxInt32 |
||||
} |
||||
for i := n - 1; i >= 0; i-- { |
||||
if length[i][n-1] <= lim || i == n-1 { |
||||
cost[i] = 0 |
||||
nbrk[i] = n |
||||
} else { |
||||
for j := i + 1; j < n; j++ { |
||||
d := lim - length[i][j-1] |
||||
c := d*d + cost[j] |
||||
if length[i][j-1] > lim { |
||||
c += pen // too-long lines get a worse penalty
|
||||
} |
||||
if c < cost[i] { |
||||
cost[i] = c |
||||
nbrk[i] = j |
||||
} |
||||
} |
||||
} |
||||
} |
||||
|
||||
var lines [][][]byte |
||||
i := 0 |
||||
for i < n { |
||||
lines = append(lines, words[i:nbrk[i]]) |
||||
i = nbrk[i] |
||||
} |
||||
return lines |
||||
} |
||||
@ -0,0 +1,27 @@ |
||||
Copyright (c) 2013, Patrick Mezard |
||||
All rights reserved. |
||||
|
||||
Redistribution and use in source and binary forms, with or without |
||||
modification, are permitted provided that the following conditions are |
||||
met: |
||||
|
||||
Redistributions of source code must retain the above copyright |
||||
notice, this list of conditions and the following disclaimer. |
||||
Redistributions in binary form must reproduce the above copyright |
||||
notice, this list of conditions and the following disclaimer in the |
||||
documentation and/or other materials provided with the distribution. |
||||
The names of its contributors may not be used to endorse or promote |
||||
products derived from this software without specific prior written |
||||
permission. |
||||
|
||||
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS |
||||
IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED |
||||
TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A |
||||
PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT |
||||
HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
||||
SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED |
||||
TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR |
||||
PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF |
||||
LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING |
||||
NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS |
||||
SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
||||
@ -0,0 +1,772 @@ |
||||
// Package difflib is a partial port of Python difflib module.
|
||||
//
|
||||
// It provides tools to compare sequences of strings and generate textual diffs.
|
||||
//
|
||||
// The following class and functions have been ported:
|
||||
//
|
||||
// - SequenceMatcher
|
||||
//
|
||||
// - unified_diff
|
||||
//
|
||||
// - context_diff
|
||||
//
|
||||
// Getting unified diffs was the main goal of the port. Keep in mind this code
|
||||
// is mostly suitable to output text differences in a human friendly way, there
|
||||
// are no guarantees generated diffs are consumable by patch(1).
|
||||
package difflib |
||||
|
||||
import ( |
||||
"bufio" |
||||
"bytes" |
||||
"fmt" |
||||
"io" |
||||
"strings" |
||||
) |
||||
|
||||
func min(a, b int) int { |
||||
if a < b { |
||||
return a |
||||
} |
||||
return b |
||||
} |
||||
|
||||
func max(a, b int) int { |
||||
if a > b { |
||||
return a |
||||
} |
||||
return b |
||||
} |
||||
|
||||
func calculateRatio(matches, length int) float64 { |
||||
if length > 0 { |
||||
return 2.0 * float64(matches) / float64(length) |
||||
} |
||||
return 1.0 |
||||
} |
||||
|
||||
type Match struct { |
||||
A int |
||||
B int |
||||
Size int |
||||
} |
||||
|
||||
type OpCode struct { |
||||
Tag byte |
||||
I1 int |
||||
I2 int |
||||
J1 int |
||||
J2 int |
||||
} |
||||
|
||||
// SequenceMatcher compares sequence of strings. The basic
|
||||
// algorithm predates, and is a little fancier than, an algorithm
|
||||
// published in the late 1980's by Ratcliff and Obershelp under the
|
||||
// hyperbolic name "gestalt pattern matching". The basic idea is to find
|
||||
// the longest contiguous matching subsequence that contains no "junk"
|
||||
// elements (R-O doesn't address junk). The same idea is then applied
|
||||
// recursively to the pieces of the sequences to the left and to the right
|
||||
// of the matching subsequence. This does not yield minimal edit
|
||||
// sequences, but does tend to yield matches that "look right" to people.
|
||||
//
|
||||
// SequenceMatcher tries to compute a "human-friendly diff" between two
|
||||
// sequences. Unlike e.g. UNIX(tm) diff, the fundamental notion is the
|
||||
// longest *contiguous* & junk-free matching subsequence. That's what
|
||||
// catches peoples' eyes. The Windows(tm) windiff has another interesting
|
||||
// notion, pairing up elements that appear uniquely in each sequence.
|
||||
// That, and the method here, appear to yield more intuitive difference
|
||||
// reports than does diff. This method appears to be the least vulnerable
|
||||
// to synching up on blocks of "junk lines", though (like blank lines in
|
||||
// ordinary text files, or maybe "<P>" lines in HTML files). That may be
|
||||
// because this is the only method of the 3 that has a *concept* of
|
||||
// "junk" <wink>.
|
||||
//
|
||||
// Timing: Basic R-O is cubic time worst case and quadratic time expected
|
||||
// case. SequenceMatcher is quadratic time for the worst case and has
|
||||
// expected-case behavior dependent in a complicated way on how many
|
||||
// elements the sequences have in common; best case time is linear.
|
||||
type SequenceMatcher struct { |
||||
a []string |
||||
b []string |
||||
b2j map[string][]int |
||||
IsJunk func(string) bool |
||||
autoJunk bool |
||||
bJunk map[string]struct{} |
||||
matchingBlocks []Match |
||||
fullBCount map[string]int |
||||
bPopular map[string]struct{} |
||||
opCodes []OpCode |
||||
} |
||||
|
||||
func NewMatcher(a, b []string) *SequenceMatcher { |
||||
m := SequenceMatcher{autoJunk: true} |
||||
m.SetSeqs(a, b) |
||||
return &m |
||||
} |
||||
|
||||
func NewMatcherWithJunk(a, b []string, autoJunk bool, |
||||
isJunk func(string) bool) *SequenceMatcher { |
||||
|
||||
m := SequenceMatcher{IsJunk: isJunk, autoJunk: autoJunk} |
||||
m.SetSeqs(a, b) |
||||
return &m |
||||
} |
||||
|
||||
// Set two sequences to be compared.
|
||||
func (m *SequenceMatcher) SetSeqs(a, b []string) { |
||||
m.SetSeq1(a) |
||||
m.SetSeq2(b) |
||||
} |
||||
|
||||
// Set the first sequence to be compared. The second sequence to be compared is
|
||||
// not changed.
|
||||
//
|
||||
// SequenceMatcher computes and caches detailed information about the second
|
||||
// sequence, so if you want to compare one sequence S against many sequences,
|
||||
// use .SetSeq2(s) once and call .SetSeq1(x) repeatedly for each of the other
|
||||
// sequences.
|
||||
//
|
||||
// See also SetSeqs() and SetSeq2().
|
||||
func (m *SequenceMatcher) SetSeq1(a []string) { |
||||
if &a == &m.a { |
||||
return |
||||
} |
||||
m.a = a |
||||
m.matchingBlocks = nil |
||||
m.opCodes = nil |
||||
} |
||||
|
||||
// Set the second sequence to be compared. The first sequence to be compared is
|
||||
// not changed.
|
||||
func (m *SequenceMatcher) SetSeq2(b []string) { |
||||
if &b == &m.b { |
||||
return |
||||
} |
||||
m.b = b |
||||
m.matchingBlocks = nil |
||||
m.opCodes = nil |
||||
m.fullBCount = nil |
||||
m.chainB() |
||||
} |
||||
|
||||
func (m *SequenceMatcher) chainB() { |
||||
// Populate line -> index mapping
|
||||
b2j := map[string][]int{} |
||||
for i, s := range m.b { |
||||
indices := b2j[s] |
||||
indices = append(indices, i) |
||||
b2j[s] = indices |
||||
} |
||||
|
||||
// Purge junk elements
|
||||
m.bJunk = map[string]struct{}{} |
||||
if m.IsJunk != nil { |
||||
junk := m.bJunk |
||||
for s, _ := range b2j { |
||||
if m.IsJunk(s) { |
||||
junk[s] = struct{}{} |
||||
} |
||||
} |
||||
for s, _ := range junk { |
||||
delete(b2j, s) |
||||
} |
||||
} |
||||
|
||||
// Purge remaining popular elements
|
||||
popular := map[string]struct{}{} |
||||
n := len(m.b) |
||||
if m.autoJunk && n >= 200 { |
||||
ntest := n/100 + 1 |
||||
for s, indices := range b2j { |
||||
if len(indices) > ntest { |
||||
popular[s] = struct{}{} |
||||
} |
||||
} |
||||
for s, _ := range popular { |
||||
delete(b2j, s) |
||||
} |
||||
} |
||||
m.bPopular = popular |
||||
m.b2j = b2j |
||||
} |
||||
|
||||
func (m *SequenceMatcher) isBJunk(s string) bool { |
||||
_, ok := m.bJunk[s] |
||||
return ok |
||||
} |
||||
|
||||
// Find longest matching block in a[alo:ahi] and b[blo:bhi].
|
||||
//
|
||||
// If IsJunk is not defined:
|
||||
//
|
||||
// Return (i,j,k) such that a[i:i+k] is equal to b[j:j+k], where
|
||||
// alo <= i <= i+k <= ahi
|
||||
// blo <= j <= j+k <= bhi
|
||||
// and for all (i',j',k') meeting those conditions,
|
||||
// k >= k'
|
||||
// i <= i'
|
||||
// and if i == i', j <= j'
|
||||
//
|
||||
// In other words, of all maximal matching blocks, return one that
|
||||
// starts earliest in a, and of all those maximal matching blocks that
|
||||
// start earliest in a, return the one that starts earliest in b.
|
||||
//
|
||||
// If IsJunk is defined, first the longest matching block is
|
||||
// determined as above, but with the additional restriction that no
|
||||
// junk element appears in the block. Then that block is extended as
|
||||
// far as possible by matching (only) junk elements on both sides. So
|
||||
// the resulting block never matches on junk except as identical junk
|
||||
// happens to be adjacent to an "interesting" match.
|
||||
//
|
||||
// If no blocks match, return (alo, blo, 0).
|
||||
func (m *SequenceMatcher) findLongestMatch(alo, ahi, blo, bhi int) Match { |
||||
// CAUTION: stripping common prefix or suffix would be incorrect.
|
||||
// E.g.,
|
||||
// ab
|
||||
// acab
|
||||
// Longest matching block is "ab", but if common prefix is
|
||||
// stripped, it's "a" (tied with "b"). UNIX(tm) diff does so
|
||||
// strip, so ends up claiming that ab is changed to acab by
|
||||
// inserting "ca" in the middle. That's minimal but unintuitive:
|
||||
// "it's obvious" that someone inserted "ac" at the front.
|
||||
// Windiff ends up at the same place as diff, but by pairing up
|
||||
// the unique 'b's and then matching the first two 'a's.
|
||||
besti, bestj, bestsize := alo, blo, 0 |
||||
|
||||
// find longest junk-free match
|
||||
// during an iteration of the loop, j2len[j] = length of longest
|
||||
// junk-free match ending with a[i-1] and b[j]
|
||||
j2len := map[int]int{} |
||||
for i := alo; i != ahi; i++ { |
||||
// look at all instances of a[i] in b; note that because
|
||||
// b2j has no junk keys, the loop is skipped if a[i] is junk
|
||||
newj2len := map[int]int{} |
||||
for _, j := range m.b2j[m.a[i]] { |
||||
// a[i] matches b[j]
|
||||
if j < blo { |
||||
continue |
||||
} |
||||
if j >= bhi { |
||||
break |
||||
} |
||||
k := j2len[j-1] + 1 |
||||
newj2len[j] = k |
||||
if k > bestsize { |
||||
besti, bestj, bestsize = i-k+1, j-k+1, k |
||||
} |
||||
} |
||||
j2len = newj2len |
||||
} |
||||
|
||||
// Extend the best by non-junk elements on each end. In particular,
|
||||
// "popular" non-junk elements aren't in b2j, which greatly speeds
|
||||
// the inner loop above, but also means "the best" match so far
|
||||
// doesn't contain any junk *or* popular non-junk elements.
|
||||
for besti > alo && bestj > blo && !m.isBJunk(m.b[bestj-1]) && |
||||
m.a[besti-1] == m.b[bestj-1] { |
||||
besti, bestj, bestsize = besti-1, bestj-1, bestsize+1 |
||||
} |
||||
for besti+bestsize < ahi && bestj+bestsize < bhi && |
||||
!m.isBJunk(m.b[bestj+bestsize]) && |
||||
m.a[besti+bestsize] == m.b[bestj+bestsize] { |
||||
bestsize += 1 |
||||
} |
||||
|
||||
// Now that we have a wholly interesting match (albeit possibly
|
||||
// empty!), we may as well suck up the matching junk on each
|
||||
// side of it too. Can't think of a good reason not to, and it
|
||||
// saves post-processing the (possibly considerable) expense of
|
||||
// figuring out what to do with it. In the case of an empty
|
||||
// interesting match, this is clearly the right thing to do,
|
||||
// because no other kind of match is possible in the regions.
|
||||
for besti > alo && bestj > blo && m.isBJunk(m.b[bestj-1]) && |
||||
m.a[besti-1] == m.b[bestj-1] { |
||||
besti, bestj, bestsize = besti-1, bestj-1, bestsize+1 |
||||
} |
||||
for besti+bestsize < ahi && bestj+bestsize < bhi && |
||||
m.isBJunk(m.b[bestj+bestsize]) && |
||||
m.a[besti+bestsize] == m.b[bestj+bestsize] { |
||||
bestsize += 1 |
||||
} |
||||
|
||||
return Match{A: besti, B: bestj, Size: bestsize} |
||||
} |
||||
|
||||
// Return list of triples describing matching subsequences.
|
||||
//
|
||||
// Each triple is of the form (i, j, n), and means that
|
||||
// a[i:i+n] == b[j:j+n]. The triples are monotonically increasing in
|
||||
// i and in j. It's also guaranteed that if (i, j, n) and (i', j', n') are
|
||||
// adjacent triples in the list, and the second is not the last triple in the
|
||||
// list, then i+n != i' or j+n != j'. IOW, adjacent triples never describe
|
||||
// adjacent equal blocks.
|
||||
//
|
||||
// The last triple is a dummy, (len(a), len(b), 0), and is the only
|
||||
// triple with n==0.
|
||||
func (m *SequenceMatcher) GetMatchingBlocks() []Match { |
||||
if m.matchingBlocks != nil { |
||||
return m.matchingBlocks |
||||
} |
||||
|
||||
var matchBlocks func(alo, ahi, blo, bhi int, matched []Match) []Match |
||||
matchBlocks = func(alo, ahi, blo, bhi int, matched []Match) []Match { |
||||
match := m.findLongestMatch(alo, ahi, blo, bhi) |
||||
i, j, k := match.A, match.B, match.Size |
||||
if match.Size > 0 { |
||||
if alo < i && blo < j { |
||||
matched = matchBlocks(alo, i, blo, j, matched) |
||||
} |
||||
matched = append(matched, match) |
||||
if i+k < ahi && j+k < bhi { |
||||
matched = matchBlocks(i+k, ahi, j+k, bhi, matched) |
||||
} |
||||
} |
||||
return matched |
||||
} |
||||
matched := matchBlocks(0, len(m.a), 0, len(m.b), nil) |
||||
|
||||
// It's possible that we have adjacent equal blocks in the
|
||||
// matching_blocks list now.
|
||||
nonAdjacent := []Match{} |
||||
i1, j1, k1 := 0, 0, 0 |
||||
for _, b := range matched { |
||||
// Is this block adjacent to i1, j1, k1?
|
||||
i2, j2, k2 := b.A, b.B, b.Size |
||||
if i1+k1 == i2 && j1+k1 == j2 { |
||||
// Yes, so collapse them -- this just increases the length of
|
||||
// the first block by the length of the second, and the first
|
||||
// block so lengthened remains the block to compare against.
|
||||
k1 += k2 |
||||
} else { |
||||
// Not adjacent. Remember the first block (k1==0 means it's
|
||||
// the dummy we started with), and make the second block the
|
||||
// new block to compare against.
|
||||
if k1 > 0 { |
||||
nonAdjacent = append(nonAdjacent, Match{i1, j1, k1}) |
||||
} |
||||
i1, j1, k1 = i2, j2, k2 |
||||
} |
||||
} |
||||
if k1 > 0 { |
||||
nonAdjacent = append(nonAdjacent, Match{i1, j1, k1}) |
||||
} |
||||
|
||||
nonAdjacent = append(nonAdjacent, Match{len(m.a), len(m.b), 0}) |
||||
m.matchingBlocks = nonAdjacent |
||||
return m.matchingBlocks |
||||
} |
||||
|
||||
// Return list of 5-tuples describing how to turn a into b.
|
||||
//
|
||||
// Each tuple is of the form (tag, i1, i2, j1, j2). The first tuple
|
||||
// has i1 == j1 == 0, and remaining tuples have i1 == the i2 from the
|
||||
// tuple preceding it, and likewise for j1 == the previous j2.
|
||||
//
|
||||
// The tags are characters, with these meanings:
|
||||
//
|
||||
// 'r' (replace): a[i1:i2] should be replaced by b[j1:j2]
|
||||
//
|
||||
// 'd' (delete): a[i1:i2] should be deleted, j1==j2 in this case.
|
||||
//
|
||||
// 'i' (insert): b[j1:j2] should be inserted at a[i1:i1], i1==i2 in this case.
|
||||
//
|
||||
// 'e' (equal): a[i1:i2] == b[j1:j2]
|
||||
func (m *SequenceMatcher) GetOpCodes() []OpCode { |
||||
if m.opCodes != nil { |
||||
return m.opCodes |
||||
} |
||||
i, j := 0, 0 |
||||
matching := m.GetMatchingBlocks() |
||||
opCodes := make([]OpCode, 0, len(matching)) |
||||
for _, m := range matching { |
||||
// invariant: we've pumped out correct diffs to change
|
||||
// a[:i] into b[:j], and the next matching block is
|
||||
// a[ai:ai+size] == b[bj:bj+size]. So we need to pump
|
||||
// out a diff to change a[i:ai] into b[j:bj], pump out
|
||||
// the matching block, and move (i,j) beyond the match
|
||||
ai, bj, size := m.A, m.B, m.Size |
||||
tag := byte(0) |
||||
if i < ai && j < bj { |
||||
tag = 'r' |
||||
} else if i < ai { |
||||
tag = 'd' |
||||
} else if j < bj { |
||||
tag = 'i' |
||||
} |
||||
if tag > 0 { |
||||
opCodes = append(opCodes, OpCode{tag, i, ai, j, bj}) |
||||
} |
||||
i, j = ai+size, bj+size |
||||
// the list of matching blocks is terminated by a
|
||||
// sentinel with size 0
|
||||
if size > 0 { |
||||
opCodes = append(opCodes, OpCode{'e', ai, i, bj, j}) |
||||
} |
||||
} |
||||
m.opCodes = opCodes |
||||
return m.opCodes |
||||
} |
||||
|
||||
// Isolate change clusters by eliminating ranges with no changes.
|
||||
//
|
||||
// Return a generator of groups with up to n lines of context.
|
||||
// Each group is in the same format as returned by GetOpCodes().
|
||||
func (m *SequenceMatcher) GetGroupedOpCodes(n int) [][]OpCode { |
||||
if n < 0 { |
||||
n = 3 |
||||
} |
||||
codes := m.GetOpCodes() |
||||
if len(codes) == 0 { |
||||
codes = []OpCode{OpCode{'e', 0, 1, 0, 1}} |
||||
} |
||||
// Fixup leading and trailing groups if they show no changes.
|
||||
if codes[0].Tag == 'e' { |
||||
c := codes[0] |
||||
i1, i2, j1, j2 := c.I1, c.I2, c.J1, c.J2 |
||||
codes[0] = OpCode{c.Tag, max(i1, i2-n), i2, max(j1, j2-n), j2} |
||||
} |
||||
if codes[len(codes)-1].Tag == 'e' { |
||||
c := codes[len(codes)-1] |
||||
i1, i2, j1, j2 := c.I1, c.I2, c.J1, c.J2 |
||||
codes[len(codes)-1] = OpCode{c.Tag, i1, min(i2, i1+n), j1, min(j2, j1+n)} |
||||
} |
||||
nn := n + n |
||||
groups := [][]OpCode{} |
||||
group := []OpCode{} |
||||
for _, c := range codes { |
||||
i1, i2, j1, j2 := c.I1, c.I2, c.J1, c.J2 |
||||
// End the current group and start a new one whenever
|
||||
// there is a large range with no changes.
|
||||
if c.Tag == 'e' && i2-i1 > nn { |
||||
group = append(group, OpCode{c.Tag, i1, min(i2, i1+n), |
||||
j1, min(j2, j1+n)}) |
||||
groups = append(groups, group) |
||||
group = []OpCode{} |
||||
i1, j1 = max(i1, i2-n), max(j1, j2-n) |
||||
} |
||||
group = append(group, OpCode{c.Tag, i1, i2, j1, j2}) |
||||
} |
||||
if len(group) > 0 && !(len(group) == 1 && group[0].Tag == 'e') { |
||||
groups = append(groups, group) |
||||
} |
||||
return groups |
||||
} |
||||
|
||||
// Return a measure of the sequences' similarity (float in [0,1]).
|
||||
//
|
||||
// Where T is the total number of elements in both sequences, and
|
||||
// M is the number of matches, this is 2.0*M / T.
|
||||
// Note that this is 1 if the sequences are identical, and 0 if
|
||||
// they have nothing in common.
|
||||
//
|
||||
// .Ratio() is expensive to compute if you haven't already computed
|
||||
// .GetMatchingBlocks() or .GetOpCodes(), in which case you may
|
||||
// want to try .QuickRatio() or .RealQuickRation() first to get an
|
||||
// upper bound.
|
||||
func (m *SequenceMatcher) Ratio() float64 { |
||||
matches := 0 |
||||
for _, m := range m.GetMatchingBlocks() { |
||||
matches += m.Size |
||||
} |
||||
return calculateRatio(matches, len(m.a)+len(m.b)) |
||||
} |
||||
|
||||
// Return an upper bound on ratio() relatively quickly.
|
||||
//
|
||||
// This isn't defined beyond that it is an upper bound on .Ratio(), and
|
||||
// is faster to compute.
|
||||
func (m *SequenceMatcher) QuickRatio() float64 { |
||||
// viewing a and b as multisets, set matches to the cardinality
|
||||
// of their intersection; this counts the number of matches
|
||||
// without regard to order, so is clearly an upper bound
|
||||
if m.fullBCount == nil { |
||||
m.fullBCount = map[string]int{} |
||||
for _, s := range m.b { |
||||
m.fullBCount[s] = m.fullBCount[s] + 1 |
||||
} |
||||
} |
||||
|
||||
// avail[x] is the number of times x appears in 'b' less the
|
||||
// number of times we've seen it in 'a' so far ... kinda
|
||||
avail := map[string]int{} |
||||
matches := 0 |
||||
for _, s := range m.a { |
||||
n, ok := avail[s] |
||||
if !ok { |
||||
n = m.fullBCount[s] |
||||
} |
||||
avail[s] = n - 1 |
||||
if n > 0 { |
||||
matches += 1 |
||||
} |
||||
} |
||||
return calculateRatio(matches, len(m.a)+len(m.b)) |
||||
} |
||||
|
||||
// Return an upper bound on ratio() very quickly.
|
||||
//
|
||||
// This isn't defined beyond that it is an upper bound on .Ratio(), and
|
||||
// is faster to compute than either .Ratio() or .QuickRatio().
|
||||
func (m *SequenceMatcher) RealQuickRatio() float64 { |
||||
la, lb := len(m.a), len(m.b) |
||||
return calculateRatio(min(la, lb), la+lb) |
||||
} |
||||
|
||||
// Convert range to the "ed" format
|
||||
func formatRangeUnified(start, stop int) string { |
||||
// Per the diff spec at http://www.unix.org/single_unix_specification/
|
||||
beginning := start + 1 // lines start numbering with one
|
||||
length := stop - start |
||||
if length == 1 { |
||||
return fmt.Sprintf("%d", beginning) |
||||
} |
||||
if length == 0 { |
||||
beginning -= 1 // empty ranges begin at line just before the range
|
||||
} |
||||
return fmt.Sprintf("%d,%d", beginning, length) |
||||
} |
||||
|
||||
// Unified diff parameters
|
||||
type UnifiedDiff struct { |
||||
A []string // First sequence lines
|
||||
FromFile string // First file name
|
||||
FromDate string // First file time
|
||||
B []string // Second sequence lines
|
||||
ToFile string // Second file name
|
||||
ToDate string // Second file time
|
||||
Eol string // Headers end of line, defaults to LF
|
||||
Context int // Number of context lines
|
||||
} |
||||
|
||||
// Compare two sequences of lines; generate the delta as a unified diff.
|
||||
//
|
||||
// Unified diffs are a compact way of showing line changes and a few
|
||||
// lines of context. The number of context lines is set by 'n' which
|
||||
// defaults to three.
|
||||
//
|
||||
// By default, the diff control lines (those with ---, +++, or @@) are
|
||||
// created with a trailing newline. This is helpful so that inputs
|
||||
// created from file.readlines() result in diffs that are suitable for
|
||||
// file.writelines() since both the inputs and outputs have trailing
|
||||
// newlines.
|
||||
//
|
||||
// For inputs that do not have trailing newlines, set the lineterm
|
||||
// argument to "" so that the output will be uniformly newline free.
|
||||
//
|
||||
// The unidiff format normally has a header for filenames and modification
|
||||
// times. Any or all of these may be specified using strings for
|
||||
// 'fromfile', 'tofile', 'fromfiledate', and 'tofiledate'.
|
||||
// The modification times are normally expressed in the ISO 8601 format.
|
||||
func WriteUnifiedDiff(writer io.Writer, diff UnifiedDiff) error { |
||||
buf := bufio.NewWriter(writer) |
||||
defer buf.Flush() |
||||
wf := func(format string, args ...interface{}) error { |
||||
_, err := buf.WriteString(fmt.Sprintf(format, args...)) |
||||
return err |
||||
} |
||||
ws := func(s string) error { |
||||
_, err := buf.WriteString(s) |
||||
return err |
||||
} |
||||
|
||||
if len(diff.Eol) == 0 { |
||||
diff.Eol = "\n" |
||||
} |
||||
|
||||
started := false |
||||
m := NewMatcher(diff.A, diff.B) |
||||
for _, g := range m.GetGroupedOpCodes(diff.Context) { |
||||
if !started { |
||||
started = true |
||||
fromDate := "" |
||||
if len(diff.FromDate) > 0 { |
||||
fromDate = "\t" + diff.FromDate |
||||
} |
||||
toDate := "" |
||||
if len(diff.ToDate) > 0 { |
||||
toDate = "\t" + diff.ToDate |
||||
} |
||||
if diff.FromFile != "" || diff.ToFile != "" { |
||||
err := wf("--- %s%s%s", diff.FromFile, fromDate, diff.Eol) |
||||
if err != nil { |
||||
return err |
||||
} |
||||
err = wf("+++ %s%s%s", diff.ToFile, toDate, diff.Eol) |
||||
if err != nil { |
||||
return err |
||||
} |
||||
} |
||||
} |
||||
first, last := g[0], g[len(g)-1] |
||||
range1 := formatRangeUnified(first.I1, last.I2) |
||||
range2 := formatRangeUnified(first.J1, last.J2) |
||||
if err := wf("@@ -%s +%s @@%s", range1, range2, diff.Eol); err != nil { |
||||
return err |
||||
} |
||||
for _, c := range g { |
||||
i1, i2, j1, j2 := c.I1, c.I2, c.J1, c.J2 |
||||
if c.Tag == 'e' { |
||||
for _, line := range diff.A[i1:i2] { |
||||
if err := ws(" " + line); err != nil { |
||||
return err |
||||
} |
||||
} |
||||
continue |
||||
} |
||||
if c.Tag == 'r' || c.Tag == 'd' { |
||||
for _, line := range diff.A[i1:i2] { |
||||
if err := ws("-" + line); err != nil { |
||||
return err |
||||
} |
||||
} |
||||
} |
||||
if c.Tag == 'r' || c.Tag == 'i' { |
||||
for _, line := range diff.B[j1:j2] { |
||||
if err := ws("+" + line); err != nil { |
||||
return err |
||||
} |
||||
} |
||||
} |
||||
} |
||||
} |
||||
return nil |
||||
} |
||||
|
||||
// Like WriteUnifiedDiff but returns the diff a string.
|
||||
func GetUnifiedDiffString(diff UnifiedDiff) (string, error) { |
||||
w := &bytes.Buffer{} |
||||
err := WriteUnifiedDiff(w, diff) |
||||
return string(w.Bytes()), err |
||||
} |
||||
|
||||
// Convert range to the "ed" format.
|
||||
func formatRangeContext(start, stop int) string { |
||||
// Per the diff spec at http://www.unix.org/single_unix_specification/
|
||||
beginning := start + 1 // lines start numbering with one
|
||||
length := stop - start |
||||
if length == 0 { |
||||
beginning -= 1 // empty ranges begin at line just before the range
|
||||
} |
||||
if length <= 1 { |
||||
return fmt.Sprintf("%d", beginning) |
||||
} |
||||
return fmt.Sprintf("%d,%d", beginning, beginning+length-1) |
||||
} |
||||
|
||||
type ContextDiff UnifiedDiff |
||||
|
||||
// Compare two sequences of lines; generate the delta as a context diff.
|
||||
//
|
||||
// Context diffs are a compact way of showing line changes and a few
|
||||
// lines of context. The number of context lines is set by diff.Context
|
||||
// which defaults to three.
|
||||
//
|
||||
// By default, the diff control lines (those with *** or ---) are
|
||||
// created with a trailing newline.
|
||||
//
|
||||
// For inputs that do not have trailing newlines, set the diff.Eol
|
||||
// argument to "" so that the output will be uniformly newline free.
|
||||
//
|
||||
// The context diff format normally has a header for filenames and
|
||||
// modification times. Any or all of these may be specified using
|
||||
// strings for diff.FromFile, diff.ToFile, diff.FromDate, diff.ToDate.
|
||||
// The modification times are normally expressed in the ISO 8601 format.
|
||||
// If not specified, the strings default to blanks.
|
||||
func WriteContextDiff(writer io.Writer, diff ContextDiff) error { |
||||
buf := bufio.NewWriter(writer) |
||||
defer buf.Flush() |
||||
var diffErr error |
||||
wf := func(format string, args ...interface{}) { |
||||
_, err := buf.WriteString(fmt.Sprintf(format, args...)) |
||||
if diffErr == nil && err != nil { |
||||
diffErr = err |
||||
} |
||||
} |
||||
ws := func(s string) { |
||||
_, err := buf.WriteString(s) |
||||
if diffErr == nil && err != nil { |
||||
diffErr = err |
||||
} |
||||
} |
||||
|
||||
if len(diff.Eol) == 0 { |
||||
diff.Eol = "\n" |
||||
} |
||||
|
||||
prefix := map[byte]string{ |
||||
'i': "+ ", |
||||
'd': "- ", |
||||
'r': "! ", |
||||
'e': " ", |
||||
} |
||||
|
||||
started := false |
||||
m := NewMatcher(diff.A, diff.B) |
||||
for _, g := range m.GetGroupedOpCodes(diff.Context) { |
||||
if !started { |
||||
started = true |
||||
fromDate := "" |
||||
if len(diff.FromDate) > 0 { |
||||
fromDate = "\t" + diff.FromDate |
||||
} |
||||
toDate := "" |
||||
if len(diff.ToDate) > 0 { |
||||
toDate = "\t" + diff.ToDate |
||||
} |
||||
if diff.FromFile != "" || diff.ToFile != "" { |
||||
wf("*** %s%s%s", diff.FromFile, fromDate, diff.Eol) |
||||
wf("--- %s%s%s", diff.ToFile, toDate, diff.Eol) |
||||
} |
||||
} |
||||
|
||||
first, last := g[0], g[len(g)-1] |
||||
ws("***************" + diff.Eol) |
||||
|
||||
range1 := formatRangeContext(first.I1, last.I2) |
||||
wf("*** %s ****%s", range1, diff.Eol) |
||||
for _, c := range g { |
||||
if c.Tag == 'r' || c.Tag == 'd' { |
||||
for _, cc := range g { |
||||
if cc.Tag == 'i' { |
||||
continue |
||||
} |
||||
for _, line := range diff.A[cc.I1:cc.I2] { |
||||
ws(prefix[cc.Tag] + line) |
||||
} |
||||
} |
||||
break |
||||
} |
||||
} |
||||
|
||||
range2 := formatRangeContext(first.J1, last.J2) |
||||
wf("--- %s ----%s", range2, diff.Eol) |
||||
for _, c := range g { |
||||
if c.Tag == 'r' || c.Tag == 'i' { |
||||
for _, cc := range g { |
||||
if cc.Tag == 'd' { |
||||
continue |
||||
} |
||||
for _, line := range diff.B[cc.J1:cc.J2] { |
||||
ws(prefix[cc.Tag] + line) |
||||
} |
||||
} |
||||
break |
||||
} |
||||
} |
||||
} |
||||
return diffErr |
||||
} |
||||
|
||||
// Like WriteContextDiff but returns the diff a string.
|
||||
func GetContextDiffString(diff ContextDiff) (string, error) { |
||||
w := &bytes.Buffer{} |
||||
err := WriteContextDiff(w, diff) |
||||
return string(w.Bytes()), err |
||||
} |
||||
|
||||
// Split a string on "\n" while preserving them. The output can be used
|
||||
// as input for UnifiedDiff and ContextDiff structures.
|
||||
func SplitLines(s string) []string { |
||||
lines := strings.SplitAfter(s, "\n") |
||||
lines[len(lines)-1] += "\n" |
||||
return lines |
||||
} |
||||
12
vendor/github.com/kr/pretty/License → vendor/github.com/stretchr/testify/LICENSE
generated
vendored
12
vendor/github.com/kr/pretty/License → vendor/github.com/stretchr/testify/LICENSE
generated
vendored
@ -0,0 +1,484 @@ |
||||
/* |
||||
* CODE GENERATED AUTOMATICALLY WITH github.com/stretchr/testify/_codegen |
||||
* THIS FILE MUST NOT BE EDITED BY HAND |
||||
*/ |
||||
|
||||
package assert |
||||
|
||||
import ( |
||||
http "net/http" |
||||
url "net/url" |
||||
time "time" |
||||
) |
||||
|
||||
// Conditionf uses a Comparison to assert a complex condition.
|
||||
func Conditionf(t TestingT, comp Comparison, msg string, args ...interface{}) bool { |
||||
if h, ok := t.(tHelper); ok { |
||||
h.Helper() |
||||
} |
||||
return Condition(t, comp, append([]interface{}{msg}, args...)...) |
||||
} |
||||
|
||||
// Containsf asserts that the specified string, list(array, slice...) or map contains the
|
||||
// specified substring or element.
|
||||
//
|
||||
// assert.Containsf(t, "Hello World", "World", "error message %s", "formatted")
|
||||
// assert.Containsf(t, ["Hello", "World"], "World", "error message %s", "formatted")
|
||||
// assert.Containsf(t, {"Hello": "World"}, "Hello", "error message %s", "formatted")
|
||||
func Containsf(t TestingT, s interface{}, contains interface{}, msg string, args ...interface{}) bool { |
||||
if h, ok := t.(tHelper); ok { |
||||
h.Helper() |
||||
} |
||||
return Contains(t, s, contains, append([]interface{}{msg}, args...)...) |
||||
} |
||||
|
||||
// DirExistsf checks whether a directory exists in the given path. It also fails if the path is a file rather a directory or there is an error checking whether it exists.
|
||||
func DirExistsf(t TestingT, path string, msg string, args ...interface{}) bool { |
||||
if h, ok := t.(tHelper); ok { |
||||
h.Helper() |
||||
} |
||||
return DirExists(t, path, append([]interface{}{msg}, args...)...) |
||||
} |
||||
|
||||
// ElementsMatchf asserts that the specified listA(array, slice...) is equal to specified
|
||||
// listB(array, slice...) ignoring the order of the elements. If there are duplicate elements,
|
||||
// the number of appearances of each of them in both lists should match.
|
||||
//
|
||||
// assert.ElementsMatchf(t, [1, 3, 2, 3], [1, 3, 3, 2], "error message %s", "formatted")
|
||||
func ElementsMatchf(t TestingT, listA interface{}, listB interface{}, msg string, args ...interface{}) bool { |
||||
if h, ok := t.(tHelper); ok { |
||||
h.Helper() |
||||
} |
||||
return ElementsMatch(t, listA, listB, append([]interface{}{msg}, args...)...) |
||||
} |
||||
|
||||
// Emptyf asserts that the specified object is empty. I.e. nil, "", false, 0 or either
|
||||
// a slice or a channel with len == 0.
|
||||
//
|
||||
// assert.Emptyf(t, obj, "error message %s", "formatted")
|
||||
func Emptyf(t TestingT, object interface{}, msg string, args ...interface{}) bool { |
||||
if h, ok := t.(tHelper); ok { |
||||
h.Helper() |
||||
} |
||||
return Empty(t, object, append([]interface{}{msg}, args...)...) |
||||
} |
||||
|
||||
// Equalf asserts that two objects are equal.
|
||||
//
|
||||
// assert.Equalf(t, 123, 123, "error message %s", "formatted")
|
||||
//
|
||||
// Pointer variable equality is determined based on the equality of the
|
||||
// referenced values (as opposed to the memory addresses). Function equality
|
||||
// cannot be determined and will always fail.
|
||||
func Equalf(t TestingT, expected interface{}, actual interface{}, msg string, args ...interface{}) bool { |
||||
if h, ok := t.(tHelper); ok { |
||||
h.Helper() |
||||
} |
||||
return Equal(t, expected, actual, append([]interface{}{msg}, args...)...) |
||||
} |
||||
|
||||
// EqualErrorf asserts that a function returned an error (i.e. not `nil`)
|
||||
// and that it is equal to the provided error.
|
||||
//
|
||||
// actualObj, err := SomeFunction()
|
||||
// assert.EqualErrorf(t, err, expectedErrorString, "error message %s", "formatted")
|
||||
func EqualErrorf(t TestingT, theError error, errString string, msg string, args ...interface{}) bool { |
||||
if h, ok := t.(tHelper); ok { |
||||
h.Helper() |
||||
} |
||||
return EqualError(t, theError, errString, append([]interface{}{msg}, args...)...) |
||||
} |
||||
|
||||
// EqualValuesf asserts that two objects are equal or convertable to the same types
|
||||
// and equal.
|
||||
//
|
||||
// assert.EqualValuesf(t, uint32(123, "error message %s", "formatted"), int32(123))
|
||||
func EqualValuesf(t TestingT, expected interface{}, actual interface{}, msg string, args ...interface{}) bool { |
||||
if h, ok := t.(tHelper); ok { |
||||
h.Helper() |
||||
} |
||||
return EqualValues(t, expected, actual, append([]interface{}{msg}, args...)...) |
||||
} |
||||
|
||||
// Errorf asserts that a function returned an error (i.e. not `nil`).
|
||||
//
|
||||
// actualObj, err := SomeFunction()
|
||||
// if assert.Errorf(t, err, "error message %s", "formatted") {
|
||||
// assert.Equal(t, expectedErrorf, err)
|
||||
// }
|
||||
func Errorf(t TestingT, err error, msg string, args ...interface{}) bool { |
||||
if h, ok := t.(tHelper); ok { |
||||
h.Helper() |
||||
} |
||||
return Error(t, err, append([]interface{}{msg}, args...)...) |
||||
} |
||||
|
||||
// Exactlyf asserts that two objects are equal in value and type.
|
||||
//
|
||||
// assert.Exactlyf(t, int32(123, "error message %s", "formatted"), int64(123))
|
||||
func Exactlyf(t TestingT, expected interface{}, actual interface{}, msg string, args ...interface{}) bool { |
||||
if h, ok := t.(tHelper); ok { |
||||
h.Helper() |
||||
} |
||||
return Exactly(t, expected, actual, append([]interface{}{msg}, args...)...) |
||||
} |
||||
|
||||
// Failf reports a failure through
|
||||
func Failf(t TestingT, failureMessage string, msg string, args ...interface{}) bool { |
||||
if h, ok := t.(tHelper); ok { |
||||
h.Helper() |
||||
} |
||||
return Fail(t, failureMessage, append([]interface{}{msg}, args...)...) |
||||
} |
||||
|
||||
// FailNowf fails test
|
||||
func FailNowf(t TestingT, failureMessage string, msg string, args ...interface{}) bool { |
||||
if h, ok := t.(tHelper); ok { |
||||
h.Helper() |
||||
} |
||||
return FailNow(t, failureMessage, append([]interface{}{msg}, args...)...) |
||||
} |
||||
|
||||
// Falsef asserts that the specified value is false.
|
||||
//
|
||||
// assert.Falsef(t, myBool, "error message %s", "formatted")
|
||||
func Falsef(t TestingT, value bool, msg string, args ...interface{}) bool { |
||||
if h, ok := t.(tHelper); ok { |
||||
h.Helper() |
||||
} |
||||
return False(t, value, append([]interface{}{msg}, args...)...) |
||||
} |
||||
|
||||
// FileExistsf checks whether a file exists in the given path. It also fails if the path points to a directory or there is an error when trying to check the file.
|
||||
func FileExistsf(t TestingT, path string, msg string, args ...interface{}) bool { |
||||
if h, ok := t.(tHelper); ok { |
||||
h.Helper() |
||||
} |
||||
return FileExists(t, path, append([]interface{}{msg}, args...)...) |
||||
} |
||||
|
||||
// HTTPBodyContainsf asserts that a specified handler returns a
|
||||
// body that contains a string.
|
||||
//
|
||||
// assert.HTTPBodyContainsf(t, myHandler, "GET", "www.google.com", nil, "I'm Feeling Lucky", "error message %s", "formatted")
|
||||
//
|
||||
// Returns whether the assertion was successful (true) or not (false).
|
||||
func HTTPBodyContainsf(t TestingT, handler http.HandlerFunc, method string, url string, values url.Values, str interface{}, msg string, args ...interface{}) bool { |
||||
if h, ok := t.(tHelper); ok { |
||||
h.Helper() |
||||
} |
||||
return HTTPBodyContains(t, handler, method, url, values, str, append([]interface{}{msg}, args...)...) |
||||
} |
||||
|
||||
// HTTPBodyNotContainsf asserts that a specified handler returns a
|
||||
// body that does not contain a string.
|
||||
//
|
||||
// assert.HTTPBodyNotContainsf(t, myHandler, "GET", "www.google.com", nil, "I'm Feeling Lucky", "error message %s", "formatted")
|
||||
//
|
||||
// Returns whether the assertion was successful (true) or not (false).
|
||||
func HTTPBodyNotContainsf(t TestingT, handler http.HandlerFunc, method string, url string, values url.Values, str interface{}, msg string, args ...interface{}) bool { |
||||
if h, ok := t.(tHelper); ok { |
||||
h.Helper() |
||||
} |
||||
return HTTPBodyNotContains(t, handler, method, url, values, str, append([]interface{}{msg}, args...)...) |
||||
} |
||||
|
||||
// HTTPErrorf asserts that a specified handler returns an error status code.
|
||||
//
|
||||
// assert.HTTPErrorf(t, myHandler, "POST", "/a/b/c", url.Values{"a": []string{"b", "c"}}
|
||||
//
|
||||
// Returns whether the assertion was successful (true, "error message %s", "formatted") or not (false).
|
||||
func HTTPErrorf(t TestingT, handler http.HandlerFunc, method string, url string, values url.Values, msg string, args ...interface{}) bool { |
||||
if h, ok := t.(tHelper); ok { |
||||
h.Helper() |
||||
} |
||||
return HTTPError(t, handler, method, url, values, append([]interface{}{msg}, args...)...) |
||||
} |
||||
|
||||
// HTTPRedirectf asserts that a specified handler returns a redirect status code.
|
||||
//
|
||||
// assert.HTTPRedirectf(t, myHandler, "GET", "/a/b/c", url.Values{"a": []string{"b", "c"}}
|
||||
//
|
||||
// Returns whether the assertion was successful (true, "error message %s", "formatted") or not (false).
|
||||
func HTTPRedirectf(t TestingT, handler http.HandlerFunc, method string, url string, values url.Values, msg string, args ...interface{}) bool { |
||||
if h, ok := t.(tHelper); ok { |
||||
h.Helper() |
||||
} |
||||
return HTTPRedirect(t, handler, method, url, values, append([]interface{}{msg}, args...)...) |
||||
} |
||||
|
||||
// HTTPSuccessf asserts that a specified handler returns a success status code.
|
||||
//
|
||||
// assert.HTTPSuccessf(t, myHandler, "POST", "http://www.google.com", nil, "error message %s", "formatted")
|
||||
//
|
||||
// Returns whether the assertion was successful (true) or not (false).
|
||||
func HTTPSuccessf(t TestingT, handler http.HandlerFunc, method string, url string, values url.Values, msg string, args ...interface{}) bool { |
||||
if h, ok := t.(tHelper); ok { |
||||
h.Helper() |
||||
} |
||||
return HTTPSuccess(t, handler, method, url, values, append([]interface{}{msg}, args...)...) |
||||
} |
||||
|
||||
// Implementsf asserts that an object is implemented by the specified interface.
|
||||
//
|
||||
// assert.Implementsf(t, (*MyInterface, "error message %s", "formatted")(nil), new(MyObject))
|
||||
func Implementsf(t TestingT, interfaceObject interface{}, object interface{}, msg string, args ...interface{}) bool { |
||||
if h, ok := t.(tHelper); ok { |
||||
h.Helper() |
||||
} |
||||
return Implements(t, interfaceObject, object, append([]interface{}{msg}, args...)...) |
||||
} |
||||
|
||||
// InDeltaf asserts that the two numerals are within delta of each other.
|
||||
//
|
||||
// assert.InDeltaf(t, math.Pi, (22 / 7.0, "error message %s", "formatted"), 0.01)
|
||||
func InDeltaf(t TestingT, expected interface{}, actual interface{}, delta float64, msg string, args ...interface{}) bool { |
||||
if h, ok := t.(tHelper); ok { |
||||
h.Helper() |
||||
} |
||||
return InDelta(t, expected, actual, delta, append([]interface{}{msg}, args...)...) |
||||
} |
||||
|
||||
// InDeltaMapValuesf is the same as InDelta, but it compares all values between two maps. Both maps must have exactly the same keys.
|
||||
func InDeltaMapValuesf(t TestingT, expected interface{}, actual interface{}, delta float64, msg string, args ...interface{}) bool { |
||||
if h, ok := t.(tHelper); ok { |
||||
h.Helper() |
||||
} |
||||
return InDeltaMapValues(t, expected, actual, delta, append([]interface{}{msg}, args...)...) |
||||
} |
||||
|
||||
// InDeltaSlicef is the same as InDelta, except it compares two slices.
|
||||
func InDeltaSlicef(t TestingT, expected interface{}, actual interface{}, delta float64, msg string, args ...interface{}) bool { |
||||
if h, ok := t.(tHelper); ok { |
||||
h.Helper() |
||||
} |
||||
return InDeltaSlice(t, expected, actual, delta, append([]interface{}{msg}, args...)...) |
||||
} |
||||
|
||||
// InEpsilonf asserts that expected and actual have a relative error less than epsilon
|
||||
func InEpsilonf(t TestingT, expected interface{}, actual interface{}, epsilon float64, msg string, args ...interface{}) bool { |
||||
if h, ok := t.(tHelper); ok { |
||||
h.Helper() |
||||
} |
||||
return InEpsilon(t, expected, actual, epsilon, append([]interface{}{msg}, args...)...) |
||||
} |
||||
|
||||
// InEpsilonSlicef is the same as InEpsilon, except it compares each value from two slices.
|
||||
func InEpsilonSlicef(t TestingT, expected interface{}, actual interface{}, epsilon float64, msg string, args ...interface{}) bool { |
||||
if h, ok := t.(tHelper); ok { |
||||
h.Helper() |
||||
} |
||||
return InEpsilonSlice(t, expected, actual, epsilon, append([]interface{}{msg}, args...)...) |
||||
} |
||||
|
||||
// IsTypef asserts that the specified objects are of the same type.
|
||||
func IsTypef(t TestingT, expectedType interface{}, object interface{}, msg string, args ...interface{}) bool { |
||||
if h, ok := t.(tHelper); ok { |
||||
h.Helper() |
||||
} |
||||
return IsType(t, expectedType, object, append([]interface{}{msg}, args...)...) |
||||
} |
||||
|
||||
// JSONEqf asserts that two JSON strings are equivalent.
|
||||
//
|
||||
// assert.JSONEqf(t, `{"hello": "world", "foo": "bar"}`, `{"foo": "bar", "hello": "world"}`, "error message %s", "formatted")
|
||||
func JSONEqf(t TestingT, expected string, actual string, msg string, args ...interface{}) bool { |
||||
if h, ok := t.(tHelper); ok { |
||||
h.Helper() |
||||
} |
||||
return JSONEq(t, expected, actual, append([]interface{}{msg}, args...)...) |
||||
} |
||||
|
||||
// Lenf asserts that the specified object has specific length.
|
||||
// Lenf also fails if the object has a type that len() not accept.
|
||||
//
|
||||
// assert.Lenf(t, mySlice, 3, "error message %s", "formatted")
|
||||
func Lenf(t TestingT, object interface{}, length int, msg string, args ...interface{}) bool { |
||||
if h, ok := t.(tHelper); ok { |
||||
h.Helper() |
||||
} |
||||
return Len(t, object, length, append([]interface{}{msg}, args...)...) |
||||
} |
||||
|
||||
// Nilf asserts that the specified object is nil.
|
||||
//
|
||||
// assert.Nilf(t, err, "error message %s", "formatted")
|
||||
func Nilf(t TestingT, object interface{}, msg string, args ...interface{}) bool { |
||||
if h, ok := t.(tHelper); ok { |
||||
h.Helper() |
||||
} |
||||
return Nil(t, object, append([]interface{}{msg}, args...)...) |
||||
} |
||||
|
||||
// NoErrorf asserts that a function returned no error (i.e. `nil`).
|
||||
//
|
||||
// actualObj, err := SomeFunction()
|
||||
// if assert.NoErrorf(t, err, "error message %s", "formatted") {
|
||||
// assert.Equal(t, expectedObj, actualObj)
|
||||
// }
|
||||
func NoErrorf(t TestingT, err error, msg string, args ...interface{}) bool { |
||||
if h, ok := t.(tHelper); ok { |
||||
h.Helper() |
||||
} |
||||
return NoError(t, err, append([]interface{}{msg}, args...)...) |
||||
} |
||||
|
||||
// NotContainsf asserts that the specified string, list(array, slice...) or map does NOT contain the
|
||||
// specified substring or element.
|
||||
//
|
||||
// assert.NotContainsf(t, "Hello World", "Earth", "error message %s", "formatted")
|
||||
// assert.NotContainsf(t, ["Hello", "World"], "Earth", "error message %s", "formatted")
|
||||
// assert.NotContainsf(t, {"Hello": "World"}, "Earth", "error message %s", "formatted")
|
||||
func NotContainsf(t TestingT, s interface{}, contains interface{}, msg string, args ...interface{}) bool { |
||||
if h, ok := t.(tHelper); ok { |
||||
h.Helper() |
||||
} |
||||
return NotContains(t, s, contains, append([]interface{}{msg}, args...)...) |
||||
} |
||||
|
||||
// NotEmptyf asserts that the specified object is NOT empty. I.e. not nil, "", false, 0 or either
|
||||
// a slice or a channel with len == 0.
|
||||
//
|
||||
// if assert.NotEmptyf(t, obj, "error message %s", "formatted") {
|
||||
// assert.Equal(t, "two", obj[1])
|
||||
// }
|
||||
func NotEmptyf(t TestingT, object interface{}, msg string, args ...interface{}) bool { |
||||
if h, ok := t.(tHelper); ok { |
||||
h.Helper() |
||||
} |
||||
return NotEmpty(t, object, append([]interface{}{msg}, args...)...) |
||||
} |
||||
|
||||
// NotEqualf asserts that the specified values are NOT equal.
|
||||
//
|
||||
// assert.NotEqualf(t, obj1, obj2, "error message %s", "formatted")
|
||||
//
|
||||
// Pointer variable equality is determined based on the equality of the
|
||||
// referenced values (as opposed to the memory addresses).
|
||||
func NotEqualf(t TestingT, expected interface{}, actual interface{}, msg string, args ...interface{}) bool { |
||||
if h, ok := t.(tHelper); ok { |
||||
h.Helper() |
||||
} |
||||
return NotEqual(t, expected, actual, append([]interface{}{msg}, args...)...) |
||||
} |
||||
|
||||
// NotNilf asserts that the specified object is not nil.
|
||||
//
|
||||
// assert.NotNilf(t, err, "error message %s", "formatted")
|
||||
func NotNilf(t TestingT, object interface{}, msg string, args ...interface{}) bool { |
||||
if h, ok := t.(tHelper); ok { |
||||
h.Helper() |
||||
} |
||||
return NotNil(t, object, append([]interface{}{msg}, args...)...) |
||||
} |
||||
|
||||
// NotPanicsf asserts that the code inside the specified PanicTestFunc does NOT panic.
|
||||
//
|
||||
// assert.NotPanicsf(t, func(){ RemainCalm() }, "error message %s", "formatted")
|
||||
func NotPanicsf(t TestingT, f PanicTestFunc, msg string, args ...interface{}) bool { |
||||
if h, ok := t.(tHelper); ok { |
||||
h.Helper() |
||||
} |
||||
return NotPanics(t, f, append([]interface{}{msg}, args...)...) |
||||
} |
||||
|
||||
// NotRegexpf asserts that a specified regexp does not match a string.
|
||||
//
|
||||
// assert.NotRegexpf(t, regexp.MustCompile("starts", "error message %s", "formatted"), "it's starting")
|
||||
// assert.NotRegexpf(t, "^start", "it's not starting", "error message %s", "formatted")
|
||||
func NotRegexpf(t TestingT, rx interface{}, str interface{}, msg string, args ...interface{}) bool { |
||||
if h, ok := t.(tHelper); ok { |
||||
h.Helper() |
||||
} |
||||
return NotRegexp(t, rx, str, append([]interface{}{msg}, args...)...) |
||||
} |
||||
|
||||
// NotSubsetf asserts that the specified list(array, slice...) contains not all
|
||||
// elements given in the specified subset(array, slice...).
|
||||
//
|
||||
// assert.NotSubsetf(t, [1, 3, 4], [1, 2], "But [1, 3, 4] does not contain [1, 2]", "error message %s", "formatted")
|
||||
func NotSubsetf(t TestingT, list interface{}, subset interface{}, msg string, args ...interface{}) bool { |
||||
if h, ok := t.(tHelper); ok { |
||||
h.Helper() |
||||
} |
||||
return NotSubset(t, list, subset, append([]interface{}{msg}, args...)...) |
||||
} |
||||
|
||||
// NotZerof asserts that i is not the zero value for its type.
|
||||
func NotZerof(t TestingT, i interface{}, msg string, args ...interface{}) bool { |
||||
if h, ok := t.(tHelper); ok { |
||||
h.Helper() |
||||
} |
||||
return NotZero(t, i, append([]interface{}{msg}, args...)...) |
||||
} |
||||
|
||||
// Panicsf asserts that the code inside the specified PanicTestFunc panics.
|
||||
//
|
||||
// assert.Panicsf(t, func(){ GoCrazy() }, "error message %s", "formatted")
|
||||
func Panicsf(t TestingT, f PanicTestFunc, msg string, args ...interface{}) bool { |
||||
if h, ok := t.(tHelper); ok { |
||||
h.Helper() |
||||
} |
||||
return Panics(t, f, append([]interface{}{msg}, args...)...) |
||||
} |
||||
|
||||
// PanicsWithValuef asserts that the code inside the specified PanicTestFunc panics, and that
|
||||
// the recovered panic value equals the expected panic value.
|
||||
//
|
||||
// assert.PanicsWithValuef(t, "crazy error", func(){ GoCrazy() }, "error message %s", "formatted")
|
||||
func PanicsWithValuef(t TestingT, expected interface{}, f PanicTestFunc, msg string, args ...interface{}) bool { |
||||
if h, ok := t.(tHelper); ok { |
||||
h.Helper() |
||||
} |
||||
return PanicsWithValue(t, expected, f, append([]interface{}{msg}, args...)...) |
||||
} |
||||
|
||||
// Regexpf asserts that a specified regexp matches a string.
|
||||
//
|
||||
// assert.Regexpf(t, regexp.MustCompile("start", "error message %s", "formatted"), "it's starting")
|
||||
// assert.Regexpf(t, "start...$", "it's not starting", "error message %s", "formatted")
|
||||
func Regexpf(t TestingT, rx interface{}, str interface{}, msg string, args ...interface{}) bool { |
||||
if h, ok := t.(tHelper); ok { |
||||
h.Helper() |
||||
} |
||||
return Regexp(t, rx, str, append([]interface{}{msg}, args...)...) |
||||
} |
||||
|
||||
// Subsetf asserts that the specified list(array, slice...) contains all
|
||||
// elements given in the specified subset(array, slice...).
|
||||
//
|
||||
// assert.Subsetf(t, [1, 2, 3], [1, 2], "But [1, 2, 3] does contain [1, 2]", "error message %s", "formatted")
|
||||
func Subsetf(t TestingT, list interface{}, subset interface{}, msg string, args ...interface{}) bool { |
||||
if h, ok := t.(tHelper); ok { |
||||
h.Helper() |
||||
} |
||||
return Subset(t, list, subset, append([]interface{}{msg}, args...)...) |
||||
} |
||||
|
||||
// Truef asserts that the specified value is true.
|
||||
//
|
||||
// assert.Truef(t, myBool, "error message %s", "formatted")
|
||||
func Truef(t TestingT, value bool, msg string, args ...interface{}) bool { |
||||
if h, ok := t.(tHelper); ok { |
||||
h.Helper() |
||||
} |
||||
return True(t, value, append([]interface{}{msg}, args...)...) |
||||
} |
||||
|
||||
// WithinDurationf asserts that the two times are within duration delta of each other.
|
||||
//
|
||||
// assert.WithinDurationf(t, time.Now(), time.Now(), 10*time.Second, "error message %s", "formatted")
|
||||
func WithinDurationf(t TestingT, expected time.Time, actual time.Time, delta time.Duration, msg string, args ...interface{}) bool { |
||||
if h, ok := t.(tHelper); ok { |
||||
h.Helper() |
||||
} |
||||
return WithinDuration(t, expected, actual, delta, append([]interface{}{msg}, args...)...) |
||||
} |
||||
|
||||
// Zerof asserts that i is the zero value for its type.
|
||||
func Zerof(t TestingT, i interface{}, msg string, args ...interface{}) bool { |
||||
if h, ok := t.(tHelper); ok { |
||||
h.Helper() |
||||
} |
||||
return Zero(t, i, append([]interface{}{msg}, args...)...) |
||||
} |
||||
@ -0,0 +1,5 @@ |
||||
{{.CommentFormat}} |
||||
func {{.DocInfo.Name}}f(t TestingT, {{.ParamsFormat}}) bool { |
||||
if h, ok := t.(tHelper); ok { h.Helper() } |
||||
return {{.DocInfo.Name}}(t, {{.ForwardedParamsFormat}}) |
||||
} |
||||
@ -0,0 +1,956 @@ |
||||
/* |
||||
* CODE GENERATED AUTOMATICALLY WITH github.com/stretchr/testify/_codegen |
||||
* THIS FILE MUST NOT BE EDITED BY HAND |
||||
*/ |
||||
|
||||
package assert |
||||
|
||||
import ( |
||||
http "net/http" |
||||
url "net/url" |
||||
time "time" |
||||
) |
||||
|
||||
// Condition uses a Comparison to assert a complex condition.
|
||||
func (a *Assertions) Condition(comp Comparison, msgAndArgs ...interface{}) bool { |
||||
if h, ok := a.t.(tHelper); ok { |
||||
h.Helper() |
||||
} |
||||
return Condition(a.t, comp, msgAndArgs...) |
||||
} |
||||
|
||||
// Conditionf uses a Comparison to assert a complex condition.
|
||||
func (a *Assertions) Conditionf(comp Comparison, msg string, args ...interface{}) bool { |
||||
if h, ok := a.t.(tHelper); ok { |
||||
h.Helper() |
||||
} |
||||
return Conditionf(a.t, comp, msg, args...) |
||||
} |
||||
|
||||
// Contains asserts that the specified string, list(array, slice...) or map contains the
|
||||
// specified substring or element.
|
||||
//
|
||||
// a.Contains("Hello World", "World")
|
||||
// a.Contains(["Hello", "World"], "World")
|
||||
// a.Contains({"Hello": "World"}, "Hello")
|
||||
func (a *Assertions) Contains(s interface{}, contains interface{}, msgAndArgs ...interface{}) bool { |
||||
if h, ok := a.t.(tHelper); ok { |
||||
h.Helper() |
||||
} |
||||
return Contains(a.t, s, contains, msgAndArgs...) |
||||
} |
||||
|
||||
// Containsf asserts that the specified string, list(array, slice...) or map contains the
|
||||
// specified substring or element.
|
||||
//
|
||||
// a.Containsf("Hello World", "World", "error message %s", "formatted")
|
||||
// a.Containsf(["Hello", "World"], "World", "error message %s", "formatted")
|
||||
// a.Containsf({"Hello": "World"}, "Hello", "error message %s", "formatted")
|
||||
func (a *Assertions) Containsf(s interface{}, contains interface{}, msg string, args ...interface{}) bool { |
||||
if h, ok := a.t.(tHelper); ok { |
||||
h.Helper() |
||||
} |
||||
return Containsf(a.t, s, contains, msg, args...) |
||||
} |
||||
|
||||
// DirExists checks whether a directory exists in the given path. It also fails if the path is a file rather a directory or there is an error checking whether it exists.
|
||||
func (a *Assertions) DirExists(path string, msgAndArgs ...interface{}) bool { |
||||
if h, ok := a.t.(tHelper); ok { |
||||
h.Helper() |
||||
} |
||||
return DirExists(a.t, path, msgAndArgs...) |
||||
} |
||||
|
||||
// DirExistsf checks whether a directory exists in the given path. It also fails if the path is a file rather a directory or there is an error checking whether it exists.
|
||||
func (a *Assertions) DirExistsf(path string, msg string, args ...interface{}) bool { |
||||
if h, ok := a.t.(tHelper); ok { |
||||
h.Helper() |
||||
} |
||||
return DirExistsf(a.t, path, msg, args...) |
||||
} |
||||
|
||||
// ElementsMatch asserts that the specified listA(array, slice...) is equal to specified
|
||||
// listB(array, slice...) ignoring the order of the elements. If there are duplicate elements,
|
||||
// the number of appearances of each of them in both lists should match.
|
||||
//
|
||||
// a.ElementsMatch([1, 3, 2, 3], [1, 3, 3, 2])
|
||||
func (a *Assertions) ElementsMatch(listA interface{}, listB interface{}, msgAndArgs ...interface{}) bool { |
||||
if h, ok := a.t.(tHelper); ok { |
||||
h.Helper() |
||||
} |
||||
return ElementsMatch(a.t, listA, listB, msgAndArgs...) |
||||
} |
||||
|
||||
// ElementsMatchf asserts that the specified listA(array, slice...) is equal to specified
|
||||
// listB(array, slice...) ignoring the order of the elements. If there are duplicate elements,
|
||||
// the number of appearances of each of them in both lists should match.
|
||||
//
|
||||
// a.ElementsMatchf([1, 3, 2, 3], [1, 3, 3, 2], "error message %s", "formatted")
|
||||
func (a *Assertions) ElementsMatchf(listA interface{}, listB interface{}, msg string, args ...interface{}) bool { |
||||
if h, ok := a.t.(tHelper); ok { |
||||
h.Helper() |
||||
} |
||||
return ElementsMatchf(a.t, listA, listB, msg, args...) |
||||
} |
||||
|
||||
// Empty asserts that the specified object is empty. I.e. nil, "", false, 0 or either
|
||||
// a slice or a channel with len == 0.
|
||||
//
|
||||
// a.Empty(obj)
|
||||
func (a *Assertions) Empty(object interface{}, msgAndArgs ...interface{}) bool { |
||||
if h, ok := a.t.(tHelper); ok { |
||||
h.Helper() |
||||
} |
||||
return Empty(a.t, object, msgAndArgs...) |
||||
} |
||||
|
||||
// Emptyf asserts that the specified object is empty. I.e. nil, "", false, 0 or either
|
||||
// a slice or a channel with len == 0.
|
||||
//
|
||||
// a.Emptyf(obj, "error message %s", "formatted")
|
||||
func (a *Assertions) Emptyf(object interface{}, msg string, args ...interface{}) bool { |
||||
if h, ok := a.t.(tHelper); ok { |
||||
h.Helper() |
||||
} |
||||
return Emptyf(a.t, object, msg, args...) |
||||
} |
||||
|
||||
// Equal asserts that two objects are equal.
|
||||
//
|
||||
// a.Equal(123, 123)
|
||||
//
|
||||
// Pointer variable equality is determined based on the equality of the
|
||||
// referenced values (as opposed to the memory addresses). Function equality
|
||||
// cannot be determined and will always fail.
|
||||
func (a *Assertions) Equal(expected interface{}, actual interface{}, msgAndArgs ...interface{}) bool { |
||||
if h, ok := a.t.(tHelper); ok { |
||||
h.Helper() |
||||
} |
||||
return Equal(a.t, expected, actual, msgAndArgs...) |
||||
} |
||||
|
||||
// EqualError asserts that a function returned an error (i.e. not `nil`)
|
||||
// and that it is equal to the provided error.
|
||||
//
|
||||
// actualObj, err := SomeFunction()
|
||||
// a.EqualError(err, expectedErrorString)
|
||||
func (a *Assertions) EqualError(theError error, errString string, msgAndArgs ...interface{}) bool { |
||||
if h, ok := a.t.(tHelper); ok { |
||||
h.Helper() |
||||
} |
||||
return EqualError(a.t, theError, errString, msgAndArgs...) |
||||
} |
||||
|
||||
// EqualErrorf asserts that a function returned an error (i.e. not `nil`)
|
||||
// and that it is equal to the provided error.
|
||||
//
|
||||
// actualObj, err := SomeFunction()
|
||||
// a.EqualErrorf(err, expectedErrorString, "error message %s", "formatted")
|
||||
func (a *Assertions) EqualErrorf(theError error, errString string, msg string, args ...interface{}) bool { |
||||
if h, ok := a.t.(tHelper); ok { |
||||
h.Helper() |
||||
} |
||||
return EqualErrorf(a.t, theError, errString, msg, args...) |
||||
} |
||||
|
||||
// EqualValues asserts that two objects are equal or convertable to the same types
|
||||
// and equal.
|
||||
//
|
||||
// a.EqualValues(uint32(123), int32(123))
|
||||
func (a *Assertions) EqualValues(expected interface{}, actual interface{}, msgAndArgs ...interface{}) bool { |
||||
if h, ok := a.t.(tHelper); ok { |
||||
h.Helper() |
||||
} |
||||
return EqualValues(a.t, expected, actual, msgAndArgs...) |
||||
} |
||||
|
||||
// EqualValuesf asserts that two objects are equal or convertable to the same types
|
||||
// and equal.
|
||||
//
|
||||
// a.EqualValuesf(uint32(123, "error message %s", "formatted"), int32(123))
|
||||
func (a *Assertions) EqualValuesf(expected interface{}, actual interface{}, msg string, args ...interface{}) bool { |
||||
if h, ok := a.t.(tHelper); ok { |
||||
h.Helper() |
||||
} |
||||
return EqualValuesf(a.t, expected, actual, msg, args...) |
||||
} |
||||
|
||||
// Equalf asserts that two objects are equal.
|
||||
//
|
||||
// a.Equalf(123, 123, "error message %s", "formatted")
|
||||
//
|
||||
// Pointer variable equality is determined based on the equality of the
|
||||
// referenced values (as opposed to the memory addresses). Function equality
|
||||
// cannot be determined and will always fail.
|
||||
func (a *Assertions) Equalf(expected interface{}, actual interface{}, msg string, args ...interface{}) bool { |
||||
if h, ok := a.t.(tHelper); ok { |
||||
h.Helper() |
||||
} |
||||
return Equalf(a.t, expected, actual, msg, args...) |
||||
} |
||||
|
||||
// Error asserts that a function returned an error (i.e. not `nil`).
|
||||
//
|
||||
// actualObj, err := SomeFunction()
|
||||
// if a.Error(err) {
|
||||
// assert.Equal(t, expectedError, err)
|
||||
// }
|
||||
func (a *Assertions) Error(err error, msgAndArgs ...interface{}) bool { |
||||
if h, ok := a.t.(tHelper); ok { |
||||
h.Helper() |
||||
} |
||||
return Error(a.t, err, msgAndArgs...) |
||||
} |
||||
|
||||
// Errorf asserts that a function returned an error (i.e. not `nil`).
|
||||
//
|
||||
// actualObj, err := SomeFunction()
|
||||
// if a.Errorf(err, "error message %s", "formatted") {
|
||||
// assert.Equal(t, expectedErrorf, err)
|
||||
// }
|
||||
func (a *Assertions) Errorf(err error, msg string, args ...interface{}) bool { |
||||
if h, ok := a.t.(tHelper); ok { |
||||
h.Helper() |
||||
} |
||||
return Errorf(a.t, err, msg, args...) |
||||
} |
||||
|
||||
// Exactly asserts that two objects are equal in value and type.
|
||||
//
|
||||
// a.Exactly(int32(123), int64(123))
|
||||
func (a *Assertions) Exactly(expected interface{}, actual interface{}, msgAndArgs ...interface{}) bool { |
||||
if h, ok := a.t.(tHelper); ok { |
||||
h.Helper() |
||||
} |
||||
return Exactly(a.t, expected, actual, msgAndArgs...) |
||||
} |
||||
|
||||
// Exactlyf asserts that two objects are equal in value and type.
|
||||
//
|
||||
// a.Exactlyf(int32(123, "error message %s", "formatted"), int64(123))
|
||||
func (a *Assertions) Exactlyf(expected interface{}, actual interface{}, msg string, args ...interface{}) bool { |
||||
if h, ok := a.t.(tHelper); ok { |
||||
h.Helper() |
||||
} |
||||
return Exactlyf(a.t, expected, actual, msg, args...) |
||||
} |
||||
|
||||
// Fail reports a failure through
|
||||
func (a *Assertions) Fail(failureMessage string, msgAndArgs ...interface{}) bool { |
||||
if h, ok := a.t.(tHelper); ok { |
||||
h.Helper() |
||||
} |
||||
return Fail(a.t, failureMessage, msgAndArgs...) |
||||
} |
||||
|
||||
// FailNow fails test
|
||||
func (a *Assertions) FailNow(failureMessage string, msgAndArgs ...interface{}) bool { |
||||
if h, ok := a.t.(tHelper); ok { |
||||
h.Helper() |
||||
} |
||||
return FailNow(a.t, failureMessage, msgAndArgs...) |
||||
} |
||||
|
||||
// FailNowf fails test
|
||||
func (a *Assertions) FailNowf(failureMessage string, msg string, args ...interface{}) bool { |
||||
if h, ok := a.t.(tHelper); ok { |
||||
h.Helper() |
||||
} |
||||
return FailNowf(a.t, failureMessage, msg, args...) |
||||
} |
||||
|
||||
// Failf reports a failure through
|
||||
func (a *Assertions) Failf(failureMessage string, msg string, args ...interface{}) bool { |
||||
if h, ok := a.t.(tHelper); ok { |
||||
h.Helper() |
||||
} |
||||
return Failf(a.t, failureMessage, msg, args...) |
||||
} |
||||
|
||||
// False asserts that the specified value is false.
|
||||
//
|
||||
// a.False(myBool)
|
||||
func (a *Assertions) False(value bool, msgAndArgs ...interface{}) bool { |
||||
if h, ok := a.t.(tHelper); ok { |
||||
h.Helper() |
||||
} |
||||
return False(a.t, value, msgAndArgs...) |
||||
} |
||||
|
||||
// Falsef asserts that the specified value is false.
|
||||
//
|
||||
// a.Falsef(myBool, "error message %s", "formatted")
|
||||
func (a *Assertions) Falsef(value bool, msg string, args ...interface{}) bool { |
||||
if h, ok := a.t.(tHelper); ok { |
||||
h.Helper() |
||||
} |
||||
return Falsef(a.t, value, msg, args...) |
||||
} |
||||
|
||||
// FileExists checks whether a file exists in the given path. It also fails if the path points to a directory or there is an error when trying to check the file.
|
||||
func (a *Assertions) FileExists(path string, msgAndArgs ...interface{}) bool { |
||||
if h, ok := a.t.(tHelper); ok { |
||||
h.Helper() |
||||
} |
||||
return FileExists(a.t, path, msgAndArgs...) |
||||
} |
||||
|
||||
// FileExistsf checks whether a file exists in the given path. It also fails if the path points to a directory or there is an error when trying to check the file.
|
||||
func (a *Assertions) FileExistsf(path string, msg string, args ...interface{}) bool { |
||||
if h, ok := a.t.(tHelper); ok { |
||||
h.Helper() |
||||
} |
||||
return FileExistsf(a.t, path, msg, args...) |
||||
} |
||||
|
||||
// HTTPBodyContains asserts that a specified handler returns a
|
||||
// body that contains a string.
|
||||
//
|
||||
// a.HTTPBodyContains(myHandler, "GET", "www.google.com", nil, "I'm Feeling Lucky")
|
||||
//
|
||||
// Returns whether the assertion was successful (true) or not (false).
|
||||
func (a *Assertions) HTTPBodyContains(handler http.HandlerFunc, method string, url string, values url.Values, str interface{}, msgAndArgs ...interface{}) bool { |
||||
if h, ok := a.t.(tHelper); ok { |
||||
h.Helper() |
||||
} |
||||
return HTTPBodyContains(a.t, handler, method, url, values, str, msgAndArgs...) |
||||
} |
||||
|
||||
// HTTPBodyContainsf asserts that a specified handler returns a
|
||||
// body that contains a string.
|
||||
//
|
||||
// a.HTTPBodyContainsf(myHandler, "GET", "www.google.com", nil, "I'm Feeling Lucky", "error message %s", "formatted")
|
||||
//
|
||||
// Returns whether the assertion was successful (true) or not (false).
|
||||
func (a *Assertions) HTTPBodyContainsf(handler http.HandlerFunc, method string, url string, values url.Values, str interface{}, msg string, args ...interface{}) bool { |
||||
if h, ok := a.t.(tHelper); ok { |
||||
h.Helper() |
||||
} |
||||
return HTTPBodyContainsf(a.t, handler, method, url, values, str, msg, args...) |
||||
} |
||||
|
||||
// HTTPBodyNotContains asserts that a specified handler returns a
|
||||
// body that does not contain a string.
|
||||
//
|
||||
// a.HTTPBodyNotContains(myHandler, "GET", "www.google.com", nil, "I'm Feeling Lucky")
|
||||
//
|
||||
// Returns whether the assertion was successful (true) or not (false).
|
||||
func (a *Assertions) HTTPBodyNotContains(handler http.HandlerFunc, method string, url string, values url.Values, str interface{}, msgAndArgs ...interface{}) bool { |
||||
if h, ok := a.t.(tHelper); ok { |
||||
h.Helper() |
||||
} |
||||
return HTTPBodyNotContains(a.t, handler, method, url, values, str, msgAndArgs...) |
||||
} |
||||
|
||||
// HTTPBodyNotContainsf asserts that a specified handler returns a
|
||||
// body that does not contain a string.
|
||||
//
|
||||
// a.HTTPBodyNotContainsf(myHandler, "GET", "www.google.com", nil, "I'm Feeling Lucky", "error message %s", "formatted")
|
||||
//
|
||||
// Returns whether the assertion was successful (true) or not (false).
|
||||
func (a *Assertions) HTTPBodyNotContainsf(handler http.HandlerFunc, method string, url string, values url.Values, str interface{}, msg string, args ...interface{}) bool { |
||||
if h, ok := a.t.(tHelper); ok { |
||||
h.Helper() |
||||
} |
||||
return HTTPBodyNotContainsf(a.t, handler, method, url, values, str, msg, args...) |
||||
} |
||||
|
||||
// HTTPError asserts that a specified handler returns an error status code.
|
||||
//
|
||||
// a.HTTPError(myHandler, "POST", "/a/b/c", url.Values{"a": []string{"b", "c"}}
|
||||
//
|
||||
// Returns whether the assertion was successful (true) or not (false).
|
||||
func (a *Assertions) HTTPError(handler http.HandlerFunc, method string, url string, values url.Values, msgAndArgs ...interface{}) bool { |
||||
if h, ok := a.t.(tHelper); ok { |
||||
h.Helper() |
||||
} |
||||
return HTTPError(a.t, handler, method, url, values, msgAndArgs...) |
||||
} |
||||
|
||||
// HTTPErrorf asserts that a specified handler returns an error status code.
|
||||
//
|
||||
// a.HTTPErrorf(myHandler, "POST", "/a/b/c", url.Values{"a": []string{"b", "c"}}
|
||||
//
|
||||
// Returns whether the assertion was successful (true, "error message %s", "formatted") or not (false).
|
||||
func (a *Assertions) HTTPErrorf(handler http.HandlerFunc, method string, url string, values url.Values, msg string, args ...interface{}) bool { |
||||
if h, ok := a.t.(tHelper); ok { |
||||
h.Helper() |
||||
} |
||||
return HTTPErrorf(a.t, handler, method, url, values, msg, args...) |
||||
} |
||||
|
||||
// HTTPRedirect asserts that a specified handler returns a redirect status code.
|
||||
//
|
||||
// a.HTTPRedirect(myHandler, "GET", "/a/b/c", url.Values{"a": []string{"b", "c"}}
|
||||
//
|
||||
// Returns whether the assertion was successful (true) or not (false).
|
||||
func (a *Assertions) HTTPRedirect(handler http.HandlerFunc, method string, url string, values url.Values, msgAndArgs ...interface{}) bool { |
||||
if h, ok := a.t.(tHelper); ok { |
||||
h.Helper() |
||||
} |
||||
return HTTPRedirect(a.t, handler, method, url, values, msgAndArgs...) |
||||
} |
||||
|
||||
// HTTPRedirectf asserts that a specified handler returns a redirect status code.
|
||||
//
|
||||
// a.HTTPRedirectf(myHandler, "GET", "/a/b/c", url.Values{"a": []string{"b", "c"}}
|
||||
//
|
||||
// Returns whether the assertion was successful (true, "error message %s", "formatted") or not (false).
|
||||
func (a *Assertions) HTTPRedirectf(handler http.HandlerFunc, method string, url string, values url.Values, msg string, args ...interface{}) bool { |
||||
if h, ok := a.t.(tHelper); ok { |
||||
h.Helper() |
||||
} |
||||
return HTTPRedirectf(a.t, handler, method, url, values, msg, args...) |
||||
} |
||||
|
||||
// HTTPSuccess asserts that a specified handler returns a success status code.
|
||||
//
|
||||
// a.HTTPSuccess(myHandler, "POST", "http://www.google.com", nil)
|
||||
//
|
||||
// Returns whether the assertion was successful (true) or not (false).
|
||||
func (a *Assertions) HTTPSuccess(handler http.HandlerFunc, method string, url string, values url.Values, msgAndArgs ...interface{}) bool { |
||||
if h, ok := a.t.(tHelper); ok { |
||||
h.Helper() |
||||
} |
||||
return HTTPSuccess(a.t, handler, method, url, values, msgAndArgs...) |
||||
} |
||||
|
||||
// HTTPSuccessf asserts that a specified handler returns a success status code.
|
||||
//
|
||||
// a.HTTPSuccessf(myHandler, "POST", "http://www.google.com", nil, "error message %s", "formatted")
|
||||
//
|
||||
// Returns whether the assertion was successful (true) or not (false).
|
||||
func (a *Assertions) HTTPSuccessf(handler http.HandlerFunc, method string, url string, values url.Values, msg string, args ...interface{}) bool { |
||||
if h, ok := a.t.(tHelper); ok { |
||||
h.Helper() |
||||
} |
||||
return HTTPSuccessf(a.t, handler, method, url, values, msg, args...) |
||||
} |
||||
|
||||
// Implements asserts that an object is implemented by the specified interface.
|
||||
//
|
||||
// a.Implements((*MyInterface)(nil), new(MyObject))
|
||||
func (a *Assertions) Implements(interfaceObject interface{}, object interface{}, msgAndArgs ...interface{}) bool { |
||||
if h, ok := a.t.(tHelper); ok { |
||||
h.Helper() |
||||
} |
||||
return Implements(a.t, interfaceObject, object, msgAndArgs...) |
||||
} |
||||
|
||||
// Implementsf asserts that an object is implemented by the specified interface.
|
||||
//
|
||||
// a.Implementsf((*MyInterface, "error message %s", "formatted")(nil), new(MyObject))
|
||||
func (a *Assertions) Implementsf(interfaceObject interface{}, object interface{}, msg string, args ...interface{}) bool { |
||||
if h, ok := a.t.(tHelper); ok { |
||||
h.Helper() |
||||
} |
||||
return Implementsf(a.t, interfaceObject, object, msg, args...) |
||||
} |
||||
|
||||
// InDelta asserts that the two numerals are within delta of each other.
|
||||
//
|
||||
// a.InDelta(math.Pi, (22 / 7.0), 0.01)
|
||||
func (a *Assertions) InDelta(expected interface{}, actual interface{}, delta float64, msgAndArgs ...interface{}) bool { |
||||
if h, ok := a.t.(tHelper); ok { |
||||
h.Helper() |
||||
} |
||||
return InDelta(a.t, expected, actual, delta, msgAndArgs...) |
||||
} |
||||
|
||||
// InDeltaMapValues is the same as InDelta, but it compares all values between two maps. Both maps must have exactly the same keys.
|
||||
func (a *Assertions) InDeltaMapValues(expected interface{}, actual interface{}, delta float64, msgAndArgs ...interface{}) bool { |
||||
if h, ok := a.t.(tHelper); ok { |
||||
h.Helper() |
||||
} |
||||
return InDeltaMapValues(a.t, expected, actual, delta, msgAndArgs...) |
||||
} |
||||
|
||||
// InDeltaMapValuesf is the same as InDelta, but it compares all values between two maps. Both maps must have exactly the same keys.
|
||||
func (a *Assertions) InDeltaMapValuesf(expected interface{}, actual interface{}, delta float64, msg string, args ...interface{}) bool { |
||||
if h, ok := a.t.(tHelper); ok { |
||||
h.Helper() |
||||
} |
||||
return InDeltaMapValuesf(a.t, expected, actual, delta, msg, args...) |
||||
} |
||||
|
||||
// InDeltaSlice is the same as InDelta, except it compares two slices.
|
||||
func (a *Assertions) InDeltaSlice(expected interface{}, actual interface{}, delta float64, msgAndArgs ...interface{}) bool { |
||||
if h, ok := a.t.(tHelper); ok { |
||||
h.Helper() |
||||
} |
||||
return InDeltaSlice(a.t, expected, actual, delta, msgAndArgs...) |
||||
} |
||||
|
||||
// InDeltaSlicef is the same as InDelta, except it compares two slices.
|
||||
func (a *Assertions) InDeltaSlicef(expected interface{}, actual interface{}, delta float64, msg string, args ...interface{}) bool { |
||||
if h, ok := a.t.(tHelper); ok { |
||||
h.Helper() |
||||
} |
||||
return InDeltaSlicef(a.t, expected, actual, delta, msg, args...) |
||||
} |
||||
|
||||
// InDeltaf asserts that the two numerals are within delta of each other.
|
||||
//
|
||||
// a.InDeltaf(math.Pi, (22 / 7.0, "error message %s", "formatted"), 0.01)
|
||||
func (a *Assertions) InDeltaf(expected interface{}, actual interface{}, delta float64, msg string, args ...interface{}) bool { |
||||
if h, ok := a.t.(tHelper); ok { |
||||
h.Helper() |
||||
} |
||||
return InDeltaf(a.t, expected, actual, delta, msg, args...) |
||||
} |
||||
|
||||
// InEpsilon asserts that expected and actual have a relative error less than epsilon
|
||||
func (a *Assertions) InEpsilon(expected interface{}, actual interface{}, epsilon float64, msgAndArgs ...interface{}) bool { |
||||
if h, ok := a.t.(tHelper); ok { |
||||
h.Helper() |
||||
} |
||||
return InEpsilon(a.t, expected, actual, epsilon, msgAndArgs...) |
||||
} |
||||
|
||||
// InEpsilonSlice is the same as InEpsilon, except it compares each value from two slices.
|
||||
func (a *Assertions) InEpsilonSlice(expected interface{}, actual interface{}, epsilon float64, msgAndArgs ...interface{}) bool { |
||||
if h, ok := a.t.(tHelper); ok { |
||||
h.Helper() |
||||
} |
||||
return InEpsilonSlice(a.t, expected, actual, epsilon, msgAndArgs...) |
||||
} |
||||
|
||||
// InEpsilonSlicef is the same as InEpsilon, except it compares each value from two slices.
|
||||
func (a *Assertions) InEpsilonSlicef(expected interface{}, actual interface{}, epsilon float64, msg string, args ...interface{}) bool { |
||||
if h, ok := a.t.(tHelper); ok { |
||||
h.Helper() |
||||
} |
||||
return InEpsilonSlicef(a.t, expected, actual, epsilon, msg, args...) |
||||
} |
||||
|
||||
// InEpsilonf asserts that expected and actual have a relative error less than epsilon
|
||||
func (a *Assertions) InEpsilonf(expected interface{}, actual interface{}, epsilon float64, msg string, args ...interface{}) bool { |
||||
if h, ok := a.t.(tHelper); ok { |
||||
h.Helper() |
||||
} |
||||
return InEpsilonf(a.t, expected, actual, epsilon, msg, args...) |
||||
} |
||||
|
||||
// IsType asserts that the specified objects are of the same type.
|
||||
func (a *Assertions) IsType(expectedType interface{}, object interface{}, msgAndArgs ...interface{}) bool { |
||||
if h, ok := a.t.(tHelper); ok { |
||||
h.Helper() |
||||
} |
||||
return IsType(a.t, expectedType, object, msgAndArgs...) |
||||
} |
||||
|
||||
// IsTypef asserts that the specified objects are of the same type.
|
||||
func (a *Assertions) IsTypef(expectedType interface{}, object interface{}, msg string, args ...interface{}) bool { |
||||
if h, ok := a.t.(tHelper); ok { |
||||
h.Helper() |
||||
} |
||||
return IsTypef(a.t, expectedType, object, msg, args...) |
||||
} |
||||
|
||||
// JSONEq asserts that two JSON strings are equivalent.
|
||||
//
|
||||
// a.JSONEq(`{"hello": "world", "foo": "bar"}`, `{"foo": "bar", "hello": "world"}`)
|
||||
func (a *Assertions) JSONEq(expected string, actual string, msgAndArgs ...interface{}) bool { |
||||
if h, ok := a.t.(tHelper); ok { |
||||
h.Helper() |
||||
} |
||||
return JSONEq(a.t, expected, actual, msgAndArgs...) |
||||
} |
||||
|
||||
// JSONEqf asserts that two JSON strings are equivalent.
|
||||
//
|
||||
// a.JSONEqf(`{"hello": "world", "foo": "bar"}`, `{"foo": "bar", "hello": "world"}`, "error message %s", "formatted")
|
||||
func (a *Assertions) JSONEqf(expected string, actual string, msg string, args ...interface{}) bool { |
||||
if h, ok := a.t.(tHelper); ok { |
||||
h.Helper() |
||||
} |
||||
return JSONEqf(a.t, expected, actual, msg, args...) |
||||
} |
||||
|
||||
// Len asserts that the specified object has specific length.
|
||||
// Len also fails if the object has a type that len() not accept.
|
||||
//
|
||||
// a.Len(mySlice, 3)
|
||||
func (a *Assertions) Len(object interface{}, length int, msgAndArgs ...interface{}) bool { |
||||
if h, ok := a.t.(tHelper); ok { |
||||
h.Helper() |
||||
} |
||||
return Len(a.t, object, length, msgAndArgs...) |
||||
} |
||||
|
||||
// Lenf asserts that the specified object has specific length.
|
||||
// Lenf also fails if the object has a type that len() not accept.
|
||||
//
|
||||
// a.Lenf(mySlice, 3, "error message %s", "formatted")
|
||||
func (a *Assertions) Lenf(object interface{}, length int, msg string, args ...interface{}) bool { |
||||
if h, ok := a.t.(tHelper); ok { |
||||
h.Helper() |
||||
} |
||||
return Lenf(a.t, object, length, msg, args...) |
||||
} |
||||
|
||||
// Nil asserts that the specified object is nil.
|
||||
//
|
||||
// a.Nil(err)
|
||||
func (a *Assertions) Nil(object interface{}, msgAndArgs ...interface{}) bool { |
||||
if h, ok := a.t.(tHelper); ok { |
||||
h.Helper() |
||||
} |
||||
return Nil(a.t, object, msgAndArgs...) |
||||
} |
||||
|
||||
// Nilf asserts that the specified object is nil.
|
||||
//
|
||||
// a.Nilf(err, "error message %s", "formatted")
|
||||
func (a *Assertions) Nilf(object interface{}, msg string, args ...interface{}) bool { |
||||
if h, ok := a.t.(tHelper); ok { |
||||
h.Helper() |
||||
} |
||||
return Nilf(a.t, object, msg, args...) |
||||
} |
||||
|
||||
// NoError asserts that a function returned no error (i.e. `nil`).
|
||||
//
|
||||
// actualObj, err := SomeFunction()
|
||||
// if a.NoError(err) {
|
||||
// assert.Equal(t, expectedObj, actualObj)
|
||||
// }
|
||||
func (a *Assertions) NoError(err error, msgAndArgs ...interface{}) bool { |
||||
if h, ok := a.t.(tHelper); ok { |
||||
h.Helper() |
||||
} |
||||
return NoError(a.t, err, msgAndArgs...) |
||||
} |
||||
|
||||
// NoErrorf asserts that a function returned no error (i.e. `nil`).
|
||||
//
|
||||
// actualObj, err := SomeFunction()
|
||||
// if a.NoErrorf(err, "error message %s", "formatted") {
|
||||
// assert.Equal(t, expectedObj, actualObj)
|
||||
// }
|
||||
func (a *Assertions) NoErrorf(err error, msg string, args ...interface{}) bool { |
||||
if h, ok := a.t.(tHelper); ok { |
||||
h.Helper() |
||||
} |
||||
return NoErrorf(a.t, err, msg, args...) |
||||
} |
||||
|
||||
// NotContains asserts that the specified string, list(array, slice...) or map does NOT contain the
|
||||
// specified substring or element.
|
||||
//
|
||||
// a.NotContains("Hello World", "Earth")
|
||||
// a.NotContains(["Hello", "World"], "Earth")
|
||||
// a.NotContains({"Hello": "World"}, "Earth")
|
||||
func (a *Assertions) NotContains(s interface{}, contains interface{}, msgAndArgs ...interface{}) bool { |
||||
if h, ok := a.t.(tHelper); ok { |
||||
h.Helper() |
||||
} |
||||
return NotContains(a.t, s, contains, msgAndArgs...) |
||||
} |
||||
|
||||
// NotContainsf asserts that the specified string, list(array, slice...) or map does NOT contain the
|
||||
// specified substring or element.
|
||||
//
|
||||
// a.NotContainsf("Hello World", "Earth", "error message %s", "formatted")
|
||||
// a.NotContainsf(["Hello", "World"], "Earth", "error message %s", "formatted")
|
||||
// a.NotContainsf({"Hello": "World"}, "Earth", "error message %s", "formatted")
|
||||
func (a *Assertions) NotContainsf(s interface{}, contains interface{}, msg string, args ...interface{}) bool { |
||||
if h, ok := a.t.(tHelper); ok { |
||||
h.Helper() |
||||
} |
||||
return NotContainsf(a.t, s, contains, msg, args...) |
||||
} |
||||
|
||||
// NotEmpty asserts that the specified object is NOT empty. I.e. not nil, "", false, 0 or either
|
||||
// a slice or a channel with len == 0.
|
||||
//
|
||||
// if a.NotEmpty(obj) {
|
||||
// assert.Equal(t, "two", obj[1])
|
||||
// }
|
||||
func (a *Assertions) NotEmpty(object interface{}, msgAndArgs ...interface{}) bool { |
||||
if h, ok := a.t.(tHelper); ok { |
||||
h.Helper() |
||||
} |
||||
return NotEmpty(a.t, object, msgAndArgs...) |
||||
} |
||||
|
||||
// NotEmptyf asserts that the specified object is NOT empty. I.e. not nil, "", false, 0 or either
|
||||
// a slice or a channel with len == 0.
|
||||
//
|
||||
// if a.NotEmptyf(obj, "error message %s", "formatted") {
|
||||
// assert.Equal(t, "two", obj[1])
|
||||
// }
|
||||
func (a *Assertions) NotEmptyf(object interface{}, msg string, args ...interface{}) bool { |
||||
if h, ok := a.t.(tHelper); ok { |
||||
h.Helper() |
||||
} |
||||
return NotEmptyf(a.t, object, msg, args...) |
||||
} |
||||
|
||||
// NotEqual asserts that the specified values are NOT equal.
|
||||
//
|
||||
// a.NotEqual(obj1, obj2)
|
||||
//
|
||||
// Pointer variable equality is determined based on the equality of the
|
||||
// referenced values (as opposed to the memory addresses).
|
||||
func (a *Assertions) NotEqual(expected interface{}, actual interface{}, msgAndArgs ...interface{}) bool { |
||||
if h, ok := a.t.(tHelper); ok { |
||||
h.Helper() |
||||
} |
||||
return NotEqual(a.t, expected, actual, msgAndArgs...) |
||||
} |
||||
|
||||
// NotEqualf asserts that the specified values are NOT equal.
|
||||
//
|
||||
// a.NotEqualf(obj1, obj2, "error message %s", "formatted")
|
||||
//
|
||||
// Pointer variable equality is determined based on the equality of the
|
||||
// referenced values (as opposed to the memory addresses).
|
||||
func (a *Assertions) NotEqualf(expected interface{}, actual interface{}, msg string, args ...interface{}) bool { |
||||
if h, ok := a.t.(tHelper); ok { |
||||
h.Helper() |
||||
} |
||||
return NotEqualf(a.t, expected, actual, msg, args...) |
||||
} |
||||
|
||||
// NotNil asserts that the specified object is not nil.
|
||||
//
|
||||
// a.NotNil(err)
|
||||
func (a *Assertions) NotNil(object interface{}, msgAndArgs ...interface{}) bool { |
||||
if h, ok := a.t.(tHelper); ok { |
||||
h.Helper() |
||||
} |
||||
return NotNil(a.t, object, msgAndArgs...) |
||||
} |
||||
|
||||
// NotNilf asserts that the specified object is not nil.
|
||||
//
|
||||
// a.NotNilf(err, "error message %s", "formatted")
|
||||
func (a *Assertions) NotNilf(object interface{}, msg string, args ...interface{}) bool { |
||||
if h, ok := a.t.(tHelper); ok { |
||||
h.Helper() |
||||
} |
||||
return NotNilf(a.t, object, msg, args...) |
||||
} |
||||
|
||||
// NotPanics asserts that the code inside the specified PanicTestFunc does NOT panic.
|
||||
//
|
||||
// a.NotPanics(func(){ RemainCalm() })
|
||||
func (a *Assertions) NotPanics(f PanicTestFunc, msgAndArgs ...interface{}) bool { |
||||
if h, ok := a.t.(tHelper); ok { |
||||
h.Helper() |
||||
} |
||||
return NotPanics(a.t, f, msgAndArgs...) |
||||
} |
||||
|
||||
// NotPanicsf asserts that the code inside the specified PanicTestFunc does NOT panic.
|
||||
//
|
||||
// a.NotPanicsf(func(){ RemainCalm() }, "error message %s", "formatted")
|
||||
func (a *Assertions) NotPanicsf(f PanicTestFunc, msg string, args ...interface{}) bool { |
||||
if h, ok := a.t.(tHelper); ok { |
||||
h.Helper() |
||||
} |
||||
return NotPanicsf(a.t, f, msg, args...) |
||||
} |
||||
|
||||
// NotRegexp asserts that a specified regexp does not match a string.
|
||||
//
|
||||
// a.NotRegexp(regexp.MustCompile("starts"), "it's starting")
|
||||
// a.NotRegexp("^start", "it's not starting")
|
||||
func (a *Assertions) NotRegexp(rx interface{}, str interface{}, msgAndArgs ...interface{}) bool { |
||||
if h, ok := a.t.(tHelper); ok { |
||||
h.Helper() |
||||
} |
||||
return NotRegexp(a.t, rx, str, msgAndArgs...) |
||||
} |
||||
|
||||
// NotRegexpf asserts that a specified regexp does not match a string.
|
||||
//
|
||||
// a.NotRegexpf(regexp.MustCompile("starts", "error message %s", "formatted"), "it's starting")
|
||||
// a.NotRegexpf("^start", "it's not starting", "error message %s", "formatted")
|
||||
func (a *Assertions) NotRegexpf(rx interface{}, str interface{}, msg string, args ...interface{}) bool { |
||||
if h, ok := a.t.(tHelper); ok { |
||||
h.Helper() |
||||
} |
||||
return NotRegexpf(a.t, rx, str, msg, args...) |
||||
} |
||||
|
||||
// NotSubset asserts that the specified list(array, slice...) contains not all
|
||||
// elements given in the specified subset(array, slice...).
|
||||
//
|
||||
// a.NotSubset([1, 3, 4], [1, 2], "But [1, 3, 4] does not contain [1, 2]")
|
||||
func (a *Assertions) NotSubset(list interface{}, subset interface{}, msgAndArgs ...interface{}) bool { |
||||
if h, ok := a.t.(tHelper); ok { |
||||
h.Helper() |
||||
} |
||||
return NotSubset(a.t, list, subset, msgAndArgs...) |
||||
} |
||||
|
||||
// NotSubsetf asserts that the specified list(array, slice...) contains not all
|
||||
// elements given in the specified subset(array, slice...).
|
||||
//
|
||||
// a.NotSubsetf([1, 3, 4], [1, 2], "But [1, 3, 4] does not contain [1, 2]", "error message %s", "formatted")
|
||||
func (a *Assertions) NotSubsetf(list interface{}, subset interface{}, msg string, args ...interface{}) bool { |
||||
if h, ok := a.t.(tHelper); ok { |
||||
h.Helper() |
||||
} |
||||
return NotSubsetf(a.t, list, subset, msg, args...) |
||||
} |
||||
|
||||
// NotZero asserts that i is not the zero value for its type.
|
||||
func (a *Assertions) NotZero(i interface{}, msgAndArgs ...interface{}) bool { |
||||
if h, ok := a.t.(tHelper); ok { |
||||
h.Helper() |
||||
} |
||||
return NotZero(a.t, i, msgAndArgs...) |
||||
} |
||||
|
||||
// NotZerof asserts that i is not the zero value for its type.
|
||||
func (a *Assertions) NotZerof(i interface{}, msg string, args ...interface{}) bool { |
||||
if h, ok := a.t.(tHelper); ok { |
||||
h.Helper() |
||||
} |
||||
return NotZerof(a.t, i, msg, args...) |
||||
} |
||||
|
||||
// Panics asserts that the code inside the specified PanicTestFunc panics.
|
||||
//
|
||||
// a.Panics(func(){ GoCrazy() })
|
||||
func (a *Assertions) Panics(f PanicTestFunc, msgAndArgs ...interface{}) bool { |
||||
if h, ok := a.t.(tHelper); ok { |
||||
h.Helper() |
||||
} |
||||
return Panics(a.t, f, msgAndArgs...) |
||||
} |
||||
|
||||
// PanicsWithValue asserts that the code inside the specified PanicTestFunc panics, and that
|
||||
// the recovered panic value equals the expected panic value.
|
||||
//
|
||||
// a.PanicsWithValue("crazy error", func(){ GoCrazy() })
|
||||
func (a *Assertions) PanicsWithValue(expected interface{}, f PanicTestFunc, msgAndArgs ...interface{}) bool { |
||||
if h, ok := a.t.(tHelper); ok { |
||||
h.Helper() |
||||
} |
||||
return PanicsWithValue(a.t, expected, f, msgAndArgs...) |
||||
} |
||||
|
||||
// PanicsWithValuef asserts that the code inside the specified PanicTestFunc panics, and that
|
||||
// the recovered panic value equals the expected panic value.
|
||||
//
|
||||
// a.PanicsWithValuef("crazy error", func(){ GoCrazy() }, "error message %s", "formatted")
|
||||
func (a *Assertions) PanicsWithValuef(expected interface{}, f PanicTestFunc, msg string, args ...interface{}) bool { |
||||
if h, ok := a.t.(tHelper); ok { |
||||
h.Helper() |
||||
} |
||||
return PanicsWithValuef(a.t, expected, f, msg, args...) |
||||
} |
||||
|
||||
// Panicsf asserts that the code inside the specified PanicTestFunc panics.
|
||||
//
|
||||
// a.Panicsf(func(){ GoCrazy() }, "error message %s", "formatted")
|
||||
func (a *Assertions) Panicsf(f PanicTestFunc, msg string, args ...interface{}) bool { |
||||
if h, ok := a.t.(tHelper); ok { |
||||
h.Helper() |
||||
} |
||||
return Panicsf(a.t, f, msg, args...) |
||||
} |
||||
|
||||
// Regexp asserts that a specified regexp matches a string.
|
||||
//
|
||||
// a.Regexp(regexp.MustCompile("start"), "it's starting")
|
||||
// a.Regexp("start...$", "it's not starting")
|
||||
func (a *Assertions) Regexp(rx interface{}, str interface{}, msgAndArgs ...interface{}) bool { |
||||
if h, ok := a.t.(tHelper); ok { |
||||
h.Helper() |
||||
} |
||||
return Regexp(a.t, rx, str, msgAndArgs...) |
||||
} |
||||
|
||||
// Regexpf asserts that a specified regexp matches a string.
|
||||
//
|
||||
// a.Regexpf(regexp.MustCompile("start", "error message %s", "formatted"), "it's starting")
|
||||
// a.Regexpf("start...$", "it's not starting", "error message %s", "formatted")
|
||||
func (a *Assertions) Regexpf(rx interface{}, str interface{}, msg string, args ...interface{}) bool { |
||||
if h, ok := a.t.(tHelper); ok { |
||||
h.Helper() |
||||
} |
||||
return Regexpf(a.t, rx, str, msg, args...) |
||||
} |
||||
|
||||
// Subset asserts that the specified list(array, slice...) contains all
|
||||
// elements given in the specified subset(array, slice...).
|
||||
//
|
||||
// a.Subset([1, 2, 3], [1, 2], "But [1, 2, 3] does contain [1, 2]")
|
||||
func (a *Assertions) Subset(list interface{}, subset interface{}, msgAndArgs ...interface{}) bool { |
||||
if h, ok := a.t.(tHelper); ok { |
||||
h.Helper() |
||||
} |
||||
return Subset(a.t, list, subset, msgAndArgs...) |
||||
} |
||||
|
||||
// Subsetf asserts that the specified list(array, slice...) contains all
|
||||
// elements given in the specified subset(array, slice...).
|
||||
//
|
||||
// a.Subsetf([1, 2, 3], [1, 2], "But [1, 2, 3] does contain [1, 2]", "error message %s", "formatted")
|
||||
func (a *Assertions) Subsetf(list interface{}, subset interface{}, msg string, args ...interface{}) bool { |
||||
if h, ok := a.t.(tHelper); ok { |
||||
h.Helper() |
||||
} |
||||
return Subsetf(a.t, list, subset, msg, args...) |
||||
} |
||||
|
||||
// True asserts that the specified value is true.
|
||||
//
|
||||
// a.True(myBool)
|
||||
func (a *Assertions) True(value bool, msgAndArgs ...interface{}) bool { |
||||
if h, ok := a.t.(tHelper); ok { |
||||
h.Helper() |
||||
} |
||||
return True(a.t, value, msgAndArgs...) |
||||
} |
||||
|
||||
// Truef asserts that the specified value is true.
|
||||
//
|
||||
// a.Truef(myBool, "error message %s", "formatted")
|
||||
func (a *Assertions) Truef(value bool, msg string, args ...interface{}) bool { |
||||
if h, ok := a.t.(tHelper); ok { |
||||
h.Helper() |
||||
} |
||||
return Truef(a.t, value, msg, args...) |
||||
} |
||||
|
||||
// WithinDuration asserts that the two times are within duration delta of each other.
|
||||
//
|
||||
// a.WithinDuration(time.Now(), time.Now(), 10*time.Second)
|
||||
func (a *Assertions) WithinDuration(expected time.Time, actual time.Time, delta time.Duration, msgAndArgs ...interface{}) bool { |
||||
if h, ok := a.t.(tHelper); ok { |
||||
h.Helper() |
||||
} |
||||
return WithinDuration(a.t, expected, actual, delta, msgAndArgs...) |
||||
} |
||||
|
||||
// WithinDurationf asserts that the two times are within duration delta of each other.
|
||||
//
|
||||
// a.WithinDurationf(time.Now(), time.Now(), 10*time.Second, "error message %s", "formatted")
|
||||
func (a *Assertions) WithinDurationf(expected time.Time, actual time.Time, delta time.Duration, msg string, args ...interface{}) bool { |
||||
if h, ok := a.t.(tHelper); ok { |
||||
h.Helper() |
||||
} |
||||
return WithinDurationf(a.t, expected, actual, delta, msg, args...) |
||||
} |
||||
|
||||
// Zero asserts that i is the zero value for its type.
|
||||
func (a *Assertions) Zero(i interface{}, msgAndArgs ...interface{}) bool { |
||||
if h, ok := a.t.(tHelper); ok { |
||||
h.Helper() |
||||
} |
||||
return Zero(a.t, i, msgAndArgs...) |
||||
} |
||||
|
||||
// Zerof asserts that i is the zero value for its type.
|
||||
func (a *Assertions) Zerof(i interface{}, msg string, args ...interface{}) bool { |
||||
if h, ok := a.t.(tHelper); ok { |
||||
h.Helper() |
||||
} |
||||
return Zerof(a.t, i, msg, args...) |
||||
} |
||||
@ -0,0 +1,5 @@ |
||||
{{.CommentWithoutT "a"}} |
||||
func (a *Assertions) {{.DocInfo.Name}}({{.Params}}) bool { |
||||
if h, ok := a.t.(tHelper); ok { h.Helper() } |
||||
return {{.DocInfo.Name}}(a.t, {{.ForwardedParams}}) |
||||
} |
||||
File diff suppressed because it is too large
Load Diff
@ -0,0 +1,45 @@ |
||||
// Package assert provides a set of comprehensive testing tools for use with the normal Go testing system.
|
||||
//
|
||||
// Example Usage
|
||||
//
|
||||
// The following is a complete example using assert in a standard test function:
|
||||
// import (
|
||||
// "testing"
|
||||
// "github.com/stretchr/testify/assert"
|
||||
// )
|
||||
//
|
||||
// func TestSomething(t *testing.T) {
|
||||
//
|
||||
// var a string = "Hello"
|
||||
// var b string = "Hello"
|
||||
//
|
||||
// assert.Equal(t, a, b, "The two words should be the same.")
|
||||
//
|
||||
// }
|
||||
//
|
||||
// if you assert many times, use the format below:
|
||||
//
|
||||
// import (
|
||||
// "testing"
|
||||
// "github.com/stretchr/testify/assert"
|
||||
// )
|
||||
//
|
||||
// func TestSomething(t *testing.T) {
|
||||
// assert := assert.New(t)
|
||||
//
|
||||
// var a string = "Hello"
|
||||
// var b string = "Hello"
|
||||
//
|
||||
// assert.Equal(a, b, "The two words should be the same.")
|
||||
// }
|
||||
//
|
||||
// Assertions
|
||||
//
|
||||
// Assertions allow you to easily write test code, and are global funcs in the `assert` package.
|
||||
// All assertion functions take, as the first argument, the `*testing.T` object provided by the
|
||||
// testing framework. This allows the assertion funcs to write the failings and other details to
|
||||
// the correct place.
|
||||
//
|
||||
// Every assertion function also takes an optional string message as the final argument,
|
||||
// allowing custom error messages to be appended to the message the assertion method outputs.
|
||||
package assert |
||||
@ -0,0 +1,10 @@ |
||||
package assert |
||||
|
||||
import ( |
||||
"errors" |
||||
) |
||||
|
||||
// AnError is an error instance useful for testing. If the code does not care
|
||||
// about error specifics, and only needs to return the error for example, this
|
||||
// error should be used to make the test code more readable.
|
||||
var AnError = errors.New("assert.AnError general error for testing") |
||||
@ -0,0 +1,16 @@ |
||||
package assert |
||||
|
||||
// Assertions provides assertion methods around the
|
||||
// TestingT interface.
|
||||
type Assertions struct { |
||||
t TestingT |
||||
} |
||||
|
||||
// New makes a new Assertions object for the specified TestingT.
|
||||
func New(t TestingT) *Assertions { |
||||
return &Assertions{ |
||||
t: t, |
||||
} |
||||
} |
||||
|
||||
//go:generate go run ../_codegen/main.go -output-package=assert -template=assertion_forward.go.tmpl -include-format-funcs
|
||||
@ -0,0 +1,143 @@ |
||||
package assert |
||||
|
||||
import ( |
||||
"fmt" |
||||
"net/http" |
||||
"net/http/httptest" |
||||
"net/url" |
||||
"strings" |
||||
) |
||||
|
||||
// httpCode is a helper that returns HTTP code of the response. It returns -1 and
|
||||
// an error if building a new request fails.
|
||||
func httpCode(handler http.HandlerFunc, method, url string, values url.Values) (int, error) { |
||||
w := httptest.NewRecorder() |
||||
req, err := http.NewRequest(method, url, nil) |
||||
if err != nil { |
||||
return -1, err |
||||
} |
||||
req.URL.RawQuery = values.Encode() |
||||
handler(w, req) |
||||
return w.Code, nil |
||||
} |
||||
|
||||
// HTTPSuccess asserts that a specified handler returns a success status code.
|
||||
//
|
||||
// assert.HTTPSuccess(t, myHandler, "POST", "http://www.google.com", nil)
|
||||
//
|
||||
// Returns whether the assertion was successful (true) or not (false).
|
||||
func HTTPSuccess(t TestingT, handler http.HandlerFunc, method, url string, values url.Values, msgAndArgs ...interface{}) bool { |
||||
if h, ok := t.(tHelper); ok { |
||||
h.Helper() |
||||
} |
||||
code, err := httpCode(handler, method, url, values) |
||||
if err != nil { |
||||
Fail(t, fmt.Sprintf("Failed to build test request, got error: %s", err)) |
||||
return false |
||||
} |
||||
|
||||
isSuccessCode := code >= http.StatusOK && code <= http.StatusPartialContent |
||||
if !isSuccessCode { |
||||
Fail(t, fmt.Sprintf("Expected HTTP success status code for %q but received %d", url+"?"+values.Encode(), code)) |
||||
} |
||||
|
||||
return isSuccessCode |
||||
} |
||||
|
||||
// HTTPRedirect asserts that a specified handler returns a redirect status code.
|
||||
//
|
||||
// assert.HTTPRedirect(t, myHandler, "GET", "/a/b/c", url.Values{"a": []string{"b", "c"}}
|
||||
//
|
||||
// Returns whether the assertion was successful (true) or not (false).
|
||||
func HTTPRedirect(t TestingT, handler http.HandlerFunc, method, url string, values url.Values, msgAndArgs ...interface{}) bool { |
||||
if h, ok := t.(tHelper); ok { |
||||
h.Helper() |
||||
} |
||||
code, err := httpCode(handler, method, url, values) |
||||
if err != nil { |
||||
Fail(t, fmt.Sprintf("Failed to build test request, got error: %s", err)) |
||||
return false |
||||
} |
||||
|
||||
isRedirectCode := code >= http.StatusMultipleChoices && code <= http.StatusTemporaryRedirect |
||||
if !isRedirectCode { |
||||
Fail(t, fmt.Sprintf("Expected HTTP redirect status code for %q but received %d", url+"?"+values.Encode(), code)) |
||||
} |
||||
|
||||
return isRedirectCode |
||||
} |
||||
|
||||
// HTTPError asserts that a specified handler returns an error status code.
|
||||
//
|
||||
// assert.HTTPError(t, myHandler, "POST", "/a/b/c", url.Values{"a": []string{"b", "c"}}
|
||||
//
|
||||
// Returns whether the assertion was successful (true) or not (false).
|
||||
func HTTPError(t TestingT, handler http.HandlerFunc, method, url string, values url.Values, msgAndArgs ...interface{}) bool { |
||||
if h, ok := t.(tHelper); ok { |
||||
h.Helper() |
||||
} |
||||
code, err := httpCode(handler, method, url, values) |
||||
if err != nil { |
||||
Fail(t, fmt.Sprintf("Failed to build test request, got error: %s", err)) |
||||
return false |
||||
} |
||||
|
||||
isErrorCode := code >= http.StatusBadRequest |
||||
if !isErrorCode { |
||||
Fail(t, fmt.Sprintf("Expected HTTP error status code for %q but received %d", url+"?"+values.Encode(), code)) |
||||
} |
||||
|
||||
return isErrorCode |
||||
} |
||||
|
||||
// HTTPBody is a helper that returns HTTP body of the response. It returns
|
||||
// empty string if building a new request fails.
|
||||
func HTTPBody(handler http.HandlerFunc, method, url string, values url.Values) string { |
||||
w := httptest.NewRecorder() |
||||
req, err := http.NewRequest(method, url+"?"+values.Encode(), nil) |
||||
if err != nil { |
||||
return "" |
||||
} |
||||
handler(w, req) |
||||
return w.Body.String() |
||||
} |
||||
|
||||
// HTTPBodyContains asserts that a specified handler returns a
|
||||
// body that contains a string.
|
||||
//
|
||||
// assert.HTTPBodyContains(t, myHandler, "GET", "www.google.com", nil, "I'm Feeling Lucky")
|
||||
//
|
||||
// Returns whether the assertion was successful (true) or not (false).
|
||||
func HTTPBodyContains(t TestingT, handler http.HandlerFunc, method, url string, values url.Values, str interface{}, msgAndArgs ...interface{}) bool { |
||||
if h, ok := t.(tHelper); ok { |
||||
h.Helper() |
||||
} |
||||
body := HTTPBody(handler, method, url, values) |
||||
|
||||
contains := strings.Contains(body, fmt.Sprint(str)) |
||||
if !contains { |
||||
Fail(t, fmt.Sprintf("Expected response body for \"%s\" to contain \"%s\" but found \"%s\"", url+"?"+values.Encode(), str, body)) |
||||
} |
||||
|
||||
return contains |
||||
} |
||||
|
||||
// HTTPBodyNotContains asserts that a specified handler returns a
|
||||
// body that does not contain a string.
|
||||
//
|
||||
// assert.HTTPBodyNotContains(t, myHandler, "GET", "www.google.com", nil, "I'm Feeling Lucky")
|
||||
//
|
||||
// Returns whether the assertion was successful (true) or not (false).
|
||||
func HTTPBodyNotContains(t TestingT, handler http.HandlerFunc, method, url string, values url.Values, str interface{}, msgAndArgs ...interface{}) bool { |
||||
if h, ok := t.(tHelper); ok { |
||||
h.Helper() |
||||
} |
||||
body := HTTPBody(handler, method, url, values) |
||||
|
||||
contains := strings.Contains(body, fmt.Sprint(str)) |
||||
if contains { |
||||
Fail(t, fmt.Sprintf("Expected response body for \"%s\" to NOT contain \"%s\" but found \"%s\"", url+"?"+values.Encode(), str, body)) |
||||
} |
||||
|
||||
return !contains |
||||
} |
||||
Loading…
Reference in new issue