/external/proguard/src/proguard/evaluation/value/ |
H A D | UnknownIntegerValue.java | 2 * ProGuard -- shrinking, optimization, obfuscation, and preverification 7 * This program is free software; you can redistribute it and/or modify it 166 public IntegerValue and(IntegerValue other) method in class:UnknownIntegerValue
|
H A D | UnknownLongValue.java | 2 * ProGuard -- shrinking, optimization, obfuscation, and preverification 7 * This program is free software; you can redistribute it and/or modify it 120 public LongValue and(LongValue other) method in class:UnknownLongValue
|
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/analysis/ |
H A D | SemanticContext.java | 6 * Redistribution and use in source and binary forms, with or without 10 * notice, this list of conditions and the following disclaimer. 12 * notice, this list of conditions and the following disclaimer in the 13 * documentation and/or other materials provided with the distribution. 48 * we will have to combine p1 and p2 into DFA state as we will be 52 * I have scoped the AND, NOT, OR, and Predicate subclasses of 68 * nongated predicates set to true and then reduced. So p&&(q||r) would 69 * return p&&r if q is nongated but p and r are gated. 272 return "true"; // not used for code gen, just DOT and prin 607 public static SemanticContext and(SemanticContext a, SemanticContext b) { method in class:SemanticContext [all...] |
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/misc/ |
H A D | BitSet.java | 6 * Redistribution and use in source and binary forms, with or without 10 * notice, this list of conditions and the following disclaimer. 12 * notice, this list of conditions and the following disclaimer in the 13 * documentation and/or other materials provided with the distribution. 41 * as opposed to oring and anding "in place". Further, a number of 44 * and, because it is final, I cannot subclass to add functionality. 102 // walk set and add each interval 151 public IntSet and(IntSet a) { method in class:BitSet 268 /** Get the first element you find and retur [all...] |
/external/guava/guava/src/com/google/common/base/ |
H A D | Predicates.java | 13 * See the License for the specific language governing permissions and 99 * order, and evaluation will be "short-circuited" as soon as a false 105 public static <T> Predicate<T> and( method in class:Predicates 113 * order, and evaluation will be "short-circuited" as soon as a false 119 public static <T> Predicate<T> and(Predicate<? super T>... components) { method in class:Predicates 126 * order, and evaluation will be "short-circuited" as soon as a false 129 public static <T> Predicate<T> and(Predicate<? super T> first, method in class:Predicates 138 * order, and evaluation will be "short-circuited" as soon as a 152 * order, and evaluation will be "short-circuited" as soon as a 165 * order, and evaluatio [all...] |
H A D | CharMatcher.java | 13 * See the License for the specific language governing permissions and 34 * Implementations are strongly encouraged to be side-effect-free and immutable. 41 * characters are encoded into a {@code String} using surrogate pairs, and a {@code CharMatcher} 219 * SPACE_SEPARATOR, LINE_SEPARATOR, PARAGRAPH_SEPARATOR, CONTROL, FORMAT, SURROGATE, and 313 @Override public CharMatcher and(CharMatcher other) { 395 @Override public CharMatcher and(CharMatcher other) { 425 @Override public CharMatcher and(CharMatcher other) { 457 @Override public CharMatcher and(CharMatcher other) { 458 return other.matches(match) ? super.and(other) : other; 493 // TODO(user): is it potentially worth just going ahead and buildin 676 public CharMatcher and(CharMatcher other) { method in class:CharMatcher [all...] |
/external/guava/guava-gwt/src-super/com/google/common/base/super/com/google/common/base/ |
H A D | Predicates.java | 13 * See the License for the specific language governing permissions and 96 * order, and evaluation will be "short-circuited" as soon as a false 102 public static <T> Predicate<T> and( method in class:Predicates 110 * order, and evaluation will be "short-circuited" as soon as a false 116 public static <T> Predicate<T> and(Predicate<? super T>... components) { method in class:Predicates 123 * order, and evaluation will be "short-circuited" as soon as a false 126 public static <T> Predicate<T> and(Predicate<? super T> first, method in class:Predicates 135 * order, and evaluation will be "short-circuited" as soon as a 149 * order, and evaluation will be "short-circuited" as soon as a 162 * order, and evaluatio [all...] |
H A D | CharMatcher.java | 13 * See the License for the specific language governing permissions and 32 * Implementations are strongly encouraged to be side-effect-free and immutable. 39 * characters are encoded into a {@code String} using surrogate pairs, and a {@code CharMatcher} 217 * SPACE_SEPARATOR, LINE_SEPARATOR, PARAGRAPH_SEPARATOR, CONTROL, FORMAT, SURROGATE, and 311 @Override public CharMatcher and(CharMatcher other) { 393 @Override public CharMatcher and(CharMatcher other) { 423 @Override public CharMatcher and(CharMatcher other) { 449 @Override public CharMatcher and(CharMatcher other) { 450 return other.matches(match) ? super.and(other) : other; 478 // TODO(user): is it potentially worth just going ahead and buildin 633 public CharMatcher and(CharMatcher other) { method in class:CharMatcher [all...] |
/external/libpcap/ |
H A D | grammar.y | 6 * Redistribution and use in source and binary forms, with or without 8 * retain the above copyright notice and this paragraph in its entirety, (2) 9 * distributions including binary code include the above copyright notice and 11 * provided with the distribution, and (3) all advertising materials mentioning 14 * Lawrence Berkeley Laboratory and its contributors.'' Neither the name of 263 %type <blk> and or paren not null prog 325 | expr and term { gen_and($1.b, $3.b); $$ = $3; } 326 | expr and id { gen_and($1.b, $3.b); $$ = $3; } 330 and label [all...] |
/external/toybox/toys/pending/ |
H A D | expr.c | 18 Evaluate expression and print result. For example, "expr 1 + 2". 24 Each constant and operator must be a separate command line argument. 34 The & and | operators are logical (not bitwise) and may operate on 38 Constants may be strings or integers. Comparison, logical, and regex 173 static void and(struct value *lhs, struct value *rhs) function 205 // check if v matches a token, and consume it if so 220 // calculate "lhs op rhs" (e.g. lhs + rhs) and store result in lhs 223 {"|", or }, {"&", and }, {"=", eq }, {"==", eq }, {">", gt }, 241 // tok is a string or integer - return it and ge [all...] |
/external/v8/test/webkit/fast/js/kde/ |
H A D | md5-1.js | 4 // Redistribution and use in source and binary forms, with or without 8 // notice, this list of conditions and the following disclaimer. 10 // notice, this list of conditions and the following disclaimer in the 11 // documentation and/or other materials provided with the distribution. 35 * Permission to use, copy, modify, and distribute this software 36 * and its documentation for any purposes and without 91 function and(a,b) { function 178 return or(and( [all...] |
/external/apache-xml/src/main/java/org/apache/xpath/compiler/ |
H A D | Compiler.java | 15 * See the License for the specific language governing permissions and 69 * of operation codes (op map) and then builds from that into an Expression 77 * Construct a Compiler object with a specific ErrorListener and 97 * Construct a Compiler instance that has a null error listener and a 128 expr = and(opPos); break; 200 * Bottle-neck compilation of an operation with left and right operands. 257 * Compile an 'and' operation. 265 protected Expression and(int opPos) throws TransformerException method in class:Compiler 811 * and match patterns. 906 // This is the magic and invisibl [all...] |
/external/easymock/src/org/easymock/ |
H A D | EasyMock.java | 13 * See the License for the specific language governing permissions and
108 * is disabled by default, and the mock object will return <code>0</code>,
124 * is disabled by default, and the mock object will return <code>0</code>,
159 * Creates a control, order checking is disabled by default, and the mock
704 public static boolean and(boolean first, boolean second) {
method in class:EasyMock 718 public static byte and(byte first, byte second) {
method in class:EasyMock 732 public static char and(char first, char second) {
method in class:EasyMock 746 public static double and(double first, double second) {
method in class:EasyMock 760 public static float and(float first, float second) {
method in class:EasyMock 774 public static int and(in method in class:EasyMock 788 public static long and(long first, long second) { method in class:EasyMock 802 public static short and(short first, short second) { method in class:EasyMock 818 public static <T> T and(T first, T second) { method in class:EasyMock [all...] |
/external/iproute2/doc/ |
H A D | ip-cref.tex | 28 However, the document is self-contained and the reader, provided they have a 30 and examples to understand and configure Linux-2.2 IP and IPv6 34 and options, decrypting \verb|ip| output and containing a few examples. 35 More voluminous examples and some topics, which require more elaborate 39 bugs and design drawbacks. They may be skipped at the first reading. 49 begin with the character \verb|'-'| and may be used in either long or abbreviated 55 --- print the version of the \verb|ip| utility and exi [all...] |
/external/libvorbis/doc/ |
H A D | 01-introduction.tex | 4 \section{Introduction and Description} \label{vorbis:spec:intro} 20 it is in the same league as MPEG-2 and MPC. Similarly, the 1.0 21 encoder can encode high-quality CD and DAT rate stereo at below 48kbps 23 lower and higher sample rates (from 8kHz telephony to 192kHz digital 24 masters) and a range of channel representations (monaural, 33 transient response and reproduction using a transform better suited to 40 encoder and simple, low-complexity decoder. Vorbis decode is 52 dividing it into individual frames and compressing these frames into 55 them, and reassembles the frames into a facsimile of the original 56 audio stream. Vorbis is a free-form variable bit rate (VBR) codec and packet [all...] |
/external/android-mock/src/com/google/android/testing/mocking/ |
H A D | AndroidMock.java | 13 * See the License for the specific language governing permissions and 36 * calls, and will delegate calls to EasyMock, while performing the required 41 * Interfaces and concrete Classes. 56 * <b>A note about parameter and return types for the <i>expects</i> style of methods.</b> 57 * The various expectation methods such as {@link #eq(boolean)}, {@link #and(boolean, boolean)}, 58 * and {@link #leq(byte)} all have nonsense return values. Each of the expectation methods may only 60 * during record mode) and thus their return types are in fact never used. The return types are set 65 * Similarly, the complex expectation methods ({@code #and}, {@code #or}, and {@code not}) take 67 * other than an expectation method is provided. E.g. {@code mockObject.doFoo(and(g 1052 public static boolean and(boolean first, boolean second) { method in class:AndroidMock 1077 public static byte and(byte first, byte second) { method in class:AndroidMock 1102 public static char and(char first, char second) { method in class:AndroidMock 1127 public static double and(double first, double second) { method in class:AndroidMock 1152 public static float and(float first, float second) { method in class:AndroidMock 1177 public static int and(int first, int second) { method in class:AndroidMock 1202 public static long and(long first, long second) { method in class:AndroidMock 1227 public static short and(short first, short second) { method in class:AndroidMock 1253 public static <T> T and(T first, T second) { method in class:AndroidMock [all...] |
/external/clang/test/Preprocessor/ |
H A D | cxx_oper_keyword_ms_compat.cpp | 9 return true and false; 13 #ifdef and 16 // The second 'and' is a valid C++ operator name for '&&'. 17 #if defined and and defined(and) 21 // (operators like "and" aren't normally, the rest always is.) 22 #define and macro 107 and
|
/external/antlr/antlr-3.4/runtime/JavaScript/src/org/antlr/runtime/ |
H A D | BitSet.js | 104 * <li>If el is a number and el2 is a number return a BitSet containing 105 * the numbers between el and el2 (inclusive).</li> 189 // walk set and add each interval 206 * Clone this BitSet and then {@link #andInPlace} with a. 210 and: function(a) { 220 * and only if it both initially had the value true and the corresponding 300 * The result is true if and only if the argument is not null and is a 408 * set and { [all...] |
/external/clang/test/Parser/ |
H A D | MicrosoftExtensions.cpp | 245 // This is a bit weird, but the alternative tokens aren't keywords, and this 247 extern int __identifier(and) r; // expected-error {{cannot convert '&&' token to an identifier}} 339 //expected-warning@+1 {{C++ operator 'and' (aka '&&') used as a macro name}} 340 #define and foo macro
|
/external/icu/icu4j/main/classes/core/src/com/ibm/icu/text/ |
H A D | PluralRules.java | 3 * Copyright (C) 2007-2014, International Business Machines Corporation and 39 * Rules are constructed from a text description, consisting of a series of keywords and conditions. The {@link #select} 40 * method examines each condition in order and returns the keyword for the first condition that matches the number. If 49 * For more information, details, and tips for writing rules, see the <a 61 * This defines two rules, for 'one' and 'few'. The condition for 'one' is "n is 1" which means that the number must be 63 * between 2 and 4 inclusive - and be an integer - for this condition to pass. All other numbers are assigned the 71 * This illustrates that the same keyword can be defined multiple times. Each rule is examined in order, and the first 77 * "one: n is 1; few: n mod 10 in 2..4 and n mod 100 not in 12..14" 80 * This illustrates conjunction and negatio 1619 public Rule and(Constraint c) { method in class:PluralRules.Rule [all...] |
/external/messageformat/java/com/ibm/icu/simple/ |
H A D | PluralRules.java | 3 * Copyright (C) 2007-2014, International Business Machines Corporation and 35 * Rules are constructed from a text description, consisting of a series of keywords and conditions. The {@link #select} 36 * method examines each condition in order and returns the keyword for the first condition that matches the number. If 45 * For more information, details, and tips for writing rules, see the <a 57 * This defines two rules, for 'one' and 'few'. The condition for 'one' is "n is 1" which means that the number must be 59 * between 2 and 4 inclusive - and be an integer - for this condition to pass. All other numbers are assigned the 67 * This illustrates that the same keyword can be defined multiple times. Each rule is examined in order, and the first 73 * "one: n is 1; few: n mod 10 in 2..4 and n mod 100 not in 12..14" 76 * This illustrates conjunction and negatio 1609 public Rule and(Constraint c) { method in class:PluralRules.Rule [all...] |
/external/v8/benchmarks/ |
H A D | crypto.js | 6 * a copy of this software and associated documentation files (the 9 * distribute, sublicense, and/or sell copies of the Software, and to 13 * The above copyright notice and this permission notice shall be 29 * and disclaimer. 74 // am1: use a single mult and divide to get the high bits, 88 // am2 avoids a big mult-and-extract completely. 202 // (protected) set from string and radix 450 // (protected) divide this by m, quotient and remainder to q, r (HAC 14.20) 537 // should reduce x and [all...] |
/external/valgrind/VEX/priv/ |
H A D | ir_opt.c | 14 This program is free software; you can redistribute it and/or 55 It takes an IRSB and produces a new one with the same meaning, 58 After execution of the new BB, all guest state and guest memory is 74 (i.e. at SB exits and as specified by dirty helper call). 93 The relative order of loads and stores (including loads/stores of 136 - Unrolled a loop, and block does not contain GetI or PutI: 139 - Unrolled a loop, and block contains GetI or PutI: 147 and is therefore in a sense, wrong. In the sense that PutIs are 150 mattered since indeed only the x87 FP registers and tags are 151 accessed using GetI/PutI, and ther 6036 IRExpr *a1, *and, *xor, *c, *a2bL, *a2bR; local [all...] |
/external/proguard/lib/ |
H A D | proguard.jar | META-INF/ META-INF/MANIFEST.MF proguard/optimize/WriteOnlyFieldFilter.class WriteOnlyFieldFilter.java package proguard ... |
/external/jarjar/lib/ |
H A D | asm-commons-4.0.jar | ... SHR public static final int USHR public static final int AND public static final int OR public static final int XOR ... |