| /external/hyphenation/ |
| substrings.c | 27 int left=0, right=max-1;
local
28 while (left <= right) {
29 int mid = ((right-left)/2)+left;
34 right = mid -1;
64 int right,
69 swap2(a,b,p,right); // Move pivot to end
71 for (i=left; i<right; i++) {
77 swap2(a,b,right,p); // Move pivot to its final place
88 int right
90 while (right > left) {
[all...] |
| /external/skia/src/core/ |
| SkRect.cpp | 12 void SkIRect::join(int32_t left, int32_t top, int32_t right, int32_t bottom) {
14 if (left >= right || top >= bottom) {
20 this->set(left, top, right, bottom);
24 if (right > fRight) fRight = right;
133 bool SkRect::intersect(SkScalar left, SkScalar top, SkScalar right,
135 if (left < right && top < bottom && !this->isEmpty() && // check for empties
136 fLeft < right && left < fRight && fTop < bottom && top < fBottom)
140 if (fRight > right) fRight = right;
[all...] |
| /frameworks/base/graphics/java/android/graphics/ |
| Region.java | 71 nativeSetRect(mNativeRegion, r.left, r.top, r.right, r.bottom);
76 public Region(int left, int top, int right, int bottom) {
78 nativeSetRect(mNativeRegion, left, top, right, bottom);
97 return nativeSetRect(mNativeRegion, r.left, r.top, r.right, r.bottom);
102 public boolean set(int left, int top, int right, int bottom) {
103 return nativeSetRect(mNativeRegion, left, top, right, bottom);
182 return quickContains(r.left, r.top, r.right, r.bottom);
191 public native boolean quickContains(int left, int top, int right,
200 return quickReject(r.left, r.top, r.right, r.bottom);
208 public native boolean quickReject(int left, int top, int right, int bottom)
[all...] |
| /external/chromium_org/v8/benchmarks/spinning-balls/ |
| splay-tree.js | 79 node.right = this.root_.right;
80 this.root_.right = null;
82 node.right = this.root_;
108 this.root_ = this.root_.right;
110 var right = this.root_.right;
112 // Splay to make sure that the new root has an empty right child.
114 // Insert the original right child as the right child of the ne
[all...] |
| /external/v8/benchmarks/spinning-balls/ |
| splay-tree.js | 79 node.right = this.root_.right;
80 this.root_.right = null;
82 node.right = this.root_;
108 this.root_ = this.root_.right;
110 var right = this.root_.right;
112 // Splay to make sure that the new root has an empty right child.
114 // Insert the original right child as the right child of the ne
[all...] |
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/parallel/ |
| losertree.h | 187 unsigned int right = init_winner (2 * root + 1); local
188 if (losers[right].sup
190 && !comp(losers[right].key, losers[left].key)))
193 losers[root] = losers[right];
198 // Right one is less.
200 return right;
282 unsigned int right = init_winner (2 * root + 1); local
283 if (losers[right].sup ||
285 && !comp(losers[right].key, losers[left].key)))
288 losers[root] = losers[right];
415 unsigned int right = init_winner (2 * root + 1); local
495 unsigned int right = init_winner (2 * root + 1); local
639 unsigned int right = init_winner (2 * root + 1); local
722 unsigned int right = init_winner (2 * root + 1); local
876 unsigned int right = init_winner (2 * root + 1); local
959 unsigned int right = init_winner (2 * root + 1); local
[all...] |
| /external/chromium_org/v8/tools/ |
| splaytree.js | 81 node.right = this.root_.right;
82 this.root_.right = null;
84 node.right = this.root_;
110 this.root_ = this.root_.right;
112 var right = this.root_.right;
114 // Splay to make sure that the new root has an empty right child.
116 // Insert the original right child as the right child of the ne
[all...] |
| /external/dropbear/libtomcrypt/src/ciphers/ |
| kasumi.c | 103 u16 left, right; local
107 right = (u16) in&0xFFFF;
112 left ^= right;
114 right ^= key->kasumi.KOi2[round_no];
115 right = FI( right, key->kasumi.KIi2[round_no] );
116 right ^= left;
120 left ^= right;
122 return (((ulong32)right)<<16)+left;
128 /* split out the left and right halves *
143 ulong32 left, right, temp; local
170 ulong32 left, right, temp; local
[all...] |
| /external/v8/tools/ |
| splaytree.js | 81 node.right = this.root_.right;
82 this.root_.right = null;
84 node.right = this.root_;
110 this.root_ = this.root_.right;
112 var right = this.root_.right;
114 // Splay to make sure that the new root has an empty right child.
116 // Insert the original right child as the right child of the ne
[all...] |
| /cts/tests/tests/graphics/src/android/graphics/cts/ |
| RectFTest.java | 62 assertEquals(5.0f, mRectF.right);
68 assertEquals(10.0f, mRectF.right);
79 assertEquals(3.0f, mRectF.right);
91 assertEquals(3.0f, mRectF.right);
103 assertEquals(3.0f, mRectF.right);
114 assertEquals(10.0f, mRectF.right);
121 assertEquals(10.0f, mRectF.right);
147 assertEquals(10.0f, mRectF.right);
154 assertEquals(10.0f, mRectF.right);
168 assertEquals(10.0f, mRectF.right);
[all...] |
| EmbossMaskFilterTest.java | 62 Rect right = new Rect(CENTER_X, 0, BITMAP_WIDTH, BITMAP_HEIGHT); local
65 assertTrue(brightness(bitmap, left) > brightness(bitmap, right));
72 left.right = START_X;
74 right.left = END_X;
75 assertEquals(0, brightness(bitmap, right));
85 for (int x = rect.left; x < rect.right; x++) {
|
| /external/chromium_org/cc/resources/ |
| layer_tiling_data.cc | 72 int* right,
82 *right = tiling_data_.TileXIndexFromSrcCoord(content_rect.right() - 1);
98 int left, top, right, bottom; local
99 ContentRectToTileIndices(content_rect, &left, &top, &right, &bottom);
101 for (int i = left; i <= right; ++i) {
123 int left, top, right, bottom; local
125 gfx::Rect(size), &left, &top, &right, &bottom); local
128 if (it->first.first > right || it->first.second > bottom)
|
| /external/chromium_org/third_party/WebKit/Source/core/platform/ |
| PODRedBlackTree.h | 286 Node* right() const { return m_right; } function in class:WebCore::PODRedBlackTree::Node
309 // given node based on the values in the left and right children. It
312 // in the left and right children. This method should return true if
339 current = current->right();
353 return treeSearchFullComparisons(current->right(), data);
357 // We may need to traverse both the left and right subtrees.
360 result = treeSearchFullComparisons(current->right(), data);
373 x = x->right();
390 if (x->right())
391 return treeMinimum(x->right());
[all...] |
| /external/guava/guava-tests/test/com/google/common/collect/ |
| BstNodeTest.java | 18 import static com.google.common.collect.BstSide.RIGHT;
55 testLacksChild(leaf, RIGHT);
62 testLacksChild(node, RIGHT);
69 testChildIs(node, RIGHT, leaf);
74 SimpleNode right = new SimpleNode('c', null, null); local
75 SimpleNode node = new SimpleNode('b', left, right);
77 testChildIs(node, RIGHT, right);
96 for (SimpleNode right : GOOD_RIGHTS) {
98 new SimpleNode(MIDDLE_KEY, left, right).orderingInvariantHolds(Ordering.natural()))
[all...] |
| /external/chromium/chrome/common/extensions/docs/examples/extensions/news/css/ |
| options.css | 47 padding-right: 7px;
53 border-bottom-right-radius: 12px 12px;
57 border-top-right-radius: 12px 12px;
67 text-align: right;
73 padding-right: 20px;
76 float: right;
96 float: right;
|
| /external/chromium_org/chrome/common/extensions/docs/examples/extensions/news/css/ |
| options.css | 47 padding-right: 7px;
53 border-bottom-right-radius: 12px 12px;
57 border-top-right-radius: 12px 12px;
67 text-align: right;
73 padding-right: 20px;
76 float: right;
96 float: right;
|
| /external/chromium_org/third_party/WebKit/Source/devtools/front_end/ |
| splitView.css | 34 right: 0;
59 right: 0;
63 right: 0;
72 right: 0;
92 border-right: 1px solid rgb(64%, 64%, 64%);
119 right: 0;
132 border-right: 1px solid gray;
|
| /external/chromium_org/ui/keyboard/resources/webui/ |
| main.css | 45 padding-right: 10px;
47 right: 0;
55 right: 7%;
79 right: 0;
84 /* Left and right-side special keys with a character letter next to them need
89 margin-right: 2px;
92 kb-shift-key.padded-right-special,
93 kb-key.padded-right-special {
133 .right-more {
150 .right-more
[all...] |
| /external/linux-tools-perf/util/ |
| sort.c | 102 sort__thread_cmp(struct hist_entry *left, struct hist_entry *right)
104 return right->thread->pid - left->thread->pid;
144 sort__dso_cmp(struct hist_entry *left, struct hist_entry *right)
147 struct dso *dso_r = right->ms.map ? right->ms.map->dso : NULL;
179 sort__sym_cmp(struct hist_entry *left, struct hist_entry *right)
183 if (left->ms.sym == right->ms.sym)
187 ip_r = right->ms.sym ? right->ms.sym->start : right->ip
[all...] |
| /frameworks/base/libs/hwui/ |
| OpenGLRenderer.h | 173 * @param right The right coordinate of the dirty rectangle
179 virtual status_t prepareDirty(float left, float top, float right, float bottom, bool opaque);
225 ANDROID_API int saveLayer(float left, float top, float right, float bottom,
229 return saveLayer(left, top, right, bottom, paint ? paint->getAlpha() : 255, mode, flags);
231 ANDROID_API int saveLayerAlpha(float left, float top, float right, float bottom,
233 return saveLayer(left, top, right, bottom, alpha, SkXfermode::kSrcOver_Mode, flags);
235 virtual int saveLayer(float left, float top, float right, float bottom,
238 int saveLayerDeferred(float left, float top, float right, float bottom,
257 bool quickRejectPreStroke(float left, float top, float right, float bottom, SkPaint* paint)
[all...] |
| /libcore/luni/src/main/java/java/util/ |
| DualPivotQuicksort.java | 96 * {@code right} index is inclusive, and it does no range checking
97 * on {@code left} or {@code right}.
101 * @param right the index of the last element, inclusive, to be sorted
103 private static void doSort(int[] a, int left, int right) {
105 if (right - left + 1 < INSERTION_SORT_THRESHOLD) {
106 for (int i = left + 1; i <= right; i++) {
115 dualPivotQuicksort(a, left, right);
125 * @param right the index of the last element, inclusive, to be sorted
127 private static void dualPivotQuicksort(int[] a, int left, int right) {
129 int sixth = (right - left + 1) / 6
[all...] |
| /external/chromium/chrome/browser/resources/gpu_internals/ |
| timeline.css | 33 padding-right: 5px;
40 text-align: right;
43 padding-right: 5px;
|
| /external/chromium-trace/trace-viewer/src/ui/ |
| filter_control.css | 16 right: 0.5ex;
17 text-align: right;
31 margin-right: 0;
|
| /external/chromium_org/chrome/browser/resources/chromeos/ |
| wrench_menu.css | 31 .right-button {
33 border-bottom-right-radius: 3px;
34 border-top-right-radius: 3px;
|
| /external/chromium_org/chrome/browser/resources/user_manager/ |
| control_bar.css | 14 right: 0;
31 background-position: right center;
35 background-position: right center;
|
