Cross Reference: /inkscape/src/2geom/piecewise.h

Lines Matching refs:size
114     *  The size of the returned vector equals n_derivs+1.
120         for(unsigned i = 0; i < val.size(); i++) {
131     inline unsigned size() const { return segs.size(); }
139      * Asserts that basic size and order invariants are correct
142         assert(cuts.size() - segs.size() == 1);
148         assert(cuts.size() - segs.size() == 1);
168         high = (high == -1) ? size() : high;
170         if(t >= cuts[size()]) return size() - 1;
203             for(unsigned i = 0; i <= size(); i++)
214         for(unsigned i = 0; i <= size(); i++)
231         for(unsigned i = 0; i <= size(); i++)
235         cuts[size()] = dom.max();
249         cuts.reserve(cuts.size() + other.size());
250         for(unsigned i = 0; i < other.size(); i++)
263         reserve(size() + other.size());
264         for(unsigned i = 0; i < other.size(); i++)
271         if(!(segs.size() + 1 == cuts.size() || (segs.empty() && cuts.empty())))
274         for(unsigned i = 0; i < segs.size(); i++)
293     for(unsigned i = 1; i < f.size(); i++)
309     for(unsigned i = 1; i < f.size(); i++)
346     assert(i < a.size());
368     ret.reserve(c.size() + pw.cuts.size() - 1);
372         for(unsigned i = 0; i < c.size() - 1; i++)
380     while(c[ci] < pw.cuts.front() && ci < c.size()) {
381         bool isLast = (ci == c.size()-1 || c[ci + 1] >= pw.cuts.front());
391     while(si < pw.size() && ci <= c.size()) {
392         if(ci == c.size() && prev <= pw.cuts[si]) { //cuts exhausted, straight copy the rest
396         }else if(ci == c.size() || c[ci] >= pw.cuts[si + 1]) {  //no more cuts within this segment, finalize
416     while(ci < c.size()) {
418             ret.push(elem_portion(pw, pw.size() - 1, prev, c[ci]), c[ci]);
442     if(i == pw.size() - 1 || to <= pw.cuts[i + 1]) {    //to/from inhabit the same segment
471     ret.reserve(f.size());
473     for(unsigned i=0; i<f.size(); i++){
474         if (f.cuts[i+1]-f.cuts[i] >= tol || i==f.size()-1) {
491     ret.reserve(f.size());
494     for(unsigned i=0; i<f.size(); i++){
511     for(unsigned i = 0; i < pw.size(); i++) {
513         for (unsigned j = 0; j < sr.size(); j++) ret.push_back(sr[j] * (pw.cuts[i + 1] - pw.cuts[i]) + pw.cuts[i]);
530     ret.segs.reserve(a.size());
532     for(unsigned i = 0; i < a.size();i++)
541     ret.segs.reserve(a.size());
543     for(unsigned i = 0; i < a.size();i++)
553     for(unsigned i = 0; i < a.size();i++)
563     for(unsigned i = 0;i < a.size();i++)
579     ret.segs.reserve(a.size());
581     for(unsigned i = 0; i < a.size();i++)
597     ret.segs.reserve(a.size());
599     for(unsigned i = 0; i < a.size();i++)
615     ret.segs.reserve(a.size());
617     for(unsigned i = 0; i < a.size();i++)
634     ret.segs.reserve(a.size());
636     for(unsigned i = 0; i < a.size();i++)
644     for(unsigned i = 0; i < a.size();i++)
654     for(unsigned i = 0; i < a.size();i++)
671     assert(pa.size() == pb.size());
672     ret.segs.reserve(pa.size());
674     for (unsigned i = 0; i < pa.size(); i++)
689     assert(pa.size() == pb.size());
690     ret.segs.reserve(pa.size());
692     for (unsigned i = 0; i < pa.size(); i++)
720     assert(pa.size() == pb.size());
721     ret.segs.reserve(pa.size());
723     for (unsigned i = 0; i < pa.size(); i++)
770     if (f.size()==1){
778         int idx = (bs.max() < f.cuts[1]) ? 0 : f.cuts.size()-2;
822   for(unsigned i = 0; i < g.segs.size(); i++){
835   for(unsigned i = 0; i < pwd2sb.size(); i++){
864     result.segs.resize(a.segs.size());
867     for(unsigned i = 0; i < a.segs.size(); i++){
883     result.segs.resize(a.segs.size());
885     for(unsigned i = 0; i < a.segs.size(); i++){
911     ret.reserve(f.size());
914     for (unsigned i = 0; i < f.cuts.size(); i++) {
915         double x = f.cuts[f.cuts.size() - 1 - i];
918     for (unsigned i = 0; i < f.segs.size(); i++)
919         ret.push_seg(reverse(f[f.segs.size() - i - 1]));