Skip to content
Projects
Groups
Snippets
Help
Loading...
Help
Support
Keyboard shortcuts
?
Submit feedback
Contribute to GitLab
Sign in / Register
Toggle navigation
G
go
Project overview
Project overview
Details
Activity
Releases
Repository
Repository
Files
Commits
Branches
Tags
Contributors
Graph
Compare
Issues
0
Issues
0
List
Boards
Labels
Milestones
Merge Requests
0
Merge Requests
0
Analytics
Analytics
Repository
Value Stream
Wiki
Wiki
Snippets
Snippets
Members
Members
Collapse sidebar
Close sidebar
Activity
Graph
Create a new issue
Commits
Issue Boards
Open sidebar
Kirill Smelkov
go
Commits
d724631a
Commit
d724631a
authored
Mar 13, 2012
by
Robert Griesemer
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
all: various typos
R=golang-dev, dsymonds CC=golang-dev
https://golang.org/cl/5820045
parent
fef92cbb
Changes
7
Hide whitespace changes
Inline
Side-by-side
Showing
7 changed files
with
9 additions
and
9 deletions
+9
-9
src/pkg/index/suffixarray/qsufsort.go
src/pkg/index/suffixarray/qsufsort.go
+2
-2
src/pkg/math/big/nat.go
src/pkg/math/big/nat.go
+1
-1
src/pkg/math/erf.go
src/pkg/math/erf.go
+2
-2
src/pkg/net/interface_linux.go
src/pkg/net/interface_linux.go
+1
-1
src/pkg/net/interface_stub.go
src/pkg/net/interface_stub.go
+1
-1
src/pkg/net/interface_windows.go
src/pkg/net/interface_windows.go
+1
-1
src/pkg/syscall/syscall_linux.go
src/pkg/syscall/syscall_linux.go
+1
-1
No files found.
src/pkg/index/suffixarray/qsufsort.go
View file @
d724631a
...
...
@@ -11,7 +11,7 @@
// Consecutive groups of suffixes in sa are labeled as sorted groups or
// unsorted groups. For a given pass of the sorter, all suffixes are ordered
// up to their first h characters, and sa is h-ordered. Suffixes in their
// final positions and unambiguouly sorted in h-order are in a sorted group.
// final positions and unambiguou
s
ly sorted in h-order are in a sorted group.
// Consecutive groups of suffixes with identical first h characters are an
// unsorted group. In each pass of the algorithm, unsorted groups are sorted
// according to the group number of their following suffix.
...
...
@@ -78,7 +78,7 @@ func sortedByFirstByte(data []byte) []int {
for
_
,
b
:=
range
data
{
count
[
b
]
++
}
// make count[b] equal index of first occurence of b in sorted array
// make count[b] equal index of first occur
r
ence of b in sorted array
sum
:=
0
for
b
:=
range
count
{
count
[
b
],
sum
=
sum
,
count
[
b
]
+
sum
...
...
src/pkg/math/big/nat.go
View file @
d724631a
...
...
@@ -826,7 +826,7 @@ func (x nat) string(charset string) string {
// iterative approach. This threshold is represented by leafSize. Benchmarking of leafSize in the
// range 2..64 shows that values of 8 and 16 work well, with a 4x speedup at medium lengths and
// ~30x for 20000 digits. Use nat_test.go's BenchmarkLeafSize tests to optimize leafSize for
// specfic hardware.
// spec
i
fic hardware.
//
func
(
q
nat
)
convertWords
(
s
[]
byte
,
charset
string
,
b
Word
,
ndigits
int
,
bb
Word
,
table
[]
divisor
)
{
// split larger blocks recursively
...
...
src/pkg/math/erf.go
View file @
d724631a
...
...
@@ -248,7 +248,7 @@ func Erf(x float64) float64 {
R
=
rb0
+
s
*
(
rb1
+
s
*
(
rb2
+
s
*
(
rb3
+
s
*
(
rb4
+
s
*
(
rb5
+
s
*
rb6
)))))
S
=
1
+
s
*
(
sb1
+
s
*
(
sb2
+
s
*
(
sb3
+
s
*
(
sb4
+
s
*
(
sb5
+
s
*
(
sb6
+
s
*
sb7
))))))
}
z
:=
Float64frombits
(
Float64bits
(
x
)
&
0xffffffff00000000
)
// pseudo-single (20-bit) precison x
z
:=
Float64frombits
(
Float64bits
(
x
)
&
0xffffffff00000000
)
// pseudo-single (20-bit) precis
i
on x
r
:=
Exp
(
-
z
*
z
-
0.5625
)
*
Exp
((
z
-
x
)
*
(
z
+
x
)
+
R
/
S
)
if
sign
{
return
r
/
x
-
1
...
...
@@ -321,7 +321,7 @@ func Erfc(x float64) float64 {
R
=
rb0
+
s
*
(
rb1
+
s
*
(
rb2
+
s
*
(
rb3
+
s
*
(
rb4
+
s
*
(
rb5
+
s
*
rb6
)))))
S
=
1
+
s
*
(
sb1
+
s
*
(
sb2
+
s
*
(
sb3
+
s
*
(
sb4
+
s
*
(
sb5
+
s
*
(
sb6
+
s
*
sb7
))))))
}
z
:=
Float64frombits
(
Float64bits
(
x
)
&
0xffffffff00000000
)
// pseudo-single (20-bit) precison x
z
:=
Float64frombits
(
Float64bits
(
x
)
&
0xffffffff00000000
)
// pseudo-single (20-bit) precis
i
on x
r
:=
Exp
(
-
z
*
z
-
0.5625
)
*
Exp
((
z
-
x
)
*
(
z
+
x
)
+
R
/
S
)
if
sign
{
return
2
-
r
/
x
...
...
src/pkg/net/interface_linux.go
View file @
d724631a
...
...
@@ -13,7 +13,7 @@ import (
)
// If the ifindex is zero, interfaceTable returns mappings of all
// network interfaces. Other
iw
se it returns a mapping of a specific
// network interfaces. Other
wi
se it returns a mapping of a specific
// interface.
func
interfaceTable
(
ifindex
int
)
([]
Interface
,
error
)
{
tab
,
err
:=
syscall
.
NetlinkRIB
(
syscall
.
RTM_GETLINK
,
syscall
.
AF_UNSPEC
)
...
...
src/pkg/net/interface_stub.go
View file @
d724631a
...
...
@@ -9,7 +9,7 @@
package
net
// If the ifindex is zero, interfaceTable returns mappings of all
// network interfaces. Other
iw
se it returns a mapping of a specific
// network interfaces. Other
wi
se it returns a mapping of a specific
// interface.
func
interfaceTable
(
ifindex
int
)
([]
Interface
,
error
)
{
return
nil
,
nil
...
...
src/pkg/net/interface_windows.go
View file @
d724631a
...
...
@@ -56,7 +56,7 @@ func getInterfaceList() ([]syscall.InterfaceInfo, error) {
}
// If the ifindex is zero, interfaceTable returns mappings of all
// network interfaces. Other
iw
se it returns a mapping of a specific
// network interfaces. Other
wi
se it returns a mapping of a specific
// interface.
func
interfaceTable
(
ifindex
int
)
([]
Interface
,
error
)
{
ai
,
err
:=
getAdapterList
()
...
...
src/pkg/syscall/syscall_linux.go
View file @
d724631a
...
...
@@ -627,7 +627,7 @@ func ptracePeek(req int, pid int, addr uintptr, out []byte) (count int, err erro
// Remainder.
for
len
(
out
)
>
0
{
// We use an internal buffer to g
au
rantee alignment.
// We use an internal buffer to g
ua
rantee alignment.
// It's not documented if this is necessary, but we're paranoid.
err
=
ptrace
(
req
,
pid
,
addr
+
uintptr
(
n
),
uintptr
(
unsafe
.
Pointer
(
&
buf
[
0
])))
if
err
!=
nil
{
...
...
Write
Preview
Markdown
is supported
0%
Try again
or
attach a new file
Attach a file
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment