Searched refs:sum (Results 1 - 25 of 26) sorted by relevance

12

/inkscape/src/trace/
H A Dfilterset.cpp66 unsigned long sum = 0; local
72 sum += me->getPixel(me, j, i) * weight;
75 sum /= 159;
76 newGm->setPixel(newGm, x, y, sum);
187 unsigned long sum = 0; local
191 sum = 0;
218 sum = abs(sumX) + abs(sumY);
220 if (sum > 765)
221 sum = 765;
304 if (sum < leftPixe
393 int sum = rgb.r + rgb.g + rgb.b; local
[all...]
H A Dsiox.cpp245 float sum=0.0; local
246 sum += (L - other.L) * (L - other.L);
247 sum += (A - other.A) * (A - other.A);
248 sum += (B - other.B) * (B - other.B);
249 return sum;
1289 unsigned int sum = 0;
1291 sum += points[i].C;
1293 if ((float)sum >= threshold)
1675 * the weight factors sum up to 1.
1719 float sum
[all...]
/inkscape/share/extensions/Barcode/
H A DEan5.py36 family = sum([int(n)*int(m) for n, m in zip(number, '39393')]) % 10
/inkscape/src/
H A Dsyseq.h94 double sum = 0; local
96 sum += A[i][k] * B[k][j];
98 res[i][j] = sum;
110 double sum = 0; local
112 sum += A[i][k] * v[k];
114 res[i] = sum;
H A Dunclump.cpp174 double sum = 0; local
182 sum += unclump_dist (item, other);
186 return sum/n;
H A Dsp-mesh-array.cpp1559 double sum( const double alpha[16], const double& x, const double& y ) {
1745 r[m][k][l] = sum( alpha, x, y );
/inkscape/src/libnrtype/
H A DTextWrapper.cpp940 double sum = 0; local
945 for (int j = l_pos + 1; j <= n_pos; j++) sum += kern_x[j];
947 for (int j = l_pos; j > n_pos; j--) sum -= kern_x[j];
951 glyph_text[i].x += sum;
956 for (int j = l_pos + 1; j <= n_pos; j++) sum += kern_x[j];
958 for (int j = l_pos; j > n_pos; j--) sum -= kern_x[j];
961 glyph_text[glyph_length].x += sum;
965 double sum = 0; local
970 for (int j = l_pos + 1; j <= n_pos; j++) sum += kern_y[j];
972 for (int j = l_pos; j > n_pos; j--) sum
[all...]
/inkscape/src/display/
H A Dnr-filter-gaussian.cpp153 // Compute kernel and sum of coefficients
155 double sum = 0; local
158 if ( i > 0 ) sum += k[i];
160 // the sum of the complete kernel is twice as large (plus the center element which we skipped above to prevent counting it twice)
161 sum = 2*sum + k[0];
163 // Normalize kernel (making sure the sum is exactly 1)
167 ksum += k[i]/sum;
409 FIRValue sum = 0; local
422 // sum pixel
[all...]
/inkscape/
H A Ddistro164 sum="`expr $ALL + $CODENAME + $FTPNAME + $NAME + $RELEASE`"
165 if test $sum -eq 0 || test $FTPNAME -eq 1; then
/inkscape/src/libcola/
H A Dcola.cpp149 double sum = 0, d, diff; local
154 sum += diff*diff / (d*d);
159 sum += gpX->dummy_vars[i]->stress(dummy_var_euclidean_dist(gpX, gpY, i));
162 return sum;
/inkscape/share/extensions/
H A Daddnodes.py29 return sum([len(p)-1 for p in csp])
H A Dpolyhedron_3d.py275 sum = 0
277 sum += pts[ face[i]-1 ][2]
278 return sum/len(face)
H A Dpathalongpath.py161 l=l % sum(self.lengths)
254 length=sum(self.lengths)
H A Dpathscatter.py194 l=l % sum(self.lengths)
263 length=sum(self.lengths)
H A Dnicechart.py491 #create value sum in order to divide the slices
493 valuesum = sum(values)
585 #create value sum in order to divide the bars
587 valuesum = sum(values)
H A Dlayout_nup.py158 pgEdge = map(sum,zip(pgMargin, pgPadding))
H A Dinterp.py22 return sum([len(p)-1 for p in csp])
H A Dmeasure.py68 return sum([len(p)-1 for p in csp])
H A Dgcodetools.py1421 return [ [ sum([a[i][k]*b[k][j] for k in range(len(a[0])) ]) for j in range(len(b[0]))] for i in range(len(a))]
1423 return [ [ sum([a[i][k]*b[k][j] for k in range(len(a[0])) ]) for j in range(len(b[0]))] for i in range(len(a))]
1809 return sum([i.length() for i in items])
2081 print_("Path length = %s"% sum([len(i)for i in csp] ) )
2978 len_edges = sum([len(edges[p]) for p in edges])
3044 # for sp2 in top_spieces sum(|sp1-sp2|)/top_count
3438 #print_("Redused edges count from", sum([len(poly) for poly in polygon.polygon ]) )
3444 print_("Got %s polygons having average %s edges each."% ( len(polygons), float(sum([ sum([len(poly) for poly in polygon.polygon]) for polygon in polygons ])) / len(polygons) ) )
4586 c = 1. - float(sum(color
[all...]
/inkscape/src/libuemf/
H A Dupmf.c75 \param sum U_PSEUDO_OBJ to use for scratch space
78 int U_PMR_write(U_PSEUDO_OBJ *po, U_PSEUDO_OBJ *sum, EMFTRACK *et){ argument
81 sum->Used = 0; /* clean it out, retaining allocated memory */
82 sum = U_PO_append(sum, "EMF+", 4); /* indicates that this comment holds an EMF+ record */
83 if(!sum)goto end;
84 sum = U_PO_append(sum, po->Data, po->Used); /* the EMF+ record itself */
85 if(!sum)goto end;
87 rec = U_EMRCOMMENT_set(sum
106 U_PMR_drawline(uint32_t PenID, uint32_t PathID, U_PMF_POINTF Start, U_PMF_POINTF End, int Dashed, U_PSEUDO_OBJ *sum, EMFTRACK *et) argument
159 U_PMR_drawstring( const char *string, int Vpos, uint32_t FontID, const U_PSEUDO_OBJ *BrushID, uint32_t FormatID, U_PMF_STRINGFORMAT Sfs, const char *FontName, U_FLOAT Height, U_FontInfoParams *fip, uint32_t FontFlags, U_FLOAT x, U_FLOAT y, U_PSEUDO_OBJ *sum, EMFTRACK *et) argument
[all...]
H A Dupmf.h2823 int U_PMR_write(U_PSEUDO_OBJ *po, U_PSEUDO_OBJ *sum, EMFTRACK *et);
2824 int U_PMR_drawline(uint32_t PenID, uint32_t PathID, U_PMF_POINTF Start, U_PMF_POINTF End, int Dashed, U_PSEUDO_OBJ *sum, EMFTRACK *et);
2827 U_FLOAT x, U_FLOAT y, U_PSEUDO_OBJ *sum, EMFTRACK *et);
/inkscape/src/livarot/
H A Dfloat-line.cpp404 * Computes the sum of the coverages of the runs currently being scanned,
409 float sum = 0; local
413 sum+=bords[nn].val+(at-bords[nn].pos)*bords[nn].pente;
414 // sum+=((at-bords[nn].pos)*bords[no].val+(bords[no].pos-at)*bords[nn].val)/(bords[no].pos-bords[nn].pos);
415 // sum+=ValAt(at,bords[nn].pos,bords[no].pos,bords[nn].val,bords[no].val);
418 // for each portion being scanned, compute coverage at position "at" and sum.
419 // we could simply compute the sum of portion coverages as a "f(x)=ux+y" and evaluate it at "x=at",
425 sum += bords[nn].val + (at - bords[nn].pos) * bords[nn].pente;
428 return sum;
472 // more precisely, leftV is the sum o
[all...]
H A Dint-line.cpp84 float sum = 0; local
87 sum += ValAt(at, bords[nn].pos, bords[no].pos, bords[nn].val, bords[no].val);
90 return sum;
/inkscape/src/2geom/
H A Dcoord.cpp683 Chunk sum = bigits_[bigit_pos] + other.bigits_[i] + carry;
684 bigits_[bigit_pos] = sum & kBigitMask;
685 carry = sum >> kBigitSize;
690 Chunk sum = bigits_[bigit_pos] + carry;
691 bigits_[bigit_pos] = sum & kBigitMask;
692 carry = sum >> kBigitSize;
843 // The sum of the two indices must be equal to i.
1103 Chunk sum = chunk_a + chunk_b;
1104 if (sum > chunk_c + borrow) {
1107 borrow = chunk_c + borrow - sum;
[all...]
/inkscape/src/extension/internal/
H A Dodf.cpp191 double sum = 0.0; local
194 //sum += a[i][k] * b[k][j];
195 sum += d[i*cols +k] * other(k, j);
197 result(i, j) = sum;

Completed in 1213 milliseconds

12