HomeSort by relevance Sort by last modified time
    Searched refs:original (Results 176 - 200 of 515) sorted by null

1 2 3 4 5 6 78 91011>>

  /external/chromium/sdch/open-vcdiff/vsprojects/
vcdiff_test.bat 71 || ( echo Decoded target does not match original ^
93 || ( echo Decoded target does not match original ^
113 || ( echo Decoded target does not match original ^
132 || ( echo Decoded target does not match original ^
139 rem If using the wrong dictionary, and dictionary is smaller than the original
204 || ( echo Decoded target does not match original ^
297 || ( echo Decoded target does not match original with -buffersize=1 ^
363 || ( echo Decoded target does not match original with -interleaved ^
382 || ( echo Decoded target does not match original with -target_matches ^
  /external/guava/guava-tests/test/com/google/common/collect/
TableCollectionTest.java 477 Table<Integer, String, Character> original
479 return Tables.transpose(original);
788 Table<String, Character, Integer> original = TreeBasedTable.create(); local
789 return Tables.transpose(original);
929 Table<Character, String, Integer> original = TreeBasedTable.create(); local
1209 Table<String, Integer, String> original = HashBasedTable.create(); local
1229 Table<String, Integer, Character> original = HashBasedTable.create(); local
1249 RowSortedTable<String, Integer, Character> original = TreeBasedTable.create(); local
1328 Table<Integer, String, String> original = HashBasedTable.create(); local
1348 Table<Integer, String, Character> original = HashBasedTable.create(); local
1368 RowSortedTable<Integer, String, Character> original = TreeBasedTable.create(); local
    [all...]
  /external/open-vcdiff/vsprojects/
vcdiff_test.bat 71 || ( echo Decoded target does not match original ^
93 || ( echo Decoded target does not match original ^
113 || ( echo Decoded target does not match original ^
132 || ( echo Decoded target does not match original ^
139 rem If using the wrong dictionary, and dictionary is smaller than the original
204 || ( echo Decoded target does not match original ^
297 || ( echo Decoded target does not match original with -buffersize=1 ^
363 || ( echo Decoded target does not match original with -interleaved ^
382 || ( echo Decoded target does not match original with -target_matches ^
  /external/eigen/Eigen/src/Core/util/
Memory.h 93 void *original = std::malloc(size+16); local
94 if (original == 0) return 0;
95 void *aligned = reinterpret_cast<void*>((reinterpret_cast<size_t>(original) & ~(size_t(15))) + 16);
96 *(reinterpret_cast<void**>(aligned) - 1) = original;
114 void *original = *(reinterpret_cast<void**>(ptr) - 1); local
115 original = std::realloc(original,size+16);
116 if (original == 0) return 0;
117 void *aligned = reinterpret_cast<void*>((reinterpret_cast<size_t>(original) & ~(size_t(15))) + 16);
118 *(reinterpret_cast<void**>(aligned) - 1) = original;
    [all...]
  /external/v8/test/mjsunit/
array-iteration.js 50 // Modify original array.
90 // Modify original array.
133 // Modify original array.
170 // Modify original array.
208 // Modify original array.
  /external/guava/guava/src/com/google/common/cache/
LocalCache.java 454 Segment<K, V> segment, ReferenceEntry<K, V> original, ReferenceEntry<K, V> newNext) {
455 ReferenceEntry<K, V> newEntry = super.copyEntry(segment, original, newNext);
456 copyAccessEntry(original, newEntry);
469 Segment<K, V> segment, ReferenceEntry<K, V> original, ReferenceEntry<K, V> newNext) {
470 ReferenceEntry<K, V> newEntry = super.copyEntry(segment, original, newNext);
471 copyWriteEntry(original, newEntry);
484 Segment<K, V> segment, ReferenceEntry<K, V> original, ReferenceEntry<K, V> newNext) {
485 ReferenceEntry<K, V> newEntry = super.copyEntry(segment, original, newNext);
486 copyAccessEntry(original, newEntry);
487 copyWriteEntry(original, newEntry)
    [all...]
  /external/guava/guava/src/com/google/common/base/
CharMatcher.java 557 final CharMatcher original = this;
560 return !original.matches(c);
564 return original.matchesNoneOf(sequence);
568 return original.matchesAllOf(sequence);
572 return sequence.length() - original.countIn(sequence);
576 return original;
649 * query than the original; your mileage may vary. Precomputation takes time and is likely to be
664 * <p>The default precomputation is to cache the configuration of the original matcher in an
666 * than the original.
    [all...]
  /packages/apps/Gallery2/tests/src/com/android/photos/data/
MediaCacheTest.java 135 mImage = new File(mDir, "original.jpg");
176 Bitmap original = BitmapFactory.decodeFile(mImage.getPath()); local
177 assertTrue(bitmap.getWidth() < original.getWidth());
178 assertTrue(bitmap.getHeight() < original.getHeight());
215 Bitmap original = BitmapFactory.decodeFile(mImage.getPath());
216 assertTrue(bitmap.getWidth() < original.getWidth());
217 assertTrue(bitmap.getHeight() < original.getHeight());
235 mImage = new File(mDir, "original.mp4");
294 mImage = new File(mDir, "original.mp4");
  /external/guava/guava/src/com/google/common/primitives/
Booleans.java 226 private static boolean[] copyOf(boolean[] original, int length) {
228 System.arraycopy(original, 0, copy, 0, Math.min(original.length, length));
Chars.java 344 private static char[] copyOf(char[] original, int length) {
346 System.arraycopy(original, 0, copy, 0, Math.min(original.length, length));
Doubles.java 283 private static double[] copyOf(double[] original, int length) {
285 System.arraycopy(original, 0, copy, 0, Math.min(original.length, length));
Floats.java 280 private static float[] copyOf(float[] original, int length) {
282 System.arraycopy(original, 0, copy, 0, Math.min(original.length, length));
Ints.java 353 private static int[] copyOf(int[] original, int length) {
355 System.arraycopy(original, 0, copy, 0, Math.min(original.length, length));
Longs.java 337 private static long[] copyOf(long[] original, int length) {
339 System.arraycopy(original, 0, copy, 0, Math.min(original.length, length));
Shorts.java 350 private static short[] copyOf(short[] original, int length) {
352 System.arraycopy(original, 0, copy, 0, Math.min(original.length, length));
  /external/guava/guava-gwt/src-super/com/google/common/primitives/super/com/google/common/primitives/
Chars.java 293 private static char[] copyOf(char[] original, int length) {
295 System.arraycopy(original, 0, copy, 0, Math.min(original.length, length));
Ints.java 297 private static int[] copyOf(int[] original, int length) {
299 System.arraycopy(original, 0, copy, 0, Math.min(original.length, length));
Longs.java 270 private static long[] copyOf(long[] original, int length) {
272 System.arraycopy(original, 0, copy, 0, Math.min(original.length, length));
Shorts.java 298 private static short[] copyOf(short[] original, int length) {
300 System.arraycopy(original, 0, copy, 0, Math.min(original.length, length));
  /external/icu4c/common/
ucnv_err.c 148 UConverterFromUCallback original = NULL; local
162 &original,
271 original,
uresimp.h 56 char *fName; /* name of the locale for bundle - still to decide whether it is original or fallback */
109 U_CFUNC UResourceBundle *ures_copyResb(UResourceBundle *r, const UResourceBundle *original, UErrorCode *status);
  /frameworks/base/core/java/android/text/style/
SuggestionSpan.java 41 * the original text by one of the suggestions.
224 * @return The name of the class to notify. The class of the original IME package will receive
226 * the original string, the suggested replacement string as well as the hashCode of this span.
347 public void notifySelection(Context context, String original, int index) {
353 // Ensures that only a class in the original IME package will receive the
366 intent.putExtra(SuggestionSpan.SUGGESTION_SPAN_PICKED_BEFORE, original);
373 imm.notifySuggestionPicked(this, original, index);
  /cts/tests/src/android/opengl/cts/
CompressedTextureSurfaceView.java 208 int original = mBaseTexture.getPixel(x, y); local
210 int deltaR = Math.abs(R - Color.red(original));
211 int deltaG = Math.abs(G - Color.green(original));
212 int deltaB = Math.abs(B - Color.blue(original));
  /external/ceres-solver/docs/
curvefitting.tex 4 The examples we have seen until now are simple optimization problems with no data. The original purpose of least squares and non-linear least squares analysis was fitting curves to data. It is only appropriate that we now consider an example of such a problem\footnote{The full code and data for this example can be found in
77 Starting from parameter values $m = 0, c=0$ with an initial objective function value of $121.173$ Ceres finds a solution $m= 0.291861, c = 0.131439$ with an objective function value of $1.05675$. These values are a a bit different than the parameters of the original model $m=0.3, c= 0.1$, but this is expected. When reconstructing a curve from noisy data, we expect to see such deviations. Indeed, if you were to evaluate the objective function for $m=0.3, c=0.1$, the fit is worse with an objective function value of 1.082425. Figure~\ref{fig:exponential} illustrates the fit.
  /external/compiler-rt/BlocksRuntime/
runtime.c 53 long original = InterlockedCompareExchange(dst, newl, oldl); local
54 return (original == oldl);
59 int original = InterlockedCompareExchange(dst, newi, oldi); local
60 return (original == oldi);

Completed in 701 milliseconds

1 2 3 4 5 6 78 91011>>