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
|
/*
This file is part of BioD.
Copyright (C) 2012-2014 Artem Tarasov <lomereiter@gmail.com>
Permission is hereby granted, free of charge, to any person obtaining a
copy of this software and associated documentation files (the "Software"),
to deal in the Software without restriction, including without limitation
the rights to use, copy, modify, merge, publish, distribute, sublicense,
and/or sell copies of the Software, and to permit persons to whom the
Software is furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in
all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
DEALINGS IN THE SOFTWARE.
*/
module bio.core.utils.algo;
import std.traits;
import std.range;
import std.algorithm;
import std.array;
/**
This function is supposed to be used on a small amount of objects,
typically tags of the same alignment. Therefore it runs in O(N^2)
but doesn't require any memory allocations.
*/
bool allDistinct(Range)(Range r) {
uint sz = 0;
uint eq = 0;
foreach (e1; r) {
++sz;
foreach (e2; r) {
if (e1 == e2) {
eq += 1;
}
}
}
return sz == eq;
}
private import std.algorithm;
static if (!__traits(compiles, any!"a == 2"([1,2,3]))) {
import std.functional;
/// check if all elements satisfy the condition
bool all(alias F, R)(R r) {
foreach (e; r) {
if (!unaryFun!F(e)) {
return false;
}
}
return true;
}
/// check if any element satisfies the condition
bool any(alias F, R)(R r) {
foreach (e; r) {
if (unaryFun!F(e)) {
return true;
}
}
return false;
}
}
import std.functional;
auto argmax(alias func, S)(S set) {
auto best_elem = set.front;
auto best_value = unaryFun!func(best_elem);
set.popFront();
foreach (elem; set) {
auto value = unaryFun!func(elem);
if (value > best_value) {
best_value = value;
best_elem = elem;
}
}
return best_elem;
}
struct NonOverlappingChunks(R, alias begFunc, alias endFunc) {
this(R r) {
_range = r;
popFront();
}
bool empty() @property {
return _empty;
}
auto front() @property {
return _front;
}
void popFront() {
if (!_range.empty()) {
_front = _range.front;
tryToJoinWithNextChunks();
} else {
_empty = true;
}
}
private:
R _range;
void tryToJoinWithNextChunks() {
_range.popFront();
while (!_range.empty()) {
/// Get next element
auto next = _range.front;
/// It's presumed that chunks are sorted
assert(next >= _front);
/// Check if the chunk can be joined with the previous one
if (endFunc(_front) >= begFunc(next)) {
/// update end of _front
endFunc(_front) = max(endFunc(_front), endFunc(next));
_range.popFront(); /// next is consumed
} else {
/// can't join
break;
}
}
}
Unqual!(ElementType!R) _front;
bool _empty = false;
}
/// $(D begFunc) and $(D endFunc) must take a reference to the object
/// and return references to the field.
/// FIXME: the design is ugly.
/// Params:
/// r - range of chunks, sorted by leftmost coordinate
/// Returns:
/// range of non-overlapping chunks, covering the same subset
/// as original chunks
NonOverlappingChunks!(R, begFunc, endFunc)
nonOverlapping(alias begFunc, alias endFunc, R)(R r)
if (__traits(compiles, {
if (begFunc(r.front) == endFunc(r.front))
endFunc(r.front) = begFunc(r.front);
}))
{
return NonOverlappingChunks!(R, begFunc, endFunc)(r);
}
|
