| /packages/wallpapers/NoiseField/ |
| proguard.cfg | 6 -optimizations !code/simplification/arithmetic,!field/*,!class/merging/*
|
| /packages/wallpapers/PhaseBeam/ |
| proguard.cfg | 6 -optimizations !code/simplification/arithmetic,!field/*,!class/merging/*
|
| /sdk/testapps/customViewTest/libWithCustomView/ |
| proguard.cfg | 6 -optimizations !code/simplification/arithmetic,!field/*,!class/merging/*
|
| /dalvik/dx/src/com/android/dx/cf/code/ |
| Merger.java | 40 * @return {@code non-null;} the result of merging the two locals arrays
92 * @return {@code non-null;} the result of merging the two stacks
130 ex.addContext("...while merging stack[" + Hex.u2(i) + "]");
149 * @return {@code non-null;} the result of merging the two types
197 * Merging two non-identical int-like types results in
|
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/parallel/ |
| multiway_merge.h | 28 * Explanations on the high-speed merging routines in the appendix of
259 /** @brief Highly efficient 3-way merging procedure.
261 * Merging is done with the algorithm implementation described by Peter
263 * comparison after merging out an element. The implementation trick
267 * This works well for merging up to 4 sequences.
269 * Note that making the merging stable does <em>not</em> come at a
272 * Whether the merging is done guarded or unguarded is selected by the
379 * @brief Highly efficient 4-way merging procedure.
381 * Merging is done with the algorithm implementation described by Peter
383 * comparison after merging out an element. The implementation tric
[all...] |
| types.h | 81 /// Merging algorithms:
95 /// Sorting/merging algorithms: sampling, exact.
|
| /external/chromium_org/chrome/browser/translate/ |
| translate_prefs_unittest.cc | 25 // The subcode (IT) will be ignored when merging, except for Chinese.
31 // when merging.
|
| /external/llvm/utils/release/ |
| merge.sh | 63 echo "Merging r$rev:" > $tempfile
69 echo "# Merging r$rev into $proj"
|
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.8/include/parallel/ |
| types.h | 83 /// Merging algorithms:
97 /// Sorting/merging algorithms: sampling, __exact.
|
| multiway_merge.h | 28 * Explanations on the high-speed merging routines in the appendix of
210 /** @brief Highly efficient 3-way merging procedure.
212 * Merging is done with the algorithm implementation described by Peter
214 * comparison after merging an element. The implementation trick
218 * This works well for merging up to 4 sequences.
220 * Note that making the merging stable does @a not come at a
223 * Whether the merging is done guarded or unguarded is selected by the
329 * @brief Highly efficient 4-way merging procedure.
331 * Merging is done with the algorithm implementation described by Peter
333 * comparison after merging an element. The implementation tric
[all...] |
| /external/chromium/chrome/browser/policy/ |
| profile_policy_connector.h | 57 // |browser_policy_provider_|, thus merging device policies into
|
| /external/chromium/chrome/browser/sync/glue/ |
| extension_data.h | 43 // Stores the given data as being from the given source, merging it
|
| /external/chromium_org/tools/telemetry/telemetry/value/ |
| __init__.py | 15 - merging properties
25 # The possible merging policies are listed here.
64 It must return a single Value. If merging does not make sense, the
90 aggregated across pages. If merging values of this type across pages is
|
| /external/chromium_org/v8/test/webkit/ |
| dfg-constant-fold-first-local-read-after-block-merge.js | 25 "Tests that the DFG doesn't crash if we constant fold the first read of a local variable in a block that is the result of merging two blocks, where the first doesn't touch the local and the second reads it."
|
| /external/jpeg/ |
| maktjpeg.st | 18 .C[-M] ; and no string merging, folks
|
| /external/llvm/test/Analysis/BasicAA/ |
| must-and-partial.ll | 3 ; When merging MustAlias and PartialAlias, merge to PartialAlias
|
| /external/llvm/test/Transforms/SimplifyCFG/ |
| PhiEliminate3.ll | 1 ; Test merging of blocks containing complex expressions,
|
| EqualPHIEdgeBlockMerge.ll | 1 ; Test merging of blocks with phi nodes.
29 ; Test merging of blocks with phi nodes where at least one incoming value
54 ; Test merging of blocks with phi nodes where at least one incoming value
106 ; After merging X into Y, we should have 5 predecessors
242 ; merging this block
|
| /external/oprofile/libpp/ |
| arrange_profiles.h | 24 * store merging options options used to classify profiles
83 * profile specification (after merging). Includes the set of dependent
115 /// merging matches against this
171 * classes containing profile_sets. Merging is done at this stage
|
| /external/qemu/distrib/jpeg-6b/ |
| maktjpeg.st | 18 .C[-M] ; and no string merging, folks
|
| /external/proguard/docs/manual/ |
| optimizations.html | 58 <dt><code><b>class/merging/vertical</b></code></dt>
61 <dt><code><b>class/merging/horizontal</b></code></dt>
108 <dt><code><b>code/merging</b></code></dt>
|
| /packages/apps/InCallUI/src/com/android/incallui/ |
| CallCommandClient.java | 137 Log.e(this, "Error merging calls.", e);
150 Log.e(this, "Error merging calls.", e);
163 Log.e(this, "Error merging calls.", e);
|
| /dalvik/dx/tests/115-merge/com/android/dx/merge/ |
| DexMergeTest.java | 35 * Test that DexMerge works by merging dex files, and then loading them into
128 * Merging dex files uses pessimistic sizes that naturally leave gaps in the
130 * compact the result. This exercises that by repeatedly merging a dex with
|
| /external/e2fsprogs/misc/ |
| chattr.1.in | 30 data journalling (j), secure deletion (s), no tail-merging (t),
132 support tail-merging). This is necessary for applications such as LILO
135 (yet, except in very experimental patches) support tail-merging.
|
| /external/llvm/lib/MC/ |
| MCPureStreamer.cpp | 153 // TODO: This is exactly the same as WinCOFFStreamer. Consider merging into
161 // TODO: This is exactly the same as WinCOFFStreamer. Consider merging into
174 // TODO: This is exactly the same as WinCOFFStreamer. Consider merging into
|
