| /external/jsilver/src/com/google/clearsilver/jsilver/functions/operators/ |
| OrFunction.java | 29 Value left = args[0]; local
31 return literalConstant(left.asBoolean() || right.asBoolean(), left, right);
|
| SubtractFunction.java | 33 Value left = args[0]; local
35 return literalConstant(left.asNumber() - right.asNumber(), left, right);
|
| AddFunction.java | 30 Value left = args[0]; local
32 EscapeMode mode = EscapeMode.combineModes(left.getEscapeMode(), right.getEscapeMode());
33 return literalValue(left.asString() + right.asString(), mode, left.isPartiallyEscaped()
|
| /external/skia/src/core/ |
| SkTSort.h | 121 template <typename T, typename C> static void SkTInsertionSort(T* left, T* right, C lessThan) {
122 for (T* next = left + 1; next <= right; ++next) {
125 while (left < hole && lessThan(insert, *(hole - 1))) {
136 static T* SkTQSort_Partition(T* left, T* right, T* pivot, C lessThan) {
139 T* newPivot = left;
140 while (left < right) {
141 if (lessThan(*left, pivotValue)) {
142 SkTSwap(*left, *newPivot);
145 left += 1;
154 * This implementation recurses on the left region after pivoting and loops on the right
[all...] |
| /frameworks/base/core/java/android/animation/ |
| RectEvaluator.java | 30 * (left, top, right, and bottom).
40 return new Rect(startValue.left + (int)((endValue.left - startValue.left) * fraction),
|
| /external/zlib/src/contrib/blast/ |
| blast.c | 42 unsigned left; /* available input at in */ member in struct:state
66 * bit buffer, using shift left.
75 if (s->left == 0) {
76 s->left = s->infun(s->inhow, &(s->in));
77 if (s->left == 0) longjmp(s->env, 1); /* out of input */
80 s->left--;
84 /* drop need bits and update buffer, always zero to seven bits left */
133 int left; /* bits left in next or left to process * local
191 int left; \/* number of possible codes left of current length *\/ local
[all...] |
| /development/ndk/platforms/android-9/include/android/ |
| rect.h | 31 int32_t left; member in struct:ARect
|
| /external/chromium_org/chrome/browser/resources/memory_internals/ |
| extension_view.css | 11 text-align: left;
15 border-left: 1px solid rgb(181, 198, 222);
|
| /external/chromium_org/chrome/browser/resources/options/ |
| certificate_tree.css | 10 padding-left: 1px;
15 margin-left: 3px;
|
| /external/chromium_org/chrome/browser/resources/quota_internals/ |
| main.css | 7 padding-left: 0.5em;
13 float: left;
|
| /external/chromium_org/chrome/common/extensions/docs/examples/api/topsites/magic8ball/ |
| newTab.css | 24 margin-left: 20px;
25 padding-left: 20px;
|
| /external/chromium_org/third_party/WebKit/PerformanceTests/Dromaeo/resources/dromaeo/web/ |
| ie.css | 12 .container { text-align: left; }
30 ol { margin-left:2em;
|
| /external/chromium_org/third_party/angle_dx11/src/third_party/compiler/ |
| ArrayBoundsClamper.cpp | 54 TIntermTyped* left = node->getLeft(); local
55 if (left->isArray() || left->isVector() || left->isMatrix())
|
| /external/valgrind/main/helgrind/tests/ |
| tc14_laog_dinphils.c | 15 long left = (long)arg; local
16 long right = (left + 1) % 5;
18 pthread_mutex_lock(&chop[left]);
21 pthread_mutex_unlock(&chop[left]);
|
| /frameworks/native/include/android/ |
| rect.h | 31 int32_t left; member in struct:ARect
|
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/ext/pb_ds/detail/binary_heap_/ |
| erase_fn_imps.hpp | 123 const size_type left = partition(pred_t(pred)); local
125 _GLIBCXX_DEBUG_ASSERT(m_size >= left);
127 const size_type ersd = m_size - left;
129 for (size_type i = left; i < m_size; ++i)
135 resize_policy::get_new_size_for_arbitrary(left);
139 std::copy(m_a_entries, m_a_entries + left, a_entries);
150 m_size = left;
222 size_type left = 0; local
225 while (right + 1 != left)
227 _GLIBCXX_DEBUG_ASSERT(left <= m_size)
[all...] |
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/i686-linux/include/c++/4.6.x-google/ext/pb_ds/detail/binary_heap_/ |
| erase_fn_imps.hpp | 119 const size_type left = partition(pred_t(pred)); local
121 _GLIBCXX_DEBUG_ASSERT(m_size >= left);
123 const size_type ersd = m_size - left;
125 for (size_type i = left; i < m_size; ++i)
131 resize_policy::get_new_size_for_arbitrary(left);
135 std::copy(m_a_entries, m_a_entries + left, a_entries);
146 m_size = left;
219 size_type left = 0; local
222 while (right + 1 != left)
224 _GLIBCXX_DEBUG_ASSERT(left <= m_size)
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/x86_64-linux/include/c++/4.6.x-google/ext/pb_ds/detail/binary_heap_/ |
| erase_fn_imps.hpp | 119 const size_type left = partition(pred_t(pred)); local
121 _GLIBCXX_DEBUG_ASSERT(m_size >= left);
123 const size_type ersd = m_size - left;
125 for (size_type i = left; i < m_size; ++i)
131 resize_policy::get_new_size_for_arbitrary(left);
135 std::copy(m_a_entries, m_a_entries + left, a_entries);
146 m_size = left;
219 size_type left = 0; local
222 while (right + 1 != left)
224 _GLIBCXX_DEBUG_ASSERT(left <= m_size)
[all...] |
| /prebuilts/ndk/5/sources/cxx-stl/gnu-libstdc++/include/ext/pb_ds/detail/binary_heap_/ |
| erase_fn_imps.hpp | 123 const size_type left = partition(pred_t(pred)); local
125 _GLIBCXX_DEBUG_ASSERT(m_size >= left);
127 const size_type ersd = m_size - left;
129 for (size_type i = left; i < m_size; ++i)
135 resize_policy::get_new_size_for_arbitrary(left);
139 std::copy(m_a_entries, m_a_entries + left, a_entries);
150 m_size = left;
222 size_type left = 0; local
225 while (right + 1 != left)
227 _GLIBCXX_DEBUG_ASSERT(left <= m_size)
[all...] |
| /prebuilts/ndk/6/sources/cxx-stl/gnu-libstdc++/include/ext/pb_ds/detail/binary_heap_/ |
| erase_fn_imps.hpp | 123 const size_type left = partition(pred_t(pred)); local
125 _GLIBCXX_DEBUG_ASSERT(m_size >= left);
127 const size_type ersd = m_size - left;
129 for (size_type i = left; i < m_size; ++i)
135 resize_policy::get_new_size_for_arbitrary(left);
139 std::copy(m_a_entries, m_a_entries + left, a_entries);
150 m_size = left;
222 size_type left = 0; local
225 while (right + 1 != left)
227 _GLIBCXX_DEBUG_ASSERT(left <= m_size)
[all...] |
| /prebuilts/ndk/7/sources/cxx-stl/gnu-libstdc++/include/ext/pb_ds/detail/binary_heap_/ |
| erase_fn_imps.hpp | 123 const size_type left = partition(pred_t(pred)); local
125 _GLIBCXX_DEBUG_ASSERT(m_size >= left);
127 const size_type ersd = m_size - left;
129 for (size_type i = left; i < m_size; ++i)
135 resize_policy::get_new_size_for_arbitrary(left);
139 std::copy(m_a_entries, m_a_entries + left, a_entries);
150 m_size = left;
222 size_type left = 0; local
225 while (right + 1 != left)
227 _GLIBCXX_DEBUG_ASSERT(left <= m_size)
[all...] |
| /prebuilts/ndk/8/platforms/android-14/arch-arm/usr/include/android/ |
| rect.h | 31 int32_t left; member in struct:ARect
|
| /prebuilts/ndk/8/platforms/android-14/arch-mips/usr/include/android/ |
| rect.h | 31 int32_t left; member in struct:ARect
|
| /prebuilts/ndk/8/platforms/android-14/arch-x86/usr/include/android/ |
| rect.h | 31 int32_t left; member in struct:ARect
|
| /prebuilts/ndk/8/platforms/android-9/arch-arm/usr/include/android/ |
| rect.h | 31 int32_t left; member in struct:ARect
|
