| /toolchain/binutils/binutils-2.25/ld/testsuite/ld-cris/ |
| tls-ie-11.d | 8 # DSO with two R_CRIS_32_GOT_TPREL against different symbols. Check
|
| tls-ie-9.d | 8 # DSO with two R_CRIS_16_GOT_TPREL against different symbols. Check
|
| tls-ld-5.d | 8 # DSO with two R_CRIS_16_DTPRELs against different hidden symbols.
|
| tls-ld-7.d | 8 # DSO with two R_CRIS_32_DTPRELs against different hidden symbols.
|
| /external/guava/guava-tests/test/com/google/common/collect/ |
| MapMakerInternalMapTest.java | 126 // round up to nearest power of two
145 // share capacity over each segment, then round up to nearest power of two
286 Object two = new Object(); local
292 map.put(one, two);
294 assertNotified(listener, one, two, RemovalCause.EXPLICIT);
296 map.put(two, three);
297 map.remove(two, three);
298 assertNotified(listener, two, three, RemovalCause.EXPLICIT);
329 Object two = new Object(); local
335 map.put(one, two);
361 Object two = new Object(); local
386 Object two = new Object(); local
[all...] |
| /external/v8/test/mjsunit/ |
| switch.js | 58 r = "two";
93 r = "two";
105 assertEquals("two", f3(2,0), "value-switch.2-0");
135 case 'two':
144 assertEquals(3, f4_string('two', 2), "fallthrough-string-switch.2");
|
| /prebuilts/go/darwin-x86/src/compress/flate/ |
| huffman_code.go | 149 // For every level, the first two items are the first two characters.
190 // nextPairFreq isn't valid until we generate two
201 // of that level with the sum of the two nodes we've just calculated on
281 // two or fewer literals, everything has bit length 1.
|
| /prebuilts/go/darwin-x86/src/runtime/ |
| proc_test.go | 325 // Start two co-scheduled hog goroutines.
330 // Start two co-scheduled light goroutines.
577 // divide in two by y axis
584 // divide in two by x axis
591 // divide in two by "k" axis
|
| /prebuilts/go/linux-x86/src/compress/flate/ |
| huffman_code.go | 149 // For every level, the first two items are the first two characters.
190 // nextPairFreq isn't valid until we generate two
201 // of that level with the sum of the two nodes we've just calculated on
281 // two or fewer literals, everything has bit length 1.
|
| /prebuilts/go/linux-x86/src/runtime/ |
| proc_test.go | 325 // Start two co-scheduled hog goroutines.
330 // Start two co-scheduled light goroutines.
577 // divide in two by y axis
584 // divide in two by x axis
591 // divide in two by "k" axis
|
| /prebuilts/go/darwin-x86/src/text/template/ |
| doc.go | 145 any type) or two return values, the second of which is an error.
146 If it has two and the returned error is non-nil, execution terminates
194 The output of a command will be either one value or two values, the second of
210 successive elements of the iteration. Also, a "range" may declare two
259 During execution functions are found in two function maps: first in the
278 return either one or two result values, the second of which
329 For simpler multi-way equality tests, eq (only) accepts two or more
370 {{define "T2"}}TWO{{end}}
374 This defines two templates, T1 and T2, and a third T3 that invokes the other two
[all...] |
| /prebuilts/go/linux-x86/src/text/template/ |
| doc.go | 145 any type) or two return values, the second of which is an error.
146 If it has two and the returned error is non-nil, execution terminates
194 The output of a command will be either one value or two values, the second of
210 successive elements of the iteration. Also, a "range" may declare two
259 During execution functions are found in two function maps: first in the
278 return either one or two result values, the second of which
329 For simpler multi-way equality tests, eq (only) accepts two or more
370 {{define "T2"}}TWO{{end}}
374 This defines two templates, T1 and T2, and a third T3 that invokes the other two
[all...] |
| /external/bison/doc/ |
| refcard.tex | 41 % The final reference card has two columns:
44 % produces two separate pages, each of which needs to be reduced to 80%.
102 %%%% smallcopyrightnotice for two column printing on one page.
157 % two lines below commented out in Yet Another Attempt to eliminate
182 %%%% Reduce skip from .8 to .75 to permit printing on two pages.
215 %% in case we never use \columnb (two-column mode)
|
| /external/libchrome/sandbox/linux/bpf_dsl/ |
| codegen_unittest.cc | 247 // The two "LOAD 0" instructions are blocks of their own. MergeTails() could
279 // crash as the two "LOAD 0" instructions would get merged.
301 // In PointerCompare(), this exercises the path where two blocks are of the
389 // instructions: two far jumps plus the branch itself.
397 CodeGen::Node two = local
399 EXPECT_EQ(one + 1, two); // XXX: Implementation detail!
400 RunTest(two);
|
| /libcore/tzdata/update/src/test/libcore/tzdata/update/ |
| FileUtilsTest.java | 159 File two = new File(one, "two"); local
160 File three = new File(two, "three");
163 assertDirExistsAndIsAccessible(two, true /* requireWorldReadable */);
248 assertEquals(lines, Arrays.asList("One", "Two", "Three"));
|
| /bionic/libm/upstream-freebsd/lib/msun/ld128/ |
| s_erfl.c | 33 two = 2; variable
317 if(x < -9) return two-tiny; /* x < -9 */
325 if(x>0) return r/ax; else return two-r/ax;
327 if(x>0) return tiny*tiny; else return two-tiny;
|
| /external/ImageMagick/www/api/ |
| morphology.php | 136 <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" -> "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 sca (…)
[all...] |
| /external/antlr/antlr-3.4/runtime/Ruby/test/functional/debugging/ |
| profile-mode.rb | 18 /** In this rule, the functionHeader left prefix on the last two
|
| /external/clang/test/CodeGenCXX/ |
| x86_64-arguments.cpp | 9 // Check with two eight-bytes in base class.
15 // Check with two eight-bytes in base class and merge.
204 short two; member in struct:test10::BasePacked
|
| /external/clang/test/Parser/ |
| cxx-template-decl.cpp | 173 char two[2];
|
| /external/eigen/bench/btl/data/ |
| gnuplot_common_settings.hh | 3 set noclip two
|
| /external/fec/ |
| sumsq_mmx_assist.s | 24 # Since 4 * 32767**2 < 2**32, we can accumulate two at a time
|
| /external/guice/core/test/com/google/inject/ |
| BindingTest.java | 257 C<Injector> two = (C<Injector>) injector.getInstance(i); local
258 assertEquals(Stage.DEVELOPMENT, two.stage);
259 assertEquals(injector, two.t);
260 assertEquals(injector, two.anotherT);
|
| /external/libavc/common/arm/ |
| ih264_default_weighted_pred_a9q.s | 50 @* This function gets two ht x wd blocks, calculates their rounded-average and
224 @* This function gets two ht x wd blocks, calculates their rounded-average and
295 loop_2_uv: @each iteration processes two rows
313 loop_4_uv: @each iteration processes two rows
|
| /external/libvorbis/examples/ |
| frameview.pl | 251 my$two=$graph_shell->Canvas()->
262 $twostate{"canvas"}=$two;
505 $two->place(-relwidth=>1.,-relheight=>1.,-rely=>1.,
521 $two->placeForget();
|
