aboutsummaryrefslogtreecommitdiff
path: root/src/r.bqn
blob: bacec9aa4a6b81b9a3bdfb8eb1de8440e3375f80 (plain)
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
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
# BQN runtime. Requires:
# IsArray Type Log  !+-×÷⋆⌊=≤≢⥊⊑↕⌜`

  {𝕨((𝕨𝔽𝕩)𝕘){𝔽}𝕩}     # LIMITED to number left operand result
  {𝕨((1{𝔽}𝕨)-0)𝔽𝔾 𝕩}
  {𝕩}
  {𝕩}{𝕨}
˜  {𝕩𝔽𝕨𝕩}
  {𝔽𝕨𝔾𝕩}
  {(𝔾𝕨)𝔽𝔾𝕩}
  {(𝔽𝕨𝕩)𝔾𝕩}
  {(𝕨𝕩)𝔽𝔾𝕩}
  {𝕨((𝕨𝔾𝕩)⊑⊢𝕗){𝔽}𝕩}   # LIMITED to boolean right operand result

IntIsArray=,0
NatIsArray0≤×⌊=,0

# LIMITED to numeric arguments for scalar cases
<  {⟨⟩𝕩}  (1-≤˜)
>             (1-≤)
           (>⊑{𝕨𝕩})
  --     (<⊑{𝕨𝕩})
  IsArray⟨⟩‿   # LIMITED to monadic case
  (0<=)10⊑≢  # LIMITED to monadic case

_fold{
  ! 1==𝕩
  lv𝕩  F𝔽
  r𝕨 (0<l){𝕩Identity f}{ll-1l𝕩} 𝕩
  {r(𝕩v)F r}(l-1)-l
  r
}
´  _fold

ToArray  <(1-IsArray)
Cell{(𝕨+⊑𝕩˜)(𝕩)-𝕨}

  {k𝕨k𝕨-k𝕩˜k+≠𝕩}  # LIMITED to two vector arguments

_eachd{
  _d{ # Equal ranks
    p𝕨
    ! 1(p=⊑(𝕩))×´↕=𝕨
    p ((𝕨)𝔽⊑(𝕩))1×´p
  }
  _e{ # 𝕨 has smaller or equal rank
    p𝕨  k=𝕨  q𝕩
    ! 1(p=⊑q)×´k
    l1(q˜k+)×´(=𝕩)-k
    a𝕨  b𝕩
    q⥊⥊(a) (a𝔽l×+⊑b˜) l
  }
  ==>=𝔽_e𝔽˜_e˜⟩⋄𝔽_d
}

_perv{ # Pervasion
  R𝔽{𝕨𝔽_perv𝕩}
  +IsArray𝔽R(>IsArray{𝕨{𝕗R𝕩}𝕩}{𝕩{𝕩R𝕗}𝕨})R _eachd
}

Cmp0  ˜-≤
Cmp1  (0<1×´)1, IsArray(1-2×≤){𝕨Cmp1𝕩}(0⊑⥊)
Cmp  +IsArray
  Cmp0
  IsArrayCmp1,-Cmp1˜
  {
    lc𝕨CmpLen𝕩
    cc  ((𝕨))Cmp((𝕩)) _getCellCmp´ lc
    Cc˜0
  }

_grade_{
  ! 1≤=𝕩
  l𝕩
  m1×´1 Cell 𝕩
  d𝕩
  # Counting sort for small-range ints
  blbu0r1-{((bu´𝕩)-bl´𝕩)2×l}𝕩((m=1)×32<l)0(1×´Int)d
  rGroupLenGroupOrd (𝕘-bl,bu-)  𝔽{𝕩
    # Merge sort
    GT(m 𝔽(d) _getCellCmp 0)>0˜
    Bll
    (l){
      i-d𝕨  jeiej0
      e3  GGT((m×(1-m=1)𝕩))  cG,0,1,2
      s(8d)+,{(𝕩-1){𝕩e2jii𝕩}(1-G)(1-e)𝕩}
      N{id+𝕨ejB d+eiB jd+𝕩eljS eii R j}
      R{𝕨ec𝕩}{e+2×ei=i1+𝕨𝕨}{e+ej=j1+𝕩𝕩}N
      {(i R j)𝕩}𝕩𝕩
    }´(2ni-1+⊢)ni2 Log l+l=0
  }𝕩
}

