@@ -80,8 +80,6 @@ class Graph {
80
80
in_edges_.resize (1 );
81
81
}
82
82
void makeConnection (const Layer& layPrev, Layer& layNext) {
83
- /* std::cout << "BEFORE CONNECTION - Prev ID: " << layPrev.getID()
84
- << ", Next ID: " << layNext.getID() << std::endl;*/
85
83
bool layer_exists = false ;
86
84
for (const auto * layer : layers_) {
87
85
if (layer == &layNext) {
@@ -117,8 +115,6 @@ class Graph {
117
115
}
118
116
119
117
in_edges_[layNext.getID ()].push_back (layPrev.getID ());
120
- /* std::cout << "AFTER CONNECTION - Prev ID: " << layPrev.getID()
121
- << ", Next ID: " << layNext.getID() << std::endl;*/
122
118
}
123
119
bool areLayerNext (const Layer& layPrev, const Layer& layNext) {
124
120
for (int i = arrayV_[layPrev.getID ()]; i < arrayV_[layPrev.getID () + 1 ];
@@ -136,28 +132,6 @@ class Graph {
136
132
137
133
for (size_t i = 0 ; i < traversal.size (); ++i) {
138
134
int current_layer = traversal[i];
139
-
140
- // // Ïðîñòîé âûâîä
141
- // std::string layer_name = getLayerName(current_layer);
142
- // std::cout << "Processing layer #" << current_layer << " (" << layer_name
143
- // << ")" << std::endl;
144
- // if (!inten_.empty()) {
145
- // std::cout << "Input shape: ";
146
- // for (size_t d = 0; d < inten_[0].get_shape().dims(); ++d) {
147
- // std::cout << inten_[0].get_shape()[d] << " ";
148
- // }
149
- // std::cout << std::endl;
150
- // }
151
-
152
- // std::cout << "Layer #" << current_layer << " ("
153
- // << getLayerName(current_layer) << ") has "
154
- // << in_edges_[current_layer].size() << " input connections"
155
- // << std::endl;
156
-
157
- // for (int input_id : in_edges_[current_layer]) {
158
- // std::cout << " - From layer #" << input_id << " ("
159
- // << getLayerName(input_id) << ")" << std::endl;
160
- // }
161
135
#ifdef ENABLE_STATISTIC_TIME
162
136
auto start = std::chrono::high_resolution_clock::now ();
163
137
#endif
@@ -199,14 +173,6 @@ class Graph {
199
173
weights_.push_back (layers_[i]->get_weights ());
200
174
#endif
201
175
202
- /* if (!outten_.empty()) {
203
- std::cout << "Output shape: ";
204
- for (size_t d = 0; d < outten_[0].get_shape().dims(); ++d) {
205
- std::cout << outten_[0].get_shape()[d] << " ";
206
- }
207
- std::cout << std::endl << std::endl;
208
- }*/
209
-
210
176
inten_ = outten_;
211
177
212
178
if (layers_[current_layer]->postops .count > 0 ) {
@@ -236,12 +202,6 @@ class Graph {
236
202
split_distribution_[count_used_split_distribution_];
237
203
count_used_split_distribution_++;
238
204
}
239
- /* std::cout << " Split distribution: ";
240
- for (const auto& dist : new_branch.distribution) {
241
- std::cout << "(To Layer #" << dist.first << ", Output " << dist.second
242
- << ") ";
243
- }
244
- std::cout << std::endl;*/
245
205
} else {
246
206
std::vector<std::pair<int , int >> dis (countinout[current_layer].second );
247
207
for (size_t m = 0 ; m < dis.size (); ++m) {
0 commit comments