HomeSort by relevance Sort by last modified time
    Searched refs:mismatch (Results 1 - 25 of 111) sorted by null

1 2 3 4 5

  /external/openssh/regress/
proto-mismatch.sh 1 # $OpenBSD: proto-mismatch.sh,v 1.3 2002/03/15 13:08:56 markus Exp $
4 tid="protocol version mismatch"
6 mismatch () function
18 mismatch 2 SSH-1.5-HALLO
19 mismatch 1 SSH-2.0-HALLO
  /dalvik/dx/tests/100-local-mismatch/
run 23 dx --dex Blort1.class 2>&1 | grep mismatch
26 dx --dex Blort2.class 2>&1 | grep mismatch
29 dx --dex Blort3.class 2>&1 | grep mismatch
32 dx --dex Blort4.class 2>&1 | grep mismatch
  /ndk/sources/cxx-stl/llvm-libc++/test/algorithms/alg.nonmodifying/mismatch/
mismatch_pred.pass.cpp 16 // mismatch(Iter1 first1, Iter1 last1, Iter2 first2, Pred pred);
29 assert(std::mismatch(input_iterator<const int*>(ia),
37 assert(std::mismatch(ia, ia + sa, ib, std::equal_to<int>()) ==
mismatch.pass.cpp 15 // mismatch(Iter1 first1, Iter1 last1, Iter2 first2);
27 assert(std::mismatch(input_iterator<const int*>(ia),
  /external/stlport/test/unit/
mismatch_test.cpp 44 pair <int*, int*> result = mismatch((int*)n1, (int*)n1 + 5, (int*)n2);
47 result = mismatch((int*)n1, (int*)n1 + 5, (int*)n3);
58 pair <IntVec::iterator, IntVec::iterator> result = mismatch(v1.begin(), v1.end(), v2.begin());
63 result = mismatch(v1.begin(), v1.end(), v2.begin());
74 pair <char const**, char const**> result = mismatch((char const**)n1, (char const**)n1 + size, (char const**)n2, str_equal);
79 result = mismatch((char const**)n1, (char const**)n1 + size, (char const**)n2, str_equal);
  /ndk/tests/device/test-gnustl-full/unit/
mismatch_test.cpp 44 pair <int*, int*> result = mismatch((int*)n1, (int*)n1 + 5, (int*)n2);
47 result = mismatch((int*)n1, (int*)n1 + 5, (int*)n3);
58 pair <IntVec::iterator, IntVec::iterator> result = mismatch(v1.begin(), v1.end(), v2.begin());
63 result = mismatch(v1.begin(), v1.end(), v2.begin());
74 pair <char const**, char const**> result = mismatch((char const**)n1, (char const**)n1 + size, (char const**)n2, str_equal);
79 result = mismatch((char const**)n1, (char const**)n1 + size, (char const**)n2, str_equal);
  /ndk/tests/device/test-stlport/unit/
mismatch_test.cpp 44 pair <int*, int*> result = mismatch((int*)n1, (int*)n1 + 5, (int*)n2);
47 result = mismatch((int*)n1, (int*)n1 + 5, (int*)n3);
58 pair <IntVec::iterator, IntVec::iterator> result = mismatch(v1.begin(), v1.end(), v2.begin());
63 result = mismatch(v1.begin(), v1.end(), v2.begin());
74 pair <char const**, char const**> result = mismatch((char const**)n1, (char const**)n1 + size, (char const**)n2, str_equal);
79 result = mismatch((char const**)n1, (char const**)n1 + size, (char const**)n2, str_equal);
  /external/webkit/Source/JavaScriptCore/runtime/
PropertyDescriptor.cpp 170 unsigned mismatch = other.m_attributes ^ m_attributes; local
172 if (sharedSeen & WritablePresent && mismatch & ReadOnly)
174 if (sharedSeen & ConfigurablePresent && mismatch & DontDelete)
176 if (sharedSeen & EnumerablePresent && mismatch & DontEnum)
183 unsigned mismatch = other.m_attributes ^ m_attributes; local
186 if (sharedSeen & WritablePresent && mismatch & ReadOnly)
188 if (sharedSeen & ConfigurablePresent && mismatch & DontDelete)
190 if (sharedSeen & EnumerablePresent && mismatch & DontEnum)
  /bionic/libc/unistd/
fnmatch.c 106 const char * const mismatch = pattern; local
109 *ep = mismatch;
116 *ep = mismatch;
133 *ep = mismatch;
148 const char * const mismatch = *pattern; local
240 *pattern = mismatch;
287 const char *mismatch = NULL; local
369 mismatch = pattern;
439 * but slashes will mismatch, and are not consumed)
453 pattern = mismatch;
    [all...]
  /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/parallel/
algobase.h 50 // NB: equal and lexicographical_compare require mismatch.
55 mismatch(InputIterator1 begin1, InputIterator1 end1, InputIterator2 begin2, function in namespace:std::__parallel
57 { return _GLIBCXX_STD_P::mismatch(begin1, end1, begin2); }
63 mismatch(InputIterator1 begin1, InputIterator1 end1, InputIterator2 begin2, function in namespace:std::__parallel
65 { return _GLIBCXX_STD_P::mismatch(begin1, end1, begin2, pred); }
74 { return _GLIBCXX_STD_P::mismatch(begin1, end1, begin2, pred); }
76 // Parallel mismatch for random access iterators
93 return _GLIBCXX_STD_P::mismatch(begin1, end1, begin2, pred);
99 mismatch(InputIterator1 begin1, InputIterator1 end1, InputIterator2 begin2) function in namespace:std::__parallel
118 mismatch(InputIterator1 begin1, InputIterator1 end1, InputIterator2 begin2 function in namespace:std::__parallel
    [all...]
find_selectors.h 146 { return mismatch(begin1, end1, begin2, pred, sequential_tag()); }
  /external/antlr/antlr-3.4/runtime/C/src/
antlr3treeparser.c 38 static void mismatch (pANTLR3_BASE_RECOGNIZER recognizer, ANTLR3_UINT32 ttype, pANTLR3_BITSET_LIST follow);
83 parser->rec->mismatch = mismatch;
169 /** Override for standard base recognizer mismatch function
174 mismatch (pANTLR3_BASE_RECOGNIZER recognizer, ANTLR3_UINT32 ttype, pANTLR3_BITSET_LIST follow) function
  /external/marisa-trie/lib/marisa/
trie-search.cc 390 if ((next_pos == mismatch()) || (next_pos == pos)) {
402 return mismatch();
411 if ((next_pos == mismatch()) || (next_pos == pos)) {
412 return mismatch();
416 return mismatch();
442 return mismatch();
449 return mismatch();
506 std::size_t pos_found = mismatch();
665 if ((next_pos == mismatch()) || (next_pos == pos)) {
691 if ((next_pos == mismatch()) || (next_pos == pos))
    [all...]
trie-inline.h 142 inline std::size_t Trie::mismatch() { function in class:marisa::Trie
165 if (next_pos == mismatch()) {
217 if (next_pos == mismatch()) {
  /external/marisa-trie/v0_1_5/lib/marisa_alpha/
trie-search.cc 409 if ((next_pos == mismatch()) || (next_pos == pos)) {
421 return mismatch();
430 if ((next_pos == mismatch()) || (next_pos == pos)) {
431 return mismatch();
435 return mismatch();
461 return mismatch();
468 return mismatch();
529 std::size_t pos_found = mismatch();
696 if ((next_pos == mismatch()) || (next_pos == pos)) {
722 if ((next_pos == mismatch()) || (next_pos == pos))
    [all...]
trie-inline.h 143 inline std::size_t Trie::mismatch() { function in class:marisa_alpha::Trie
166 if (next_pos == mismatch()) {
222 if (next_pos == mismatch()) {
  /external/antlr/antlr-3.4/runtime/C/include/
antlr3baserecognizer.h 141 /** Pointer to a function that works out what to do when a token mismatch
144 void (*mismatch) (struct ANTLR3_BASE_RECOGNIZER_struct * recognizer, member in struct:ANTLR3_BASE_RECOGNIZER_struct
  /libcore/luni/src/main/java/java/util/
Formatter.java 1340 String mismatch = null; local
    [all...]
  /frameworks/base/tests/CoreTests/android/core/
TestEventHandler.java 371 boolean mismatch = false;
389 expectDetails.append("expect data length mismatch expected:"+
398 mismatch = true;
399 expectDetails.append("Expect data mismatch at byte "+
408 if ((expectDataLength == -1) || !mismatch)
  /external/antlr/antlr-3.4/runtime/ActionScript/project/src/org/antlr/runtime/tree/
TreeParser.as 113 protected override function mismatch(input:IntStream, ttype:int, follow:BitSet):void {
  /external/antlr/antlr-3.4/runtime/JavaScript/src/org/antlr/runtime/tree/
TreeParser.js 85 mismatch: function(input, ttype, follow) {
  /external/v8/test/mjsunit/regress/
regress-1229.js 74 return f2(y); /* f should be inlined into g, note argument count mismatch */
78 return f3(x, y, z); /* f should be inlined into g, note argument count mismatch */
regress-117409.js 44 // elements fixed array backing store. This leads to a mismatch between the map
  /external/openssh/
sshconnect.c 440 int remote_major, remote_minor, mismatch; local
515 mismatch = 0;
526 mismatch = 1;
548 mismatch = 1;
551 if (mismatch)
    [all...]
  /external/blktrace/
blkiomon.c 104 static long leftover = 0, driverdata = 0, match = 0, mismatch = 0, sequence = 0; variable
425 dump_bits(t_old, t_young, "mismatch");
426 mismatch++;
591 fprintf(debug.fp, "%ld leftover, %ld match, %ld mismatch, "
593 leftover, match, mismatch, driverdata, sequence);

Completed in 1206 milliseconds

1 2 3 4 5