Indices{
  ! 1==𝕩
  l𝕩
  {
    ! 1×´Nat𝕩
    kl-1
    N  ((⊢+-×0=𝕩˜)`k-l)˜k-⊢  # Next nonzero
    E  (+`𝕩)
    eiE iN 0
    {{eiE iN𝕩+1i}(𝕩=ei)i}↕E k
  }(0<l)𝕩
}

Transpose{
  l𝕩  m1×´c1 Cell 𝕩
  (c⥊↕m)(+(m×)(𝕩)˜)l
}(0<=)

SelSub{
  ! IsArray 𝕨
  ! 1×´⥊Int 𝕨
  l𝕩
  ! 1×´ ((-l)≤×l>) 𝕨
  ((⊢+l×0>⊢)𝕨)(1==𝕩){
    c1×´s1 Cell 𝕩
    𝕨((𝕩)˜c×+)s⥊↕c
  }{
    𝕩𝕨
  }𝕩
}

_under_{
  il1×´s𝕩
  v𝕨𝔽𝔾𝕩
  gCmp0 _grade_ 0 gi⥊𝔾si
  P(g)(g)gi˜,l
  eP j0
  s{e=𝕩}(𝕩),{𝕩r(jg)veP j1+jr}i
}

¨  {(𝔽)(𝔽_eachd)ToArray}

match{(0𝕨)(1𝕨)𝕩}´
  =IsArray, 0
  IsArray, =
  ==      , 0
  1×´=¨  , 0
  {1×´𝕨Match¨𝕩}

DepthIsArray0{1+0(⊣-≤×-)´Depth𝕩}

  Depth           Match

Merge{
  c0⊑⥊𝕩
  ! 1×´(c≡≢)𝕩
  𝕩Deshape˜⌜c⥊↕1×´c
}(0<≠)IsArray

+  + _perv
-  - _perv
×  (0(<->)  ×) _perv
÷  ÷ _perv
   _perv
  (÷2)    (÷˜)
|  (××      {𝕩-𝕨×⌊𝕩÷𝕨}) _perv
  (        {(𝕨>𝕩)𝕨𝕩}) _perv
  (--    {(𝕨<𝕩)𝕨𝕩}) _perv
¬  1+-
             ×
             (+-×)
<  {⟨⟩𝕩}  ((1-≤˜) _perv)
>  Merge     ((1-≤) _perv)
           ((1-=) _perv)
=  =         (= _perv)
  !0       (˜_perv)
  !0       ( _perv)
identity  (0!0) {(0𝕨){𝕗=𝕩}𝕩(1𝕨)}´ +0,-0,×1,÷1,1,1,1,0,|0,,¯∞,<0,1,=1,1,>0,0

DeshapeIsArray{𝕩}
Reshape{
  ! 1≥=𝕨
  𝕨Deshape 𝕨
  ! ´Nat𝕨
  l×´𝕨
  n×´𝕩
  𝕨{
    𝕩(0<n)Type(){𝕨n|𝕩}l
  }(ln)𝕩
}ToArray
  Deshape         

Range{
  I{!Nat𝕩𝕩}
  M{!1==𝕩(<⟨⟩)⌜´I𝕩}
  IsArrayIM 𝕩
}

                 (¬Match)


Pair  {𝕩}  {𝕨,𝕩}

  >Pair
_ranks  {21,0((⊣-1+|)˜≠⊑¨<)𝔽}
_depthOp_{
  neg0>n𝕨𝔾_ranks𝕩  F𝔽
  _d{
    R(𝕗+neg)_d
    𝕨(×2+´2 Reshape (neg𝕗0)(0𝕗)≥Pair)(R¨R𝕩(𝕨R⊢)F)𝕩
  }
  𝕨 n _d 𝕩
}
  _depthOp_
_rankOp_{
  k𝕨(Pair= (0≤⊢)-,0⌈-¨ 𝔾_ranks)𝕩
  Enc{
    f(𝕩)𝕨
    c×´s𝕨Cell𝕩
    f⥊⊑(𝕩)((s⥊↕c)+c×⊢)↕×´f
  }
  Enc(>0+≥=)<⊢,Enc,<
  > ((0k)Enc𝕨) 𝔽¨ ((1-˜)k)Enc𝕩
}
  _rankOp_
˘  {𝔽¯1}
_insert{
  ! 1≤=𝕩
  𝕨 𝔽´ <˘𝕩
}
˝  _insert


