| /external/llvm/include/llvm/Support/ |
| StringPool.h | 24 // to another instance. So that interned strings can eventually be freed,
90 PooledStringPtr(const PooledStringPtr &That) : S(That.S) {
94 PooledStringPtr &operator=(const PooledStringPtr &That) {
95 if (S != That.S) {
97 S = That.S;
133 inline bool operator==(const PooledStringPtr &That) { return S == That.S; }
134 inline bool operator!=(const PooledStringPtr &That) { return S != That.S;
[all...] |
| Registry.h | 109 bool operator==(const iterator &That) const { return Cur == That.Cur; }
110 bool operator!=(const iterator &That) const { return Cur != That.Cur; }
180 /// Use of this template requires that:
|
| /external/chromium/testing/gmock/test/ |
| gmock-nice-strict_test.cc | 5 // modification, are permitted provided that the following conditions are
102 MOCK_METHOD2(That, string(int, bool));
112 // Tests that a nice mock generates no warning for uninteresting calls.
122 // Tests that a nice mock generates no warning for uninteresting calls
123 // that delete the mock object.
135 // Tests that a nice mock generates informational logs for
156 // Tests that a nice mock allows expected calls.
164 // Tests that an unexpected call on a nice mock fails.
172 // Tests that NiceMock works with a mock class that has a non-defaul
[all...] |
| /external/llvm/lib/Transforms/InstCombine/ |
| InstCombineAddSub.cpp | 124 /// Similar to FAddend::drillDownOneStep() except that the value being
209 void FAddendCoef::operator=(const FAddendCoef& That) {
210 if (That.isInt())
211 set(That.IntVal);
213 set(That.getFpVal());
216 void FAddendCoef::operator+=(const FAddendCoef &That) {
218 if (isInt() == That.isInt()) {
220 IntVal += That.IntVal;
222 getFpVal().add(That.getFpVal(), RndMode);
227 const APFloat &T = That.getFpVal()
[all...] |
| /device/generic/goldfish/opengl/ |
| Android.mk | 40 # modules below in correct order. That is, if module B depends on
43 # This ensures that anything exported by module A will be correctly
46 # Note that the build system will complain if you try to import a
47 # module that hasn't been declared yet anyway.
|
| /external/v8/tools/ |
| consarray.js | 3 // modification, are permitted provided that the following conditions are
31 * In this use case we have lots of arrays that we need to iterate
34 * That's why we avoid copying memory and insead build a linked list
|
| /external/webkit/LayoutTests/dom/html/level1/core/ |
| hc_textparseintolistofelements.js | 7 hope that it will be useful, but WITHOUT ANY WARRANTY; without even
16 * Gets URI that identifies the test.
79 second employee. That node is composed of two
|
| hc_textwithnomarkup.js | 7 hope that it will be useful, but WITHOUT ANY WARRANTY; without even
16 * Gets URI that identifies the test.
80 implementing the Text interface that is the only child
84 third employee. That Text node contains a block of
|
| /external/webkit/LayoutTests/dom/xhtml/level1/core/ |
| hc_textparseintolistofelements.js | 7 hope that it will be useful, but WITHOUT ANY WARRANTY; without even
16 * Gets URI that identifies the test.
79 second employee. That node is composed of two
|
| hc_textwithnomarkup.js | 7 hope that it will be useful, but WITHOUT ANY WARRANTY; without even
16 * Gets URI that identifies the test.
80 implementing the Text interface that is the only child
84 third employee. That Text node contains a block of
|
| /sdk/emulator/opengl/ |
| Android.mk | 40 # modules below in correct order. That is, if module B depends on
43 # This ensures that anything exported by module A will be correctly
46 # Note that the build system will complain if you try to import a
47 # module that hasn't been declared yet anyway.
|
| /external/v8/test/mjsunit/ |
| debug-setexceptionbreak.js | 3 // modification, are permitted provided that the following conditions are
34 // actually breaks on exceptions or not. That functionality is tested
98 // Indicate that all was processed.
117 // Make sure that the debug event listener vas invoked.
|
| debug-listbreakpoints.js | 3 // modification, are permitted provided that the following conditions are
34 // actually breaks on exceptions or not. That functionality is tested
37 // Note: The following function g() is purposedly placed here so that
192 // Indicate that all was processed.
208 // Make sure that the debug event listener vas invoked.
|
| fuzz-natives.js | 3 // modification, are permitted provided that the following conditions are
130 // which means that we have to propagate errors back.
172 // That can only be invoked on Array.prototype.
|
| /external/webkit/PerformanceTests/SunSpider/tests/sunspider-0.9/ |
| crypto-aes.js | 52 } // note that this will work for Nb=4,5,6, but not 7,8 (always 4 for AES):
389 That thou her maid art far more fair than she:\n\
394 O, that she knew she were!\n\
395 She speaks yet she says nothing: what of that?\n\
405 That birds would sing and think it were not night.\n\
407 O, that I were a glove upon that hand,\n\
408 That I might touch that cheek!\n\
415 Of mortals that fall back to gaze on him\n
[all...] |
| /external/webkit/PerformanceTests/SunSpider/tests/sunspider-0.9.1/ |
| crypto-aes.js | 52 } // note that this will work for Nb=4,5,6, but not 7,8 (always 4 for AES):
389 That thou her maid art far more fair than she:\n\
394 O, that she knew she were!\n\
395 She speaks yet she says nothing: what of that?\n\
405 That birds would sing and think it were not night.\n\
407 O, that I were a glove upon that hand,\n\
408 That I might touch that cheek!\n\
415 Of mortals that fall back to gaze on him\n
[all...] |
| /build/core/ |
| pdk_config.mk | 109 # Note that if there is already explicit rule in the build system to generate a file,
111 # That's desired by us: we want only absent files from the platform zip package.
|
| /external/libvorbis/doc/ |
| a1-encapsulation-ogg.tex | 24 The Ogg/Vorbis I specification currently dictates that Ogg/Vorbis
26 form only. That is:
41 This is not to say that it is not currently possible to multiplex
118 position of the last packet \emph{completed} on that
121 subsequent block. A page that is entirely spanned by a single
122 packet (that completes on a subsequent page) has no granule
126 Note that the last decoded (fully lapped) PCM sample from a packet
127 is not necessarily the middle sample from that block. If, eg, the
136 that the stream started at position zero. Although the granule
139 inference it may indicate that the PCM position of the beginnin
[all...] |
| 02-bitpacking.tex | 22 'octet', that is, eight bits. This has not always been the case;
30 size that is a grouped multiple of this smallest size.
34 bytes (16, 32 or 64 bits). Note however that the Vorbis bitpacking
37 that a byte is one octet for purposes of example.
62 code that operates on a word of storage at a time rather than by byte.
84 byte and writing the next bit into the bit position 0 of that byte.
93 interpreted by the decoder given decode context. That is, the three
224 error; it is merely a state indicating that there is insufficient
237 not past, such that an 'end-of-packet' condition has not triggered)
|
| 05-comment.tex | 9 packets that begin a Vorbis bitstream. It is meant for short text
11 separate logical bitstream (usually an XML stream type) that provides
17 text note that need not only be a couple words, but isn't going to be
67 That is, comment fields consist of a field name and a corresponding value and
162 the world that doesn't speak English. Field \emph{contents},
167 the field name so that the field name is bounded in a known way. Thus
|
| 07-floor1.tex | 31 logical line segment and produces a y_new value at that point computed
38 amplitude value at x_new so that later refinement is additionally
163 condition that renders the stream undecodable. All vector
175 If \varname{[nonzero]} is unset, that indicates this channel contained
179 floor that has all points set to minimum representation amplitude,
350 values in \varname{[floor1_X_list]}. That is, sort the values of
352 elements of the other two vectors so that the X, Y and step2_flag
|
| /external/v8/src/ |
| math.js | 3 // modification, are permitted provided that the following conditions are
30 // has the added benefit that the code in this file is isolated from
36 // Instance class name can only be set on functions. That is the only
100 // It's more common to call this with a positive number that's out
|
| /external/antlr/antlr-3.4/runtime/ActionScript/project/src/org/antlr/runtime/tree/ |
| BaseTreeAdaptor.as | 9 /** A TreeAdaptor that works with any Tree implementation. */
12 * track ourselves. That's ok, it's only for debugging, though it's
22 /** create tree node that holds the start and stop tokens associated
48 /** This is generic in the sense that it will work with any kind of
73 * make sure that this is consistent with have the user will build
103 * Be advised that it's ok for newRoot to point at oldRoot's
|
| /external/dropbear/libtommath/ |
| bn.tex | 76 large integer numbers. It was written in portable ISO C source code so that it will build on any platform with a conforming
90 Since both\footnote{Note that the MPI files under mtest/ are copyrighted by Michael Fromberger. They are not required to use LibTomMath.} are in the
106 that and include ``tommath.h'' within your programs. Alternatively to build with MSVC issue the following
143 If you do not have a ``/dev/urandom'' style RNG source you will have to write your own PRNG and simply pipe that into
150 This will output a row of numbers that are increasing. Each column is a different test (such as addition, multiplication, etc)
151 that is being performed. The numbers represent how many times the test was invoked. If an error is detected the program
175 You will also note that the header tommath\_class.h is actually recursively included (it includes itself twice).
195 A trim is a manner of removing functionality from a function that is not required. For instance, to perform
255 Source code alone cannot really teach how the algorithms work which is why I also wrote a textbook that accompanies
256 the library (beat that!)
[all...] |
| /external/dropbear/libtomcrypt/ |
| crypt.tex | 123 The library was designed such that new ciphers/hashes/PRNGs can be added at run-time and the existing API
125 block cipher and hash function to ensure that they compile and execute to the published design specifications. The library
132 provide all of the tools required to build such functionality. LibTomCrypt was designed to be a flexible library that
139 \item I am too lazy to figure out someone else's API. I'd rather invent my own simpler API and use that.
143 The idea is that I am not striving to replace OpenSSL or Crypto++ or Cryptlib or etc. I'm trying to write my
148 on an x86 with zero problems. The consistent API also means that if you learn how to use Blowfish with the library you
150 that can be used to make a program automatically pick between ciphers, hashes and PRNGs at run-time. That means your
155 without having to use configure scripts. This means that the library will work with platforms where development
161 with \textit{cycles per byte} timings that are comparable (and often favourable) to other libraries such as OpenSSL an
[all...] |
