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

1 2 3 4

  /external/guava/guava-tests/test/com/google/common/collect/
MultisetsImmutableEntryTest.java 33 private static final String NE = null;
50 assertEquals("null", entry(NE, 1).toString());
51 assertEquals("null x 2", entry(NE, 2).toString());
64 assertEquals(control(NE, 1), entry(NE, 1));
65 assertFalse(control(NE, 1).equals(entry(NE, 2)));
66 assertFalse(entry(NE, 1).equals(control("bar", 1)));
67 assertFalse(entry(NE, 1).equals(new Object()));
68 assertFalse(entry(NE, 1).equals(null))
    [all...]
  /external/clang/test/CodeGen/
2005-04-09-ComplexOps.c 8 _Bool NE(double __complex A, double __complex B) { return A != B; }
  /external/llvm/lib/Target/MBlaze/
MBlazeISelLowering.h 29 NE,
39 case EQ: return NE;
40 case NE: return EQ;
52 case NE: return "ne";
  /external/llvm/lib/Target/NVPTX/
NVPTX.h 34 NE,
44 case NVPTXCC::NE: return "ne";
  /bootable/recovery/edify/
parser.y 45 %token AND OR SUBSTR SUPERSTR EQ NE IF THEN ELSE ENDIF
59 %left EQ NE
83 | expr NE expr { $$ = Build(InequalityFn, @$, 2, $1, $3); }
  /external/webkit/Source/JavaScriptCore/assembler/
MacroAssemblerSH4.cpp 35 const Condition MacroAssemblerSH4::NotEqual = SH4Assembler::NE;
45 const Condition MacroAssemblerSH4::NonZero = SH4Assembler::NE;
52 const Condition MacroAssemblerSH4::DoubleNotEqual = SH4Assembler::NE;
  /external/dexmaker/src/main/java/com/google/dexmaker/
Comparison.java 64 NE() {
  /frameworks/av/include/media/stagefright/foundation/
ADebug.h 52 MAKE_COMPARATOR(NE,!=)
72 #define CHECK_NE(x,y) CHECK_OP(x,y,NE,!=)
  /external/v8/src/
token.h 112 T(NE, "!=", 9) \
229 case EQ: return NE;
230 case NE: return EQ;
244 case EQ: return NE;
245 case NE: return EQ;
  /external/llvm/lib/Target/ARM/MCTargetDesc/
ARMBaseInfo.h 31 NE, // Not equal Not equal, or unordered
50 case EQ: return NE;
51 case NE: return EQ;
71 case ARMCC::NE: return "ne";
  /external/webkit/Source/WebKit/android/content/
address_detector.cpp 704 NE = 34, // NE Nebraska
801 NE, NE, XX, NE, NE, NE, NE, NE, NE, NE, // 680-68
    [all...]
  /external/llvm/lib/Analysis/
DominanceFrontier.cpp 80 NE = currentNode->end(); NI != NE; ++NI) {
  /frameworks/base/core/java/com/android/internal/util/
FastXmlSerializer.java 118 final char NE = (char)ESCAPE_TABLE.length;
124 if (c >= NE) continue;
135 final char NE = (char)ESCAPE_TABLE.length;
142 if (c >= NE) continue;
  /dalvik/vm/compiler/codegen/x86/libenc/
enc_defs_ext.h 106 CCM(CMOV,NZ), CCM(CMOV,NE),
221 CCM(J,NZ), CCM(J,NE),
282 CCM(SET,NZ), CCM(SET,NE),
  /external/webkit/Source/JavaScriptCore/parser/
JSParser.h 121 NE = 6 | BINARY_OP_PRECEDENCE(6),
  /libcore/luni/src/test/java/libcore/java/util/
EnumSetTest.java 102 H, HE, LI, BE, B, C, N, O, F, NE, NA, MG, AL, SI, P, S, CL, AR, K, CA, SC, TI, V, CR, MN,
  /ndk/sources/host-tools/nawk-20071023/
maketab.c 46 { NE, "relop", " != " },
awkgram.y 54 %token <i> AND BOR APPEND EQ GE GT LE LT NE IN
81 %nonassoc APPEND EQ GE GT LE LT NE MATCHOP IN '|'
232 | pattern NE pattern { $$ = op2($2, $1, $3); }
469 case LE: case LT: case EQ: case NE: case GT: case GE:
473 return op2(NE, n, nullnode);
lex.c 235 input(); yylval.i = NE; RET(NE);
  /external/clang/lib/StaticAnalyzer/Core/
ExprEngineObjC.cpp 94 NE = dstLocation.end(); NI!=NE; ++NI) {
CheckerManager.cpp 122 for (ExplodedNodeSet::iterator NI = PrevSet->begin(), NE = PrevSet->end();
123 NI != NE; ++NI) {
510 NI = Src.begin(), NE = Src.end(); NI != NE; ++NI) {
  /external/chromium/googleurl/base/
logging.h 265 DEFINE_DCHECK_OP_IMPL(NE, !=)
298 #define DCHECK_NE(val1, val2) DCHECK_OP(NE, !=, val1, val2)
  /external/chromium/base/
logging.h 516 DEFINE_CHECK_OP_IMPL(NE, !=)
524 #define CHECK_NE(val1, val2) CHECK_OP(NE, !=, val1, val2)
702 #define DCHECK_NE(val1, val2) DCHECK_OP(NE, !=, val1, val2)
    [all...]
  /external/llvm/include/llvm/MC/
MCExpr.h 328 NE, ///< Inequality comparison.
399 return Create(NE, LHS, RHS, Ctx);
  /external/clang/include/clang/AST/
StmtVisitor.h 126 BINOP_FALLBACK(GE) BINOP_FALLBACK(EQ) BINOP_FALLBACK(NE)

Completed in 519 milliseconds

1 2 3 4