/external/libvorbis/lib/ |
H A D | backends.h | 62 int partitions; /* 0 to 31 */ member in struct:__anon8712 111 int partitions; /* possible codebooks for a partition */ member in struct:vorbis_info_residue0 112 int partvals; /* partitions ^ groupbook dim */
|
H A D | res0.c | 182 oggpack_write(opb,info->partitions-1,6); /* possible partition choices */ 188 for(j=0;j<info->partitions;j++){ 212 info->partitions=oggpack_read(opb,6)+1; 218 for(j=0;j<info->partitions;j++){ 254 partvals *= info->partitions; 278 look->parts=info->partitions; 421 int possible_partitions=info->partitions; 488 int possible_partitions=info->partitions; 552 int possible_partitions=info->partitions; 601 /* now we encode interleaved residual values for the partitions */ [all...] |
H A D | floor1.c | 102 /* save out partitions */ 103 oggpack_write(opb,info->partitions,5); /* only 0 to 31 legal */ 104 for(j=0;j<info->partitions;j++){ 123 for(j=0,k=0;j<info->partitions;j++){ 139 /* read partitions */ 140 info->partitions=oggpack_read(opb,5); /* only 0 to 31 legal */ 141 for(j=0;j<info->partitions;j++){ 168 for(j=0,k=0;j<info->partitions;j++){ 215 for(i=0;i<info->partitions;i++)n+=info->class_dim[info->partitionclass[i]]; 860 for(i=0,j=2;i<info->partitions; [all...] |
H A D | vorbisenc.c | 202 int partitions=f->partitions; local 205 for(i=0;i<partitions;i++) 477 for(i=0;i<r->partitions;i++) 485 for(i=0;i<r->partitions;i++){ 497 for(i=0;i<r->partitions;i++) 505 for(i=0;i<r->partitions;i++){
|
/external/guava/guava-tests/test/com/google/common/collect/ |
H A D | ListsTest.java | 763 List<List<Integer>> partitions = Lists.partition(source, 1); 764 assertTrue(partitions.isEmpty()); 765 assertEquals(0, partitions.size()); 770 List<List<Integer>> partitions = Lists.partition(source, 1); 771 assertEquals(1, partitions.size()); 772 assertEquals(Collections.singletonList(1), partitions.get(0)); 777 List<List<Integer>> partitions = Lists.partition(source, 2); 778 assertEquals(1, partitions.size()); 779 assertEquals(Collections.singletonList(1), partitions.get(0)); 784 List<List<Integer>> partitions [all...] |
H A D | IteratorsTest.java | 839 Iterator<List<Integer>> partitions = Iterators.partition(source, 1); 840 assertFalse(partitions.hasNext()); 845 Iterator<List<Integer>> partitions = Iterators.partition(source, 1); 846 assertTrue(partitions.hasNext()); 847 assertTrue(partitions.hasNext()); 848 assertEquals(ImmutableList.of(1), partitions.next()); 849 assertFalse(partitions.hasNext()); 854 Iterator<List<Integer>> partitions = Iterators.partition(source, 2); 855 assertTrue(partitions.hasNext()); 856 assertTrue(partitions [all...] |
H A D | IterablesTest.java | 440 Iterable<List<Integer>> partitions = Iterables.partition(source, 1); 441 assertTrue(Iterables.isEmpty(partitions)); 446 Iterable<List<Integer>> partitions = Iterables.partition(source, 1); 447 assertEquals(1, Iterables.size(partitions)); 448 assertEquals(Collections.singletonList(1), partitions.iterator().next()); 453 Iterable<List<Integer>> partitions = Iterables.partition(list, 2); 458 Iterator<List<Integer>> iterator = partitions.iterator(); 475 Iterable<List<Integer>> partitions = Iterables.partition(source, 2); 476 Iterator<List<Integer>> iterator = partitions.iterator(); 485 Iterable<List<Integer>> partitions [all...] |
/external/tremolo/Tremolo/ |
H A D | res012.c | 69 info->partitions=(char)(oggpack_read(opb,6)+1); 73 info->stagemasks=_ogg_malloc(info->partitions*sizeof(*info->stagemasks)); 74 info->stagebooks=_ogg_malloc(info->partitions*8*sizeof(*info->stagebooks)); 76 for(j=0;j<info->partitions;j++){ 83 for(j=0;j<info->partitions;j++){ 142 partword[0][i+k]=partword[0][i+k+1]*info->partitions; 163 /* now we decode residual values for the partitions */ 210 partword[i+k]=partword[i+k+1]*info->partitions; 225 /* now we decode residual values for the partitions */
|
H A D | codec_internal.h | 123 int partitions; /* 0 to 31 */ member in struct:__anon13441 142 char partitions; /* possible codebooks for a partition */ member in struct:vorbis_info_residue
|
H A D | floor1.c | 112 /* read partitions */ 113 info->partitions=oggpack_read(opb,5); /* only 0 to 31 legal */ 115 (char *)_ogg_malloc(info->partitions*sizeof(*info->partitionclass)); 116 for(j=0;j<info->partitions;j++){ 144 for(j=0,k=0;j<info->partitions;j++) 156 for(j=0,k=0;j<info->partitions;j++){ 304 for(i=0,j=2;i<info->partitions;i++){
|
/external/eigen/bench/ |
H A D | check_cache_queries.cpp | 66 int partitions = (abcd[1] & 0x003FF000) >> 12; // B[21:12] local 69 int cache_size = (ways+1) * (partitions+1) * (line_size+1) * (sets+1); 74 cout << "cache[" << cache_id << "].partitions = " << partitions << "\n"; local
|
/external/webp/src/enc/ |
H A D | config.c | 37 config->partitions = 0; 111 if (config->partitions < 0 || config->partitions > 3)
|
H A D | webpenc.c | 211 enc->num_parts_ = 1 << config->partitions;
|
H A D | syntax.c | 330 VP8PutValue(bw, enc->config_->partitions, 2); 412 // Token partitions
|
/external/e2fsprogs/lib/ext2fs/ |
H A D | dosio.c | 45 * Array of all opened partitions 47 static PARTITION **partitions = NULL; variable 48 static unsigned short npart = 0; /* Number of mapped partitions */ 108 * For partition numbers >5 Linux uses DOS extended partitions - 110 * extended partitions when scanning for a first Linux/ext2fs. 119 return NULL; /* We don't support extended partitions for now */ 220 if(!strcmp(partitions[i]->dev, dev)) 223 active = partitions[i]; 338 newparts = (PARTITION**)realloc(partitions, sizeof(PARTITION) * npart); 343 partitions [all...] |
/external/libxml2/ |
H A D | relaxng.c | 286 int nbgroups; /* number of groups in the partitions */ 931 * @partitions: a partition set structure 936 xmlRelaxNGFreePartition(xmlRelaxNGPartitionPtr partitions) argument 941 if (partitions != NULL) { 942 if (partitions->groups != NULL) { 943 for (j = 0; j < partitions->nbgroups; j++) { 944 group = partitions->groups[j]; 953 xmlFree(partitions->groups); 955 if (partitions->triage != NULL) { 956 xmlHashFree(partitions 4315 xmlRelaxNGPartitionPtr partitions = NULL; local 9268 xmlRelaxNGPartitionPtr partitions; local [all...] |
/external/kernel-headers/original/linux/mtd/ |
H A D | nand.h | 530 * @nr_partitions: number of partitions pointed to by partitions (or zero) 531 * @partitions: mtd partition list 541 struct mtd_partition *partitions; member in struct:platform_nand_chip
|
/external/webp/include/webp/ |
H A D | encode.h | 107 int partitions; // log2(number of token partitions) in [0..3]. Default member in struct:__anon15605
|
/external/libvorbis/doc/ |
H A D | 08-residue.tex | 25 Residue format partitions each vector in the vector bundle into chunks, 51 partitions to increase encoding efficiency, the classification vector 352 Format zero decodes partitions exactly as described earlier in the 386 Format 1 decodes partitions exactly as described earlier in the
|
H A D | 07-floor1.tex | 98 list is split into partitions, and each partition is assigned to a
|
/external/flac/libFLAC/ |
H A D | stream_encoder.c | 2315 /*@@@ new_blocksize*2 is too pessimistic, but to fix, we need smarter logic because a smaller new_blocksize can actually increase the # of partitions; would require moving this out into a separate function, then checking its capacity against the need of the current blocksize&min/max_partition_order (and maybe predictor order) */ 3203 /* only use RICE2 partitions if stream bps > 16 */ 3794 unsigned partitions = 1u << max_partition_order; local 3815 for(partition = residual_sample = 0; partition < partitions; partition++) { 3826 for(partition = residual_sample = 0; partition < partitions; partition++) { 3836 /* now merge partitions for lower orders */ 3838 unsigned from_partition = 0, to_partition = partitions; 3842 partitions >>= 1; 3843 for(i = 0; i < partitions; i++) { 3871 const unsigned partitions local 3900 const unsigned partitions = 1u << partition_order; local 4038 const unsigned partitions = 1u << partition_order; local [all...] |
/external/kernel-headers/original/asm-mips/ |
H A D | sgiarcs.h | 326 struct sgi_partition partitions[SGIBBLOCK_MAXPART]; member in struct:sgi_bootblock
|
/external/yaffs2/yaffs2/mtdemul/ |
H A D | nandemul2k.c | 36 #include <linux/mtd/partitions.h> 649 * Define partitions for flash devices 695 /* Unregister partitions */
|
/external/eigen/Eigen/src/Core/util/ |
H A D | Memory.h | 777 int partitions = (abcd[1] & 0x003FF000) >> 12; // B[21:12] local 781 int cache_size = (ways+1) * (partitions+1) * (line_size+1) * (sets+1);
|
/external/bison/djgpp/ |
H A D | config.bat | 332 Rem if the package is configured across partitions.
|