forked from dgraph-io/dgraph
-
Notifications
You must be signed in to change notification settings - Fork 0
/
sort.go
89 lines (79 loc) · 2.33 KB
/
sort.go
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
/*
* Copyright 2016 Dgraph Labs, Inc.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package types
import (
"sort"
"time"
"github.com/dgraph-io/dgraph/task"
"github.com/dgraph-io/dgraph/x"
)
type sortBase struct {
values []Val
ul *task.List
}
// Len returns size of vector.
func (s sortBase) Len() int { return len(s.values) }
// Swap swaps two elements.
func (s sortBase) Swap(i, j int) {
s.values[i], s.values[j] = s.values[j], s.values[i]
data := s.ul.Uids
data[i], data[j] = data[j], data[i]
}
type byValue struct{ sortBase }
// Less compares two elements
func (s byValue) Less(i, j int) bool {
switch s.values[i].Tid {
case DateTimeID:
return s.values[i].Value.(time.Time).Before(s.values[j].Value.(time.Time))
case DateID:
return s.values[i].Value.(time.Time).Before(s.values[j].Value.(time.Time))
case Int32ID:
return (s.values[i].Value.(int32)) < (s.values[j].Value.(int32))
case FloatID:
return (s.values[i].Value.(float64)) < (s.values[j].Value.(float64))
case StringID:
return (s.values[i].Value.(string)) < (s.values[j].Value.(string))
}
return false
}
// Sort sorts the given array in-place.
func Sort(sID TypeID, v []Val, ul *task.List, desc bool) error {
var toBeSorted sort.Interface
b := sortBase{v, ul}
toBeSorted = byValue{b}
if desc {
toBeSorted = sort.Reverse(toBeSorted)
}
sort.Sort(toBeSorted)
return nil
}
// Less returns true if a is strictly less than b.
func Less(a, b Val) bool {
switch a.Tid {
case DateID:
return a.Value.(time.Time).Before(b.Value.(time.Time))
case DateTimeID:
return a.Value.(time.Time).Before(b.Value.(time.Time))
case Int32ID:
return (a.Value.(int32)) < (b.Value.(int32))
case FloatID:
return (a.Value.(float64)) < (b.Value.(float64))
case StringID:
return (a.Value.(string)) < (b.Value.(string))
}
x.Fatalf("Unexpected scalar: %v", a.Tid)
return false
}