/external/icu/icu4c/source/data/misc/ |
H A D | miscfiles.mk | 2 # License & terms of use: http://www.unicode.org/copyright.html 5 # A list of txt's to build 8 # If you are thinking of modifying this file, READ THIS. 10 # Instead of changing this file [unless you want to check it back in], 21 # * To REPLACE the default list and only build a subset of files:
|
/external/icu/icu4c/source/data/sprep/ |
H A D | sprepfiles.mk | 2 # License & terms of use: http://www.unicode.org/copyright.html 5 # A list of txt's to build 8 # If you are thinking of modifying this file, READ THIS. 10 # Instead of changing this file [unless you want to check it back in], 21 # * To REPLACE the default list and only build a subset of files:
|
/external/libusb/android/jni/ |
H A D | Application.mk | 5 # modify it under the terms of the GNU Lesser General Public 7 # version 2.1 of the License, or (at your option) any later version. 10 # but WITHOUT ANY WARRANTY; without even the implied warranty of 14 # You should have received a copy of the GNU Lesser General Public 22 # of shared object in NDK versions at least up to r9.
|
/external/ltp/testcases/kernel/containers/pidns/ |
H A D | README | 6 ## it under the terms of the GNU General Public License as published by ## 7 ## the Free Software Foundation; either version 2 of the License, or ## 11 ## WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY ## 15 ## You should have received a copy of the GNU General Public License ## 23 A pid namespace is a view of particular set of tasks on the system. For processes, a process may have pid 1234 in one namespace, but have pid 1 in another.This allows processes to use process ids which are in use in other pid namespaces, without having to worry about what pids exist in other namespaces. 27 "Another way of specifying process visibility, then is that process A will see all tasks which have a valid pid in process A's pid namespace." 33 1> Check the process id of container after cloning as 1. 34 2> After creation of container the PID Namespace of th [all...] |
/external/valgrind/memcheck/tests/ |
H A D | noisy_child.stderr.exp | 2 Invalid write of size 1 4 Address 0x........ is 5 bytes inside a block of size 10 free'd 11 Invalid write of size 1 14 Address 0x........ is 0 bytes after a block of size 10 free'd 28 For counts of detected and suppressed errors, rerun with: -v
|
/external/webrtc/webrtc/modules/video_processing/test/ |
H A D | readYUV420file.m | 9 % Number of pixels per image 15 % calculate number of frames 16 fseek(fid,0,'eof'); % move to end of file 17 fileLen=ftell(fid); % number of bytes 20 % calculate number of frames
|
/external/ImageMagick/www/api/ |
H A D | magick-image.php | 12 <meta name="description" content="ImageMagick® is a software suite to create, edit, compose, or convert bitmap images. It can read and write images in a variety of formats (over 200) including PNG, JPEG, JPEG-2000, GIF, WebP, Postscript, PDF, and SVG. Use ImageMagick to resize, flip, mirror, rotate, distort, shear and transform images, adjust image colors, apply various special effects, or draw text, lines, polygons, ellipses and Bézier curves."/> 61 <p>The format of the GetImageFromMagickWand method is:</p> 67 <p>A description of each parameter follows:</p> 81 <p>MagickAdaptiveBlurImage() adaptively blurs the image by blurring less intensely near image edges and more intensely far from edges. We blur the image with a Gaussian operator of the given radius and standard deviation (sigma). For reasonable results, radius should be larger than sigma. Use a radius of 0 and MagickAdaptiveBlurImage() selects a suitable radius for you.</p> 83 <p>The format of the MagickAdaptiveBlurImage method is:</p> 90 <p>A description of each parameter follows:</p> 102 <dd>the radius of the Gaussian, in pixels, not counting the center pixel. </dd> 106 <dd>the standard deviation of the Gaussian, in pixels. </dd> 116 <p>A description of eac [all...] |
H A D | memory.php | 12 <meta name="description" content="ImageMagick® is a software suite to create, edit, compose, or convert bitmap images. It can read and write images in a variety of formats (over 200) including PNG, JPEG, JPEG-2000, GIF, WebP, Postscript, PDF, and SVG. Use ImageMagick to resize, flip, mirror, rotate, distort, shear and transform images, adjust image colors, apply various special effects, or draw text, lines, polygons, ellipses and Bézier curves."/> 59 <p>AcquireAlignedMemory() returns a pointer to a block of memory at least size bytes whose address is a multiple of 16*sizeof(void *).</p> 61 <p>The format of the AcquireAlignedMemory method is:</p> 67 <p>A description of each parameter follows:</p> 75 <dd>the number of quantum elements to allocate. </dd> 79 <dd>the number of bytes in each quantum. </dd> 85 <p>AcquireMagickMemory() returns a pointer to a block of memory at least size bytes suitably aligned for any use.</p> 87 <p>The format of the AcquireMagickMemory method is:</p> 93 <p>A description of eac [all...] |
H A D | quantize.php | 9 <title>ImageMagick: MagickCore, C API for ImageMagick: Reduce the Number of Unique Colors in an Image</title> 12 <meta name="description" content="ImageMagick® is a software suite to create, edit, compose, or convert bitmap images. It can read and write images in a variety of formats (over 200) including PNG, JPEG, JPEG-2000, GIF, WebP, Postscript, PDF, and SVG. Use ImageMagick to resize, flip, mirror, rotate, distort, shear and transform images, adjust image colors, apply various special effects, or draw text, lines, polygons, ellipses and Bézier curves."/> 15 <meta name="keywords" content="magickcore, c, api, for, imagemagick:, reduce, the, number, of, unique, colors, in, an, image, ImageMagick, PerlMagick, image processing, image, photo, software, Magick++, OpenMP, convert"/> 59 <p>QuantizeImage() takes a standard RGB or monochrome images and quantizes them down to some fixed number of colors.</p> 61 <p>For purposes of color allocation, an image is a set of n pixels, where each pixel is a point in RGB space. RGB space is a 3-dimensional vector space, and each pixel, Pi, is defined by an ordered triple of red, green, and blue coordinates, (Ri, Gi, Bi).</p> 63 <p>Each primary color component (red, green, or blue) represents an intensity which varies linearly from 0 to a maximum value, Cmax, which corresponds to full saturation of that color. Color allocation is defined over a domain consisting of the cube in RGB space with opposite vertices at (0,0,0) and (Cmax, Cmax, Cmax). QUANTIZE requires Cmax = 255.</p> 65 <p>The algorithm maps this domain onto a tree in which each node represents a cube within that domain. In the following discussion these cubes are defined by the coordinate of tw [all...] |
/external/guava/guava-gwt/test-super/com/google/common/collect/super/com/google/common/collect/ |
H A D | ImmutableBiMapTest.java | 6 * You may obtain a copy of the License at 42 // TODO: Reduce duplication of ImmutableMapTest code 82 return ImmutableBiMap.of(); 86 return ImmutableBiMap.of("one", 1, "two", 2, "three", 3); 101 return ImmutableBiMap.of(); 105 return ImmutableBiMap.of(1, "one", 2, "two", 3, "three").inverse(); 123 assertSame(ImmutableBiMap.of(), map); 244 ImmutableBiMap.of("one", 1), 247 ImmutableBiMap.of("one", 1).inverse(), 250 ImmutableBiMap.of("on [all...] |
/external/mockito/src/test/java/org/mockito/internal/util/collections/ |
H A D | HashCodeAndEqualsSafeSetTest.java | 3 * This program is made available under the terms of the MIT License. 63 HashCodeAndEqualsSafeSet mocks = HashCodeAndEqualsSafeSet.of( 76 HashCodeAndEqualsSafeSet mocks = HashCodeAndEqualsSafeSet.of( 91 HashCodeAndEqualsSafeSet mocks = HashCodeAndEqualsSafeSet.of( 106 HashCodeAndEqualsSafeSet mocks = HashCodeAndEqualsSafeSet.of( 119 HashCodeAndEqualsSafeSet mocks = HashCodeAndEqualsSafeSet.of(mock1); 128 HashCodeAndEqualsSafeSet.of().clone(); 133 HashCodeAndEqualsSafeSet set = HashCodeAndEqualsSafeSet.of(mock1); 141 HashCodeAndEqualsSafeSet set = HashCodeAndEqualsSafeSet.of(mock1); 147 HashCodeAndEqualsSafeSet set = HashCodeAndEqualsSafeSet.of(); [all...] |
/external/guava/guava-tests/test/com/google/common/collect/ |
H A D | ImmutableMultisetTest.java | 6 * You may obtain a copy of the License at 134 Multiset<String> multiset = ImmutableMultiset.of(); 139 Multiset<String> multiset = ImmutableMultiset.of("a"); 144 Multiset<String> multiset = ImmutableMultiset.of("a", "b"); 149 Multiset<String> multiset = ImmutableMultiset.of("a", "b", "c"); 154 Multiset<String> multiset = ImmutableMultiset.of("a", "b", "c", "d"); 159 Multiset<String> multiset = ImmutableMultiset.of("a", "b", "c", "d", "e"); 165 Multiset<String> multiset = ImmutableMultiset.of( 172 Multiset<String> multiset = ImmutableMultiset.of( 193 Multiset<String[]> multiset = ImmutableMultiset.<String[]>of(arra [all...] |
H A D | ImmutableMapTest.java | 6 * You may obtain a copy of the License at 173 return ImmutableMap.of(); 177 return ImmutableMap.of("one", 1, "two", 2, "three", 3); 192 return ImmutableMap.of("one", 1); 209 ImmutableMap.of("one", 1, "two", 2, "three", 3)); 230 return ImmutableMap.of( 250 return ImmutableMap.of(); 255 return ImmutableMap.of( 273 return ImmutableMap.of(0, unhashables.e0); 487 ImmutableMap.of("on [all...] |
/external/valgrind/gdbserver_tests/ |
H A D | mcleak.stderrB.exp | 3 10 bytes in 1 blocks are still reachable in loss record ... of ... 7 10 (+10) bytes in 1 (+1) blocks are definitely lost in loss record ... of ... 11 21 (+21) bytes in 1 (+1) blocks are still reachable in loss record ... of ... 15 65 (+65) bytes in 2 (+2) blocks are still reachable in loss record ... of ... 19 10 (+10) bytes in 1 (+1) blocks are still reachable in loss record ... of ... 23 0 (-10) bytes in 0 (-1) blocks are still reachable in loss record ... of ... 27 10 (+10) bytes in 1 (+1) blocks are definitely lost in loss record ... of ... 31 0 (-10) bytes in 0 (-1) blocks are definitely lost in loss record ... of ... 35 10 (+10) bytes in 1 (+1) blocks are still reachable in loss record ... of ... 39 32 (+32) bytes in 1 (+1) blocks are definitely lost in loss record ... of [all...] |
/external/antlr/antlr-3.4/runtime/Perl5/lib/ANTLR/Runtime/ |
H A D | BitSet.pm | 14 # number of bits / long 23 # turns out that, for powers of two, this mod operation is 48 # Construct a bitset of size one word (64 bits) 58 # Construction from a static array of longs 72 # Construction from a list of integers 86 sub of { subroutine 266 A stripped-down version of org.antlr.misc.BitSet that is just good enough to 274 =item C<of> 288 Grows the set to a larger number of bits. 292 Sets the size of [all...] |
/external/valgrind/memcheck/tests/amd64/ |
H A D | sh-mem-vec128-plo-no.stderr.exp | 28 Invalid read of size 16 30 Address 0x........ is 1 bytes before a block of size 80,000 alloc'd 35 Invalid write of size 8 37 Address 0x........ is 1 bytes before a block of size 80,000 alloc'd 47 Invalid read of size 16 49 Address 0x........ is 79,985 bytes inside a block of size 80,000 alloc'd 54 Invalid write of size 8 56 Address 0x........ is 79,993 bytes inside a block of size 80,000 alloc'd 64 Invalid read of size 16 66 Address 0x........ is 0 bytes inside a block of siz [all...] |
H A D | sh-mem-vec256-plo-yes.stderr.exp | 28 Invalid read of size 32 30 Address 0x........ is 1 bytes before a block of size 80,000 alloc'd 35 Invalid write of size 8 37 Address 0x........ is 1 bytes before a block of size 80,000 alloc'd 47 Invalid read of size 32 49 Address 0x........ is 79,969 bytes inside a block of size 80,000 alloc'd 54 Invalid write of size 8 56 Address 0x........ is 79,993 bytes inside a block of size 80,000 alloc'd 352 Invalid read of size 32 354 Address 0x........ is 1 bytes inside a block of siz [all...] |
/external/valgrind/memcheck/tests/x86/ |
H A D | sh-mem-vec128-plo-no.stderr.exp | 28 Invalid read of size 16 30 Address 0x........ is 1 bytes before a block of size 80,000 alloc'd 35 Invalid write of size 8 37 Address 0x........ is 1 bytes before a block of size 80,000 alloc'd 47 Invalid read of size 16 49 Address 0x........ is 79,985 bytes inside a block of size 80,000 alloc'd 54 Invalid write of size 8 56 Address 0x........ is 79,993 bytes inside a block of size 80,000 alloc'd 64 Invalid read of size 16 66 Address 0x........ is 0 bytes inside a block of siz [all...] |
/external/libvorbis/doc/ |
H A D | 01-introduction.tex | 8 This document provides a high level description of the Vorbis codec's 12 understanding of the Vorbis decode process, which is 18 over an exceptionally wide range of bitrates. At the high 19 quality/bitrate end of the scale (CD or DAT rate stereo, 16/24 bits) 24 masters) and a range of channel representations (monaural, 32 addition of a hybrid wavelet filterbank in Vorbis II to offer better 43 codebooks used in the first stage of decoding from the bitstream are 50 Vorbis provides none of its own framing, synchronization or protection 51 against errors; it is solely a method of accepting input audio, 55 them, and reassembles the frames into a facsimile of th [all...] |
/external/guava/guava-gwt/test-super/com/google/common/base/super/com/google/common/base/ |
H A D | EquivalenceTest.java | 6 * You may obtain a copy of the License at 36 EquivalenceTester.of(Equivalence.equals().<String>pairwise()) 37 .addEquivalenceGroup(ImmutableList.<String>of()) 38 .addEquivalenceGroup(ImmutableList.of("a")) 39 .addEquivalenceGroup(ImmutableList.of("b")) 40 .addEquivalenceGroup(ImmutableList.of("a", "b"), ImmutableList.of("a", "b")) 98 EquivalenceTester.of(Equivalence.equals().onResultOf(Functions.toStringFunction())) 131 EquivalenceTester.of(Equivalence.equals()) 138 EquivalenceTester.of(Equivalenc [all...] |
/external/guava/guava-tests/test/com/google/common/base/ |
H A D | EquivalenceTest.java | 6 * You may obtain a copy of the License at 39 EquivalenceTester.of(Equivalence.equals().<String>pairwise()) 40 .addEquivalenceGroup(ImmutableList.<String>of()) 41 .addEquivalenceGroup(ImmutableList.of("a")) 42 .addEquivalenceGroup(ImmutableList.of("b")) 43 .addEquivalenceGroup(ImmutableList.of("a", "b"), ImmutableList.of("a", "b")) 108 EquivalenceTester.of(Equivalence.equals().onResultOf(Functions.toStringFunction())) 141 EquivalenceTester.of(Equivalence.equals()) 148 EquivalenceTester.of(Equivalenc [all...] |
/external/mesa3d/docs/ |
H A D | MESA_texture_array.spec | 38 Written based on the wording of the OpenGL 2.0 specification and 43 There are a number of circumstances where an application may wish to 44 blend two textures out of a larger set of textures. Moreover, in some 49 different "exposures" of an image as different textures. On a 53 2. A terrain engine where the altitude of a point determines the 60 single frame of video. 64 textures without mipmaps. Both of these options have major drawbacks. 67 drawbacks of both previous methods. A new texture target, 69 all aspects except the sizes of th [all...] |
/external/mesa3d/docs/OLD/ |
H A D | MESA_packed_depth_stencil.spec | 27 EXT_abgr affects the definition of this extension 28 SGIS_texture4D affects the definition of this extension 29 EXT_cmyka affects the definition of this extension 30 ARB_packed_pixels affects the definition of this extension 61 Accepted by the <format> parameter of ReadPixels and DrawPixels: 65 Accepted by the <type> parameter of ReadPixels and DrawPixels: 72 Additions to Chapter 2 of the 1.1 Specification (OpenGL Operation) 76 Additions to Chapter 3 of the 1.1 Specification (Rasterization) 103 gives a description of and the number and order of element [all...] |
/external/caliper/caliper/src/test/java/com/google/caliper/config/ |
H A D | CaliperConfigTest.java | 6 * You may obtain a copy of the License at 52 ImmutableMap.of("vm.args", "-very -special=args")); 67 CaliperConfig configuration = new CaliperConfig(ImmutableMap.of( 77 CaliperConfig configuration = new CaliperConfig(ImmutableMap.of( 86 CaliperConfig configuration = new CaliperConfig(ImmutableMap.of( 103 CaliperConfig configuration = new CaliperConfig(ImmutableMap.of( 116 CaliperConfig configuration = new CaliperConfig(ImmutableMap.of( 130 CaliperConfig configuration = new CaliperConfig(ImmutableMap.of( 140 CaliperConfig configuration = new CaliperConfig(ImmutableMap.of( 146 assertEquals(ImmutableSet.of("tes [all...] |
/external/guava/guava-tests/test/com/google/common/reflect/ |
H A D | ImmutableTypeToInstanceMapTest.java | 6 * You may obtain a copy of the License at 78 assertEquals(0, ImmutableTypeToInstanceMap.of().size()); 89 assertEquals(0, (int) map.getInstance(TypeToken.of(Integer.class))); 91 assertEquals(1, (int) map.getInstance(TypeToken.of(int.class))); 97 .put(type, ImmutableList.of(1)) 100 assertEquals(ImmutableList.of(1), map.getInstance(type)); 105 ImmutableList<Integer>[] array = new ImmutableList[] {ImmutableList.of(1)}; 118 .put(type, ImmutableList.of(1)) 121 assertEquals(ImmutableList.of(1), map.getInstance(type)); 125 ImmutableTypeToInstanceMap<Iterable<Number>> map = ImmutableTypeToInstanceMap.of(); [all...] |