code review 4715041: go/printer: changed max. number of newlines from 3 to 2

src/pkg/index/suffixarray/suffixarray.go

 // Copyright 2010 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 suffixarray implements substring search in logarithmic time using
 // an in-memory suffix array.
 //
 // Example use:
 //
 //      // create index for some data
 //      index := suffixarray.New(data)
 //
 //      // lookup byte slice s
 //      offsets1 := index.Lookup(s, -1) // the list of all indices where s occurs in data
 //      offsets2 := index.Lookup(s, 3)  // the list of at most 3 indices where s occurs in data
 //
 package suffixarray
 
 import (
         "bytes"
         "regexp"
         "sort"
 )
 
-
 // Index implements a suffix array for fast substring search.
 type Index struct {
         data []byte
         sa   []int // suffix array for data
 }
 
-
 // New creates a new Index for data.
 // Index creation time is O(N*log(N)) for N = len(data).
 func New(data []byte) *Index {
         return &Index{data, qsufsort(data)}
 }
-
 
 // Bytes returns the data over which the index was created.
 // It must not be modified.
 //
 func (x *Index) Bytes() []byte {
         return x.data
 }
 
-
 func (x *Index) at(i int) []byte {
         return x.data[x.sa[i]:]
 }
-
 
 // lookupAll returns a slice into the matching region of the index.
 // The runtime is O(log(N)*len(s)).
 func (x *Index) lookupAll(s []byte) []int {
         // find matching suffix index range [i:j]
         // find the first index where s would be the prefix
         i := sort.Search(len(x.sa), func(i int) bool { return bytes.Compare(x.at(i), s) >= 0 })
         // starting at i, find the first index at which s is not a prefix
         j := i + sort.Search(len(x.sa)-i, func(j int) bool { return !bytes.HasPrefix(x.at(j+i), s) })
         return x.sa[i:j]
 }
-
 
 // Lookup returns an unsorted list of at most n indices where the byte string s
 // occurs in the indexed data. If n < 0, all occurrences are returned.
 // The result is nil if s is empty, s is not found, or n == 0.
 // Lookup time is O(log(N)*len(s) + len(result)) where N is the
 // size of the indexed data.
 //
 func (x *Index) Lookup(s []byte, n int) (result []int) {
         if len(s) > 0 && n != 0 {
                 matches := x.lookupAll(s)
                 if len(matches) < n || n < 0 {
                         n = len(matches)
                 }
                 if n > 0 {
                         result = make([]int, n)
                         copy(result, matches)
                 }
         }
         return
 }
-
 
 // FindAllIndex returns a sorted list of non-overlapping matches of the
 // regular expression r, where a match is a pair of indices specifying
 // the matched slice of x.Bytes(). If n < 0, all matches are returned
 // in successive order. Otherwise, at most n matches are returned and
 // they may not be successive. The result is nil if there are no matches,
 // or if n == 0.
 //
 func (x *Index) FindAllIndex(r *regexp.Regexp, n int) (result [][]int) {
         // a non-empty literal prefix is used to determine possible
@@ skipping 84 matching lines @@
                         // found all matches or there's no chance to find more
                         // (n and n1 can be negative)
                         break
                 }
         }
         if len(result) == 0 {
                 result = nil
         }
         return
 }