| /external/clang/test/Preprocessor/ |
| cxx_oper_keyword.cpp | 7 // Valid because 'and' is a spelling of '&&'
8 #if defined foo and bar
14 //expected-error@+2 {{C++ operator 'and' (aka '&&') used as a macro name}}
16 #define and foo macro
26 //expected-error@+3 {{C++ operator 'and' (aka '&&') used as a macro name}}
28 //expected-warning@+2 {{and is defined}}
29 #ifdef and
30 #warning and is defined
|
| /external/libvorbis/doc/ |
| 05-comment.tex | 4 \section{comment field and header specification} \label{vorbis:spec:comment}
12 greater structure and machine parseability.
16 remember the disc by and explain it to others; a short, to-the-point
22 Honest Bob and the Factory-to-Dealer-Incentives, \textit{``I'm Still
34 number of vectors is bounded to $2^{32}-1$ and the length of each vector
41 The vector lengths and number of vectors are stored lsb first, according
67 That is, comment fields consist of a field name and a corresponding value and
77 The field name is case-insensitive and may consist of ASCII 0x20
117 The artist(s) who performed the work. In classical music this would be the conductor, orchestra, soloists. In an audio book it would be the actor who did the reading. In popular music this is typically the same as the ARTIST and is omitted
[all...] |
| 03-codebook.tex | 4 \section{Probability Model and Codebooks} \label{vorbis:spec:codebook}
10 decoding configuration, VQ and Huffman, into the bitstream itself in
20 the codebooks themselves and the codewords they decode are unrolled
44 16 bit \varname{[codebook_dimensions]} and 24 bit \varname{[codebook_entries]} fields:
67 We now read the list of codeword lengths and store these lengths in
74 length ordered and the decoder needs to read each codeword length
122 2) [current_length] = read a five bit unsigned integer and add 1;
160 Lookup types one and two are similar, differing only in the
171 3) [codebook_value_bits] = read 4 bits as an unsigned integer and add 1
189 and indicates a stream that is not decodable by the specification in thi
[all...] |
| /art/test/640-checker-boolean-simd/src/ |
| Main.java | 13 * See the License for the specific language governing permissions and
28 /// CHECK-START: void Main.and(boolean) loop_optimization (before)
33 /// CHECK-START-ARM64: void Main.and(boolean) loop_optimization (after)
38 static void and(boolean x) { method in class:Main
40 a[i] &= x; // NOTE: bitwise and, not the common &&
99 and(true);
101 expectEquals((i & 1) == 0, a[i], "and-true");
119 and(false);
121 expectEquals(false, a[i], "and-false");
|
| /external/bison/doc/ |
| refcard.tex | 10 % per page and reduce to 80%.
26 % This program is free software: you can redistribute it and/or modify
48 % You will still need to cut and paste.
61 % Thanks to Paul Rubin, Bob Chassell, Len Tower, and Richard Mlynarik
64 % We only change the following to change the version numbers and
85 \centerline{designed by Brendan Kehoe and Gavin Nicol}
89 Permission is granted to make and distribute copies of this card
90 provided the copyright notice and this permission notice
110 \centerline{designed by Brendan Kehoe and Gavin Nicol}
114 Permission is granted to make and distribute copies of this car
[all...] |
| /external/guice/core/src/com/google/inject/matcher/ |
| Matcher.java | 13 * See the License for the specific language governing permissions and
32 * Returns a new matcher which returns {@code true} if both this and the
35 Matcher<T> and(Matcher<? super T> other); method in interface:Matcher
|
| AbstractMatcher.java | 13 * See the License for the specific language governing permissions and
22 * Implements {@code and()} and {@code or()}.
28 public Matcher<T> and(final Matcher<? super T> other) { method in class:AbstractMatcher
59 return "and(" + a + ", " + b + ")";
|
| /external/libunwind/doc/ |
| libunwind.tex | 80 of the chain has been reached, and any negative value indicates that
87 two cursor variables: ``\Var{curr}'' and ``\Var{prev}''. The former
88 would be used as the current cursor and \Var{prev} would be maintained
94 frame and that way it could move up and down the callframe-chain at
97 Given an unwind cursor, it is possible to read and write the CPU
102 \Func{unw\_set\_reg}() writes an integer register, and
109 frame and, in those cases, \Prog{libunwind} will grant access to them
113 (IP), sometimes also known as the ``program counter'', and the stack
115 the macros \Const{UNW\_REG\_IP} and \Const{UNW\_REG\_SP}
[all...] |
| unw_init_local.tex | 52 \section{Thread and Signal Safety}
|
| unw_init_remote.tex | 39 it is easier to use and because it may perform better.
47 \section{Thread and Signal Safety}
59 including \File{$<$libunwind.h$>$} and then calling
|
| unw_resume.tex | 21 slightly for local and remote unwinding.
24 and then directly resumes execution in the target stack frame. Thus
36 identified by the cursor by calling the \Func{access\_reg} and
56 of each unwound frame and appropriately processing its unwind handler
57 and language-specific data area (lsda). These steps are generally
58 dependent on the target-platform and are regulated by the
67 \section{Thread and Signal Safety}
|
| unw_strerror.tex | 20 to a corresponding text message and returns it.
28 \section{Thread and Signal Safety}
|
| unw_flush_cache.tex | 24 list is not tied to a code-range and its cached value (if any) is
26 \Var{lo} and \Var{hi} should be understood as a hint:
31 As a special case, if arguments \Var{lo} and \Var{hi} are both 0, all
36 The \Func{unw\_flush\_cache}() routine cannot fail and does not
39 \section{Thread and Signal Safety}
|
| /libcore/ojluni/src/main/java/java/util/function/ |
| BiPredicate.java | 2 * Copyright (c) 2010, 2013, Oracle and/or its affiliates. All rights reserved.
5 * This code is free software; you can redistribute it and/or modify it
57 * AND of this predicate and another. When evaluating the composed
68 * AND of this predicate and the {@code other} predicate
71 default BiPredicate<T, U> and(BiPredicate<? super T, ? super U> other) { method in interface:BiPredicate
89 * OR of this predicate and another. When evaluating the composed
100 * OR of this predicate and the {@code other} predicate
|
| DoublePredicate.java | 2 * Copyright (c) 2010, 2013, Oracle and/or its affiliates. All rights reserved.
5 * This code is free software; you can redistribute it and/or modify it
54 * AND of this predicate and another. When evaluating the composed
65 * AND of this predicate and the {@code other} predicate
68 default DoublePredicate and(DoublePredicate other) { method in interface:DoublePredicate
86 * OR of this predicate and another. When evaluating the composed
97 * OR of this predicate and the {@code other} predicate
|
| IntPredicate.java | 2 * Copyright (c) 2010, 2013, Oracle and/or its affiliates. All rights reserved.
5 * This code is free software; you can redistribute it and/or modify it
54 * AND of this predicate and another. When evaluating the composed
65 * AND of this predicate and the {@code other} predicate
68 default IntPredicate and(IntPredicate other) { method in interface:IntPredicate
86 * OR of this predicate and another. When evaluating the composed
97 * OR of this predicate and the {@code other} predicate
|
| LongPredicate.java | 2 * Copyright (c) 2010, 2013, Oracle and/or its affiliates. All rights reserved.
5 * This code is free software; you can redistribute it and/or modify it
54 * AND of this predicate and another. When evaluating the composed
65 * AND of this predicate and the {@code other} predicate
68 default LongPredicate and(LongPredicate other) { method in interface:LongPredicate
86 * OR of this predicate and another. When evaluating the composed
97 * OR of this predicate and the {@code other} predicate
|
| Predicate.java | 2 * Copyright (c) 2010, 2013, Oracle and/or its affiliates. All rights reserved.
5 * This code is free software; you can redistribute it and/or modify it
53 * AND of this predicate and another. When evaluating the composed
64 * AND of this predicate and the {@code other} predicate
67 default Predicate<T> and(Predicate<? super T> other) { method in interface:Predicate
85 * OR of this predicate and another. When evaluating the composed
96 * OR of this predicate and the {@code other} predicate
|
| /prebuilts/misc/common/swig/include/2.0.11/chicken/ |
| swigclosprefix.scm | 14 (define-method (compute-getter-and-setter (class <swig-metaclass-$module>) slot allocator)
|
| /toolchain/binutils/binutils-2.25/gas/testsuite/gas/nds32/ |
| to-16bit-v3.s | 14 and $r0, $r0, $r0 label
15 and $r7, $r7, $r7 label
|
| /external/iproute2/doc/ |
| api-ip6-flowlabels.tex | 24 prefer this term) and 20 bits of flow label. Currently there exist
56 Flows with coinciding source address and flow label must have identical
57 destination address and not-fragmentable extensions headers (i.e.\
58 hop by hop options and all the headers up to and including routing header,
68 NB notes here and below reflect only my personal opinion,
74 Flow labels have finite lifetime and source is not allowed to reuse
100 It contradicts both to IETF spirit and the letter. Before RFC2553
109 and have to mangle it, even if we are not interested in flowinfo subtleties.
115 is followed by attempts to patch the hole and more mistakes..
[all...] |
| ip-tunnels.tex | 52 ``network unreachable'' and after this I found a strange direct route
74 that between \verb|route add| and \verb|route del| host 193.233.7.65 is
78 Q: In 2.0.36 I used to load \verb|tunnel| device module and \verb|ipip| module.
82 and for all IPIP tunnel devices.
93 and you are not afraid of
102 \paragraph{Summary of differences between 2.2 and 2.0.}
107 and got set of 4 devices \verb|tunl0| ... \verb|tunl3| or,
108 alternatively, compile it as module and load new module
113 tunnel device \verb|tunl0| and another tunnels may be created with command
133 kinds and gateway is required to be directly reachable via this tunnel
[all...] |
| /external/mesa3d/src/glsl/ |
| Android.gen.mk | 7 # copy of this software and associated documentation files (the "Software"),
10 # and/or sell copies of the Software, and to permit persons to whom the
13 # The above copyright notice and this permission notice shall be included
18 # FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
55 define local-y-to-c-and-h
61 define local-yy-to-cpp-and-h
77 $(call local-yy-to-cpp-and-h,.cpp)
83 $(call local-y-to-c-and-h)
|
| /device/linaro/bootloader/edk2/StdLib/Include/ |
| iso646.h | 8 This program and the accompanying materials are licensed and made available under
9 the terms and conditions of the BSD License that accompanies this distribution.
20 #define and && ///< Logical AND of two boolean expressions
macro
21 #define and_eq &= ///< Bitwise AND with assignment to lval
22 #define bitand & ///< Bitwise AND of two scalar expressions
|
| /external/clang/lib/Headers/ |
| iso646.h | 6 * of this software and associated documentation files (the "Software"), to deal
8 * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
9 * copies of the Software, and to permit persons to whom the Software is
12 * The above copyright notice and this permission notice shall be included in
17 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
30 #define and && macro
|
