Searched refs:idx (Results 1 - 25 of 29) sorted by relevance

12

/inkscape/src/svg/
H A Dsvg-affine.cpp35 int idx; local
45 idx = 0;
46 while (str[idx]) {
48 while (g_ascii_isspace (str[idx])) idx++;
54 c = str[idx];
56 keyword[key_len] = str[idx++];
65 while (g_ascii_isspace (str[idx])) idx++;
67 if (str[idx] !
[all...]
/inkscape/src/trace/
H A Dsiox.cpp1361 for (unsigned long idx = 0 ; idx<pixelCount ; idx++)
1362 labelField[idx] = -1;
1476 for (unsigned long idx = 0 ; idx<pixelCount ; idx++)
1477 labelField[idx] = -1;
1561 int idx=(y*xres)+x;
1562 if (cm[idx
[all...]
/inkscape/src/libdepixelize/priv/
H A Diterator.h52 difference_type idx = ptr - to_ptr<T>(begin); local
53 return begin + idx;
63 difference_type idx = ptr - to_ptr<T>(begin); local
64 return begin + idx;
/inkscape/src/live_effects/
H A Dlpe-recursiveskeleton.cpp82 for (unsigned idx = 0; idx < skeleton.size(); idx++){
83 Piecewise<D2<SBasis> > path_i = skeleton[idx];
H A Dlpe-rough-hatches.cpp60 unsigned idx; member in struct:Inkscape::LivePathEffect::LevelCrossingInfo
117 elem.idx = j;
126 unsigned lvl = temp[i].level, idx = temp[i].idx; local
128 std::pair<unsigned,unsigned>next_data(temp[first_in_comp].level,temp[first_in_comp].idx);
129 (*this)[lvl][idx].next_on_curve = next_data;
133 std::pair<unsigned,unsigned> next_data(temp[i+1].level,temp[i+1].idx);
134 (*this)[lvl][idx].next_on_curve = next_data;
146 void findFirstUnused(unsigned &level, unsigned &idx){ argument
148 idx
165 step(unsigned &level, unsigned &idx, int &direction) argument
[all...]
H A Dlpe-patternalongpath.cpp176 for (unsigned idx = 0; idx < paths_in.size(); idx++){
177 Geom::Piecewise<Geom::D2<Geom::SBasis> > path_i = paths_in[idx];
H A Dlpe-taperstroke.cpp401 for (unsigned idx = 0; idx < paths_in.size(); idx++) {
402 Piecewise<D2<SBasis> > path_i = paths_in[idx];
H A Dlpe-knot.cpp328 unsigned idx = idx_of_nearest(other,p); local
329 if (idx < other.size()) {
330 (*this)[n].sign = other[idx].sign;
/inkscape/src/ui/tools/
H A Dmeasure-tool.cpp393 for (size_t idx = 0; idx < measure_tmp_items.size(); ++idx) {
394 sp_canvas_item_destroy(measure_tmp_items[idx]);
397 for (size_t idx = 0; idx < measure_phantom_items.size(); ++idx) {
398 sp_canvas_item_destroy(measure_phantom_items[idx]);
771 for (size_t idx = 0; idx < measure_phantom_item
[all...]
/inkscape/src/2geom/
H A Dsbasis-roots.cpp226 int idx; local
227 idx=upper_level(levels,0,vtol);
228 if (idx<(int)levels.size()&&fabs(levels.at(idx))<=vtol){
229 roots[idx].push_back(a);
230 roots[idx].push_back(b);
256 //TODO: unsigned idx ? (remove int casts when fixed)
257 int idx=std::min(upper_level(levels,fa,vtol),upper_level(levels,fb,vtol)); local
258 if (idx==(int)levels.size()) idx
309 int idx=upper_level(levels,ft,vtol); local
418 unsigned idx; local
[all...]
H A Dpiecewise.cpp139 int idx; //idx of the relevant f.segs
141 idx=levels.size()-1;
143 idx=std::min(idx0,idx1);
145 idx=idx0-1;
147 idx=idx0;
149 idx = (idx0==levels.size())? idx0-1:idx0;
152 //move idx back from levels f.cuts
153 idx+=1;
154 return idx;
[all...]
H A Dconvex-hull.cpp585 T idx_to_pair(pair<T, T> p, int idx) {
586 return idx?p.second:p.first;
606 unsigned idx = 0;
611 << idx << ", " << limit << ", s: "
614 while(idx <= limit) {
615 ret.boundary.push_back(chs[state][idx++]);
618 idx = idx_to_pair(bpair[k], state);
620 while(idx < chs[state].size()) {
621 ret.boundary.push_back(chs[state][idx++]);
H A Dpiecewise.h778 int idx = (bs.max() < f.cuts[1]) ? 0 : f.cuts.size()-2;
779 double t0 = f.cuts[idx], width = f.cuts[idx+1] - t0;
780 return (Piecewise<T>) compose(f.segs[idx],compose(Linear(-t0 / width, (1-t0) / width), g));
796 int idx = compose_findSegIdx(cut,next,levels,g);
802 sub_g=compose(Linear(-f.cuts[idx]/(f.cuts[idx+1]-f.cuts[idx]),
803 (1-f.cuts[idx])/(f.cuts[idx
[all...]
H A Dsbasis-math.cpp316 int idx=reciprocal_fn.segs.size()-1-i; local
317 reciprocal_fn_neg.push_seg(-reverse(reciprocal_fn.segs.at(idx)));
318 reciprocal_fn_neg.push_cut(-reciprocal_fn.cuts.at(idx));
H A Dconicsec.cpp1288 size_t idx = d.max_index(); local
1289 if (d[idx] == 0)
1294 d[0] = D(idx,0); d[1] = D(idx,1); d[2] = D(idx,2);
1295 d.scale (1 / std::sqrt (std::fabs (D(idx,idx))));
1447 size_t idx = 0;
1457 idx = i;
1462 points.push_back (crs[idx]);
[all...]
H A Dpath.h136 PathTime(size_type idx, Coord tval) : t(tval), curve_index(idx) {} argument
H A Dpath.cpp481 CurveRecord(Curve const *pc, std::size_t idx, unsigned w)
484 , index(idx)
/inkscape/src/2geom/numeric/
H A Dsymmetric-matrix-fs.h213 size_t idx = 0; local
220 idx = j;
223 return idx;
228 size_t idx = 0; local
235 idx = j;
238 return idx;
253 size_t idx = 0; local
260 idx = i;
263 return idx;
268 size_t idx local
[all...]
/inkscape/src/libuemf/
H A Duwmf.c56 \param idx WMR record type.
59 uint32_t U_wmr_values(int idx){ argument
319 if(idx<U_WMR_MIN || idx > U_WMR_MAX){ ret = 0xFFFFFFFF; }
320 else { ret = U_WMR_VALUES[idx]; }
328 \param idx WMR record type.
331 const char *U_wmr_names(int idx){ argument
591 if(idx<U_WMR_MIN || idx > U_WMR_MAX){ ret = 256; }
592 else { ret = idx; }
601 U_wmr_escnames(int idx) argument
[all...]
H A Dupmf_print.c407 uint8_t idx; local
416 idx = pfe >> 24;
417 printf(" Type:%u(",idx);
418 switch(idx){
434 default: printf("INVALID(%d)",idx); break;
H A Duwmf.h2097 uint32_t U_wmr_values(int idx);
2098 const char *U_wmr_names(int idx);
2099 const char *U_wmr_escnames(int idx);
/inkscape/src/extension/internal/
H A Dwmf-inout.cpp222 uint32_t idx; local
243 idx = in_hatches(d,hpathname);
244 if(!idx){ // add path/color if not already present
367 idx = in_hatches(d,hatchname);
368 if(!idx){ // add it if not already present
377 idx = d->hatches.count;
384 idx = in_hatches(d,hbkname);
385 if(!idx){ // add path/color if not already present. Hatchtype is not needed in the name.
399 idx = in_hatches(d,hatchname);
400 if(!idx){ // ad
441 uint32_t idx; local
541 uint32_t idx; local
665 uint32_t idx = in_clips(d, combined); local
[all...]
H A Demf-inout.cpp245 uint32_t idx; local
266 idx = in_hatches(d,hpathname);
267 if(!idx){ // add path/color if not already present
390 idx = in_hatches(d,hatchname);
391 if(!idx){ // add it if not already present
400 idx = d->hatches.count;
407 idx = in_hatches(d,hbkname);
408 if(!idx){ // add path/color if not already present. Hatchtype is not needed in the name.
422 idx = in_hatches(d,hatchname);
423 if(!idx){ // ad
467 uint32_t idx; local
647 uint32_t idx; local
756 uint32_t idx = in_clips(d, combined); local
[all...]
H A Dtext_reassemble.c890 \param idx index of the alts entry to increment
1736 int current,idx,taln; local
1749 idx = tsp->fi_idx;
1752 if(idx <0 || idx >= (int) fti->used)return(5);
1753 fsp = &(fti->fonts[idx]);
1782 printf("Face idx:%d bbox: xMax/Min:%ld,%ld yMax/Min:%ld,%ld UpEM:%d asc/des:%d,%d height:%d size:%f\n",
1783 idx,
/inkscape/src/widgets/
H A Dgradient-toolbar.cpp181 guint idx = 0; local
191 pos = idx;
193 idx ++;

Completed in 168 milliseconds

12