HomeSort by relevance Sort by last modified time
    Searched full:piece (Results 26 - 50 of 852) sorted by null

12 3 4 5 6 7 8 91011>>

  /external/mockito/src/org/mockito/internal/util/
MockCreationValidator.java 55 // We can't catch all the errors with this piece of code
  /sdk/eclipse/plugins/com.android.ide.eclipse.tests/src/com/android/ide/eclipse/adt/internal/editors/layout/refactoring/testdata/
completion1-expected-completion11.txt 64 <fragment /> : A Fragment is a piece of an application's user interface or behavior that can be placed in an Activity
completion1-expected-completion12.txt 64 <fragment /> : A Fragment is a piece of an application's user interface or behavior that can be placed in an Activity
completion9-expected-completion64.txt 64 <fragment /> : A Fragment is a piece of an application's user interface or behavior that can be placed in an Activity
  /external/clang/lib/Sema/
SemaStmtAsm.cpp 66 const GCCAsmStmt::AsmStringPiece &Piece = AsmStrPieces[p];
67 if (!Piece.isOperand()) continue;
71 if (Piece.getOperandNo() == OpNo)
220 GCCAsmStmt::AsmStringPiece &Piece = Pieces[i];
221 if (!Piece.isOperand()) continue;
228 if (Idx == Piece.getOperandNo())
233 if (Idx == Piece.getOperandNo())
241 if (Idx == Piece.getOperandNo())
246 if (Idx == Piece.getOperandNo())
260 .validateConstraintModifier(Literal->getString(), Piece.getModifier()
    [all...]
  /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/parallel/
balanced_quicksort.h 69 typedef std::pair<RandomAccessIterator, RandomAccessIterator> Piece;
71 /** @brief Initial piece to work on. */
72 Piece initial;
75 RestrictedBoundedConcurrentQueue<Piece> leftover_parts;
84 Piece global;
245 typedef std::pair<RandomAccessIterator, RandomAccessIterator> Piece;
258 Piece current = tl.initial;
427 typedef std::pair<RandomAccessIterator, RandomAccessIterator> Piece;
466 Piece dummy;
  /frameworks/av/libvideoeditor/vss/common/inc/
M4SYS_AccessUnit.h 44 /** A Fragment is a piece of access unit. It can be decoded without decoding the others*/
61 /** An access unit is the smallest piece of data with timing information.*/
  /external/clang/lib/Rewrite/Core/
RewriteRope.cpp 45 /// new RopePieces (e.g. when the middle of some other rope piece is deleted,
104 /// If there is no space in this subtree for the extra piece, the extra tree
112 /// If there is no space in this subtree for the extra piece, the extra tree
168 assert(i < getNumPieces() && "Invalid piece ID");
205 /// If there is no space in this subtree for the extra piece, the extra tree
213 /// If there is no space in this subtree for the extra piece, the extra tree
232 /// If there is no space in this subtree for the extra piece, the extra tree
242 // Find the piece that this offset lands in.
255 // Otherwise, we need to split piece 'i' at Offset-PieceOffs. Convert Offset
256 // to being Piece relative
    [all...]
  /external/chromium/chrome/browser/first_run/
first_run_gtk.cc 23 // TODO(port): This is just a piece of the silent import functionality from
  /external/chromium_org/base/allocator/
allocator_extension.h 30 // |buffer| must point to a valid piece of memory
  /external/chromium_org/net/quic/crypto/
p256_key_exchange_nss.cc 25 static vector<uint8> StringPieceToVector(StringPiece piece) {
26 return vector<uint8>(piece.data(), piece.data() + piece.length());
  /external/chromium_org/third_party/opus/src/silk/
lin2log.c 43 /* Piece-wise parabolic approximation */
LP_variable_cutoff.c 53 /* Piece-wise linear interpolation of B and A */
70 /* Piece-wise linear interpolation of B and A */
97 /* piece-wise linear interpolation between elliptic filters */
  /external/chromium_org/ui/base/resource/
data_pack.cc 199 base::StringPiece piece; local
200 if (!GetStringPiece(resource_id, &piece))
204 reinterpret_cast<const unsigned char*>(piece.data()), piece.length());
  /external/llvm/include/llvm/Bitcode/
BitstreamReader.h 405 uint32_t Piece = Read(NumBits);
406 if ((Piece & (1U << (NumBits-1))) == 0)
407 return Piece;
412 Result |= (Piece & ((1U << (NumBits-1))-1)) << NextBit;
414 if ((Piece & (1U << (NumBits-1))) == 0)
418 Piece = Read(NumBits);
425 uint32_t Piece = Read(NumBits);
426 if ((Piece & (1U << (NumBits-1))) == 0)
427 return uint64_t(Piece);
432 Result |= uint64_t(Piece & ((1U << (NumBits-1))-1)) << NextBit
    [all...]
  /external/clang/include/clang/StaticAnalyzer/Core/BugReporter/
BugReporterVisitor.h 53 /// \brief Return a diagnostic piece which should be associated with the
63 /// \brief Provide custom definition for the final diagnostic piece on the
64 /// path - the piece, which is displayed before the path is expanded.
68 /// non-NULL end of path diagnostic piece.
75 /// \brief Generates the default final diagnostic piece.
  /external/clang/lib/StaticAnalyzer/Core/
PathDiagnostic.cpp 69 PathDiagnosticPiece *Piece = I->getPtr();
71 switch (Piece->getKind()) {
73 PathDiagnosticCallPiece *Call = cast<PathDiagnosticCallPiece>(Piece);
86 PathDiagnosticMacroPiece *Macro = cast<PathDiagnosticMacroPiece>(Piece);
90 Current.push_back(Piece);
93 // FIXME: This probably shouldn't mutate the original path piece.
100 Current.push_back(Piece);
133 "The call piece should be in the main file.");
143 // Check if the last piece in the callee path is a call to a function outside
150 // Otherwise, the last piece is in the main file
224 const PathDiagnosticPiece *piece = I->getPtr(); local
1025 const PathDiagnosticPiece *piece = it->getPtr(); local
    [all...]
BugReporter.cpp 111 IntrusiveRefCntPtr<PathDiagnosticPiece> piece(path.front());
114 switch (piece->getKind()) {
116 removeRedundantMsgs(cast<PathDiagnosticCallPiece>(piece)->path);
119 removeRedundantMsgs(cast<PathDiagnosticMacroPiece>(piece)->subPieces);
130 cast<PathDiagnosticEventPiece>(piece);
132 // come up with a preference, record which piece to keep, and consume
133 // another piece from the path.
136 piece = pieceToKeep;
144 path.push_back(piece);
162 // Remove the front piece from the path. If it is still something w
2957 PathDiagnosticPiece *piece = I->getPtr(); local
3410 PathDiagnosticPiece *piece = local
    [all...]
  /external/chromium_org/third_party/jinja2/
loaders.py 27 for piece in template.split('/'):
28 if path.sep in piece \
29 or (path.altsep and path.altsep in piece) or \
30 piece == path.pardir:
32 elif piece and piece != '.':
33 pieces.append(piece)
  /external/chromium_org/base/strings/
string_piece.cc 30 std::ostream& operator<<(std::ostream& o, const StringPiece& piece) {
31 o.write(piece.data(), static_cast<std::streamsize>(piece.size()));
  /external/chromium_org/third_party/libphonenumber/src/phonenumbers/base/strings/
string_piece.cc 16 std::ostream& operator<<(std::ostream& o, const StringPiece& piece) {
17 o.write(piece.data(), static_cast<std::streamsize>(piece.size()));
  /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/test/
test_codeop.py 23 '''succeed iff str is a valid piece of code'''
46 '''succeed iff str is the start of a valid piece of code'''
50 '''succeed iff str is the start of an invalid piece of code'''
  /prebuilts/python/linux-x86/2.7.5/lib/python2.7/test/
test_codeop.py 23 '''succeed iff str is a valid piece of code'''
46 '''succeed iff str is the start of a valid piece of code'''
50 '''succeed iff str is the start of an invalid piece of code'''
  /dalvik/dexgen/src/com/android/dexgen/dex/file/
Item.java 23 * repeated piece of a Dalvik file.
  /dalvik/dx/src/com/android/dx/dex/file/
Item.java 23 * repeated piece of a Dalvik file.

Completed in 4247 milliseconds

12 3 4 5 6 7 8 91011>>