-
Notifications
You must be signed in to change notification settings - Fork 6
/
_bp.pyx
1130 lines (897 loc) · 35.4 KB
/
_bp.pyx
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
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
# cython: boundscheck=False, wraparound=False, cdivision=True, linetrace=False
# ----------------------------------------------------------------------------
# Copyright (c) 2013--, BP development team.
#
# Distributed under the terms of the Modified BSD License.
#
# The full license is in the file LICENSE, distributed with this software.
# ----------------------------------------------------------------------------
### NOTE: some doctext strings are copied and pasted from manuscript
### http://www.dcc.uchile.cl/~gnavarro/ps/tcs16.2.pdf
from libc.math cimport ceil, log as ln, pow, log2
import time
#import numpy.testing as npt
import numpy as np
cimport numpy as np
cimport cython
from bp._binary_tree cimport * #bt_node_from_left, bt_left_child, bt_right_child
from bp._ba cimport *
np.import_array()
cdef extern from "limits.h":
int INT_MAX
DOUBLE = np.float64
SIZE = np.intp
BOOL = np.uint8
INT32 = np.int32
cdef inline int min(int a, int b) nogil:
if a > b:
return b
else:
return a
cdef inline int max(int a, int b) nogil:
if a > b:
return a
else:
return b
cdef class mM:
def __cinit__(self, BOOL_t[:] B, int B_size):
self.m_idx = 0
self.M_idx = 1
self.rmm(B, B_size)
cdef void rmm(self, BOOL_t[:] B, int B_size) nogil:
"""Construct the rmM tree based off of Navarro and Sadakane
http://www.dcc.uchile.cl/~gnavarro/ps/talg12.pdf
"""
cdef int i, j, lvl, pos # for loop support
cdef int offset # tip offset in binary tree for a given parenthesis
cdef int lower_limit # the lower limit of the bucket a parenthesis is in
cdef int upper_limit # the upper limit of the bucket a parenthesis is in
cdef int min_ = 0 # m, absolute minimum for a blokc
cdef int max_ = 0 # M, absolute maximum for a block
cdef int excess = 0 # e, absolute excess
cdef int vbar
cdef int r = 0
# build tip info
self.b = <int>ceil(ln(<double> B_size) * ln(ln(<double> B_size)))
# determine the number of nodes and height of the binary tree
self.n_tip = <int>ceil(B_size / <double> self.b)
self.height = <int>ceil(log2(self.n_tip))
self.n_internal = <int>(pow(2, self.height)) - 1
self.n_total = self.n_tip + self.n_internal
with gil:
# creation of a memoryview directly or via numpy requires the GIL:
# http://stackoverflow.com/a/22238012
self.mM = np.zeros((self.n_total, 2), dtype=SIZE)
self.r = np.zeros(self.n_total, dtype=SIZE)
# annoying, cannot do step in range if step is not known at runtime
# see https://github.com/cython/cython/pull/520
# for i in range(0, B_size, b):
# as a result, doing a custom range using a while loop
# compute for tips of rmM tree
i = 0
while i < B_size:
offset = i // self.b
lower_limit = i
upper_limit = min(i + self.b, B_size)
min_ = INT_MAX
max_ = 0
self.r[offset + self.n_internal] = r
for j in range(lower_limit, upper_limit):
# G function, a +-1 method where if B[j] == 1 we +1, and if
# B[j] == 0 we -1
excess += -1 + (2 * B[j])
r += B[j]
if excess < min_:
min_ = excess
if excess > max_:
max_ = excess
# at the left bound of the bucket
self.mM[offset + self.n_internal, self.m_idx] = min_
self.mM[offset + self.n_internal, self.M_idx] = max_
i += self.b
# compute for internal nodes of rmM tree in reverse level order starting
# at the level above the tips
for lvl in range(self.height - 1, -1, -1):
num_curr_nodes = <int>pow(2, lvl)
# for each node in the level
for pos in range(num_curr_nodes):
# obtain the node, and the index to its children
node = bt_node_from_left(pos, lvl)
lchild = bt_left_child(node)
rchild = bt_right_child(node)
if lchild >= self.n_total:
continue
elif rchild >= self.n_total:
self.mM[node, self.m_idx] = self.mM[lchild, self.m_idx]
self.mM[node, self.M_idx] = self.mM[lchild, self.M_idx]
else:
self.mM[node, self.m_idx] = min(self.mM[lchild, self.m_idx],
self.mM[rchild, self.m_idx])
self.mM[node, self.M_idx] = max(self.mM[lchild, self.M_idx],
self.mM[rchild, self.M_idx])
self.r[node] = self.r[lchild]
@cython.final
cdef class BP:
"""A balanced parentheses succinct data structure tree representation
The basis for this implementation is the data structure described by
Cordova and Navarro [1]. In some instances, some docstring text was copied
verbatim from the manuscript. This does not implement the bucket-based
trees, although that would be a very interesting next step.
A node in this data structure is represented by 2 bits, an open parenthesis
and a close parenthesis. The implementation uses a numpy uint8 type where
an open parenthesis is a 1 and a close is a 0. In general, operations on
this tree are best suited for passing in the opening parenthesis index, so
for instance, if you'd like to use BP.isleaf to determine if a node is a
leaf, the operation is defined only for using the opening parenthesis. At
this time, there is some ambiguity over what methods can handle a closing
parenthesis.
Node attributes, such as names, are stored external to this data structure.
The motivator for this data structure is pure performance both in space and
time. As such, there is minimal sanity checking. It is advised to use this
structure with care, and ideally within a framework which can assure
sanity.
References
----------
[1] http://www.dcc.uchile.cl/~gnavarro/ps/tcs16.2.pdf
"""
def __cinit__(self, np.ndarray[BOOL_t, ndim=1] B,
np.ndarray[DOUBLE_t, ndim=1] lengths=None,
np.ndarray[object, ndim=1] names=None,
np.ndarray[INT32_t, ndim=1] edges=None):
cdef SIZE_t i
cdef SIZE_t size
cdef SIZE_t[:] _e_index
cdef SIZE_t[:] _k_index_0
cdef SIZE_t[:] _k_index_1
cdef SIZE_t[:] _r_index_0
cdef SIZE_t[:] _r_index_1
cdef np.ndarray[object, ndim=1] _names
cdef np.ndarray[DOUBLE_t, ndim=1] _lengths
cdef np.ndarray[INT32_t, ndim=1] _edges
cdef np.ndarray[SIZE_t, ndim=1] _edge_lookup
# the tree is only valid if it is balanaced
assert B.sum() == (float(B.size) / 2)
self.B = B
self._b_ptr = &B[0]
self.size = B.size
self._rmm = mM(B, B.size)
if names is not None:
self._names = names
else:
self._names = np.full(self.B.size, None, dtype=object)
if lengths is not None:
self._lengths = lengths
else:
self._lengths = np.zeros(self.B.size, dtype=DOUBLE)
if edges is not None:
self._set_edges(edges)
else:
self._edges = np.full(self.B.size, 0, dtype=INT32)
self._edge_lookup = None
# precursor for select index cache
_r_index_0 = np.cumsum((1 - B), dtype=SIZE)
_r_index_1 = np.cumsum(B, dtype=SIZE)
# construct a select index. These operations are performed frequently,
# and easy to cache at a relatively minor memory expense. It cannot be
# assumed that open and close will be same length so can't stack
#TODO: leverage rmmtree, and calculate select on the fly
_k_index_0 = np.unique(_r_index_0,
return_index=True)[1].astype(SIZE)
self._k_index_0 = _k_index_0
_k_index_1 = np.unique(_r_index_1,
return_index=True)[1].astype(SIZE)
self._k_index_1 = _k_index_1
# construct an excess index. These operations are performed a lot, and
# similarly can to rank and select, can be cached at a minimal expense.
#TODO: leverage rmm tree, and calculate excess on the fly
_e_index = np.empty(B.size, dtype=SIZE)
for i in range(B.size):
_e_index[i] = self._excess(i)
self._e_index = _e_index
def write(self, object fname):
np.savez_compressed(fname, names=self._names, lengths=self._lengths,
B=self.B)
@staticmethod
def read(object fname):
data = np.load(fname)
bp = BP(data['B'], names=data['names'], lengths=data['lengths'])
return bp
def set_names(self, np.ndarray[object, ndim=1] names):
self._names = names
def set_lengths(self, np.ndarray[DOUBLE_t, ndim=1] lengths):
self._lengths = lengths
cdef void _set_edges(self, np.ndarray[INT32_t, ndim=1] edges):
cdef:
int i, n
INT32_t edge
np.ndarray[SIZE_t, ndim=1] _edge_lookup
np.ndarray[BOOL_t, ndim=1] b
b = self.B
n = b.size
_edge_lookup = np.full(n, 0, dtype=SIZE)
for i in range(n):
if b[i] == 1:
edge = edges[i]
_edge_lookup[edge] = i
self._edge_lookup = _edge_lookup
self._edges = edges
def set_edges(self, np.ndarray[INT32_t, ndim=1] edges):
self._set_edges(edges)
cpdef inline unicode name(self, SIZE_t i):
return self._names[i]
cpdef inline DOUBLE_t length(self, SIZE_t i):
return self._lengths[i]
cpdef inline INT32_t edge(self, SIZE_t i):
return self._edges[i]
cpdef SIZE_t edge_from_number(self, INT32_t n):
return self._edge_lookup[n]
cdef inline SIZE_t rank(self, SIZE_t t, SIZE_t i) nogil:
"""Determine the rank order of the ith bit t
Rank is the order of the ith bit observed, from left to right. For
t=1, this is a preorder traversal of the tree.
Parameters
----------
t : SIZE_t
The bit value, either 0 or 1 where 0 is a closing parenthesis and
1 is an opening.
i : SIZE_T
The position to evaluate
Returns
-------
SIZE_t
The rank order of the position.
"""
cdef int k
cdef int r = 0
cdef int lower_bound
cdef int upper_bound
cdef int j
cdef int node
#TODO: add method to mM for determining block from i
k = i // self._rmm.b
lower_bound = k * self._rmm.b
# upper_bound is block boundary or end of tree
upper_bound = min((k + 1) * self._rmm.b, self.size)
upper_bound = min(upper_bound, i + 1)
# collect rank from within the block
for j in range(lower_bound, upper_bound):
r += self._b_ptr[j]
# collect the rank at the left end of the block
node = bt_node_from_left(k, self._rmm.height)
r += self._rmm.r[node]
# TODO: can this if statement be removed?
if t:
return r
else:
return (i - r) + 1
cdef inline SIZE_t select(self, SIZE_t t, SIZE_t k) nogil:
"""The position in B of the kth occurrence of the bit t."""
if t:
return self._k_index_1[k]
else:
return self._k_index_0[k]
cdef SIZE_t _excess(self, SIZE_t i) nogil:
"""Actually compute excess"""
if i < 0:
return 0 # wasn't stated as needed but appears so given testing
return (2 * self.rank(1, i) - i) - 1
cdef SIZE_t excess(self, SIZE_t i) nogil:
"""the number of opening minus closing parentheses in B[1, i]"""
# same as: self.rank(1, i) - self.rank(0, i)
return self._e_index[i]
cpdef inline SIZE_t close(self, SIZE_t i) nogil:
"""The position of the closing parenthesis that matches B[i]"""
if not self._b_ptr[i]:
# identity: the close of a closed parenthesis is itself
return i
return self.fwdsearch(i, -1)
cdef inline SIZE_t open(self, SIZE_t i) nogil:
"""The position of the opening parenthesis that matches B[i]"""
if self._b_ptr[i] or i <= 0:
# identity: the open of an open parenthesis is itself
# the open of 0 is open. A negative index cannot be open, so just return
return i
return self.bwdsearch(i, 0) + 1
cdef inline SIZE_t enclose(self, SIZE_t i) nogil:
"""The opening parenthesis of the smallest matching pair that contains position i"""
if self._b_ptr[i]:
return self.bwdsearch(i, -2) + 1
else:
return self.bwdsearch(i - 1, -2) + 1
cpdef SIZE_t rmq(self, SIZE_t i, SIZE_t j) nogil:
"""The leftmost minimum excess in i -> j"""
cdef:
SIZE_t k, min_k
SIZE_t min_v, obs_v
min_k = i
min_v = self.excess(i) # a value larger than what will be tested
for k in range(i, j + 1):
obs_v = self.excess(k)
if obs_v < min_v:
min_k = k
min_v = obs_v
return min_k
cpdef SIZE_t rMq(self, SIZE_t i, SIZE_t j) nogil:
"""The leftmost maximmum excess in i -> j"""
cdef:
SIZE_t k, max_k
SIZE_t max_v, obs_v
max_k = i
max_v = self.excess(i) # a value larger than what will be tested
for k in range(i, j + 1):
obs_v = self.excess(k)
if obs_v > max_v:
max_k = k
max_v = obs_v
return max_k
def __len__(self):
"""The number of nodes in the tree"""
return self.size / 2
def __repr__(self):
"""Returns summary of the tree
Returns
-------
str
A summary of this node and all descendants
Notes
-----
This method returns the name of the node and a count of tips and the
number of internal nodes in the tree. This docstring and repr was
adapted from skbio.TreeNode
"""
cdef total_nodes = len(self)
cdef tip_count = self.ntips()
return "<BP, name: %s, internal node count: %d, tips count: %d>" % \
(self.name(0), total_nodes - tip_count, tip_count)
def __reduce__(self):
return (BP, (self.B, self._lengths, self._names))
cpdef SIZE_t depth(self, SIZE_t i) nogil:
"""The depth of node i"""
return self._e_index[i]
cpdef SIZE_t root(self) nogil:
"""The root of the tree"""
return 0
cpdef SIZE_t parent(self, SIZE_t i) nogil:
"""The parent of node i"""
# TODO: only make operations like this defined on the open parentheses.
# this monkeying with checking open/close sucks.
if i == self.root() or i == (self.size - 1):
return -1
else:
return self.enclose(i)
cpdef BOOL_t isleaf(self, SIZE_t i) nogil:
"""Whether the node is a leaf"""
return self._b_ptr[i] and (not self._b_ptr[i + 1])
cpdef SIZE_t fchild(self, SIZE_t i) nogil:
"""The first child of i (i.e., the left child)
fchild(i) = i + 1 (if i is not a leaf)
Returns 0 if the node is a leaf as the root cannot be a child by
definition.
"""
if self._b_ptr[i]:
if self.isleaf(i):
return 0
else:
return i + 1
else:
return self.fchild(self.open(i))
cpdef SIZE_t lchild(self, SIZE_t i) nogil:
"""The last child of i (i.e., the right child)
lchild(i) = open(close(i) − 1) (if i is not a leaf)
Returns 0 if the node is a leaf as the root cannot be a child by
definition.
"""
if self._b_ptr[i]:
if self.isleaf(i):
return 0
else:
return self.open(self.close(i) - 1)
else:
return self.lchild(self.open(i))
def mincount(self, SIZE_t i, SIZE_t j):
"""number of occurrences of the minimum in excess(i), excess(i + 1), . . . , excess(j)."""
excess, counts = np.unique([self.excess(k) for k in range(i, j + 1)], return_counts=True)
return counts[excess.argmin()]
def minselect(self, SIZE_t i, SIZE_t j, SIZE_t q):
"""position of the qth minimum in excess(i), excess(i + 1), . . . , excess(j)."""
counts = np.array([self.excess(k) for k in range(i, j + 1)])
index = counts == counts.min()
if index.sum() < q:
return None
else:
return i + index.nonzero()[0][q - 1]
cpdef SIZE_t nsibling(self, SIZE_t i) nogil:
"""The next sibling of i (i.e., the sibling to the right)
nsibling(i) = close(i) + 1 (if the result j holds B[j] = 0 then i has no next sibling)
Will return 0 if there is no sibling. This makes sense as the root
cannot have a sibling by definition
"""
cdef SIZE_t pos
if self._b_ptr[i]:
pos = self.close(i) + 1
else:
pos = self.nsibling(self.open(i))
if pos >= self.size:
return 0
elif self._b_ptr[pos]:
return pos
else:
return 0
cpdef SIZE_t psibling(self, SIZE_t i) nogil:
"""The previous sibling of i (i.e., the sibling to the left)
psibling(i) = open(i − 1) (if B[i − 1] = 1 then i has no previous sibling)
Will return 0 if there is no sibling. This makes sense as the root
cannot have a sibling by definition
"""
cdef SIZE_t pos
if self._b_ptr[i]:
if self._b_ptr[max(0, i - 1)]:
return 0
pos = self.open(i - 1)
else:
pos = self.psibling(self.open(i))
if pos < 0:
return 0
elif self._b_ptr[pos]:
return pos
else:
return 0
cpdef SIZE_t preorder(self, SIZE_t i) nogil:
"""Preorder rank of node i
Parameters
----------
i : int
The node index to assess the preorder order of.
Returns
-------
int
The nodes order of evaluation in a preorder traversal of the tree.
"""
if self._b_ptr[i]:
return self.rank(1, i)
else:
return self.preorder(self.open(i))
cpdef SIZE_t preorderselect(self, SIZE_t k) nogil:
"""The index of the node with preorder k
Parameters
----------
k : int
The preorder evaluation order to search for.
Returns
-------
int
The index position of the node in the tree.
"""
return self.select(1, k)
cpdef SIZE_t postorder(self, SIZE_t i) nogil:
"""Postorder rank of node i
Parameters
----------
i : int
The node index to assess the postorder order of.
Returns
-------
int
The nodes order of evaluation in a postorder traversal of the tree.
"""
if self._b_ptr[i]:
return self.rank(0, self.close(i))
else:
return self.rank(0, i)
cpdef SIZE_t postorderselect(self, SIZE_t k) nogil:
"""The index of the node with postorder k
Parameters
----------
k : int
The postorder evaluation order to search for.
Returns
-------
int
The index position of the node in the tree.
"""
return self.open(self.select(0, k))
cpdef BOOL_t isancestor(self, SIZE_t i, SIZE_t j) nogil:
"""Whether i is an ancestor of j
Parameters
----------
i : int
A node index
j : int
A node index
Note
----
False is returned if i == j. A node cannot be an ancestor of itself.
Returns
-------
bool
True if i is an ancestor of j, False otherwise.
"""
if i == j:
return False
if not self._b_ptr[i]:
i = self.open(i)
return i <= j < self.close(i)
cpdef SIZE_t subtree(self, SIZE_t i) nogil:
"""The number of nodes in the subtree of i
Parameters
----------
i : int
The node to evaluate
Returns
-------
int
The number of nodes in the subtree of i
"""
if not self._b_ptr[i]:
i = self.open(i)
return (self.close(i) - i + 1) / 2
cpdef SIZE_t levelancestor(self, SIZE_t i, SIZE_t d) nogil:
"""The ancestor j of i such that depth(j) = depth(i) − d
Parameters
----------
i : int
The node to evaluate
d : int
How many ancestors back to evaluate
Returns
-------
int
The node index of the ancestor to search for
"""
if d <= 0:
return -1
if not self._b_ptr[i]:
i = self.open(i)
return self.bwdsearch(i, -d - 1) + 1
cpdef SIZE_t levelnext(self, SIZE_t i) nogil:
"""The next node with the same depth
Parameters
----------
i : int
The node to evaluate
Returns
-------
int
The node index of the next node or -1 if there isn't one
"""
return self.fwdsearch(self.close(i), 1)
cpdef SIZE_t lca(self, SIZE_t i, SIZE_t j) nogil:
"""The lowest common ancestor of i and j
Parameters
----------
i : int
A node index to evaluate
j : int
A node index to evalute
Returns
-------
int
The index of the lowest common ancestor
"""
if self.isancestor(i, j):
return i
elif self.isancestor(j, i):
return j
else:
return self.parent(self.rmq(i, j) + 1)
cpdef SIZE_t deepestnode(self, SIZE_t i) nogil:
"""The index of the deepestnode which descends from i
Parameters
----------
i : int
The node to evaluate
Returns
-------
int
The index of the deepest node which descends from i
"""
return self.rMq(self.open(i), self.close(i))
cpdef SIZE_t height(self, SIZE_t i) nogil:
"""The height of node i with respect to its deepest descendent
Parameters
----------
i : int
The node to evaluate
Notes
-----
Height is in terms of number of edges, not in terms of branch length
Returns
-------
int
The number of edges between node i and its deepest node
"""
return self.excess(self.deepestnode(i)) - self.excess(self.open(i))
cpdef BP shear(self, set tips):
"""Remove all nodes from the tree except tips and ancestors of tips
Parameters
----------
tips : set of str
The set of tip names to retain
Returns
-------
BP
A new BP tree corresponding to only the described tips and their
ancestors.
"""
cdef:
SIZE_t i, n = len(tips)
SIZE_t p, t, count = 0
BIT_ARRAY* mask
BP new_bp
mask = bit_array_create(self.B.size)
bit_array_set_bit(mask, self.root())
bit_array_set_bit(mask, self.close(self.root()))
for i in range(self.B.size):
# isleaf is only defined on the open parenthesis
if self.isleaf(i):
if self.name(i) in tips: # gil is required for set operation
with nogil:
count += 1
bit_array_set_bit(mask, i)
bit_array_set_bit(mask, i + 1)
p = self.parent(i)
while p != 0 and bit_array_get_bit(mask, p) == 0:
bit_array_set_bit(mask, p)
bit_array_set_bit(mask, self.close(p))
p = self.parent(p)
if count == 0:
bit_array_free(mask)
raise ValueError("No requested tips found")
new_bp = self._mask_from_self(mask, self._lengths)
bit_array_free(mask)
return new_bp
cdef BP _mask_from_self(self, BIT_ARRAY* mask,
np.ndarray[DOUBLE_t, ndim=1] lengths):
cdef:
SIZE_t i, k, n, mask_sum
np.ndarray[BOOL_t, ndim=1] new_b
np.ndarray[object, ndim=1] new_names
np.ndarray[object, ndim=1] names = self._names
np.ndarray[DOUBLE_t, ndim=1] new_lengths
BOOL_t* new_b_ptr
DOUBLE_t* lengths_ptr
DOUBLE_t* new_lengths_ptr
n = bit_array_length(mask)
mask_sum = bit_array_num_bits_set(mask)
k = 0
lengths_ptr = &lengths[0]
new_b = np.empty(mask_sum, dtype=BOOL)
new_names = np.empty(mask_sum, dtype=object)
new_lengths = np.empty(mask_sum, dtype=DOUBLE)
new_b_ptr = &new_b[0]
new_lengths_ptr = &new_lengths[0]
for i in range(n):
if bit_array_get_bit(mask, i):
new_b_ptr[k] = self._b_ptr[i]
# since names is dtype=object, gil is required
new_names[k] = names[i]
new_lengths_ptr[k] = lengths_ptr[i]
k += 1
return BP(np.asarray(new_b), names=new_names, lengths=new_lengths)
cpdef BP collapse(self):
cdef:
SIZE_t i, n = self.B.sum()
SIZE_t current, first, last
np.ndarray[DOUBLE_t, ndim=1] new_lengths
BIT_ARRAY* mask
DOUBLE_t* new_lengths_ptr
BP new_bp
mask = bit_array_create(self.B.size)
bit_array_set_bit(mask, self.root())
bit_array_set_bit(mask, self.close(self.root()))
new_lengths = self._lengths.copy()
new_lengths_ptr = <DOUBLE_t*>new_lengths.data
with nogil:
for i in range(n):
current = self.preorderselect(i)
if self.isleaf(current):
bit_array_set_bit(mask, current)
bit_array_set_bit(mask, self.close(current))
else:
first = self.fchild(current)
last = self.lchild(current)
if first == last:
new_lengths_ptr[first] = new_lengths_ptr[first] + \
new_lengths_ptr[current]
else:
bit_array_set_bit(mask, current)
bit_array_set_bit(mask, self.close(current))
new_bp = self._mask_from_self(mask, new_lengths)
bit_array_free(mask)
return new_bp
cpdef inline SIZE_t ntips(self) nogil:
cdef:
SIZE_t i = 0
SIZE_t count = 0
SIZE_t n = self.size
while i < (n - 1):
if self._b_ptr[i] and not self._b_ptr[i+1]:
count += 1
i += 1
i += 1
return count
cdef int scan_block_forward(self, int i, int k, int b, int d) nogil:
"""Scan a block forward from i
Parameters
----------
bp : BP
The tree
i : int
The index position to start from in the tree
k : int
The block to explore
b : int
The block size
d : int
The depth to search for
Returns
-------
int
The index position of the result. -1 is returned if a result is not
found.
"""
cdef int lower_bound
cdef int upper_bound
cdef int j
# lower_bound is block boundary or right of i
lower_bound = max(k, 0) * b
lower_bound = max(i + 1, lower_bound)
# upper_bound is block boundary or end of tree
upper_bound = min((k + 1) * b, self.size)
for j in range(lower_bound, upper_bound):
if self._e_index[j] == d:
return j
return -1
cdef int scan_block_backward(self, int i, int k, int b, int d) nogil:
"""Scan a block backward from i
Parameters
----------
i : int
The index position to start from in the tree
k : int
The block to explore
b : int
The block size
d : int
The depth to search for
Returns
-------
int
The index position of the result. -1 is returned if a result is not
found.
"""
cdef int lower_bound
cdef int upper_bound
cdef int j
# i and k are currently needed to handle the situation where
# k_start < i < k_end. It should be possible to resolve using partial
# excess.
# range stop is exclusive, so need to set "stop" at -1 of boundary
lower_bound = max(k, 0) * b - 1 # is it possible for k to be < 0?
# include the right most position of the k-1 block so we can identify
# closures spanning blocks. Not positive if this is correct, however if the
# block is "()((", and we're searching for the opening paired with ")",
# we need to go to evaluate the excess prior to the first "(", at least as
# "open" is defined in Cordova and Navarro
if lower_bound >= 0:
lower_bound -= 1
# upper bound is block boundary or left of i, whichever is less
# note that this is an inclusive boundary since this is a backward search
upper_bound = min((k + 1) * b, self.size) - 1
upper_bound = min(i - 1, upper_bound)
if upper_bound <= 0:
return -1
for j in range(upper_bound, lower_bound, -1):
if self.excess(j) == d:
return j
return -1
cdef SIZE_t fwdsearch(self, SIZE_t i, int d) nogil:
"""Search forward from i for desired excess
Parameters
----------
i : int
The index to search forward from
d : int
The excess difference to search for (relative to E[i])
Returns
-------
int
The index of the result, or -1 if no result was found