Searched refs:vals (Results 1 - 5 of 5) sorted by relevance

/inkscape/share/extensions/
H A Ddxf_input.py33 if (vals[groups['1']] or vals[groups['3']]) and vals[groups['10']] and vals[groups['20']]:
34 x = vals[groups['10']][0]
35 y = vals[groups['20']][0]
38 if vals[groups['40']] and vals[groups['40']][0]:
39 size = scale*vals[groups['40']][0]
42 if vals[group
524 vals = [[],[],[],[],[],[],[],[],[],[],[],[],[],[],[],[],[],[],[],[],[],[],[],[],[],[]] variable
[all...]
/inkscape/src/display/
H A Dnr-filter-morphology.cpp77 std::deque< std::pair<int,unsigned char> > vals[BPP]; // In my tests it was actually slightly faster to allocate it here than allocate it once for all threads and retrieving the correct set based on the thread id. local
81 vals[p].push_back(std::pair<int,unsigned char>(-1,0)); // TODO: Only do this when performing an erosion?
91 if (!vals[p].empty() && vals[p].front().first+wi <= j) vals[p].pop_front(); // out-of-range
93 while(!vals[p].empty() && !comp(vals[p].back().second, *in_p)) vals[p].pop_back(); // useless
94 vals[p].push_back(std::make_pair(j, *in_p));
97 while(!vals[
[all...]
/inkscape/src/widgets/
H A Dicon.cpp949 static int vals[Inkscape::ICON_SIZE_DECORATION + 1]; local
972 g_assert( val_ix < G_N_ELEMENTS(vals) );
988 memset( vals, 0, sizeof(vals) );
1014 g_assert( val_ix < G_N_ELEMENTS(vals) );
1020 vals[val_ix] = std::max(width, height);
1021 lastSys[val_ix] = vals[val_ix];
1038 vals[val_ix],
1047 vals[val_ix] = newSize;
1059 return vals[siz
[all...]
/inkscape/src/
H A Ddevice-manager.cpp70 static pair<gint, gint> vals[] = { member in namespace:Inkscape
78 static std::map<gint, gint> bitVals(vals, &vals[G_N_ELEMENTS(vals)]);
/inkscape/src/extension/internal/
H A Dodf.cpp126 SVDMatrix(double *vals, unsigned int rowSize, unsigned int colSize) argument
134 d[i] = vals[i];

Completed in 34 milliseconds