qbit/go
1
0
Fork 0
mirror of https://github.com/golang/go synced 2024-11-22 07:34:40 -07:00
Code Releases Activity

test/bench: dead code in reverse-complement

Browse Source 
R=r
https://golang.org/cl/165065
This commit is contained in:
Russ Cox 2009-12-04 19:25:25 -08:00
parent d7402cea8c
commit e2b23e42a8
1 changed files with 3 additions and 30 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

33
test/bench/reverse-complement.go
View File

@ -61,37 +61,8 @@ var complement = [256]uint8{
'N': 'N', 'n': 'N',
}
var in *bufio.Reader
func reverseComplement(in []byte) []byte {
outLen := len(in) + (len(in)+lineSize-1)/lineSize;
out := make([]byte, outLen);
j := 0;
k := 0;
for i := len(in) - 1; i >= 0; i-- {
if k == lineSize {
out[j] = '\n';
j++;
k = 0;
}
out[j] = complement[in[i]];
j++;
k++;
}
out[j] = '\n';
j++;
return out[0:j];
}
func output(buf []byte) {
if len(buf) == 0 {
return
}
os.Stdout.Write(reverseComplement(buf));
}
func main() {
in = bufio.NewReader(os.Stdin);
in := bufio.NewReader(os.Stdin);
buf := make([]byte, 1024*1024);
line, err := in.ReadSlice('\n');
for err == nil {
@ -113,6 +84,8 @@ func main() {
w += len(nbuf) - len(buf);
buf = nbuf;
}
// This loop is the bottleneck.
for r := 0; r < len(line); r++ {
w--;
buf[w] = complement[line[r]];