-
Notifications
You must be signed in to change notification settings - Fork 0
/
indexes.go
137 lines (109 loc) · 2.97 KB
/
indexes.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
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
// Copyright 2021 FerretDB 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 metadata
import (
"errors"
"slices"
"github.com/zaporter/go-update-mongo/internal/ferret/types"
"github.com/zaporter/go-update-mongo/internal/ferret/util/iterator"
"github.com/zaporter/go-update-mongo/internal/ferret/util/lazyerrors"
"github.com/zaporter/go-update-mongo/internal/ferret/util/must"
)
// Indexes represents information about all indexes in a collection.
type Indexes []IndexInfo
// IndexInfo represents information about a single index.
type IndexInfo struct {
Name string
Index string
Key []IndexKeyPair
Unique bool
}
// IndexKeyPair consists of a field name and a sort order that are part of the index.
type IndexKeyPair struct {
Field string
Descending bool
}
// deepCopy returns a deep copy.
func (indexes Indexes) deepCopy() Indexes {
res := make(Indexes, len(indexes))
for i, index := range indexes {
res[i] = IndexInfo{
Name: index.Name,
Index: index.Index,
Key: slices.Clone(index.Key),
Unique: index.Unique,
}
}
return res
}
// marshal returns [*types.Array] for indexes.
func (indexes Indexes) marshal() *types.Array {
res := types.MakeArray(len(indexes))
for _, index := range indexes {
key := types.MakeDocument(len(index.Key))
for _, pair := range index.Key {
order := int32(1)
if pair.Descending {
order = int32(-1)
}
key.Set(pair.Field, order)
}
res.Append(must.NotFail(types.NewDocument(
"name", index.Name,
"index", index.Index,
"key", key,
"unique", index.Unique,
)))
}
return res
}
func (s *Indexes) unmarshal(a *types.Array) error {
res := make([]IndexInfo, a.Len())
iter := a.Iterator()
defer iter.Close()
for {
i, v, err := iter.Next()
if errors.Is(err, iterator.ErrIteratorDone) {
break
}
if err != nil {
return lazyerrors.Error(err)
}
index := v.(*types.Document)
keyDoc := must.NotFail(index.Get("key")).(*types.Document)
fields := keyDoc.Keys()
orders := keyDoc.Values()
key := make([]IndexKeyPair, keyDoc.Len())
for j, f := range fields {
descending := false
if orders[j].(int32) == -1 {
descending = true
}
key[j] = IndexKeyPair{
Field: f,
Descending: descending,
}
}
v, _ = index.Get("unique")
unique, _ := v.(bool)
res[i] = IndexInfo{
Name: must.NotFail(index.Get("name")).(string),
Index: must.NotFail(index.Get("index")).(string),
Key: key,
Unique: unique,
}
}
*s = res
return nil
}