| /inkscape/src/libvpsc/ |
| H A D | solve_VPSC.h | 63 Blocks *bs; member in class:vpsc::Solver
|
| /inkscape/src/libcola/ |
| H A D | straightener.cpp | 140 vector<double> bs; local
142 e->xpos(conjpos,bs);
144 e->ypos(conjpos,bs);
146 //cerr << "edge(intersections="<<bs.size()<<":("<<e->startNode<<","<<e->endNode<<"))"<<endl;
147 for(vector<double>::iterator it=bs.begin();it!=bs.end();++it) {
|
| /inkscape/src/libavoid/ |
| H A D | vpsc.h | 234 Blocks *bs; member in class:Avoid::IncSolver
|
| /inkscape/src/trace/ |
| H A D | quantize.cpp | 35 unsigned long rs, gs, bs; // sum of pixels colors this node accounts for member in struct:Ocnode_def
50 colors_sum(stored in rs,gs,bs)/weight
205 (node->bs / node->weight)),
233 node->rs = rgb.r; node->gs = rgb.g; node->bs = rgb.b;
266 node1->rs += node2->rs; node1->gs += node2->gs; node1->bs += node2->bs;
279 node2->rs += node1->rs; node2->gs += node1->gs; node2->bs += node1->bs;
294 newnode->bs = node1->bs
[all...] |
| /inkscape/src/2geom/ |
| H A D | basic-intersection.cpp | 281 std::vector<Point> as, bs; local
283 bs = B.valueAndDerivatives(t, 2);
284 Point F = as[0] - bs[0];
300 -bs[1][0], -bs[1][1],
307 bs = B.valueAndDerivatives(nt, 2);
308 F = as[0] - bs[0];
|
| H A D | sbasis-roots.cpp | 269 Interval bs = *bounds_local(df,Interval(a,b)); local
281 if (bs.max()>0 && idxa<(int)levels.size())
282 ta_hi=a+(levels.at(idxa )-fa)/bs.max();
283 if (bs.min()<0 && idxa>0)
284 ta_lo=a+(levels.at(idxa-1)-fa)/bs.min();
291 if (bs.min()<0 && idxb<(int)levels.size())
292 tb_hi=b+(levels.at(idxb )-fb)/bs.min();
293 if (bs.max()>0 && idxb>0)
294 tb_lo=b+(levels.at(idxb-1)-fb)/bs.max();
429 Interval bs local
571 OptInterval bs = bounds_fast(s); local
[all...] |
| H A D | sbasis.cpp | 46 Interval bs = *bounds_fast(*this, tail); local
47 return std::max(fabs(bs.min()),fabs(bs.max()));
|
| H A D | ellipse.cpp | 567 std::vector<ShapeIntersection> bs = other.intersect(lines[li]); local
569 if (!as.empty() && as.size() == bs.size()) {
571 ShapeIntersection ix(as[i].first, bs[i].first,
572 middle_point(as[i].point(), bs[i].point()));
|
| H A D | path-intersection.cpp | 158 std::vector<Point> as, bs; local
160 bs = B.pointAndDerivatives(t, 2);
161 Point F = as[0] - bs[0];
177 -bs[1][0], -bs[1][1],
189 bs = B.pointAndDerivatives(nt, 2);
190 F = as[0] - bs[0];
|
| /inkscape/src/livarot/ |
| H A D | Shape.cpp | 1564 Shape::CmpToVert (Geom::Point ax, Geom::Point bx,bool as,bool bs) argument
1691 if ( as == true && bs == false ) return -1;
1692 if ( as == false && bs == true ) return 1;
|
| /inkscape/src/ |
| H A D | sp-gradient.cpp | 130 SPStop *bs = that->getVector()->getFirstStop(); local
133 while (effective && (as && bs)) {
134 if (!as->getEffectiveColor().isClose(bs->getEffectiveColor(), 0.001) ||
135 as->offset != bs->offset) {
141 bs = bs->getNextStop();
|
| H A D | splivarot.cpp | 384 Inkscape::XML::Node *bs = AncetreFils(b, parent); local
393 if (child == bs)
|
| /inkscape/src/ui/widget/ |
| H A D | color-slider.cpp | 539 static gint bs = 0; local
544 if (buf && (bs < width * height)) {
550 bs = width * height;
594 static gint bs = 0; local
598 if (buf && (bs < width * height)) {
604 bs = width * height;
|
| /inkscape/src/libuemf/ |
| H A D | uemf_endian.c | 305 int bs; local
330 bs = colortype/8;
331 if(bs<1){
335 usedbytes = width*bs;
|
| H A D | uemf_safe.c | 139 int bs; local
158 bs = colortype/8;
159 if(bs<1){
163 usedbytes = width*bs;
|
| H A D | uemf.c | 639 int bs; local
661 bs = colortype/8;
662 if(bs<1){
666 usedbytes = w*bs;
937 int bs; local
956 bs = colortype/8;
957 if(bs<1){
961 usedbytes = w*bs;
|
| H A D | uwmf.c | 695 int bs; local
709 bs = colortype/8;
710 if(bs<1){
714 usedbytes = width*bs;
|