/development/samples/browseable/LNotifications/res/values/ |
strings.xml | 22 On Android L or above, you have options to display important information in front of the user (Heads-Up Notifications) which
|
/external/androidplot/AndroidPlot-Core/src/main/java/com/androidplot/util/ |
ZIndexable.java | 23 * be moved up and down in the queue relative to other elements in the hash or absolutely to the front or back of the queue.
|
/external/clang/include/clang/Rewrite/Frontend/ |
Rewriters.h | 10 // This header contains miscellaneous utilities for various front-end actions.
|
/external/clang/lib/Lex/ |
Makefile | 10 # This implements the Lexer library for the C-Language front-end.
|
/external/clang/www/ |
clang_video-05-25-2007.html | 18 <p><b>Details:</b> New LLVM C Front-end - This talk describes a new from-scratch C frontend (which is aiming to support Objective C and C++ someday) for LLVM, built as a native part of the LLVM system and in the LLVM design style.
|
/external/jmonkeyengine/engine/src/core/com/jme3/renderer/queue/ |
GuiComparator.java | 39 * <code>GuiComparator</code> sorts geometries back-to-front based
|
/external/jmonkeyengine/engine/src/core/com/jme3/scene/shape/ |
Box.java | 52 10, 9, 8, 11, 10, 8, // front 61 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, // front 70 1, 0, 0, 0, 0, 1, 1, 1, // front 167 v[4].x, v[4].y, v[4].z, v[5].x, v[5].y, v[5].z, v[7].x, v[7].y, v[7].z, v[6].x, v[6].y, v[6].z, // front
|
/external/libcxx/include/experimental/ |
dynarray | 80 reference front(); 81 const_reference front() const; 205 inline _LIBCPP_INLINE_VISIBILITY reference front() { return data()[0]; } 206 inline _LIBCPP_INLINE_VISIBILITY const_reference front() const { return data()[0]; }
|
/external/libcxx/test/std/containers/container.adaptors/queue/queue.cons/ |
ctor_container.pass.cpp | 34 assert(q.front() == d[i]);
|
/external/libcxx/test/std/containers/container.adaptors/queue/queue.defn/ |
emplace.pass.cpp | 27 assert(q.front() == Emplaceable(1, 2.5));
|
/external/libcxx/test/std/containers/sequences/dynarray/dynarray.zero/ |
default.pass.cpp | 15 // The effect of calling front() or back() for a zero-sized dynarray is undefined.
|
/external/libcxx/test/std/experimental/string.view/string.view.access/ |
back.pass.cpp | 13 // constexpr const _CharT& front();
|
/external/libcxx/test/std/iterators/predef.iterators/insert.iterators/front.insert.iter.ops/front.insert.iter.op=/ |
lv_value.pass.cpp | 29 assert(c.front() == v);
|
/external/libnl/include/netlink/ |
types.h | 42 * Specifies the number of whitespaces to be put in front
|
/external/llvm/examples/Kaleidoscope/Orc/lazy_codegen/ |
README.txt | 9 performed up-front.
|
/external/llvm/examples/Kaleidoscope/Orc/lazy_irgen/ |
README.txt | 7 amount of up-front work that must be done by lazily IRgen'ing ASTs. When a
|
/external/llvm/include/llvm/ADT/ |
MapVector.h | 60 std::pair<KeyT, ValueT> &front() { return Vector.front(); } function in class:llvm::MapVector 61 const std::pair<KeyT, ValueT> &front() const { return Vector.front(); } function in class:llvm::MapVector
|
/external/llvm/test/Transforms/InstCombine/ |
CPP_min_max.ll | 5 ; is generated by the C++ front-end and LLVM optimizers, which has lots of
|
/external/llvm/test/Transforms/ScalarRepl/ |
phinodepromote.ll | 4 ; are used by PHI nodes that are immediately loaded. The LLVM C++ front-end
|
/external/lzma/CPP/7zip/UI/Common/ |
SetProperties.cpp | 70 RINOK(setProperties->SetProperties(&names.Front(), values, names.Size()));
|
/external/lzma/CPP/Common/ |
Wildcard.h | 72 { return (Pairs.Size() == 1 && Pairs.Front().Prefix.IsEmpty()); }
|
/external/marisa-trie/lib/marisa/ |
tail.h | 41 return (buf_.front() == '\0') ? MARISA_BINARY_TAIL : MARISA_TEXT_TAIL;
|
/external/marisa-trie/v0_1_5/lib/marisa_alpha/ |
tail.h | 41 return (buf_.front() == '\0') ?
|
/ndk/sources/cxx-stl/llvm-libc++/libcxx/include/experimental/ |
dynarray | 80 reference front(); 81 const_reference front() const; 203 inline _LIBCPP_INLINE_VISIBILITY reference front() { return data()[0]; } 204 inline _LIBCPP_INLINE_VISIBILITY const_reference front() const { return data()[0]; }
|
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/container.adaptors/queue/queue.cons/ |
ctor_container.pass.cpp | 34 assert(q.front() == d[i]);
|