ires 0.1.3 → 0.1.4

data/ext/vendor/golang.org/x/text/number/option.go

@@ -0,0 +1,177 @@
+// Copyright 2017 The Go Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style
+// license that can be found in the LICENSE file.
+
+package number
+
+import (
+	"fmt"
+
+	"golang.org/x/text/internal/number"
+	"golang.org/x/text/language"
+)
+
+// An Option configures a Formatter.
+type Option option
+
+type option func(tag language.Tag, f *number.Formatter)
+
+// TODO: SpellOut requires support of the ICU RBNF format.
+// func SpellOut() Option
+
+// NoSeparator causes a number to be displayed without grouping separators.
+func NoSeparator() Option {
+	return func(t language.Tag, f *number.Formatter) {
+		f.GroupingSize = [2]uint8{}
+	}
+}
+
+// MaxIntegerDigits limits the number of integer digits, eliminating the
+// most significant digits.
+func MaxIntegerDigits(max int) Option {
+	return func(t language.Tag, f *number.Formatter) {
+		if max >= 1<<8 {
+			max = (1 << 8) - 1
+		}
+		f.MaxIntegerDigits = uint8(max)
+	}
+}
+
+// MinIntegerDigits specifies the minimum number of integer digits, adding
+// leading zeros when needed.
+func MinIntegerDigits(min int) Option {
+	return func(t language.Tag, f *number.Formatter) {
+		if min >= 1<<8 {
+			min = (1 << 8) - 1
+		}
+		f.MinIntegerDigits = uint8(min)
+	}
+}
+
+// MaxFractionDigits specifies the maximum number of fractional digits.
+func MaxFractionDigits(max int) Option {
+	return func(t language.Tag, f *number.Formatter) {
+		if max >= 1<<15 {
+			max = (1 << 15) - 1
+		}
+		f.MaxFractionDigits = int16(max)
+	}
+}
+
+// MinFractionDigits specifies the minimum number of fractional digits.
+func MinFractionDigits(min int) Option {
+	return func(t language.Tag, f *number.Formatter) {
+		if min >= 1<<8 {
+			min = (1 << 8) - 1
+		}
+		f.MinFractionDigits = uint8(min)
+	}
+}
+
+// Precision sets the maximum number of significant digits. A negative value
+// means exact.
+func Precision(prec int) Option {
+	return func(t language.Tag, f *number.Formatter) {
+		f.SetPrecision(prec)
+	}
+}
+
+// Scale simultaneously sets MinFractionDigits and MaxFractionDigits to the
+// given value.
+func Scale(decimals int) Option {
+	return func(t language.Tag, f *number.Formatter) {
+		f.SetScale(decimals)
+	}
+}
+
+// IncrementString sets the incremental value to which numbers should be
+// rounded. For instance: Increment("0.05") will cause 1.44 to round to 1.45.
+// IncrementString also sets scale to the scale of the increment.
+func IncrementString(decimal string) Option {
+	increment := 0
+	scale := 0
+	d := decimal
+	p := 0
+	for ; p < len(d) && '0' <= d[p] && d[p] <= '9'; p++ {
+		increment *= 10
+		increment += int(d[p]) - '0'
+	}
+	if p < len(d) && d[p] == '.' {
+		for p++; p < len(d) && '0' <= d[p] && d[p] <= '9'; p++ {
+			increment *= 10
+			increment += int(d[p]) - '0'
+			scale++
+		}
+	}
+	if p < len(d) {
+		increment = 0
+		scale = 0
+	}
+	return func(t language.Tag, f *number.Formatter) {
+		f.Increment = uint32(increment)
+		f.IncrementScale = uint8(scale)
+		f.SetScale(scale)
+	}
+}
+
+func noop(language.Tag, *number.Formatter) {}
+
+// PatternOverrides allows users to specify alternative patterns for specific
+// languages. The Pattern will be overridden for all languages in a subgroup as
+// well. The function will panic for invalid input. It is best to create this
+// option at startup time.
+// PatternOverrides must be the first Option passed to a formatter.
+func PatternOverrides(patterns map[string]string) Option {
+	// TODO: make it so that it does not have to be the first option.
+	// TODO: use -x-nochild to indicate it does not override child tags.
+	m := map[language.Tag]*number.Pattern{}
+	for k, v := range patterns {
+		tag := language.MustParse(k)
+		p, err := number.ParsePattern(v)
+		if err != nil {
+			panic(fmt.Errorf("number: PatternOverrides: %v", err))
+		}
+		m[tag] = p
+	}
+	return func(t language.Tag, f *number.Formatter) {
+		// TODO: Use language grouping relation instead of parent relation.
+		// TODO: Should parent implement the grouping relation?
+		for lang := t; ; lang = t.Parent() {
+			if p, ok := m[lang]; ok {
+				f.Pattern = *p
+				break
+			}
+			if lang == language.Und {
+				break
+			}
+		}
+	}
+}
+
+// FormatWidth sets the total format width.
+func FormatWidth(n int) Option {
+	if n <= 0 {
+		return noop
+	}
+	return func(t language.Tag, f *number.Formatter) {
+		f.FormatWidth = uint16(n)
+		if f.PadRune == 0 {
+			f.PadRune = ' '
+		}
+	}
+}
+
+// Pad sets the rune to be used for filling up to the format width.
+func Pad(r rune) Option {
+	return func(t language.Tag, f *number.Formatter) {
+		f.PadRune = r
+	}
+}
+
+// TODO:
+// - FormatPosition (using type aliasing?)
+// - Multiplier: find a better way to represent and figure out what to do
+//   with clashes with percent/permille.
+// - NumberingSystem(nu string): not accessable in number.Info now. Also, should
+//      this be keyed by language or generic?
+// - SymbolOverrides(symbols map[string]map[number.SymbolType]string) Option

