MCPcopy Create free account
hub / github.com/davisking/dlib / test_sparse_to_dense

Method test_sparse_to_dense

dlib/test/data_io.cpp:107–205  ·  view source on GitHub ↗

Source from the content-addressed store, hash-verified

105
106
107 void test_sparse_to_dense()
108 {
109 {
110 std::map<unsigned long, double> temp;
111
112 matrix<double,0,1> m, m2;
113
114 m = sparse_to_dense(m);
115 DLIB_TEST(m.size() == 0);
116 m.set_size(2,1);
117 m = 1, 2;
118 m2 = sparse_to_dense(m);
119 DLIB_TEST(m == m2);
120 m2 = sparse_to_dense(m,1);
121 DLIB_TEST(m2.size() == 1);
122 DLIB_TEST(m2(0,0) == 1);
123 m2 = sparse_to_dense(m,0);
124 DLIB_TEST(m2.size() == 0);
125
126 temp[3] = 2;
127 temp[5] = 4;
128 m2 = sparse_to_dense(temp);
129 m.set_size(6);
130 m = 0,0,0,2,0,4;
131 DLIB_TEST(m2 == m);
132
133 m2 = sparse_to_dense(temp, 5);
134 m.set_size(5);
135 m = 0,0,0,2,0;
136 DLIB_TEST(m2 == m);
137
138 m2 = sparse_to_dense(temp, 7);
139 m.set_size(7);
140 m = 0,0,0,2,0,4,0;
141 DLIB_TEST(m2 == m);
142
143 std::vector<std::vector<std::pair<unsigned long,double> > > vects;
144
145 std::vector<std::pair<unsigned long,double> > v;
146 v.push_back(make_pair(5,2));
147 v.push_back(make_pair(3,1));
148 v.push_back(make_pair(5,2));
149 v.push_back(make_pair(3,1));
150 v = make_sparse_vector(v);
151 vects.push_back(v);
152 vects.push_back(v);
153 vects.push_back(v);
154 vects.push_back(v);
155 DLIB_TEST(max_index_plus_one(v) == 6);
156 m2 = sparse_to_dense(v);
157 m.set_size(6);
158 m = 0,0,0,2,0,4;
159 DLIB_TEST_MSG(m2 == m, m2 << "\n\n" << m );
160
161 m2 = sparse_to_dense(v,7);
162 m.set_size(7);
163 m = 0,0,0,2,0,4,0;
164 DLIB_TEST(m2 == m);

Callers

nothing calls this directly

Calls 7

sparse_to_denseFunction · 0.85
make_sparse_vectorFunction · 0.85
max_index_plus_oneFunction · 0.50
sizeMethod · 0.45
set_sizeMethod · 0.45
push_backMethod · 0.45
clearMethod · 0.45

Tested by

no test coverage detected