Lines Matching refs:size
53 //unsigned size() const { return coeff.size();}
54 unsigned degree() const { return size()-1;}
61 const unsigned out_size = std::max(size(), p.size());
62 const unsigned min_size = std::min(size(), p.size());
68 for(unsigned i = min_size; i < size(); i++)
70 for(unsigned i = min_size; i < p.size(); i++)
72 assert(result.size() == out_size);
77 const unsigned out_size = std::max(size(), p.size());
78 const unsigned min_size = std::min(size(), p.size());
84 for(unsigned i = min_size; i < size(); i++)
86 for(unsigned i = min_size; i < p.size(); i++)
88 assert(result.size() == out_size);
92 const unsigned out_size = std::max(size(), p.size());
93 const unsigned min_size = std::min(size(), p.size());
105 const unsigned out_size = size();
116 result.resize(size());
118 for(unsigned i = 0; i < size(); i++) {
125 const unsigned out_size = size();
131 assert(result.size() == out_size);
137 size_type const out_size = size() + terms;
143 assert(result.size() == out_size);
151 for(int k = size()-1; k >= 0; k--) {
171 int nc = size() - 1;
172 int nd = pd.size() - 1;
173 for(unsigned j = 1; j < pd.size(); j++)
233 if(in_poly.size() == 0)
236 for(int i = (int)in_poly.size()-1; i >= 0; --i) {