HomeSort by relevance Sort by last modified time
    Searched defs:left (Results 151 - 175 of 2695) sorted by null

1 2 3 4 5 67 8 91011>>

  /external/toybox/toys/pending/
vi.c 29 long top, left; member in struct:linestack_show
  /external/v8/benchmarks/spinning-balls/
splay-tree.js 78 node.left = this.root_;
83 node.left = this.root_.left;
84 this.root_.left = null;
107 if (!this.root_.left) {
111 this.root_ = this.root_.left;
165 // the left subtree.
168 } else if (this.root_.left) {
169 return this.findMax(this.root_.left);
204 // the L tree of the algorithm. The left child of the dummy nod
275 SplayTree.Node.prototype.left = null; method in class:SplayTree.Node
    [all...]
  /external/webrtc/webrtc/voice_engine/
utility.cc 92 int32_t left = 0; local
95 left = source[i] + target[i * 2];
97 target[i * 2] = WebRtcSpl_SatW32ToW16(left);
  /external/wpa_supplicant_8/src/crypto/
aes-omac1.c 49 size_t i, e, left, total_len; local
62 left = total_len;
68 while (left >= AES_BLOCK_SIZE) {
77 left == AES_BLOCK_SIZE)
84 if (left > AES_BLOCK_SIZE)
86 left -= AES_BLOCK_SIZE;
93 if (left || total_len == 0) {
94 for (i = 0; i < left; i++) {
101 if (i + 1 == left)
108 cbc[left] ^= 0x80
    [all...]
sha1-pbkdf2.c 77 size_t left = buflen, plen; local
80 while (left > 0) {
85 plen = left > SHA1_MAC_LEN ? SHA1_MAC_LEN : left;
88 left -= plen;
  /external/wpa_supplicant_8/src/eap_common/
eap_pax_common.c 39 size_t num_blocks, left; local
57 left = output_len;
59 size_t clen = left > EAP_PAX_MAC_LEN ? EAP_PAX_MAC_LEN : left;
64 left -= clen;
  /frameworks/base/core/java/android/animation/
RectEvaluator.java 59 * (left, top, right, and bottom).
73 int left = startValue.left + (int) ((endValue.left - startValue.left) * fraction); local
78 return new Rect(left, top, right, bottom);
80 mRect.set(left, top, right, bottom);
  /frameworks/base/core/tests/coretests/src/android/app/usage/
UsageStatsTest.java 31 private UsageStats left; field in class:UsageStatsTest
36 left = new UsageStats();
42 left.mPackageName = "com.test";
43 left.mBeginTimeStamp = 100000;
47 left.add(right);
49 assertThat(left.getFirstTimeStamp()).isEqualTo(99999);
54 left.mPackageName = "com.test";
55 left.mEndTimeStamp = 100000;
59 left.add(right);
61 assertThat(left.getLastTimeStamp()).isEqualTo(100001)
    [all...]
  /frameworks/base/graphics/java/android/graphics/
Insets.java 31 public final int left; field in class:Insets
36 private Insets(int left, int top, int right, int bottom) {
37 this.left = left;
48 * @param left the left inset
55 public static Insets of(int left, int top, int right, int bottom) {
56 if (left == 0 && top == 0 && right == 0 && bottom == 0) {
59 return new Insets(left, top, right, bottom);
70 return (r == null) ? NONE : of(r.left, r.top, r.right, r.bottom)
    [all...]
  /frameworks/base/media/tests/MediaFrameworkTest/src/com/android/mediaframeworktest/helpers/
CameraUtils.java 59 long left = widthA * (long) heightA; local
61 if (left == right) {
62 left = widthA;
65 return (left < right) ? -1 : (left > right ? 1 : 0);
  /frameworks/base/packages/SystemUI/src/com/android/systemui/recents/misc/
RectFEvaluator.java 33 * (left, top, right, and bottom).
45 float left = startValue.left + ((endValue.left - startValue.left) * fraction); local
49 mRect.set(left, top, right, bottom);
  /frameworks/data-binding/extensions/baseAdapters/src/main/java/android/databinding/adapters/
CardViewBindingAdapter.java 37 public static void setContentPaddingLeft(CardView view, int left) {
41 view.setContentPadding(left, top, right, bottom);
46 int left = view.getContentPaddingLeft(); local
49 view.setContentPadding(left, top, right, bottom);
54 int left = view.getContentPaddingLeft(); local
57 view.setContentPadding(left, top, right, bottom);
62 int left = view.getContentPaddingLeft(); local
65 view.setContentPadding(left, top, right, bottom);
  /frameworks/support/transition/src/android/support/transition/
RectEvaluator.java 63 * (left, top, right, and bottom).
77 int left = startValue.left + (int) ((endValue.left - startValue.left) * fraction); local
82 return new Rect(left, top, right, bottom);
84 mRect.set(left, top, right, bottom);
  /frameworks/wilhelm/src/itf/
IOutputMixExt.cpp 29 short left; member in struct:__anon39837
244 mixBuffer->left += (short) (source->left * track->mGains[0]);
250 mixBuffer->left += source->left;
258 mixBuffer->left = (short) (source->left * track->mGains[0]);
  /packages/apps/Messaging/src/com/android/messaging/ui/animation/
RectEvaluatorCompat.java 39 int left = startValue.left + (int) ((endValue.left - startValue.left) * fraction); local
43 return new Rect(left, top, right, bottom);
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/ext/pb_ds/detail/binary_heap_/
erase_fn_imps.hpp 108 const size_type left = partition(pred_t(pred)); local
109 _GLIBCXX_DEBUG_ASSERT(m_size >= left);
110 const size_type ersd = m_size - left;
111 for (size_type i = left; i < m_size; ++i)
117 resize_policy::get_new_size_for_arbitrary(left);
120 std::copy(m_a_entries, m_a_entries + left, new_entries);
128 m_size = left;
187 size_type left = 0; local
190 while (right + 1 != left)
192 _GLIBCXX_DEBUG_ASSERT(left <= m_size)
    [all...]
split_join_fn_imps.hpp 53 const size_type left = partition(pred_t(pred)); local
54 _GLIBCXX_DEBUG_ASSERT(m_size >= left);
56 const size_type ersd = m_size - left;
59 const size_type new_size = resize_policy::get_new_size_for_arbitrary(left);
84 _GLIBCXX_DEBUG_ASSERT(new_size >= left);
85 std::copy(m_a_entries, m_a_entries + left, a_entries);
86 std::copy(m_a_entries + left, m_a_entries + m_size, a_other_entries);
94 m_size = left;
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/ext/pb_ds/detail/binary_heap_/
erase_fn_imps.hpp 108 const size_type left = partition(pred_t(pred)); local
109 _GLIBCXX_DEBUG_ASSERT(m_size >= left);
110 const size_type ersd = m_size - left;
111 for (size_type i = left; i < m_size; ++i)
117 resize_policy::get_new_size_for_arbitrary(left);
120 std::copy(m_a_entries, m_a_entries + left, new_entries);
128 m_size = left;
187 size_type left = 0; local
190 while (right + 1 != left)
192 _GLIBCXX_DEBUG_ASSERT(left <= m_size)
    [all...]
split_join_fn_imps.hpp 53 const size_type left = partition(pred_t(pred)); local
54 _GLIBCXX_DEBUG_ASSERT(m_size >= left);
56 const size_type ersd = m_size - left;
59 const size_type new_size = resize_policy::get_new_size_for_arbitrary(left);
84 _GLIBCXX_DEBUG_ASSERT(new_size >= left);
85 std::copy(m_a_entries, m_a_entries + left, a_entries);
86 std::copy(m_a_entries + left, m_a_entries + m_size, a_other_entries);
94 m_size = left;
  /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/ext/pb_ds/detail/binary_heap_/
erase_fn_imps.hpp 108 const size_type left = partition(pred_t(pred)); local
109 _GLIBCXX_DEBUG_ASSERT(m_size >= left);
110 const size_type ersd = m_size - left;
111 for (size_type i = left; i < m_size; ++i)
117 resize_policy::get_new_size_for_arbitrary(left);
120 std::copy(m_a_entries, m_a_entries + left, new_entries);
128 m_size = left;
187 size_type left = 0; local
190 while (right + 1 != left)
192 _GLIBCXX_DEBUG_ASSERT(left <= m_size)
    [all...]
split_join_fn_imps.hpp 53 const size_type left = partition(pred_t(pred)); local
54 _GLIBCXX_DEBUG_ASSERT(m_size >= left);
56 const size_type ersd = m_size - left;
59 const size_type new_size = resize_policy::get_new_size_for_arbitrary(left);
84 _GLIBCXX_DEBUG_ASSERT(new_size >= left);
85 std::copy(m_a_entries, m_a_entries + left, a_entries);
86 std::copy(m_a_entries + left, m_a_entries + m_size, a_other_entries);
94 m_size = left;
  /prebuilts/ndk/r10/sources/cxx-stl/gnu-libstdc++/4.9/include/ext/pb_ds/detail/binary_heap_/
erase_fn_imps.hpp 108 const size_type left = partition(pred_t(pred)); local
109 _GLIBCXX_DEBUG_ASSERT(m_size >= left);
110 const size_type ersd = m_size - left;
111 for (size_type i = left; i < m_size; ++i)
117 resize_policy::get_new_size_for_arbitrary(left);
120 std::copy(m_a_entries, m_a_entries + left, new_entries);
128 m_size = left;
187 size_type left = 0; local
190 while (right + 1 != left)
192 _GLIBCXX_DEBUG_ASSERT(left <= m_size)
    [all...]
split_join_fn_imps.hpp 53 const size_type left = partition(pred_t(pred)); local
54 _GLIBCXX_DEBUG_ASSERT(m_size >= left);
56 const size_type ersd = m_size - left;
59 const size_type new_size = resize_policy::get_new_size_for_arbitrary(left);
84 _GLIBCXX_DEBUG_ASSERT(new_size >= left);
85 std::copy(m_a_entries, m_a_entries + left, a_entries);
86 std::copy(m_a_entries + left, m_a_entries + m_size, a_other_entries);
94 m_size = left;
  /prebuilts/ndk/r11/sources/cxx-stl/gnu-libstdc++/4.9/include/ext/pb_ds/detail/binary_heap_/
erase_fn_imps.hpp 108 const size_type left = partition(pred_t(pred)); local
109 _GLIBCXX_DEBUG_ASSERT(m_size >= left);
110 const size_type ersd = m_size - left;
111 for (size_type i = left; i < m_size; ++i)
117 resize_policy::get_new_size_for_arbitrary(left);
120 std::copy(m_a_entries, m_a_entries + left, new_entries);
128 m_size = left;
187 size_type left = 0; local
190 while (right + 1 != left)
192 _GLIBCXX_DEBUG_ASSERT(left <= m_size)
    [all...]
split_join_fn_imps.hpp 53 const size_type left = partition(pred_t(pred)); local
54 _GLIBCXX_DEBUG_ASSERT(m_size >= left);
56 const size_type ersd = m_size - left;
59 const size_type new_size = resize_policy::get_new_size_for_arbitrary(left);
84 _GLIBCXX_DEBUG_ASSERT(new_size >= left);
85 std::copy(m_a_entries, m_a_entries + left, a_entries);
86 std::copy(m_a_entries + left, m_a_entries + m_size, a_other_entries);
94 m_size = left;

Completed in 1283 milliseconds

1 2 3 4 5 67 8 91011>>