Searched refs:right (Results 1 - 25 of 630) sorted by relevance

1234567891011>>

/haiku/src/apps/processcontroller/
H A DNoiseBarMenuItem.cpp55 frame.right -= 24;
56 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);
77 if (grenze1 > frame.right)
78 grenze1 = frame.right;
79 if (grenze2 > frame.right)
80 grenze2 = frame.right;
81 r.right = grenze1;
84 if (r.left < r.right) {
[all...]
H A DKernelMemoryBarMenuItem.cpp76 BRect cadre (frame.right - kMargin - kBarWidth, frame.top + kBarPadding,
77 frame.right - kMargin, frame.bottom - kBarPadding);
91 double grenze1 = cadre.left + (cadre.right - cadre.left)
93 double grenze2 = cadre.left + (cadre.right - cadre.left)
95 if (grenze1 > cadre.right)
96 grenze1 = cadre.right;
97 if (grenze2 > cadre.right)
98 grenze2 = cadre.right;
99 r.right = grenze1;
102 if (r.left < r.right) {
[all...]
H A DThreadBarMenuItem.cpp60 frame.right -= 24;
61 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);
82 if (grenze1 > frame.right)
83 grenze1 = frame.right;
84 if (grenze2 > frame.right)
85 grenze2 = frame.right;
86 r.right = grenze1;
91 if (r.left < r.right) {
[all...]
H A DMemoryBarMenuItem.cpp121 BRect rect(frame.right - kMargin - kBarWidth, frame.top + kBarPadding,
122 frame.right - kMargin, frame.bottom - kBarPadding);
139 double grenze1 = rect.left + (rect.right - rect.left) * float(fWriteMemory)
141 double grenze2 = rect.left + (rect.right - rect.left) * float(fAllMemory)
143 if (grenze1 > rect.right)
144 grenze1 = rect.right;
145 if (grenze2 > rect.right)
146 grenze2 = rect.right;
147 r.right = grenze1;
150 if (r.left < r.right) {
[all...]
H A DTeamBarMenuItem.cpp127 frame.right -= 24;
128 frame.left = frame.right-kBarWidth;
149 float grenze1 = frame.left + (frame.right - frame.left)
151 float grenze2 = frame.left + (frame.right - frame.left)
154 if (grenze1 > frame.right)
155 grenze1 = frame.right;
157 if (grenze2 > frame.right)
158 grenze2 = frame.right;
160 r.right = grenze1;
164 if (r.left < r.right) {
[all...]
/haiku/src/add-ons/print/drivers/gutenprint/
H A DRectangle.h23 right(0),
34 right(static_cast<T>(rect.right)),
40 Rectangle(T left, T top, T right, T bottom) argument
44 right(right),
53 right = static_cast<T>(rect.right);
60 return right - left;
71 T right; member in class:Rectangle
[all...]
/haiku/src/libs/alm/
H A DColumn.cpp31 * The right boundary of the column.
53 Column::Column(LinearSpec* ls, XTab* left, XTab* right) argument
56 fRight(right),
H A DALMGroup.cpp53 ALMGroup::operator|(const ALMGroup& right) argument
55 return _AddItem(right, B_HORIZONTAL);
67 ALMGroup::BuildLayout(BALMLayout* layout, XTab* left, YTab* top, XTab* right, argument
74 if (right == NULL)
75 right = layout->Right();
79 _Build(layout, left, top, right, bottom);
100 BReference<YTab> top, BReference<XTab> right, BReference<YTab> bottom) const
103 layout->AddItem(LayoutItem(), left, top, right, bottom); local
105 layout->AddView(View(), left, top, right, bottom); local
112 currentRight = right;
99 _Build(BALMLayout* layout, BReference<XTab> left, BReference<YTab> top, BReference<XTab> right, BReference<YTab> bottom) const argument
[all...]
H A DALMLayoutBuilder.cpp62 XTab* right, YTab* bottom)
64 Area* a = (fLayout->AddView(view, left, top, right, bottom));
80 XTab* right, YTab* bottom)
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);
154 XTab* right = currentArea->Left(); local
160 return Add(view, left, top, right, bottom);
170 BReference<XTab> right = _right; local
172 right
61 Add(BView* view, XTab* left, YTab* top, XTab* right, YTab* bottom) argument
79 Add(BLayoutItem* item, XTab* left, YTab* top, XTab* right, YTab* bottom) argument
183 AddAbove(BView* view, YTab* _top, XTab* left, XTab* right) argument
201 AddBelow(BView* view, YTab* _bottom, XTab* left, XTab* right) argument
226 XTab* right = currentArea->Left(); local
242 BReference<XTab> right = _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...]
/haiku/src/servers/app/drawing/
H A Ddrawing_support.cpp10 rect->right = roundf(rect->right);
/haiku/headers/private/interface/
H A Dclipping.h49 rect.right = max_c(r1.right, r2.right);
66 rect.right = min_c(r1.right, r2.right);
79 rect.right += x;
89 rect.right = (int)((rect.right + 1) * x) - 1;
99 (float)rect.right, (floa
[all...]
/haiku/src/system/kernel/util/
H A DAVLTreeBase.cpp84 while (node->right)
85 node = node->right;
96 // The previous node cannot be in the right subtree.
98 // We have a left subtree, so go to the right-most node.
100 while (node->right)
101 node = node->right;
104 // took the right branch.
122 if (node->right) {
123 // We have a right subtree, so go to the left-most node.
124 node = node->right;
303 AVLTreeNode* right = node->right; local
358 AVLTreeNode** right = &(*node)->right; local
447 AVLTreeNode** right = &(*node)->right; local
[all...]
/haiku/src/system/libroot/posix/glibc/misc/
H A Dtsearch.c47 Adding to a red/black tree is rather easy. The right place is searched
97 struct node_t *right; member in struct:node_t
122 check_tree_recurse (p->right, d_sofar + (p->right && !p->right->red), d_total);
125 if (p->right)
126 assert (!(p->right->red && p->red));
161 rp = &(*rootp)->right;
182 1. The edge types (left or right) of the two red edges differ.
198 gp->right
[all...]
/haiku/headers/libs/print/libprint/
H A DValidRect.h16 int right; member in struct:RECT
/haiku/headers/os/interface/
H A DRect.h19 float right; member in class:BRect
24 BRect(float left, float top, float right,
31 void Set(float left, float top, float right,
101 return *(const BPoint*)&right;
115 return BPoint(right, top);
124 right(-1),
131 BRect::BRect(float left, float top, float right, float bottom) argument
135 right(right),
146 right(othe
197 Set(float left, float top, float right, float bottom) argument
[all...]
/haiku/src/servers/app/
H A DIntRect.cpp26 right = p.x;
42 right = p.x;
51 right -= point.x;
61 right -= dx;
105 right += point.x;
115 right += dx;
158 right = (right - left) + point.x;
168 right = (right
[all...]
H A DIntRect.h22 int32 right; member in class:IntRect
81 right, bottom); }
106 return *(const IntPoint*)&right;
120 return IntPoint(right, top);
128 bottom = right = -1;
137 right = r;
147 right = r.right;
157 right = (int32)r.right;
[all...]
/haiku/src/apps/icon-o-matic/generic/gui/popup_control/
H A DSliderView.cpp42 fButtonRect.right = fButtonRect.left + buttonWidth;
95 BPoint(r.right, r.top), lightShadow);
96 AddLine(BPoint(r.right, r.top + 1.0),
97 BPoint(r.right, r.bottom), darkShadow);
98 AddLine(BPoint(r.right - 1.0, r.bottom),
105 BPoint(r.right, r.top), light);
106 AddLine(BPoint(r.right, r.top + 1.0),
107 BPoint(r.right, r.bottom), shadow);
108 AddLine(BPoint(r.right - 1.0, r.bottom),
115 BPoint(r.right,
[all...]
H A DInputSlider.cpp114 frame.right -= 10.0;
193 BPoint(r.right, r.top), lightShadow);
194 AddLine(BPoint(r.right, r.top + 1.0),
195 BPoint(r.right, r.bottom), light);
196 AddLine(BPoint(r.right - 1.0, r.bottom),
204 BPoint(r.right, r.top), darkShadow);
205 AddLine(BPoint(r.right, r.top + 1.0),
206 BPoint(r.right, r.bottom), background);
207 AddLine(BPoint(r.right - 1.0, r.bottom),
210 r.left = r.right
[all...]
/haiku/headers/private/kernel/util/
H A DSplayTree.h41 Node* right; member in struct:SplayTreeLink
70 nodeLink->right = NULL;
85 nodeLink->right = fRoot;
88 nodeLink->right = rootLink->right;
90 rootLink->right = NULL;
111 fRoot = rootLink->right;
113 Node* temp = rootLink->right;
116 Definition::GetLink(fRoot)->right = temp;
137 fRoot = rootLink->right;
314 Node*& right = Definition::GetLink(t)->right; local
[all...]
/haiku/src/add-ons/translators/wonderbrush/support/
H A Dsupport.h58 int32& left, int32& top, int32& right, int32& bottom)
62 right = (int32)ceilf(r.right);
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));
44 fDecRegion.Include(BRect(bounds.right+1, bounds.top, bounds.right+4, bounds.bottom));
50 fDecRegion.Include(BRect(bounds.right-10, bounds.bottom-10, bounds.right, bounds.bottom));
/haiku/src/kits/interface/
H A DRegionSupport.cpp57 * given upper-left y coordinate (top) will have the same lower-right y
62 * or right but within its "vertical scope".
96 * Remember, right and bottom are not in the region
99 ((r1)->right > (r2)->left && \
100 (r1)->left < (r2)->right && \
112 if ((r)->right > (idRect)->fBounds.right)\
113 (idRect)->fBounds.right = (r)->right;\
141 ((R-1)->right >
413 register int right; local
[all...]
/haiku/src/system/libnetwork/netresolv/isc/
H A Dtree.c113 RET(tree_srch(&(**ppr_tree).right,
166 if (!tree_trav(&(**ppr_tree).right, pfi_uar))
176 tree_mung(&(**ppr_tree).right, pfv_uar);
202 (*ppr)->right = NULL;
224 /* right branch WAS longer; bal is ok now */
240 (*ppr)->left = p1->right;
241 p1->right = *ppr;
247 p2 = p1->right;
248 p1->right = p2->left;
251 (*ppr)->left = p2->right;
[all...]
/haiku/src/apps/launchbox/
H A Dsupport.cpp70 stroke_frame(BView* v, BRect r, rgb_color left, rgb_color top, rgb_color right, argument
78 BPoint(r.right, r.top), top);
79 v->AddLine(BPoint(r.right, r.top + 1.0),
80 BPoint(r.right, r.bottom), right); local
81 v->AddLine(BPoint(r.right - 1.0, r.bottom),
100 frame.right -= frame.Width() - screenFrame.Width() + 10.0;
104 if (frame.right > screenFrame.right)
105 frame.OffsetBy(-(frame.right
[all...]

Completed in 196 milliseconds

1234567891011>>