Adding ability to sort results based on different keys

server.go

@@ -50,7 +50,10 @@ func executeQuery(rw http.ResponseWriter, req *http.Request) {
 
 	entries := getRecords(queryContext{geo, request.Profile, request.WalkingDist})
 	features := fixFeatures(request.Features)
+
 	foundEntries := findRecords(entries, features, request.MinScore)
+	sorter := recordSorter{entries: foundEntries, key: request.SortKey, ascending: request.SortAscending}
+	sorter.sort()
 
 	response := jsonQueryResponse{
 		Count:   len(foundEntries),

types.go

@@ -22,6 +22,8 @@
 
 package main
 
+import "sort"
+
 type featureMap map[string]float64
 
 type jsonAccessRequest struct {
@@ -41,6 +43,8 @@ type jsonQueryRequest struct {
 	MaxResults    int          `json:"maxResults"`
 	MinScore      float64      `json:"minScore"`
 	Profile       featureMap   `json:"profile"`
+	SortAscending bool         `json:"SortAscending"`
+	SortKey       string       `json:"sortKey"`
 	WalkingDist   float64      `json:"walkingDist"`
 }
 
@@ -130,14 +134,46 @@ type record struct {
 
 type records []record
 
-func (slice records) Len() int {
-	return len(slice)
+type recordSorter struct {
+	ascending bool
+	entries   records
+	key       string
 }
 
-func (slice records) Less(i, j int) bool {
-	return slice[i].score > slice[j].score
+func (sorter recordSorter) sort() {
+	if sorter.ascending {
+		sort.Sort(sorter)
+	} else {
+		sort.Sort(sort.Reverse(sorter))
+	}
 }
 
-func (slice records) Swap(i, j int) {
-	slice[i], slice[j] = slice[j], slice[i]
+func (sorter recordSorter) Len() int {
+	return len(sorter.entries)
+}
+
+func (sorter recordSorter) Less(i, j int) bool {
+	entry1 := sorter.entries[i]
+	entry2 := sorter.entries[j]
+
+	switch sorter.key {
+	case "accessCount":
+		return entry1.accessCount < entry2.accessCount
+	case "closestStn":
+		return entry1.closestStn < entry2.closestStn
+	case "compatibility":
+		return entry1.compatibility < entry2.compatibility
+	case "distanceToStn":
+		return entry1.distanceToStn < entry2.distanceToStn
+	case "distanceToUser":
+		return entry1.distanceToUser < entry2.distanceToUser
+	case "name":
+		return entry1.name < entry2.name
+	default:
+		return entry1.score < entry2.score
+	}
+}
+
+func (sorter recordSorter) Swap(i, j int) {
+	sorter.entries[i], sorter.entries[j] = sorter.entries[j], sorter.entries[i]
 }

util.go

@@ -26,7 +26,6 @@ import (
 	"github.com/kellydunn/golang-geo"
 	"log"
 	"math"
-	"sort"
 	"strconv"
 )
 
@@ -97,7 +96,6 @@ func findRecords(entries records, features featureMap, minScore float64) records
 		foundEntries = append(foundEntries, entry)
 	})
 
-	sort.Sort(foundEntries)
 	return foundEntries
 }