-
Notifications
You must be signed in to change notification settings - Fork 16
/
order.json
201 lines (201 loc) · 5.23 KB
/
order.json
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
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
{
"id": "order",
"summary": "Get the order of array elements",
"description": "Computes the ranked (sorted) element positions in the original list (i.e., a permutation), either in ascending or descending order. The process ``rearrange()`` allows sorting the data based on the computed permutation.\n\n**Remarks:**\n\n* The positions in the result are zero-based.\n* The ordering of ties is implementation-dependent.\n* Temporal strings can *not* be compared based on their string representation due to the time zone/time-offset representations.",
"categories": [
"arrays",
"sorting"
],
"parameters": [
{
"name": "data",
"description": "An array to compute the order for.",
"schema": {
"type": "array",
"items": {
"anyOf": [
{
"type": "number"
},
{
"type": "null"
},
{
"type": "string",
"format": "date-time",
"subtype": "date-time"
},
{
"type": "string",
"format": "date",
"subtype": "date"
}
]
}
}
},
{
"name": "asc",
"description": "The default sort order is ascending, with smallest values first. To sort in reverse (descending) order, set this parameter to `false`.",
"schema": {
"type": "boolean"
},
"default": true,
"optional": true
},
{
"name": "nodata",
"description": "Controls the handling of no-data values (`null`). By default, they are removed. If set to `true`, missing values in the data are put last; if set to `false`, they are put first.",
"schema": {
"type": [
"boolean",
"null"
]
},
"default": null,
"optional": true
}
],
"returns": {
"description": "The computed permutation.",
"schema": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0
}
}
},
"examples": [
{
"arguments": {
"data": [
6,
-1,
2,
null,
7,
4,
null,
8,
3,
9,
9
]
},
"returns": [
1,
2,
8,
5,
0,
4,
7,
9,
10
]
},
{
"arguments": {
"data": [
6,
-1,
2,
null,
7,
4,
null,
8,
3,
9,
9
],
"nodata": true
},
"returns": [
1,
2,
8,
5,
0,
4,
7,
9,
10,
3,
6
]
},
{
"arguments": {
"data": [
6,
-1,
2,
null,
7,
4,
null,
8,
3,
9,
9
],
"asc": false,
"nodata": true
},
"returns": [
9,
10,
7,
4,
0,
5,
8,
2,
1,
3,
6
]
},
{
"arguments": {
"data": [
6,
-1,
2,
null,
7,
4,
null,
8,
3,
9,
9
],
"asc": false,
"nodata": false
},
"returns": [
3,
6,
9,
10,
7,
4,
0,
5,
8,
2,
1
]
}
],
"links": [
{
"rel": "about",
"href": "http://mathworld.wolfram.com/Permutation.html",
"title": "Permutation explained by Wolfram MathWorld"
}
]
}