Searched refs:two (Results 226 - 250 of 455) sorted by relevance

1234567891011>>

/external/pcre/dist2/
H A Dinstall-sh399 # Don't fail if two instances are running concurrently.
413 # Don't fail if two instances are running concurrently.
471 # We try this two ways since rm can't unlink itself on some
/external/protobuf/gtest/build-aux/
H A Dinstall-sh422 # Don't fail if two instances are running concurrently.
436 # Don't fail if two instances are running concurrently.
497 # We try this two ways since rm can't unlink itself on some
/external/protobuf/
H A Dinstall-sh422 # Don't fail if two instances are running concurrently.
436 # Don't fail if two instances are running concurrently.
497 # We try this two ways since rm can't unlink itself on some
/external/skia/src/opts/
H A DSkBlurImageFilter_opts.h89 // Fast path for kernel sizes between 2 and 127, working on two rows at a time.
101 two = vld1_lane_u32(s + srcStride, one, 1);
102 return vreinterpret_u8_u32(two);
/external/skia/src/pathops/
H A DSkPathOpsDebug.cpp2941 void SkPathOpsDebug::DumpOp(const SkPath& one, const SkPath& two, SkPathOp op, argument
2944 DumpOp(file, one, two, op, testName);
2947 void SkPathOpsDebug::DumpOp(FILE* file, const SkPath& one, const SkPath& two, SkPathOp op, argument
2958 fprintf(file, " path.setFillType((SkPath::FillType) %d);\n", two.getFillType());
2959 dump_path(file, two, false, true);
2991 static void debug_scale_matrix(const SkPath& one, const SkPath* two, SkMatrix& scale) { argument
2993 if (two) {
2994 larger.join(two->getBounds());
3019 static int debug_paths_draw_the_same(const SkPath& one, const SkPath& two, SkBitmap& bits) {
3033 canvas.drawPath(two, pain
[all...]
H A DSkPathWriter.cpp181 bool operator()(const int one, const int two) { argument
182 return fDistances[one] < fDistances[two];
/external/strace/
H A Dinstall-sh422 # Don't fail if two instances are running concurrently.
436 # Don't fail if two instances are running concurrently.
497 # We try this two ways since rm can't unlink itself on some
/external/stressapptest/
H A Dinstall-sh415 # Don't fail if two instances are running concurrently.
429 # Don't fail if two instances are running concurrently.
490 # We try this two ways since rm can't unlink itself on some
/external/vulkan-validation-layers/tests/gtest-1.7.0/build-aux/
H A Dinstall-sh422 # Don't fail if two instances are running concurrently.
436 # Don't fail if two instances are running concurrently.
497 # We try this two ways since rm can't unlink itself on some
/external/antlr/antlr-3.4/runtime/Ruby/lib/antlr3/tree/
H A Dvisitor.rb41 objects are similar to plain vanilla iterators, but provide two action hooks,
/external/clang/test/Parser/
H A Dcxx0x-attributes.cpp283 one, /* rest are deprecated */ two, three
/external/clang/test/Sema/
H A Ddesignated-initializers.c230 int two; member in struct:__anon2826::__anon2827
/external/curl/packages/vms/
H A Dcompare_curl_source.com5 $! This procedure compares the files in two directories and reports the
61 $! If P1 is "VMSBCK" then this changes the two directories:
/external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/
H A Dorg.eclipse.equinox.p2.reconciler.dropins_1.1.2.R36x_v20101111-1430.jarMETA-INF/MANIFEST.MF META-INF/ECLIPSEF.SF META-INF/ECLIPSEF.RSA META ...
/external/guava/guava-gwt/test-super/com/google/common/collect/super/com/google/common/collect/
H A DSetsTest.java114 ImmutableSet<SomeEnum> two
116 assertThat(two).has().exactly(SomeEnum.B, SomeEnum.D).inOrder();
623 Set<Set<Set<Object>>> two = powerSet(one);
624 Set<Set<Set<Set<Object>>>> four = powerSet(two);
/external/llvm/test/MC/ARM/
H A Deh-directive-section-multiple-func.s54 @ Check the .TEST1 section. There should be two "bx lr" instructions.
H A Deh-directive-vsave.s7 @ stack. There are two different opcodes:
/external/mesa3d/docs/
H A DMESA_swap_frame_usage.spec51 completion of the two swaps. If the value is in the range [0,1], the
113 between two buffer-swap operations being committed. In unextended GLX the
/external/mockito/src/test/java/org/mockitousage/basicapi/
H A DUsingVarargsTest.java139 String doSomething(String one, String two, String... varargs); argument
160 when(mixedVarargs.doSomething("one", "two", (String[])null)).thenReturn("hello");
163 String result = mixedVarargs.doSomething("one", "two", (String[])null);
/external/libvpx/libvpx/vpx_dsp/x86/
H A Dvpx_subpixel_8t_ssse3.asm114 ;Do two rows at once
197 ;Do two rows at once
379 ;Do two rows at once
490 ;Do two rows at once
686 ;Do two rows at once
/external/protobuf/java/core/src/test/java/com/google/protobuf/
H A DLiteTest.java1637 TestAllTypesLite two = TestAllTypesLite.parseFrom(bytes);
1640 two = two.toBuilder().mergeFrom(bytes).build();
1641 assertEquals(one, two);
1642 assertEquals(two, one);
1643 assertEquals(one.hashCode(), two.hashCode());
1649 TestAllTypesLite two = one.toBuilder().mergeFrom(one).mergeFrom(bytes).build();
1651 assertFalse(one.equals(two));
1652 assertFalse(two.equals(one));
2139 // Check that two identica
[all...]
/external/libvorbis/doc/
H A D01-introduction.tex208 A floor encoding may be of two types. Floor 0 uses a packed LSP
212 The two floors are semantically interchangeable in
343 Vorbis frames may be one of two PCM sample sizes specified during
344 codec setup. In Vorbis I, legal frame sizes are powers of two from 64
358 \captionof{figure}{overlap of two equal-sized windows}
374 window (short windows require no modification), Vorbis also codes two
453 % TODO/FIXME: The following two paragraphs have identical twins
H A D04-codec.tex135 Vorbis uses two floor types; header decode is handed to the decode
169 one or two, decode the residue configuration as defined in \xref{vorbis:spec:residue}; save this configuration in slot \varname{[i]} of the residue configuration array \varname{[vorbis_residue_configurations]}.
170 \item If the the residue type is greater than two, this stream is undecodable; ERROR CONDITION
211 \item the numbers read in the above two steps are channel numbers representing the channel to treat as magnitude and the channel to treat as angle, respectively. If for any coupling step the angle channel number equals the magnitude channel number, the magnitude channel number is greater than \varname{[audio_channels]}-1, or the angle channel is greater than \varname{[audio_channels]}-1, the stream is undecodable.
419 zeroed and nonzeroed vector to produce two nonzeroed vectors.
541 % TODO/FIXME: The following two paragraphs have identical twins
623 \item[two channels]
/external/ImageMagick/www/api/
H A Dmorphology.php136 <dd> Gaussian:{radius},{sigma} Generate a two-dimensional gaussian kernel, as used by -gaussian. The sigma for the curve is required. The resulting kernel is normalized, </dd>
152 <dd> Note that two convolutions with two "Blur" kernels perpendicular to each other, is equivalent to a far larger "Gaussian" kernel with the same sigma value, However it is much faster to apply. This is how the "-blur" operator actually works. </dd>
154 <dd> Comet:{width},{sigma},{angle} Blur in one direction only, much like how a bright object leaves a comet like trail. The Kernel is actually half a gaussian curve, Adding two such blurs in opposite directions produces a Blur Kernel. Angle can be rotated in multiples of 90 degrees. </dd>
250 <dd> Ring:{radius1},{radius2}[,{scale}] A ring of the values given that falls between the two radii. Defaults to a ring of approximataly 3 radius in a 7x7 kernel. This is the 'edge' pixels of the default "Disk" kernel, More specifically, "Ring" -&gt; "Ring:2.5,3.5,1.0" </dd>
254 <dd> Peak:radius1,radius2 Find any peak larger than the pixels the fall between the two radii. The default ring of pixels is as per "Ring". Edges Find flat orthogonal edges of a binary shape Corners Find 90 degree corners of a binary shape Diagonals:type A special kernel to thin the 'outside' of diagonals LineEnds:type Find end points of lines (for pruning a skeletion) Two types of lines ends (default to both) can be searched for Type 0: All line ends Type 1: single kernel for 4-conneected line ends Type 2: single kernel for simple line ends LineJunctions Find three line junctions (within a skeletion) Type 0: all line junctions Type 1: Y Junction kernel Type 2: Diagonal T Junction kernel Type 3: Orthogonal T Junction kernel Type 4: Diagonal X Junction kernel Type 5: Orthogonal + Junction kernel Ridges:type Find single pixel ridges or thin lines Type 1: Fine single pixel thick lines and ridges Type 2: Find two pixel thick lines and ridges ConvexHull Octagonal Thickening Kernel, to generate convex hulls of 45 degrees Skeleton:type Traditional skeleton generating kernels. Type 1: Tradional Skeleton kernel (4 connected skeleton) Type 2: HIPR2 Skeleton kernel (8 connected skeleton) Type 3: Thinning skeleton based on a ressearch paper by Dan S. Bloomberg (Default Type) ThinSE:type A huge variety of Thinning Kernels designed to preserve conectivity. many other kernel sets use these kernels as source definitions. Type numbers are 41-49, 81-89, 481, and 482 which are based on the super and sub notations used in the source research paper. </dd>
383 <p>This is almost identical to the MorphologyPrimative() function above, but applies the primitive directly to the actual image using two passes, once in each direction, with the results of the previous (and current) row being re-used.</p>
470 <p>If either of the two 'normalize_flags' are given the kernel will first be normalized and then further scaled by the scaling factor value given.</p>
/external/boringssl/src/crypto/bn/
H A Dbn_test.cc263 bssl::UniquePtr<BIGNUM> ret(BN_new()), two(BN_new()), remainder(BN_new());
264 if (!ret || !two || !remainder ||
265 !BN_set_word(two.get(), 2) ||
268 !BN_mul(ret.get(), a.get(), two.get(), ctx) ||
270 !BN_div(ret.get(), remainder.get(), lshift1.get(), two.get(), ctx) ||
284 !BN_div(ret.get(), nullptr /* rem */, lshift1.get(), two.get(), ctx) ||
621 // There are two possible answers.
1697 fprintf(stderr, "BN_is_pow2 returned false for a power of two.\n");
1703 // Pick a large random value, ensuring it isn't a power of two.
1711 fprintf(stderr, "BN_is_pow2 returned true for a non-power of two
[all...]

Completed in 2048 milliseconds

1234567891011>>