qbit/go
1
0
Fork 0
mirror of https://github.com/golang/go synced 2024-11-20 11:04:56 -07:00
Code Releases Activity

add Sort methods for convenience types

Browse Source 
R=gri
DELTA=9  (9 added, 0 deleted, 0 changed)
OCL=34000
CL=34003
This commit is contained in:
Rob Pike 2009-08-27 18:23:45 -07:00
parent 8b6274eb9f
commit 185ae4f99e
1 changed files with 9 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

9
src/pkg/sort/sort.go
View File

@ -152,6 +152,9 @@ func (p IntArray) Len() int { return len(p); }
func (p IntArray) Less(i, j int) bool { return p[i] < p[j]; }
func (p IntArray) Swap(i, j int) { p[i], p[j] = p[j], p[i]; }
// Sort is a convenience method.
func (p IntArray) Sort() { Sort(p); }
// FloatArray attaches the methods of SortInterface to []float, sorting in increasing order.
type FloatArray []float
@ -160,6 +163,9 @@ func (p FloatArray) Len() int { return len(p); }
func (p FloatArray) Less(i, j int) bool { return p[i] < p[j]; }
func (p FloatArray) Swap(i, j int) { p[i], p[j] = p[j], p[i]; }
// Sort is a convenience method.
ffunc (p FloatArray) Sort() { Sort(p); }
// StringArray attaches the methods of SortInterface to []string, sorting in increasing order.
type StringArray []string
@ -168,6 +174,9 @@ func (p StringArray) Len() int { return len(p); }
func (p StringArray) Less(i, j int) bool { return p[i] < p[j]; }
func (p StringArray) Swap(i, j int) { p[i], p[j] = p[j], p[i]; }
// Sort is a convenience method.
ffunc (p StringArray) Sort() { Sort(p); }
// Convenience wrappers for common cases