data/ext/vendor/golang.org/x/text/runes/cond.go

@@ -0,0 +1,187 @@
+// Copyright 2015 The Go Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style
+// license that can be found in the LICENSE file.
+
+package runes
+
+import (
+	"unicode/utf8"
+
+	"golang.org/x/text/transform"
+)
+
+// Note: below we pass invalid UTF-8 to the tIn and tNotIn transformers as is.
+// This is done for various reasons:
+// - To retain the semantics of the Nop transformer: if input is passed to a Nop
+//   one would expect it to be unchanged.
+// - It would be very expensive to pass a converted RuneError to a transformer:
+//   a transformer might need more source bytes after RuneError, meaning that
+//   the only way to pass it safely is to create a new buffer and manage the
+//   intermingling of RuneErrors and normal input.
+// - Many transformers leave ill-formed UTF-8 as is, so this is not
+//   inconsistent. Generally ill-formed UTF-8 is only replaced if it is a
+//   logical consequence of the operation (as for Map) or if it otherwise would
+//   pose security concerns (as for Remove).
+// - An alternative would be to return an error on ill-formed UTF-8, but this
+//   would be inconsistent with other operations.
+
+// If returns a transformer that applies tIn to consecutive runes for which
+// s.Contains(r) and tNotIn to consecutive runes for which !s.Contains(r). Reset
+// is called on tIn and tNotIn at the start of each run. A Nop transformer will
+// substitute a nil value passed to tIn or tNotIn. Invalid UTF-8 is translated
+// to RuneError to determine which transformer to apply, but is passed as is to
+// the respective transformer.
+func If(s Set, tIn, tNotIn transform.Transformer) Transformer {
+	if tIn == nil && tNotIn == nil {
+		return Transformer{transform.Nop}
+	}
+	if tIn == nil {
+		tIn = transform.Nop
+	}
+	if tNotIn == nil {
+		tNotIn = transform.Nop
+	}
+	sIn, ok := tIn.(transform.SpanningTransformer)
+	if !ok {
+		sIn = dummySpan{tIn}
+	}
+	sNotIn, ok := tNotIn.(transform.SpanningTransformer)
+	if !ok {
+		sNotIn = dummySpan{tNotIn}
+	}
+
+	a := &cond{
+		tIn:    sIn,
+		tNotIn: sNotIn,
+		f:      s.Contains,
+	}
+	a.Reset()
+	return Transformer{a}
+}
+
+type dummySpan struct{ transform.Transformer }
+
+func (d dummySpan) Span(src []byte, atEOF bool) (n int, err error) {
+	return 0, transform.ErrEndOfSpan
+}
+
+type cond struct {
+	tIn, tNotIn transform.SpanningTransformer
+	f           func(rune) bool
+	check       func(rune) bool               // current check to perform
+	t           transform.SpanningTransformer // current transformer to use
+}
+
+// Reset implements transform.Transformer.
+func (t *cond) Reset() {
+	t.check = t.is
+	t.t = t.tIn
+	t.t.Reset() // notIn will be reset on first usage.
+}
+
+func (t *cond) is(r rune) bool {
+	if t.f(r) {
+		return true
+	}
+	t.check = t.isNot
+	t.t = t.tNotIn
+	t.tNotIn.Reset()
+	return false
+}
+
+func (t *cond) isNot(r rune) bool {
+	if !t.f(r) {
+		return true
+	}
+	t.check = t.is
+	t.t = t.tIn
+	t.tIn.Reset()
+	return false
+}
+
+// This implementation of Span doesn't help all too much, but it needs to be
+// there to satisfy this package's Transformer interface.
+// TODO: there are certainly room for improvements, though. For example, if
+// t.t == transform.Nop (which will a common occurrence) it will save a bundle
+// to special-case that loop.
+func (t *cond) Span(src []byte, atEOF bool) (n int, err error) {
+	p := 0
+	for n < len(src) && err == nil {
+		// Don't process too much at a time as the Spanner that will be
+		// called on this block may terminate early.
+		const maxChunk = 4096
+		max := len(src)
+		if v := n + maxChunk; v < max {
+			max = v
+		}
+		atEnd := false
+		size := 0
+		current := t.t
+		for ; p < max; p += size {
+			r := rune(src[p])
+			if r < utf8.RuneSelf {
+				size = 1
+			} else if r, size = utf8.DecodeRune(src[p:]); size == 1 {
+				if !atEOF && !utf8.FullRune(src[p:]) {
+					err = transform.ErrShortSrc
+					break
+				}
+			}
+			if !t.check(r) {
+				// The next rune will be the start of a new run.
+				atEnd = true
+				break
+			}
+		}
+		n2, err2 := current.Span(src[n:p], atEnd || (atEOF && p == len(src)))
+		n += n2
+		if err2 != nil {
+			return n, err2
+		}
+		// At this point either err != nil or t.check will pass for the rune at p.
+		p = n + size
+	}
+	return n, err
+}
+
+func (t *cond) Transform(dst, src []byte, atEOF bool) (nDst, nSrc int, err error) {
+	p := 0
+	for nSrc < len(src) && err == nil {
+		// Don't process too much at a time, as the work might be wasted if the
+		// destination buffer isn't large enough to hold the result or a
+		// transform returns an error early.
+		const maxChunk = 4096
+		max := len(src)
+		if n := nSrc + maxChunk; n < len(src) {
+			max = n
+		}
+		atEnd := false
+		size := 0
+		current := t.t
+		for ; p < max; p += size {
+			r := rune(src[p])
+			if r < utf8.RuneSelf {
+				size = 1
+			} else if r, size = utf8.DecodeRune(src[p:]); size == 1 {
+				if !atEOF && !utf8.FullRune(src[p:]) {
+					err = transform.ErrShortSrc
+					break
+				}
+			}
+			if !t.check(r) {
+				// The next rune will be the start of a new run.
+				atEnd = true
+				break
+			}
+		}
+		nDst2, nSrc2, err2 := current.Transform(dst[nDst:], src[nSrc:p], atEnd || (atEOF && p == len(src)))
+		nDst += nDst2
+		nSrc += nSrc2
+		if err2 != nil {
+			return nDst, nSrc, err2
+		}
+		// At this point either err != nil or t.check will pass for the rune at p.
+		p = nSrc + size
+	}
+	return nDst, nSrc, err
+}

data/ext/vendor/golang.org/x/text/runes/cond_test.go

@@ -0,0 +1,282 @@
+// Copyright 2015 The Go Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style
+// license that can be found in the LICENSE file.
+
+package runes
+
+import (
+	"strings"
+	"testing"
+	"unicode"
+
+	"golang.org/x/text/cases"
+	"golang.org/x/text/language"
+	"golang.org/x/text/transform"
+)
+
+var (
+	toUpper = cases.Upper(language.Und)
+	toLower = cases.Lower(language.Und)
+)
+
+type spanformer interface {
+	transform.SpanningTransformer
+}
+
+func TestPredicate(t *testing.T) {
+	testConditional(t, func(rt *unicode.RangeTable, t, f spanformer) spanformer {
+		return If(Predicate(func(r rune) bool {
+			return unicode.Is(rt, r)
+		}), t, f)
+	})
+}
+
+func TestIn(t *testing.T) {
+	testConditional(t, func(rt *unicode.RangeTable, t, f spanformer) spanformer {
+		return If(In(rt), t, f)
+	})
+}
+
+func TestNotIn(t *testing.T) {
+	testConditional(t, func(rt *unicode.RangeTable, t, f spanformer) spanformer {
+		return If(NotIn(rt), f, t)
+	})
+}
+
+func testConditional(t *testing.T, f func(rt *unicode.RangeTable, t, f spanformer) spanformer) {
+	lower := f(unicode.Latin, toLower, toLower)
+
+	for i, tt := range []transformTest{{
+		desc:    "empty",
+		szDst:   large,
+		atEOF:   true,
+		in:      "",
+		out:     "",
+		outFull: "",
+		t:       lower,
+	}, {
+		desc:    "small",
+		szDst:   1,
+		atEOF:   true,
+		in:      "B",
+		out:     "b",
+		outFull: "b",
+		errSpan: transform.ErrEndOfSpan,
+		t:       lower,
+	}, {
+		desc:    "short dst",
+		szDst:   2,
+		atEOF:   true,
+		in:      "AAA",
+		out:     "aa",
+		outFull: "aaa",
+		err:     transform.ErrShortDst,
+		errSpan: transform.ErrEndOfSpan,
+		t:       lower,
+	}, {
+		desc:    "short dst writing error",
+		szDst:   1,
+		atEOF:   false,
+		in:      "A\x80",
+		out:     "a",
+		outFull: "a\x80",
+		err:     transform.ErrShortDst,
+		errSpan: transform.ErrEndOfSpan,
+		t:       lower,
+	}, {
+		desc:    "short dst writing incomplete rune",
+		szDst:   2,
+		atEOF:   true,
+		in:      "Σ\xc2",
+		out:     "Σ",
+		outFull: "Σ\xc2",
+		err:     transform.ErrShortDst,
+		t:       f(unicode.Latin, toLower, nil),
+	}, {
+		desc:    "short dst, longer",
+		szDst:   5,
+		atEOF:   true,
+		in:      "Hellø",
+		out:     "Hell",
+		outFull: "Hellø",
+		err:     transform.ErrShortDst,
+		// idem is used to test short buffers by forcing processing of full-rune increments.
+		t: f(unicode.Latin, Map(idem), nil),
+	}, {
+		desc:    "short dst, longer, writing error",
+		szDst:   6,
+		atEOF:   false,
+		in:      "\x80Hello\x80",
+		out:     "\x80Hello",
+		outFull: "\x80Hello\x80",
+		err:     transform.ErrShortDst,
+		t:       f(unicode.Latin, Map(idem), nil),
+	}, {
+		desc:    "short src",
+		szDst:   2,
+		atEOF:   false,
+		in:      "A\xc2",
+		out:     "a",
+		outFull: "a\xc2",
+		err:     transform.ErrShortSrc,
+		errSpan: transform.ErrEndOfSpan,
+		t:       lower,
+	}, {
+		desc:    "short src no change",
+		szDst:   2,
+		atEOF:   false,
+		in:      "a\xc2",
+		out:     "a",
+		outFull: "a\xc2",
+		err:     transform.ErrShortSrc,
+		errSpan: transform.ErrShortSrc,
+		nSpan:   1,
+		t:       lower,
+	}, {
+		desc:    "invalid input, atEOF",
+		szDst:   large,
+		atEOF:   true,
+		in:      "\x80",
+		out:     "\x80",
+		outFull: "\x80",
+		t:       lower,
+	}, {
+		desc:    "invalid input, !atEOF",
+		szDst:   large,
+		atEOF:   false,
+		in:      "\x80",
+		out:     "\x80",
+		outFull: "\x80",
+		t:       lower,
+	}, {
+		desc:    "invalid input, incomplete rune atEOF",
+		szDst:   large,
+		atEOF:   true,
+		in:      "\xc2",
+		out:     "\xc2",
+		outFull: "\xc2",
+		t:       lower,
+	}, {
+		desc:    "nop",
+		szDst:   large,
+		atEOF:   true,
+		in:      "Hello World!",
+		out:     "Hello World!",
+		outFull: "Hello World!",
+		t:       f(unicode.Latin, nil, nil),
+	}, {
+		desc:    "nop in",
+		szDst:   large,
+		atEOF:   true,
+		in:      "THIS IS α ΤΕΣΤ",
+		out:     "this is α ΤΕΣΤ",
+		outFull: "this is α ΤΕΣΤ",
+		errSpan: transform.ErrEndOfSpan,
+		t:       f(unicode.Greek, nil, toLower),
+	}, {
+		desc:    "nop in latin",
+		szDst:   large,
+		atEOF:   true,
+		in:      "THIS IS α ΤΕΣΤ",
+		out:     "THIS IS α τεστ",
+		outFull: "THIS IS α τεστ",
+		errSpan: transform.ErrEndOfSpan,
+		t:       f(unicode.Latin, nil, toLower),
+	}, {
+		desc:    "nop not in",
+		szDst:   large,
+		atEOF:   true,
+		in:      "THIS IS α ΤΕΣΤ",
+		out:     "this is α ΤΕΣΤ",
+		outFull: "this is α ΤΕΣΤ",
+		errSpan: transform.ErrEndOfSpan,
+		t:       f(unicode.Latin, toLower, nil),
+	}, {
+		desc:    "pass atEOF is true when at end",
+		szDst:   large,
+		atEOF:   true,
+		in:      "hello",
+		out:     "HELLO",
+		outFull: "HELLO",
+		errSpan: transform.ErrEndOfSpan,
+		t:       f(unicode.Latin, upperAtEOF{}, nil),
+	}, {
+		desc:    "pass atEOF is true when at end of segment",
+		szDst:   large,
+		atEOF:   true,
+		in:      "hello ",
+		out:     "HELLO ",
+		outFull: "HELLO ",
+		errSpan: transform.ErrEndOfSpan,
+		t:       f(unicode.Latin, upperAtEOF{}, nil),
+	}, {
+		desc:    "don't pass atEOF is true when atEOF is false",
+		szDst:   large,
+		atEOF:   false,
+		in:      "hello",
+		out:     "",
+		outFull: "HELLO",
+		err:     transform.ErrShortSrc,
+		errSpan: transform.ErrShortSrc,
+		t:       f(unicode.Latin, upperAtEOF{}, nil),
+	}, {
+		desc:    "pass atEOF is true when at end, no change",
+		szDst:   large,
+		atEOF:   true,
+		in:      "HELLO",
+		out:     "HELLO",
+		outFull: "HELLO",
+		t:       f(unicode.Latin, upperAtEOF{}, nil),
+	}, {
+		desc:    "pass atEOF is true when at end of segment, no change",
+		szDst:   large,
+		atEOF:   true,
+		in:      "HELLO ",
+		out:     "HELLO ",
+		outFull: "HELLO ",
+		t:       f(unicode.Latin, upperAtEOF{}, nil),
+	}, {
+		desc:    "large input ASCII",
+		szDst:   12000,
+		atEOF:   false,
+		in:      strings.Repeat("HELLO", 2000),
+		out:     strings.Repeat("hello", 2000),
+		outFull: strings.Repeat("hello", 2000),
+		errSpan: transform.ErrEndOfSpan,
+		err:     nil,
+		t:       lower,
+	}, {
+		desc:    "large input non-ASCII",
+		szDst:   12000,
+		atEOF:   false,
+		in:      strings.Repeat("\u3333", 2000),
+		out:     strings.Repeat("\u3333", 2000),
+		outFull: strings.Repeat("\u3333", 2000),
+		err:     nil,
+		t:       lower,
+	}} {
+		tt.check(t, i)
+	}
+}
+
+// upperAtEOF is a strange Transformer that converts text to uppercase, but only
+// if atEOF is true.
+type upperAtEOF struct{ transform.NopResetter }
+
+func (upperAtEOF) Transform(dst, src []byte, atEOF bool) (nDst, nSrc int, err error) {
+	if !atEOF {
+		return 0, 0, transform.ErrShortSrc
+	}
+	return toUpper.Transform(dst, src, atEOF)
+}
+
+func (upperAtEOF) Span(src []byte, atEOF bool) (n int, err error) {
+	if !atEOF {
+		return 0, transform.ErrShortSrc
+	}
+	return toUpper.Span(src, atEOF)
+}
+
+func BenchmarkConditional(b *testing.B) {
+	doBench(b, If(In(unicode.Hangul), transform.Nop, transform.Nop))
+}