_onAxes_{
  F𝔽
  (𝔾<≡){ # One axis
    ! 1≤=𝕩
    𝕨F𝕩
  }{ # Multiple axes
    ! 1≥=𝕨
    ! 𝕨≠≢𝕩
    l𝕨  W(𝕨)
    0{(W𝕨)F(1+𝕨)𝕊˘(𝕨<l-1)𝕩}(0<l)𝕩
  }
}

SelectToArray(SelSub _onAxes_ 1)
  0Select        Select

JoinTo(1≠=){
  s𝕨Pair𝕩
  a1´ks
  ! ´1a-k
  c(k¬a)+(a-1)¨s
  ! ´c
  l+´(a=k)1(0⊑⊢)¨s
  (l0c)𝕨𝕩
}

Take{
  T{
    ! Int 𝕨
    l𝕩  n𝕨<0  elr|𝕨  sr  m1
    i  𝕩{sc1 Cell 𝕨𝕩(×+)m×´c}(1≠=𝕩) (l-e)+n e
    s𝕩{(𝕩)n,˜(0⊑⥊Type𝕗)m×r-e}(l<r) (𝕩)i
  }
  𝕨 T _onAxes_ 0 ((10𝕨-≠⊢)≢⥊⥊) 𝕩
}
Prefixes  {!1≤=𝕩  Take𝕩1+≠𝕩}
  Prefixes        Take
Drop{
  s(𝕨)(⊣↑⊢∾˜·10⌈-)𝕩
  ((sׯ1𝕨>0)+(-s)s𝕨)𝕩
}
Suffixes  {!1≤=𝕩  Drop𝕩1+≠𝕩}
  Suffixes        Drop

Windows{
  ! IsArray 𝕩
  ! 1≥=𝕨
  ! 𝕨≠≢𝕩
  ! ´Nat𝕨
  s(𝕨)↑≢𝕩
  ! ´𝕨1+s
  𝕨{((𝕨↓≢𝕩)≢⥊>)<𝕩¨s(¬+Range⊢)𝕨}(0<≠𝕨)𝕩
}

Reverse  {!1≤=𝕩  (-↕¬≠𝕩)𝕩}
Rotate  {!Int𝕨  l𝕩(l|𝕨+↕l)𝕩} _onAxes_ 0

Rep  Indices
Replicate  {0<=𝕨}{𝕨Rep𝕩}{!𝕨=𝕩𝕨Rep𝕩} _onAxes_ (1-0=≠)

  Range           Windows
  Reverse         Rotate
/  Indices         Replicate

Join(1≠=)´1≠=,1{
  # List of lists
  ij¯1e⟨⟩⋄a𝕩
  {{ea˜i𝕩j¯1}(i)𝕩(jj+1)e}/≠𝕩
}{
  # Multidimensional
  C(<⟨⟩)⌜´  # Cartesian array product
  ! IsArray 𝕩
  s𝕩
  d0⊑⥊s
  ! ´d=≠s
  ! d≥=𝕩
  l(𝕩){(𝕩a Pick1˜(j=𝕩)×)𝕨}¨jr=a𝕩
  ! (rs)≡C l
  iC{p+´⌜𝕩(0⊑⌽p)-𝕩/¯1p}l
  >i<¨l/𝕩
}(0<≠)

_group{
  !1==𝕩!∧´Int𝕩!∧´¯1𝕩
  d(lGroupLen𝕩)GroupOrd𝕩
  i0(𝔽{𝕩(ii+1)id})l
}
GroupInds{
  ! IsArray 𝕩
  G_group
  (1<≡)G((<<⟨⟩)⌜⌜´G)𝕩
}
GroupGen{
  ! IsArray 𝕩
  m1<≡𝕨
  lm{!1==𝕩𝕩}𝕨
  ! l≠≢𝕩
  ! ´l=l↑≢𝕩
  𝕨m(𝕩_group){
    (𝕩˜×´l(l)Cell𝕩) +⌜⌜´ (⌽×`1∾⌽1l) × _group⌜𝕨
  }𝕩
}

  Join            JoinTo
  GroupInds       GroupGen

Pick1{
  ! 1==𝕨
  ! 𝕨=s𝕩
  ! ´Int𝕨
  ! ´𝕨(-∧<)s
  𝕨𝕨+s×𝕨<0
  (𝕩)˜0(𝕨+⊑s×⊢)´-↕¬≠𝕨
}
Pickd(´IsArray)Pick1{Pickd𝕩𝕨}
PickIsArrayPickd

# Sorting
CmpLen  {
  e𝕨-˜(´0=)𝕩
  𝕨(e=0)0,e⟩‿{
    c×𝕨-𝕩
    r𝕨𝕩
    l𝕨{
      i+´`𝕨=𝕩
      m×´𝕨i
      {c×-´𝕩mm×⌊´𝕩}(¨𝕨𝕩)(r>)i
      m
    }(((-1+↕r)+≠){𝕩𝕨})𝕩
    l,c
  }𝕩
}
_getCellCmp  {
  Ci𝔽l𝕨c𝕩
  Cc{
    a𝕨b𝕩
    S(l=){S(1+𝕩)(0=)a Ci(𝕩+)b}c
    S 0
  }
  (1l)(𝕩(0=)𝔽)Cc
}

