37 BLOB_CHOICE_IT b_it(
get(col, row));
38 for (b_it.mark_cycle_pt(); !b_it.cycled_list(); b_it.forward()) {
61 for (
int col = ind; col >= 0 && col > ind - band_width; --col) {
62 if (
array_[col * band_width + band_width - 1] !=
empty_) {
67 auto* result =
new MATRIX(dim + 1, band_width);
69 for (
int col = 0; col < dim; ++col) {
70 for (
int row = col; row < dim && row < col +
bandwidth(); ++row) {
73 BLOB_CHOICE_LIST* choices =
get(col, row);
74 if (choices !=
nullptr) {
76 BLOB_CHOICE_IT bc_it(choices);
77 for (bc_it.mark_cycle_pt(); !bc_it.cycled_list(); bc_it.forward()) {
82 result->put(coord.
col, coord.
row, choices);
96 auto* result =
new MATRIX(dim, band_width);
97 for (
int col = 0; col < dim; ++col) {
98 for (
int row = col; row < dim && row < col + band_width; ++row) {
99 BLOB_CHOICE_LIST* choices =
get(col, row);
100 if (choices !=
nullptr) {
101 auto* copy_choices =
new BLOB_CHOICE_LIST;
103 result->put(col, row, copy_choices);
112 tprintf(
"Ratings Matrix (top 3 choices)\n");
116 for (col = 0; col < dim; ++col) {
117 for (row = col; row < dim && row < col + band_width; ++row) {
118 BLOB_CHOICE_LIST *rating = this->
get(col, row);
120 BLOB_CHOICE_IT b_it(rating);
121 tprintf(
"col=%d row=%d ", col, row);
122 for (b_it.mark_cycle_pt(); !b_it.cycled_list(); b_it.forward()) {
125 b_it.data()->rating(), b_it.data()->certainty());
132 for (col = 0; col < dim; ++col)
tprintf(
"\t%d", col);
134 for (row = 0; row < dim; ++row) {
135 for (col = 0; col <= row; ++col) {
136 if (col == 0)
tprintf(
"%d\t", row);
137 if (row >= col + band_width) {
141 BLOB_CHOICE_LIST *rating = this->
get(col, row);
143 BLOB_CHOICE_IT b_it(rating);
145 for (b_it.mark_cycle_pt(); !b_it.cycled_list(); b_it.forward()) {
149 if (counter == 3)
break;