Commit 6aeaa5d3 authored by Robert Griesemer's avatar Robert Griesemer

go/token position: code improvements per rsc's suggestion

R=rsc
CC=golang-dev
https://golang.org/cl/3183041
parent ac966ac7
...@@ -94,19 +94,12 @@ func (p Pos) IsValid() bool { ...@@ -94,19 +94,12 @@ func (p Pos) IsValid() bool {
func searchFiles(a []*File, x int) int { func searchFiles(a []*File, x int) int {
i := sort.Search(len(a), func(i int) bool { return a[i].base < x }) return sort.Search(len(a), func(i int) bool { return a[i].base <= x }) - 1
// TODO(gri) The code below is really unfortunate. With the old
// semantics of sort.Search, it was possible to simply
// return i! Need to rethink the Search API.
if i == 0 || i < len(a) && a[i].base == x {
return i
}
return i - 1
} }
func (s *FileSet) file(p Pos) *File { func (s *FileSet) file(p Pos) *File {
if i := searchFiles(s.files, int(p)); i < len(s.files) { if i := searchFiles(s.files, int(p)); i >= 0 {
return s.files[i] return s.files[i]
} }
return nil return nil
...@@ -259,39 +252,25 @@ func (f *File) Position(offset int) Position { ...@@ -259,39 +252,25 @@ func (f *File) Position(offset int) Position {
func searchUints(a []int, x int) int { func searchUints(a []int, x int) int {
i := sort.Search(len(a), func(i int) bool { return a[i] < x }) return sort.Search(len(a), func(i int) bool { return a[i] <= x }) - 1
// TODO(gri) The code below is really unfortunate. With the old
// semantics of sort.Search, it was possible to simply
// return i! Need to rethink the Search API.
if i == 0 || i < len(a) && a[i] == x {
return i
}
return i - 1
} }
func searchLineInfos(a []lineInfo, x int) int { func searchLineInfos(a []lineInfo, x int) int {
i := sort.Search(len(a), func(i int) bool { return a[i].offset < x }) return sort.Search(len(a), func(i int) bool { return a[i].offset <= x }) - 1
// TODO(gri) The code below is really unfortunate. With the old
// semantics of sort.Search, it was possible to simply
// return i! Need to rethink the Search API.
if i == 0 || i < len(a) && a[i].offset == x {
return i
}
return i - 1
} }
// info returns the file name, line, and column number for a file offset. // info returns the file name, line, and column number for a file offset.
func (f *File) info(offset int) (filename string, line, column int) { func (f *File) info(offset int) (filename string, line, column int) {
filename = f.name filename = f.name
if i := searchUints(f.lines, offset); i < len(f.lines) { if i := searchUints(f.lines, offset); i >= 0 {
line, column = i+1, offset-f.lines[i]+1 line, column = i+1, offset-f.lines[i]+1
} }
if i := searchLineInfos(f.infos, offset); i < len(f.infos) { if i := searchLineInfos(f.infos, offset); i >= 0 {
alt := &f.infos[i] alt := &f.infos[i]
filename = alt.filename filename = alt.filename
if i := searchUints(f.lines, alt.offset); i < len(f.lines) { if i := searchUints(f.lines, alt.offset); i >= 0 {
line += alt.line - i - 1 line += alt.line - i - 1
} }
} }
......
Markdown is supported
0%
or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment