/external/srec/tools/thirdparty/OpenFst/fst/lib/ |
D | minimize.h | 59 const Partition<typename A::StateId>& partition, 61 : fst_(fst), partition_(partition), flags_(flags) {} in fst_() 133 const Partition<StateId>& partition() const { in partition() function 142 ArcIterCompare(const Partition<StateId>& partition) in ArcIterCompare() argument 143 : partition_(partition) {} in ArcIterCompare() 310 const Partition<StateId>& partition() { in partition() function 442 const Partition<typename A::StateId>& partition, MutableFst<A>* fst) { in MergeStates() argument 445 vector<StateId> state_map(partition.num_classes()); in MergeStates() 446 for (size_t i = 0; i < (size_t)partition.num_classes(); ++i) { in MergeStates() 447 PartitionIterator<StateId> siter(partition, i); in MergeStates() [all …]
|
/external/qemu/android/avd/ |
D | hardware-properties.ini | 165 # Cache partition 169 abstract = Cache partition support 170 description = Whether we use a /cache partition on the device. 175 abstract = Cache partition 176 description = Cache partition to use on the device. Ignored if disk.cachePartition is not 'yes'. 180 abstract = Cache partition size 304 # System partition image(s). 306 # disk.systemPartition.path points to the read/write system partition image. 313 # disk.systemPartition.size is the ideal size of the system partition. The 314 # size is ignored if the actual system partition image is larger. Otherwise, [all …]
|
/external/openfst/src/include/fst/ |
D | minimize.h | 66 const Partition<typename A::StateId>& partition, 68 : fst_(fst), partition_(partition), flags_(flags) {} in fst_() 146 const Partition<StateId>& partition() const { in partition() function 155 ArcIterCompare(const Partition<StateId>& partition) in ArcIterCompare() argument 156 : partition_(partition) {} in ArcIterCompare() 323 const Partition<StateId>& partition() { in partition() function 455 const Partition<typename A::StateId>& partition, MutableFst<A>* fst) { in MergeStates() argument 458 vector<StateId> state_map(partition.num_classes()); in MergeStates() 459 for (size_t i = 0; i < partition.num_classes(); ++i) { in MergeStates() 460 PartitionIterator<StateId> siter(partition, i); in MergeStates() [all …]
|
/external/webkit/Source/WebCore/WebCore.gyp/scripts/ |
D | action_derivedsourcesallinone.py | 139 def generateContent(filesMetaData, partition, totalPartitions): argument 153 if (hash(name) % totalPartitions) != partition: 195 partition = outputFileNames.index(fileName) 196 fileContents = generateContent(filesMetaData, partition, len(outputFileNames))
|
/external/libvorbis/doc/ |
D | 08-residue.tex | 34 coding structure, ignoring for the moment exactly how a partition is 40 \emph{n}, a partition size \emph{residue_partition_size}, and a total 46 \item Each partition in each vector has a classification number that 48 decode that partition. The classification numbers of each partition 64 a partition is the same in each pass, thus the classification codeword 80 partition are interleaved during partition encoding (visually treated 84 dimension of the codebook used to encode a partition in a specific 86 passes, however the partition size must be an even multiple of the 89 As an example, assume a partition vector of size eight, to be encoded 113 Residue 1 does not interleave VQ encoding. It represents partition [all …]
|
D | 07-floor1.tex | 98 list is split into partitions, and each partition is assigned to a 99 partition class. X positions 0 and [n] are implicit and do not belong 100 to an explicit partition or partition class. 102 A partition class consists of a representation vector width (the 103 number of Y values which the partition class encodes at once), a 105 the partition class may use in representing Y values, the list of
|
/external/grub/stage2/ |
D | freebsd.h | 62 #define MAKEBOOTDEV(type, adaptor, controller, unit, partition) \ argument 65 ((partition) << B_PARTITIONSHIFT) | B_DEVMAGIC)
|
D | disk_io.c | 577 unsigned long *partition, int *type, in next_partition() argument 590 int bsd_part_no = (*partition & 0xFF00) >> 8; in next_partition() 627 *partition = (*partition & 0xFF00FF) | (i << 8); in next_partition() 647 int pc_slice_no = (*partition & 0xFF0000) >> 16; in next_partition() 709 *partition = (pc_slice_no << 16) | 0xFFFF; in next_partition() 722 if ((*partition != 0xFFFFFF && IS_PC_SLICE_TYPE_BSD (*type & 0xff)) in next_partition() 736 || (dest & 0xFF0000) == (*partition & 0xFF0000))) in next_partition() 949 int partition = dev & 0xFFFFFF; in set_device() local 958 current_partition = partition; in set_device()
|
/external/grub/docs/ |
D | internals.texi | 22 * Partition table:: The format of partition tables 136 beginning of the disk, but @emph{not} relative to the partition 146 The installed partition. 170 For any particular partition, it is presumed that only one of the 178 access disk blocks directly (in the indicated partition) via the block 190 The current partition number. 193 The current partition type. 199 The @dfn{partition} part of the root device. 202 The current partition starting address, in sectors. 205 The current partition length, in sectors. [all …]
|
D | grub.info | 108 kernel just by specifying its file name and the drive and partition 121 partition, and a file name (*note Naming convention::) to GRUB, how to 341 that you can specify a drive/partition. 356 second integer, `1', indicates the partition number (or the PC slice 358 partition numbers are counted from _zero_, not from one. This 359 expression means the second partition of the first hard disk drive. In 360 this case, GRUB uses one partition of the disk, instead of the whole 365 This specifies the first "extended partition" of the first hard disk 366 drive. Note that the partition numbers for extended partitions are 372 This means the BSD `a' partition of the second hard disk. If you [all …]
|
D | grub.texi | 164 just by specifying its file name and the drive and partition where the 178 partition, and a file name (@pxref{Naming convention}) to GRUB, how to 379 that you can specify a drive/partition. 399 the second integer, @samp{1}, indicates the partition number (or the 401 that the partition numbers are counted from @emph{zero}, not from 402 one. This expression means the second partition of the first hard disk 403 drive. In this case, GRUB uses one partition of the disk, instead of the 410 This specifies the first @dfn{extended partition} of the first hard disk 411 drive. Note that the partition numbers for extended partitions are 419 This means the BSD @samp{a} partition of the second hard disk. If you [all …]
|
/external/replicaisland/src/com/replica/replicaisland/ |
D | QuickSorter.java | 47 int i = partition(a, left, right, comparator); in quicksort() 53 private int partition(Type[] a, int left, int right, Comparator<Type> comparator) { in partition() method in QuickSorter
|
/external/flac/libFLAC/ia32/ |
D | stream_encoder_asm.nasm | 92 xor ecx, ecx ; ecx <- partition = 0 97 .loop0: ; for(partition = residual_sample = 0; partition < partitions; partition++) { 111 mov [eax + ecx * 8], ebx ; abs_residual_partition_sums[partition] = abs_residual_partition_sum;
|
/external/guava/guava-tests/test/com/google/common/collect/ |
D | ListsTest.java | 755 Lists.partition(source, 0); in testPartition_badSize() 763 List<List<Integer>> partitions = Lists.partition(source, 1); in testPartition_empty() 770 List<List<Integer>> partitions = Lists.partition(source, 1); in testPartition_1_1() 777 List<List<Integer>> partitions = Lists.partition(source, 2); in testPartition_1_2() 784 List<List<Integer>> partitions = Lists.partition(source, 1); in testPartition_2_1() 792 List<List<Integer>> partitions = Lists.partition(source, 2); in testPartition_3_2() 801 List<List<Integer>> partitions = Lists.partition(source, 2); in testPartitionRandomAccessTrue() 818 List<List<Integer>> partitions = Lists.partition(source, 2); in testPartitionRandomAccessFalse() 828 List<List<Integer>> partitions = Lists.partition(list, 3); in testPartition_view() 852 assertEquals(1, Lists.partition(list, Integer.MAX_VALUE).size()); in testPartitionSize_1() [all …]
|
/external/grub/ |
D | TODO | 72 partition. (We already have the code, but need an approval by an 76 partition, so that it won't be accidentally erased or modified by 87 ? Add a partition naming syntax that means ``the first partition of
|
D | NEWS | 136 * Booting Windows from a logical partition is supported. 168 unmount the partition where GRUB images reside. We'd recommend _not_ 194 * The utility `grub-install' recognizes a separate boot partition 196 * New commands, "partnew" and "parttype". You can modify partition 228 * Recognize the Linux extended partition type. 286 * Support the partition ids for NetBSD and OpenBSD. 371 * GRUB now correctly points ES:SI at a partition descriptor when 394 format. Added "relative" disk and partition capability, see 418 partition active with "makeactive" command). 461 extended partitions... so any PC partition number above 3 will give [all …]
|
/external/stlport/test/unit/ |
D | partition_test.cpp | 98 partition((int*)numbers, (int*)numbers + 6, less_n(10, nb_pred_calls)); in ptition0() 117 partition(v1.begin(), v1.end(), less_n(11, nb_pred_calls)); in ptition1()
|
/external/libvorbis/lib/ |
D | psy.c | 1019 int partition=(p->vi->normal_p ? p->vi->normal_partition : 16); in _vp_couple_quantize_normalize() local 1050 raw[0] = alloca(ch*partition*sizeof(**raw)); in _vp_couple_quantize_normalize() 1051 quant[0] = alloca(ch*partition*sizeof(**quant)); in _vp_couple_quantize_normalize() 1052 floor[0] = alloca(ch*partition*sizeof(**floor)); in _vp_couple_quantize_normalize() 1053 flag[0] = alloca(ch*partition*sizeof(**flag)); in _vp_couple_quantize_normalize() 1056 raw[i] = &raw[0][partition*i]; in _vp_couple_quantize_normalize() 1057 quant[i] = &quant[0][partition*i]; in _vp_couple_quantize_normalize() 1058 floor[i] = &floor[0][partition*i]; in _vp_couple_quantize_normalize() 1059 flag[i] = &flag[0][partition*i]; in _vp_couple_quantize_normalize() 1064 for(i=0;i<n;i+=partition){ in _vp_couple_quantize_normalize() [all …]
|
/external/grub/lib/ |
D | device.h | 44 extern int write_to_partition (char **map, int drive, int partition,
|
/external/libvpx/libvpx/third_party/googletest/src/test/ |
D | gtest_filter_unittest.py | 314 partition = [] 319 partition.append(tests_run) 321 self.AssertPartitionIsValid(tests_to_run, partition)
|
/external/gtest/test/ |
D | gtest_filter_unittest.py | 314 partition = [] 319 partition.append(tests_run) 321 self.AssertPartitionIsValid(tests_to_run, partition)
|
/external/protobuf/gtest/test/ |
D | gtest_filter_unittest.py | 270 partition = [] 275 partition.append(tests_run) 277 self.AssertPartitionIsValid(tests_to_run, partition)
|
/external/chromium/testing/gtest/test/ |
D | gtest_filter_unittest.py | 314 partition = [] 319 partition.append(tests_run) 321 self.AssertPartitionIsValid(tests_to_run, partition)
|
/external/flac/libFLAC/ |
D | stream_encoder.c | 3749 unsigned partition; in find_best_partition_order_() local 3761 for(partition = 0; partition < (1u<<best_partition_order); partition++) { in find_best_partition_order_() 3762 if(prc->parameters[partition] >= FLAC__ENTROPY_CODING_METHOD_PARTITIONED_RICE_ESCAPE_PARAMETER) { in find_best_partition_order_() 3809 unsigned partition, residual_sample, end = (unsigned)(-(int)predictor_order); in precompute_partition_info_sums_() local 3815 for(partition = residual_sample = 0; partition < partitions; partition++) { in precompute_partition_info_sums_() 3820 abs_residual_partition_sums[partition] = abs_residual_partition_sum; in precompute_partition_info_sums_() 3826 for(partition = residual_sample = 0; partition < partitions; partition++) { in precompute_partition_info_sums_() 3831 abs_residual_partition_sums[partition] = abs_residual_partition_sum; in precompute_partition_info_sums_() 3870 unsigned partition, partition_sample, partition_samples, residual_sample; in precompute_partition_info_escapes_() local 3876 for(partition = residual_sample = 0; partition < partitions; partition++) { in precompute_partition_info_escapes_() [all …]
|
/external/webkit/LayoutTests/fast/xpath/py-dom-xpath/ |
D | axes-expected.txt | 12 Test that the ancestor, descendant, following, preceding, and self axes partition the document
|