summaryrefslogtreecommitdiff
path: root/gr-fec/lib/alist.cc
blob: 9cedf42e99d7c0a8c63215e5785ac67ffed36b4b (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
/* -*- c++ -*- */
/*
 * Copyright 2015 Free Software Foundation, Inc.
 *
 * This file is part of GNU Radio
 *
 * SPDX-License-Identifier: GPL-3.0-or-later
 *
 */

#include <gnuradio/fec/alist.h>

alist::alist(const char* fname) : data_ok(false) { read(fname); }

std::vector<std::vector<char>> alist::get_matrix()
{
    std::vector<std::vector<char>> mat;
    mat.resize(M);
    for (int i = 0; i < M; i++) {
        mat[i].resize(N);
        for (int j = 0; j < N; j++) {
            mat[i][j] = char(0);
        }
        for (int k = 0; k < num_mlist[i]; k++) {
            mat[i][mlist[i][k] - 1] = char(1);
        }
    }
    return mat;
}

std::vector<std::vector<int>> alist::get_mlist() { return mlist; }

std::vector<std::vector<int>> alist::get_nlist() { return nlist; }

std::vector<int> alist::get_num_mlist() { return num_mlist; }

std::vector<int> alist::get_num_nlist() { return num_nlist; }

void alist::read(const char* fname)
{
    std::ifstream file;
    std::string line;
    std::stringstream ss;

    file.open(fname);
    if (!(file.is_open())) {
        std::cout << "Could not open the file" << std::endl;
    }

    // Parse N and M
    std::getline(file, line);
    ss << line;
    ss >> N >> M;
    num_nlist.resize(N);
    num_mlist.resize(M);
    nlist.resize(N);
    mlist.resize(M);
    ss.seekg(0, std::ios::end);
    ss.clear();

    // parse max_num_n and max_num_m
    std::getline(file, line);
    ss << line;
    ss >> max_num_nlist >> max_num_mlist;
    ss.seekg(0, std::ios::end);
    ss.clear();

    // Parse weight of each column n
    std::getline(file, line);
    ss << line;
    for (int i = 0; i < N; i++) {
        ss >> num_nlist[i];
        nlist[i].resize(num_nlist[i]);
    }
    ss.seekg(0, std::ios::end);
    ss.clear();

    // Parse weight of each row m
    std::getline(file, line);
    ss << line;
    for (int i = 0; i < M; i++) {
        ss >> num_mlist[i];
        mlist[i].resize(num_mlist[i]);
    }
    ss.seekg(0, std::ios::end);
    ss.clear();

    // Parse indices with non zero entries in ith column
    for (int column = 0; column < N; column++) {
        std::getline(file, line);
        ss << line;
        for (int entry = 0; entry < num_nlist[column]; entry++) {
            ss >> nlist[column][entry];
        }
        ss.seekg(0, std::ios::end);
        ss.clear();
    }

    // Parse indices with non zero entries in ith row
    for (int row = 0; row < M; row++) {
        std::getline(file, line);
        ss << line;
        for (int entry = 0; entry < num_mlist[row]; entry++) {
            ss >> mlist[row][entry];
        }
        ss.seekg(0, std::ios::end);
        ss.clear();
    }

    file.close();
    data_ok = true;
}

void alist::write(const char* fname) const
{
    if (!data_ok) {
        std::cout << "Data not ok, exiting" << std::endl;
        exit(1);
    }
    // Else
    std::ofstream file(fname, std::ofstream::out);
    // Write N and M
    file << N << " " << M << std::endl;
    file << max_num_nlist << " " << max_num_mlist << std::endl;
    // Write column weights
    for (size_t i = 0; i < num_nlist.size() - 1; i++) {
        file << num_nlist[i] << " ";
    }
    file << num_nlist[num_nlist.size() - 1] << std::endl;
    // Write row weights
    for (size_t i = 0; i < num_mlist.size() - 1; i++) {
        file << num_mlist[i] << " ";
    }
    file << num_mlist[num_mlist.size() - 1] << std::endl;
    // Write non zero indices in the ith column
    for (int i = 0; i < N; i++) {
        for (int j = 0; j < num_nlist[i] - 1; j++) {
            file << nlist[i][j] << "\t";
        }
        file << nlist[i][num_nlist[i] - 1];
        file << std::endl;
    }
    // Write non zero indices in the ith row
    for (int i = 0; i < M; i++) {
        for (int j = 0; j < num_mlist[i] - 1; j++) {
            file << mlist[i][j] << "\t";
        }
        file << mlist[i][num_mlist[i] - 1];
        file << std::endl;
    }
    file.close();
}

int alist::get_N() { return N; }

int alist::get_M() { return M; }

int alist::get_max_num_nlist() { return max_num_nlist; }

int alist::get_max_num_mlist() { return max_num_mlist; }

void alist::print_nlist_i(int column)
{
    std::cout << "Indices in column " << column << std::endl;
    for (int i = 0; i < num_nlist[column] - 1; i++) {
        std::cout << nlist[column][i] << ", ";
    }
    std::cout << nlist[column][num_nlist[column] - 1] << std::endl;
}

void alist::print_mlist_i(int row)
{
    std::cout << "Indices in row " << row << std::endl;
    for (int i = 0; i < num_mlist[row] - 1; i++) {
        std::cout << mlist[row][i] << ", ";
    }
    std::cout << mlist[row][num_mlist[row] - 1] << std::endl;
}