/external/chromium_org/chrome/browser/resources/ |
H A D | about_version.css | 14 margin-right: auto; 38 float: right; 40 text-align: right; 46 text-align: right; 51 text-align: right;
|
/external/skia/tools/lua/ |
H A D | skia.lua | 20 Sk.Rect = { left = 0, top = 0, right = 0, bottom = 0 } 27 rect = { left = l, top = t, right = r, bottom = b } 30 rect = { right = l, bottom = t } 40 return self.right - self.left 54 value = value * self.right 62 self.right = 0 69 self.right = r 78 self.right = self.right + dx 87 self.right [all...] |
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/tool/ |
H A D | NFAFactory.java | 86 while ( s!=alt.right ) { 120 NFAState right = newState(); 122 right.associatedASTNode = associatedAST; 123 transitionBetweenStates(left, right, label); 124 StateCluster g = new StateCluster(left, right); 138 NFAState right = newState(); 140 right.associatedASTNode = associatedAST; 142 Transition e = new Transition(label,right); 144 StateCluster g = new StateCluster(left, right); 165 NFAState right [all...] |
/external/chromium_org/third_party/icu/source/i18n/ |
H A D | dtrule.cpp | 69 DateTimeRule::operator=(const DateTimeRule& right) { argument 70 if (this != &right) { 71 fMonth = right.fMonth; 72 fDayOfMonth = right.fDayOfMonth; 73 fDayOfWeek = right.fDayOfWeek; 74 fWeekInMonth = right.fWeekInMonth; 75 fMillisInDay = right.fMillisInDay; 76 fDateRuleType = right.fDateRuleType; 77 fTimeRuleType = right.fTimeRuleType;
|
/external/icu4c/i18n/ |
H A D | dtrule.cpp | 69 DateTimeRule::operator=(const DateTimeRule& right) { argument 70 if (this != &right) { 71 fMonth = right.fMonth; 72 fDayOfMonth = right.fDayOfMonth; 73 fDayOfWeek = right.fDayOfWeek; 74 fWeekInMonth = right.fWeekInMonth; 75 fMillisInDay = right.fMillisInDay; 76 fDateRuleType = right.fDateRuleType; 77 fTimeRuleType = right.fTimeRuleType;
|
/external/chromium_org/sync/internal_api/ |
H A D | syncapi_internal.cc | 57 const sync_pb::EntitySpecifics& right) { 70 if (right.has_encrypted()) { 71 if (!cryptographer->CanDecrypt(right.encrypted())) { 75 right_plaintext = cryptographer->DecryptToString(right.encrypted()); 77 right_plaintext = right.SerializeAsString(); 55 AreSpecificsEqual(const Cryptographer* cryptographer, const sync_pb::EntitySpecifics& left, const sync_pb::EntitySpecifics& right) argument
|
/external/chromium_org/third_party/WebKit/Source/core/animation/ |
H A D | AnimatableLengthBox.h | 41 static PassRefPtr<AnimatableLengthBox> create(PassRefPtr<AnimatableValue> left, PassRefPtr<AnimatableValue> right, PassRefPtr<AnimatableValue> top, PassRefPtr<AnimatableValue> bottom) argument 43 return adoptRef(new AnimatableLengthBox(left, right, top, bottom)); 46 const AnimatableValue* right() const { return m_right.get(); } function in class:WebCore::AnimatableLengthBox 55 AnimatableLengthBox(PassRefPtr<AnimatableValue> left, PassRefPtr<AnimatableValue> right, PassRefPtr<AnimatableValue> top, PassRefPtr<AnimatableValue> bottom) argument 57 , m_right(right)
|
/external/chromium_org/third_party/icu/source/common/ |
H A D | uarrsort.c | 31 uprv_uint16Comparator(const void *context, const void *left, const void *right) { argument 32 return (int32_t)*(const uint16_t *)left - (int32_t)*(const uint16_t *)right; 36 uprv_int32Comparator(const void *context, const void *left, const void *right) { argument 37 return *(const int32_t *)left - *(const int32_t *)right; 41 uprv_uint32Comparator(const void *context, const void *left, const void *right) { argument 42 uint32_t l=*(const uint32_t *)left, r=*(const uint32_t *)right; 123 int32_t left, right; local 125 /* start and left are inclusive, limit and right are exclusive */ 133 right=limit; 144 while(/* x<array[right [all...] |
/external/chromium_org/third_party/skia/src/core/ |
H A D | SkTSort.h | 121 template <typename T, typename C> static void SkTInsertionSort(T* left, T* right, C lessThan) { argument 122 for (T* next = left + 1; next <= right; ++next) { 136 static T* SkTQSort_Partition(T* left, T* right, T* pivot, C lessThan) { argument 138 SkTSwap(*pivot, *right); 140 while (left < right) { 147 SkTSwap(*newPivot, *right); 154 * This implementation recurses on the left region after pivoting and loops on the right, 160 * @param right the end of the region to be sorted (inclusive). 163 template <typename T, typename C> void SkTIntroSort(int depth, T* left, T* right, C lessThan) { argument 165 if (right 191 SkTQSort(T* left, T* right, C lessThan) argument 201 SkTQSort(T* left, T* right) argument 206 SkTQSort(T** left, T** right) argument [all...] |
/external/chromium_org/ui/gfx/ |
H A D | insets_base.h | 20 Type right() const { return right_; } function in class:gfx::InsetsBase 23 // left and right insets. 33 void Set(Type top, Type left, Type bottom, Type right) { argument 37 right_ = right; 61 InsetsBase(Type top, Type left, Type bottom, Type right) argument 65 right_(right) {}
|
/external/icu4c/common/ |
H A D | uarrsort.c | 31 uprv_uint16Comparator(const void *context, const void *left, const void *right) { argument 32 return (int32_t)*(const uint16_t *)left - (int32_t)*(const uint16_t *)right; 36 uprv_int32Comparator(const void *context, const void *left, const void *right) { argument 37 return *(const int32_t *)left - *(const int32_t *)right; 41 uprv_uint32Comparator(const void *context, const void *left, const void *right) { argument 42 uint32_t l=*(const uint32_t *)left, r=*(const uint32_t *)right; 123 int32_t left, right; local 125 /* start and left are inclusive, limit and right are exclusive */ 133 right=limit; 144 while(/* x<array[right [all...] |
/external/libvpx/libvpx/vp9/common/ |
H A D | vp9_treecoder.c | 41 unsigned int left, right; local 49 right = num_events[-tree[i + 1]]; 51 right = convert_distribution(tree[i + 1], tree, branch_ct, num_events); 54 branch_ct[i >> 1][1] = right; 55 return left + right;
|
/external/lzma/CPP/7zip/Common/ |
H A D | FilePathAutoRename.cpp | 45 unsigned left = 1, right = (1 << 30);
local 46 while (left != right)
48 unsigned mid = (left + right) / 2;
52 right = mid;
54 return !MakeAutoName(name, extension, right, fullProcessedPath);
|
/external/skia/src/core/ |
H A D | SkTSort.h | 121 template <typename T, typename C> static void SkTInsertionSort(T* left, T* right, C lessThan) { argument 122 for (T* next = left + 1; next <= right; ++next) { 136 static T* SkTQSort_Partition(T* left, T* right, T* pivot, C lessThan) { argument 138 SkTSwap(*pivot, *right); 140 while (left < right) { 147 SkTSwap(*newPivot, *right); 154 * This implementation recurses on the left region after pivoting and loops on the right, 160 * @param right the end of the region to be sorted (inclusive). 163 template <typename T, typename C> void SkTIntroSort(int depth, T* left, T* right, C lessThan) { argument 165 if (right 191 SkTQSort(T* left, T* right, C lessThan) argument 201 SkTQSort(T* left, T* right) argument 206 SkTQSort(T** left, T** right) argument [all...] |
/external/chromium_org/third_party/WebKit/Source/core/rendering/ |
H A D | GapRects.h | 33 const LayoutRect& right() const { return m_right; } function in struct:WebCore::GapRects 38 void unite(const GapRects& o) { uniteLeft(o.left()); uniteCenter(o.center()); uniteRight(o.right()); } 50 return m_left == other.left() && m_center == other.center() && m_right == other.right();
|
/external/valgrind/main/helgrind/tests/ |
H A D | tc14_laog_dinphils.c | 16 long right = (left + 1) % 5; local 19 pthread_mutex_lock(&chop[right]); 22 pthread_mutex_unlock(&chop[right]);
|
/external/chromium_org/chrome/browser/resources/memory_internals/ |
H A D | snapshot_view.css | 6 text-align: right; 30 text-align: right; 35 text-align: right;
|
/external/chromium_org/chrome/browser/resources/ntp4/ |
H A D | incognito_tab.css | 16 float: right; 28 margin-right: auto; 48 right: 0;
|
/external/apache-xml/src/main/java/org/apache/xpath/operations/ |
H A D | Div.java | 39 * @param right non-null reference to the evaluated right operand. 45 public XObject operate(XObject left, XObject right) argument 48 return new XNumber(left.num() / right.num());
|
H A D | Minus.java | 39 * @param right non-null reference to the evaluated right operand. 46 public XObject operate(XObject left, XObject right) argument 49 return new XNumber(left.num() - right.num());
|
H A D | Mod.java | 39 * @param right non-null reference to the evaluated right operand. 45 public XObject operate(XObject left, XObject right) argument 48 return new XNumber(left.num() % right.num());
|
H A D | Mult.java | 39 * @param right non-null reference to the evaluated right operand. 45 public XObject operate(XObject left, XObject right) argument 48 return new XNumber(left.num() * right.num());
|
H A D | Neg.java | 38 * @param right non-null reference to the evaluated right operand. 44 public XObject operate(XObject right) throws javax.xml.transform.TransformerException argument 46 return new XNumber(-right.num());
|
H A D | Plus.java | 39 * @param right non-null reference to the evaluated right operand. 45 public XObject operate(XObject left, XObject right) argument 48 return new XNumber(left.num() + right.num());
|
/external/chromium-trace/trace-viewer/src/tcmalloc/ |
H A D | tcmalloc_snapshot_view.css | 40 /* Allocation size in MB, right-aligned for easier comparison of columns. */ 43 padding-right: 10px; 44 text-align: right; 51 padding-right: 10px; 52 text-align: right; 56 /* Trace name, inline so it appears to the right of the byte count. */
|