Searched refs:left (Results 1 - 25 of 676) sorted by relevance

1234567891011>>

/haiku/src/add-ons/print/drivers/gutenprint/
H A DRectangle.h21 left(0),
32 left(static_cast<T>(rect.left)),
40 Rectangle(T left, T top, T right, T bottom) argument
42 left(left),
51 left = static_cast<T>(rect.left);
60 return right - left;
69 T left; member in class:Rectangle
[all...]
/haiku/src/system/kernel/util/
H A DAVLTreeBase.cpp72 while (node->left)
73 node = node->left;
97 if (node->left) {
98 // We have a left subtree, so go to the right-most node.
99 node = node->left;
103 // No left subtree: Backtrack our path and stop, where we
109 } while (node && previous == node->left);
121 // The next node cannot be in the left subtree.
123 // We have a right subtree, so go to the left-most node.
125 while (node->left)
272 AVLTreeNode* left = node->left; local
334 AVLTreeNode** left = &(*node)->left; local
382 bool left; member in struct:node_info
474 AVLTreeNode** left = &(*node)->left; local
512 AVLTreeNode* left = (*node)->left; local
[all...]
/haiku/src/libs/alm/
H A DColumn.cpp21 * The left boundary of the column.
53 Column::Column(LinearSpec* ls, XTab* left, XTab* right) argument
55 fLeft(left),
H A DALMLayoutBuilder.cpp61 BALMLayoutBuilder::Add(BView* view, XTab* left, YTab* top, argument
64 Area* a = (fLayout->AddView(view, left, top, right, bottom));
79 BALMLayoutBuilder::Add(BLayoutItem* item, XTab* left, YTab* top, argument
82 _SetCurrentArea(fLayout->AddItem(item, left, top, right, bottom));
113 BALMLayoutBuilder::SetInsets(float left, float top, float right, argument
116 fLayout->SetInsets(left, top, right, bottom);
151 BReference<XTab> left = _left; local
153 left = fLayout->AddXTab();
160 return Add(view, left, top, right, bottom);
169 XTab* left local
183 AddAbove(BView* view, YTab* _top, XTab* left, XTab* right) argument
201 AddBelow(BView* view, YTab* _bottom, XTab* left, XTab* right) argument
223 BReference<XTab> left = _left; local
241 XTab* left = currentArea->Right(); local
255 AddAbove(BLayoutItem* item, YTab* _top, XTab* left, XTab* right) argument
273 AddBelow(BLayoutItem* item, YTab* _bottom, XTab* left, XTab* right) argument
[all...]
H A DALMGroup.cpp67 ALMGroup::BuildLayout(BALMLayout* layout, XTab* left, YTab* top, XTab* right, argument
70 if (left == NULL)
71 left = layout->Left();
79 _Build(layout, left, top, right, bottom);
99 ALMGroup::_Build(BALMLayout* layout, BReference<XTab> left, argument
103 layout->AddItem(LayoutItem(), left, top, right, bottom); local
105 layout->AddView(View(), left, top, right, bottom); local
115 current._Build(layout, left, top, currentRight, bottom);
116 left = currentRight;
123 current._Build(layout, left, to
[all...]
/haiku/src/apps/processcontroller/
H A DNoiseBarMenuItem.cpp56 frame.left = frame.right - kBarWidth;
75 float grenze1 = frame.left+(frame.right-frame.left)*fBusyWaiting;
76 float grenze2 = frame.left+(frame.right-frame.left)*(fBusyWaiting+fLost);
83 r.left = fGrenze1;
84 if (r.left < r.right) {
92 r.left = grenze1;
95 if (fGrenze2 > r.left && r.left >
[all...]
H A DKernelMemoryBarMenuItem.cpp91 double grenze1 = cadre.left + (cadre.right - cadre.left)
93 double grenze2 = cadre.left + (cadre.right - cadre.left)
101 r.left = fGrenze1;
102 if (r.left < r.right) {
109 r.left = grenze1;
112 if (fGrenze2 > r.left && r.left >= fGrenze1)
113 r.left
[all...]
H A DThreadBarMenuItem.cpp61 frame.left = frame.right - kBarWidth;
80 float grenze1 = frame.left + (frame.right - frame.left) * fKernel;
81 float grenze2 = frame.left + (frame.right - frame.left) * (fKernel + fUser);
89 r.left = fGrenze1;
91 if (r.left < r.right) {
99 r.left = grenze1;
102 if (fGrenze2 > r.left && r.left >
[all...]
/haiku/headers/private/interface/
H A Dclipping.h47 rect.left = min_c(r1.left, r2.left);
64 rect.left = max_c(r1.left, r2.left);
77 rect.left += x;
87 rect.left = (int)(rect.left * x);
98 return BRect((float)rect.left, (floa
[all...]
/haiku/src/system/libroot/posix/glibc/misc/
H A Dtsearch.c84 In this case, A has been rotated left. This preserves the ordering of the
96 struct node_t *left; member in struct:node_t
121 check_tree_recurse (p->left, d_sofar + (p->left && !p->left->red), d_total);
123 if (p->left)
124 assert (!(p->left->red && p->red));
137 for(p = root->left; p; p = p->left)
162 lp = &(*rootp)->left;
[all...]
/haiku/headers/libs/agg/
H A Dagg_trans_perspective.h66 double left[8][8]; local
75 left[ix][0] = 1.0;
76 left[ix][1] = src[ix];
77 left[ix][2] = src[iy];
78 left[ix][3] = 0.0;
79 left[ix][4] = 0.0;
80 left[ix][5] = 0.0;
81 left[ix][6] = -src[ix] * dst[ix];
82 left[ix][7] = -src[iy] * dst[ix];
85 left[i
[all...]
/haiku/headers/libs/print/libprint/
H A DValidRect.h14 int left; member in struct:RECT
/haiku/src/libs/bsd/
H A Dfgetln.c25 size_t length, left; local
37 left = sBufferSize;
42 line = fgets(line, left, stream);
64 left += 1;
/haiku/src/apps/icon-o-matic/generic/gui/popup_control/
H A DSliderView.cpp42 fButtonRect.right = fButtonRect.left + buttonWidth;
92 AddLine(BPoint(r.left, r.bottom),
93 BPoint(r.left, r.top), lightShadow);
94 AddLine(BPoint(r.left + 1.0, r.top),
99 BPoint(r.left + 1.0, r.bottom), darkShadow);
102 AddLine(BPoint(r.left, r.bottom),
103 BPoint(r.left, r.top), light);
104 AddLine(BPoint(r.left + 1.0, r.top),
109 BPoint(r.left + 1.0, r.bottom), shadow);
112 AddLine(BPoint(r.left,
[all...]
/haiku/headers/os/interface/
H A DRect.h17 float left; member in class:BRect
24 BRect(float left, float top, float right,
31 void Set(float left, float top, float right,
94 return *(const BPoint*)&left;
108 return BPoint(left, bottom);
122 left(0),
131 BRect::BRect(float left, float top, float right, float bottom) argument
133 left(left),
144 left(othe
197 Set(float left, float top, float right, float bottom) argument
[all...]
/haiku/src/servers/app/
H A DIntRect.cpp18 left = p.x;
34 left = p.x;
50 left += point.x;
60 left += dx;
104 left += point.x;
114 left += dx;
158 right = (right - left) + point.x;
159 left = point.x;
168 right = (right - left) + x;
169 left
[all...]
H A DIntRect.h20 int32 left; member in class:IntRect
80 { return BRect(left, top,
99 return *(const IntPoint*)&left;
113 return IntPoint(left, bottom);
127 top = left = 0;
135 left = l;
145 left = r.left;
155 left = (int32)r.left;
[all...]
/haiku/src/kits/interface/
H A DRegionSupport.cpp57 * given upper-left y coordinate (top) will have the same lower-right y
61 * several shorter rectangles to account for shorter rectangles to its left
99 ((r1)->right > (r2)->left && \
100 (r1)->left < (r2)->right && \
108 if ((r)->left < (idRect)->fBounds.left)\
109 (idRect)->fBounds.left = (r)->left;\
140 ((R-1)->left <= (Rx1)) &&\
147 (r)->left
412 register int left; local
[all...]
/haiku/src/add-ons/print/drivers/pcl6/
H A DRasterizer.cpp28 fBounds.left = (int)bounds.left;
43 fWidth = fBounds.right - fBounds.left + 1;
48 // offset to top, left point of rect
49 fBits += fBounds.top * fBPR + fBounds.left * 4;
52 fX = fBounds.left;
/haiku/src/system/boot/platform/generic/
H A Dvideo_blit.cpp30 uint16 height, uint16 imageWidth, uint16 left, uint16 top)
33 + gKernelArgs.frame_buffer.bytes_per_row * top + 4 * left);
53 uint16 height, uint16 imageWidth, uint16 left, uint16 top)
56 + gKernelArgs.frame_buffer.bytes_per_row * top + 3 * left;
77 uint16 height, uint16 imageWidth, uint16 left, uint16 top)
80 + gKernelArgs.frame_buffer.bytes_per_row * top + 2 * left);
102 uint16 height, uint16 imageWidth, uint16 left, uint16 top)
105 + gKernelArgs.frame_buffer.bytes_per_row * top + 2 * left);
127 uint16 height, uint16 imageWidth, uint16 left, uint16 top)
133 + left;
29 blit32(addr_t frameBuffer, const uint8 *data, uint16 width, uint16 height, uint16 imageWidth, uint16 left, uint16 top) argument
52 blit24(addr_t frameBuffer, const uint8 *data, uint16 width, uint16 height, uint16 imageWidth, uint16 left, uint16 top) argument
76 blit16(addr_t frameBuffer, const uint8 *data, uint16 width, uint16 height, uint16 imageWidth, uint16 left, uint16 top) argument
101 blit15(addr_t frameBuffer, const uint8 *data, uint16 width, uint16 height, uint16 imageWidth, uint16 left, uint16 top) argument
126 blit8(addr_t frameBuffer, const uint8 *data, uint16 width, uint16 height, uint16 imageWidth, uint16 left, uint16 top) argument
143 blit4(addr_t frameBuffer, const uint8 *data, uint16 width, uint16 height, uint16 imageWidth, uint16 left, uint16 top) argument
155 video_blit_image(addr_t frameBuffer, const uint8 *data, uint16 width, uint16 height, uint16 imageWidth, uint16 left, uint16 top) argument
[all...]
/haiku/src/add-ons/translators/wonderbrush/support/
H A Dsupport.h58 int32& left, int32& top, int32& right, int32& bottom)
60 left = (int32)floorf(r.left);
57 rect_to_int(BRect r, int32& left, int32& top, int32& right, int32& bottom) argument
/haiku/src/tests/servers/app/newClipping/
H A DWinBorder.cpp41 fDecRegion.Include(BRect(bounds.left-4, bounds.top-4, bounds.right+4, bounds.top-1));
42 fDecRegion.Include(BRect(bounds.left-4, bounds.bottom+1, bounds.right+4, bounds.bottom+4));
43 fDecRegion.Include(BRect(bounds.left-4, bounds.top, bounds.left-1, bounds.bottom));
47 fDecRegion.Include(BRect(bounds.left-4, bounds.top-4-10, bounds.left+bounds.Width()/2, bounds.top-4));
/haiku/headers/private/kernel/boot/platform/generic/
H A Dvideo.h20 uint16 left, uint16 top);
25 uint16 left, uint16 top);
/haiku/headers/private/kernel/util/
H A DSplayTree.h40 Node* left; member in struct:SplayTreeLink
69 nodeLink->left = NULL;
84 nodeLink->left = rootLink->left;
86 rootLink->left = NULL;
89 nodeLink->left = fRoot;
110 if (rootLink->left == NULL) {
114 fRoot = rootLink->left;
136 if (rootLink->left == NULL) {
140 fRoot = rootLink->left;
293 Node*& left = Definition::GetLink(t)->left; local
[all...]
/haiku/src/system/libnetwork/netresolv/isc/
H A Dtree.c118 RET(tree_srch(&(**ppr_tree).left,
162 if (!tree_trav(&(**ppr_tree).left, pfi_uar))
175 tree_mung(&(**ppr_tree).left, pfv_uar);
201 (*ppr)->left = NULL;
214 /* if LESS, prepare to move to the left.
217 MSG("LESS. sprouting left.")
218 sub = sprout(&(*ppr)->left, p_data, pi_balance,
220 if (sub && *pi_balance) { /*%< left branch has grown */
221 MSG("LESS: left branch has grown")
230 /* balance WAS okay; now left branc
[all...]

Completed in 208 milliseconds

1234567891011>>