| /inkscape/src/livarot/ |
| H A D | AVL.cpp | 50 return leafFromParent(NULL, LEFT);
93 if (from == child[LEFT])
108 if (child[LEFT] == NULL)
114 AVLTree *b = child[LEFT];
116 AVLTree *c = child[LEFT]->child[LEFT];
117 AVLTree *d = child[LEFT]->child[RIGHT];
118 if (child[LEFT]->balance > 0)
127 a->child[LEFT] = d;
130 b->child[LEFT]
[all...] |
| H A D | PathStroke.cpp | 83 DoButt(dest, width, butt, pos, dir, last[RIGHT], last[LEFT]);
86 DoButt(dest, width, butt, pos, dir, end[LEFT], end[RIGHT]);
87 dest->AddEdge (end[LEFT], last[LEFT]);
149 DoButt(dest, width, butt, curP, dir, last[RIGHT], last[LEFT]);
152 DoButt(dest, width, butt, curP, dir, end[LEFT], end[RIGHT]);
153 dest->AddEdge (end[LEFT], last[LEFT]);
173 DoButt(dest, width, butt, curP, nextD, last[RIGHT], last[LEFT]);
204 dest->AddEdge(nSt[LEFT], las
[all...] |
| H A D | sweep-tree.cpp | 21 evt[LEFT] = evt[RIGHT] = NULL;
43 evt[LEFT] = evt[RIGHT] = NULL;
134 if (child[LEFT]) {
135 return (static_cast<SweepTree *>(child[LEFT]))->Find(px, newOne,
140 insertL = static_cast<SweepTree *>(elem[LEFT]);
192 if (child[LEFT])
194 return (static_cast<SweepTree *>(child[LEFT]))->Find(px, insertL,
200 insertL = static_cast<SweepTree *>(elem[LEFT]);
238 RemoveEvent(queue, LEFT);
290 insertR->RemoveEvent(queue, LEFT);
[all...] |
| H A D | sweep-event.cpp | 73 iLeft = e.sweep[LEFT];
90 iLeft = e.sweep[LEFT];
215 e->sweep[LEFT]->evt[RIGHT] = events + to;
216 e->sweep[RIGHT]->evt[LEFT] = events + to;
244 sweep[LEFT] = iLeft;
246 sweep[LEFT]->evt[RIGHT] = this;
247 sweep[RIGHT]->evt[LEFT] = this;
|
| H A D | LivarotDefs.h | 167 LEFT = 0, enumerator in enum:Side
|
| H A D | ShapeSweep.cpp | 340 intersL->RemoveEvent (*sEvts, LEFT);
348 TesteIntersection (intersL, LEFT, false);
417 if (node->elem[LEFT])
421 SweepTree * >(node->elem[LEFT]))->bord;
424 SweepTree * >(node->elem[LEFT]))->src;
487 TesteIntersection (node, LEFT, false);
502 static_cast < SweepTree * >(node->elem[LEFT]);
515 TesteIntersection (node, LEFT, false);
543 static_cast < SweepTree * >(node->elem[LEFT]);
558 TesteIntersection (node, LEFT, fals
[all...] |
| H A D | ShapeRaster.cpp | 822 if ( swrData[cb].sens == false && curS->elem[LEFT] ) {
824 int lb = (static_cast<SweepTree*>(curS->elem[LEFT]))->bord;
|
| /inkscape/src/libnrtype/ |
| H A D | Layout-TNG-Input.cpp | 163 case SP_CSS_TEXT_ANCHOR_START: return para_direction == Layout::LEFT_TO_RIGHT ? Layout::LEFT : Layout::RIGHT;
165 case SP_CSS_TEXT_ANCHOR_END: return para_direction == Layout::LEFT_TO_RIGHT ? Layout::RIGHT : Layout::LEFT;
185 case SP_CSS_TEXT_ALIGN_START: return para_direction == LEFT_TO_RIGHT ? LEFT : RIGHT;
186 case SP_CSS_TEXT_ALIGN_END: return para_direction == LEFT_TO_RIGHT ? RIGHT : LEFT;
187 case SP_CSS_TEXT_ALIGN_LEFT: return LEFT;
199 return para_direction == LEFT_TO_RIGHT ? LEFT : RIGHT;
|
| H A D | Layout-TNG-Compute.cpp | 437 case LEFT:
457 case LEFT:
1735 para.alignment = para.direction == LEFT_TO_RIGHT ? LEFT : RIGHT;
|
| H A D | Layout-TNG-OutIter.cpp | 238 case LEFT:
288 if (alignment == LEFT || alignment == FULL)
|
| H A D | Layout-TNG.h | 196 rtl or ltr, thus LEFT is always either left or top. */
197 enum Alignment {LEFT, CENTER, RIGHT, FULL}; enumerator in enum:Inkscape::Text::Layout::Alignment
594 and 'end' are correctly translated into LEFT or RIGHT according to
595 the paragraph's directionality. For vertical text, LEFT is top
|
| /inkscape/src/libvpsc/ |
| H A D | block.h | 96 typedef enum {NONE, LEFT, RIGHT} Direction; enumerator in enum:vpsc::Block::__anon400
|
| H A D | block.cpp | 263 LEFT,changedDirection);
272 if(dir==LEFT) {
|
| /inkscape/src/ui/widget/ |
| H A D | dock-item.h | 57 LEFT = GDL_DOCK_LEFT, enumerator in enum:Inkscape::UI::Widget::DockItem::Placement
|
| /inkscape/src/libavoid/ |
| H A D | vpsc.h | 108 typedef enum {NONE, LEFT, RIGHT} Direction; enumerator in enum:Avoid::Block::__anon98
|
| /inkscape/src/extension/internal/ |
| H A D | latex-text-renderer.cpp | 420 case Inkscape::Text::Layout::LEFT:
|