HomeSort by relevance Sort by last modified time
    Searched refs:Left (Results 151 - 175 of 431) sorted by null

1 2 3 4 5 67 8 91011>>

  /external/lzma/CPP/7zip/UI/FileManager/
OverwriteDialog.cpp 54 UString s1 = fileName.Left(slashPos + 1);
  /external/pdfium/xfa/fxfa/parser/
cxfa_exclgroup.cpp 28 (void*)XFA_AttributeEnum::Left},
cxfa_field.cpp 31 (void*)XFA_AttributeEnum::Left},
cxfa_subform.cpp 31 (void*)XFA_AttributeEnum::Left},
  /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/gdiplus/
gdiplusmetaheader.h 60 INT16 Left;
  /cts/tests/tests/widget/src/android/widget/cts/util/
ListItemFactory.java 35 * The filler is sized to take up any space left over within desiredHeight.
78 Left,
101 boolean left = false;
106 case Left:
107 left = true;
118 if (left) {
120 button.setText("left");
249 t1.setGravity(Gravity.LEFT | Gravity.CENTER_VERTICAL);
  /device/linaro/bootloader/edk2/Nt32Pkg/Library/PlatformBootManagerLib/
PlatformBootManager.c 156 CONST EFI_BOOT_MANAGER_LOAD_OPTION *Left,
160 return BootOptionPriority (Left) - BootOptionPriority (Right);
  /external/llvm/lib/CodeGen/AsmPrinter/
WinException.cpp     [all...]
  /external/llvm/unittests/Bitcode/
BitReaderTest.cpp 70 size_t Left = Buf.size() - Pos;
71 Len = std::min(Left, Len);
95 // enough bits left on the input stream to read N bits, and we are using a data
  /external/pdfium/fpdfsdk/fpdfxfa/
cpdfxfa_docenvironment.cpp 101 pFormFillEnv->DisplayCaret(pPage.Get(), bVisible, rcCaret.left, rcCaret.top,
135 t2 = (int)(rcAnchor.left - pageViewRect.left);
137 rtPopup.left += rcAnchor.bottom - pageViewRect.bottom;
143 if (rcAnchor.left < pageViewRect.left)
144 rtPopup.left += rcAnchor.left - pageViewRect.left;
148 t1 = (int)(rcAnchor.left - pageViewRect.left)
    [all...]
  /external/webrtc/webrtc/modules/video_render/ios/
video_render_ios_view.mm 154 Left:(const float)left
158 return _gles_renderer20->SetCoordinates(zOrder, left, top, right, bottom);
  /frameworks/base/core/tests/coretests/src/android/util/
ListItemFactory.java 35 * The filler is sized to take up any space left over within desiredHeight.
78 Left,
101 boolean left = false;
106 case Left:
107 left = true;
118 if (left) {
120 button.setText("left");
  /prebuilts/go/darwin-x86/test/
reorder.go 117 // Issue #13433: Left-to-right assignment of OAS2XXX nodes.
  /prebuilts/go/linux-x86/test/
reorder.go 117 // Issue #13433: Left-to-right assignment of OAS2XXX nodes.
  /device/linaro/bootloader/edk2/MdeModulePkg/Universal/Network/Dhcp4Dxe/
Dhcp4Option.c 125 INTN Left;
129 Left = 0;
132 while (Right >= Left) {
133 Middle = (Left + Right) / 2;
142 Left = Middle + 1;
  /external/harfbuzz_ng/src/
gen-use-table.py 112 'Left',
260 'Pre': [Left],
270 'Pre': [Left, Top_And_Left, Top_And_Left_And_Right, Left_And_Right],
276 'Pre': [Left],
326 if U == 0x103C: UIPC = Left
333 if U == 0x1171E: UIPC = Left # Correct?!
  /external/pdfium/core/fxge/
cfx_fontmapper.cpp 168 norm = norm.Left(pos.value());
246 if (bsStyle.Left(pStyle->len).Compare(pStyle->name) == 0)
442 family = SubstName.Left(pos.value());
472 family = family.Left(pos.value());
483 family = family.Left(nLen - len);
  /external/llvm/lib/Transforms/Vectorize/
SLPVectorizer.cpp 437 SmallVectorImpl<Value *> &Left,
442 SmallVectorImpl<Value *> &Left,
    [all...]
  /prebuilts/go/darwin-x86/src/cmd/compile/internal/gc/
noder.go 421 n.Left = p.param(recv, false, false)
454 typ.Right = typ.Left
455 typ.Left = nil
457 if n.Left != nil {
458 n.Left.SetIsddd(true)
594 n.Left = p.declName(expr.Lhs)
595 if isblank(n.Left) {
596 yyerror("invalid variable name %v in type switch", n.Left)
605 // in issue #16394). In particular, it avoids left recursion and
736 sig.Left = fakeRecv(
    [all...]
  /prebuilts/go/linux-x86/src/cmd/compile/internal/gc/
noder.go 421 n.Left = p.param(recv, false, false)
454 typ.Right = typ.Left
455 typ.Left = nil
457 if n.Left != nil {
458 n.Left.SetIsddd(true)
594 n.Left = p.declName(expr.Lhs)
595 if isblank(n.Left) {
596 yyerror("invalid variable name %v in type switch", n.Left)
605 // in issue #16394). In particular, it avoids left recursion and
736 sig.Left = fakeRecv(
    [all...]
  /external/libvncserver/webclients/novnc/include/
keysym.js 17 XK_Left = 0xff51, /* Move left, left arrow */
88 * Auxiliary functions; note the duplicate definitions for left and right
90 * function key groups on the left and/or right sides of the keyboard.
157 XK_Shift_L = 0xffe1, /* Left shift */
159 XK_Control_L = 0xffe3, /* Left control */
164 XK_Meta_L = 0xffe7, /* Left meta */
166 XK_Alt_L = 0xffe9, /* Left alt */
168 XK_Super_L = 0xffeb, /* Left super */
170 XK_Hyper_L = 0xffed, /* Left hyper *
    [all...]
  /external/llvm/lib/Target/Hexagon/
HexagonSplitDouble.cpp 757 bool Left = !Right;
763 unsigned ShiftOpc = Left ? S2_asl_i_r
778 // Shift left: DR = shl R, #s
787 // Shift left:
794 if (S == 16 && Left)
801 BuildMI(B, MI, DL, TII->get(ShiftOpc), (Left ? LoR : TmpR))
805 if (Left) {
829 BuildMI(B, MI, DL, TII->get(TargetOpcode::COPY), (Left ? HiR : LoR))
830 .addReg(Op1.getReg(), RS & ~RegState::Kill, (Left ? LoSR : HiSR));
832 BuildMI(B, MI, DL, TII->get(A2_tfrsi), (Left ? LoR : HiR)
    [all...]
  /external/pdfium/xfa/fxfa/
cxfa_ffcheckbutton.cpp 116 XFA_AttributeEnum iHorzAlign = XFA_AttributeEnum::Left;
127 case XFA_AttributeEnum::Left: {
131 m_rtUI.left += fCapReserve;
142 m_rtCaption.left = m_rtCaption.right() - fCapReserve;
163 m_rtUI.left += (m_rtUI.width - fCheckSize) / 2;
165 m_rtUI.left = m_rtUI.right() - fCheckSize;
198 m_rtCaption.left += m_rtCaption.width;
207 float fLeftAddRight = rtUIMargin.left + rtUIMargin.width;
211 iCapPlacement == XFA_AttributeEnum::Left) {
212 m_rtUI.left -= fLeftAddRight - m_rtUI.width
    [all...]
  /external/python/cpython3/Lib/test/
test_subclassinit.py 84 class Left(Base):
97 class A(Left, Middle, Right, middle="middle"):
101 self.assertEqual(Left.calls, [])
  /device/linaro/bootloader/edk2/MdeModulePkg/Universal/SmbiosMeasurementDxe/
SmbiosMeasurementDxe.c 152 UINTN Left;
157 Left = Size % COLUME_SIZE;
164 if (Left != 0) {
166 InternalDumpData (Data + Index * COLUME_SIZE, Left);

Completed in 389 milliseconds

1 2 3 4 5 67 8 91011>>