_binSearch  {
  B  𝔽
  {
    R{𝕨{aB m𝕩+h𝕨÷2(h+a×2|𝕨)R a𝕩m}(>1)𝕩}
    1+(𝕩+1)R ¯1
  }(0<)
}
_bins{
  c1-˜=𝕨
  ! 0c
  ! c≤=𝕩
  lw×´sw1 Cell 𝕨
  cwlw 𝔽((𝕨)) _getCellCmp 0
  ! 0<1,´0˜·cw(lw+)lw×↕-1𝕨
  cxc-˜=𝕩
  sxcx Cell 𝕩  lcsw CmpLen sx
  cc  ((𝕨))𝔽((𝕩)) _getCellCmp´ lc
  B(×´sw)×Cc≤0˜
  (𝕨){B𝕩 _binSearch 𝕨} (×´sx) × (↕×´)(𝕩)cx
}

  Cmp  _grade_ 0  (Cmp  _bins)
  Cmp˜ _grade_ 1  (Cmp˜ _bins)

# Searching
_search{ # 0 for ∊˜, 1 for ⊐
  ind  𝕗
  red  𝕗¬∧˝,+˝`
  {
    c1-˜=𝕨
    ! 0c
    𝕨 (8<≠)
      (0<≠𝕨)0c, Red≢((0<c),<c)
      { g⌽⍒𝕨  ig˜01-˜(g𝕨)𝕩  (𝕨)(⊣+i-×)ind(i𝕨)c𝕩 }
     ToArray𝕩
  }
}
UniqueMask{
  ! 1≤=𝕩
  g𝕩
  (1¨GroupOrd g)0<1,-1((g⊏<˘(1<=)𝕩))↕≠𝕩
}
Find{
  r=𝕨
  ! r≤=𝕩
  𝕨 r (𝕨) r 𝕩
}

  !0             (1 _search)
  UniqueMask      (0 _search˜)
  /             Find

ReorderAxes{
  𝕩<(0=≡)𝕩
  ! 1≥=𝕨
  𝕨𝕨
  ! 𝕨≠≢𝕩
  ! ´Nat𝕨
  r(=𝕩)-+´¬∊𝕨
  ! ´𝕨<r
  𝕨𝕨𝕨(¬˜/⊢)r
  (𝕨⊏Pick𝕩˜)↕⌊´⌜𝕨⊔≢𝕩
}
  Transpose       ReorderAxes

OccurrenceCount  ˜(⊢-⊏)
ProgressiveIndexOf  {𝕨(˘OccurrenceCount𝕨)𝕩}
  OccurrenceCount ProgressiveIndexOf

  (0⊑⥊)           Pick
  {𝕨((𝕨𝔽𝕩)𝕘){𝔽}𝕩}  # Same definition, new Pick

inverse  {((0𝕩)⊐<)  ((1𝕩)!0)˜}  (2˜2÷˜) 
  +, +(-˜)
  -, -
  ×, (÷˜)
  ÷, ÷
  , Log _perv
  , 2(˜)
  , (÷˜)
  , (-˜÷1-⊢)
  <, {!IsArray𝕩!0==𝕩𝕩}(!0)
  /, {!(⍋≡↕)𝕩𝕩}(!0)

  {Inverse 𝕗}

_repeat_{
  n𝕨𝔾𝕩
  lu0
  {!Int𝕩ll𝕩uu𝕩}0 n
  a𝕩_p{𝔽`a∾↕0+𝕩}
  pos(𝕨𝔽 )_p u
  neg(𝕨𝔽)_p-l
  (|⊑<0posneg˜)0 n
}
  _repeat_

  Deshape         Reshape
  {𝔽ToArray}
               
               
  _under_