/frameworks/wilhelm/tools/permute/ |
Makefile | 0 permute : permute.c 2 gcc -o $@ -Wall -Werror permute.c -lsndfile 5 $(RM) permute
|
permute.c | 17 /** Permute is a host tool to randomly permute an audio file. 119 /** Permute the specified input file */ 121 void permute(char *path_in) function 228 // now permute the segments randomly using a bad algorithm 337 // Permute the file 338 permute(arg);
|
/external/trappy/trappy/plotter/ |
StaticPlot.py | 70 :param permute: Draw one plot for each of the traces specified 71 :type permute: bool 136 zip_constraints = not self._attr["permute"] 160 self._attr["permute"] = False 178 permute = self._attr["permute"] and not self._attr["concat"] 181 self._resolve(permute, self._attr["concat"]) 183 self._resolve(permute, self._attr["concat"]) 185 def make_title(self, constraint, pivot, permute, concat): 190 if permute [all...] |
BarPlot.py | 85 def plot_axis(self, axis, series_list, permute, concat, args_to_forward): 118 axis.set_title(self.make_title(constraint, pivot, permute, concat)) 120 self.add_to_legend(i, line_2d_list[0], constraint, pivot, concat, permute)
|
LinePlot.py | 70 :param permute: Draw one plot for each of the traces specified 71 :type permute: bool 156 def plot_axis(self, axis, series_list, permute, concat, args_to_forward): 170 axis.set_title(self.make_title(constraint, pivot, permute, concat)) 172 self.add_to_legend(i, line_2d_list[0], constraint, pivot, concat, permute)
|
ILinePlot.py | 80 :param permute: Draw one plot for each of the traces specified 81 :type permute: bool 156 zip_constraints = not self._attr["permute"] 199 self._plot(self._attr["permute"], test) 207 self._attr["permute"] = False 216 def _plot(self, permute, test): 218 pivot_vals, len_pivots = self.c_mgr.generate_pivots(permute) 225 if permute: 238 if permute:
|
Constraint.py | 268 Permute( 274 Permute( 347 def generate_pivots(self, permute=False): 350 :param permute: Permute the Traces and Columns 351 :type permute: bool 368 if permute:
|
/external/vulkan-validation-layers/libs/glm/detail/ |
_noise.hpp | 42 GLM_FUNC_QUALIFIER T permute(T const & x) function in namespace:glm::detail 48 GLM_FUNC_QUALIFIER tvec2<T, P> permute(tvec2<T, P> const & x) function in namespace:glm::detail 54 GLM_FUNC_QUALIFIER tvec3<T, P> permute(tvec3<T, P> const & x) function in namespace:glm::detail 60 GLM_FUNC_QUALIFIER tvec4<T, P> permute(tvec4<T, P> const & x) function in namespace:glm::detail 66 GLM_FUNC_QUALIFIER vecType<T, P> permute(vecType<T, P> const & x)
|
/external/valgrind/none/tests/ppc64/ |
test_isa_2_06_part2.stdout.exp | [all...] |
test_isa_2_06_part1.stdout.exp | 163 Test VSX permute instructions [all...] |
test_isa_3_0.c | 372 /* VSX vector permute, right indexed. */ 453 /* vector bit permute doubleword */ 500 { /* vector permute right-indexed */ 509 /* vector, 3->1 unique; four arguments. xt, xa, xb, xc (xc = permute) */ 3813 unsigned int arith, logical, compare, popcnt, ldst, insert_extract, permute, round; member in struct:insn_sel_flags_t_struct [all...] |
/external/icu/icu4c/source/common/unicode/ |
caniter.h | 131 static void U_EXPORT2 permute(UnicodeString &source, UBool skipZeros, Hashtable *result, UErrorCode &status);
|
/external/icu/android_icu4j/src/main/java/android/icu/text/ |
CanonicalIterator.java | 163 public static void permute(String source, boolean skipZeros, Set<String> output) { method in class:CanonicalIterator 165 //if (PROGRESS) System.out.println("Permute: " + source); 175 // otherwise iterate through the string, and recursively permute all the other characters 183 // don't permute it 191 permute(source.substring(0,i) 258 permute(item, SKIP_ZEROS, permutations); method
|
/external/icu/icu4j/main/classes/core/src/com/ibm/icu/text/ |
CanonicalIterator.java | 167 public static void permute(String source, boolean skipZeros, Set<String> output) { method in class:CanonicalIterator 169 //if (PROGRESS) System.out.println("Permute: " + source); 179 // otherwise iterate through the string, and recursively permute all the other characters 187 // don't permute it 195 permute(source.substring(0,i) 262 permute(item, SKIP_ZEROS, permutations); method
|
/external/icu/icu4c/source/common/ |
caniter.cpp | 267 void U_EXPORT2 CanonicalIterator::permute(UnicodeString &source, UBool skipZeros, Hashtable *result, UErrorCode &status) { function in class:CanonicalIterator 271 //if (PROGRESS) printf("Permute: %s\n", UToS(Tr(source))); 288 // otherwise iterate through the string, and recursively permute all the other characters 304 // don't permute it 313 //Hashtable *subpermute = permute(source.substring(0,i) + source.substring(i + UTF16.getCharCount(cp))); 314 permute(subPermuteString.replace(i, U16_LENGTH(cp), NULL, 0), skipZeros, &subpermute, status); 373 permute(item, CANITER_SKIP_ZEROES, &permutations, status);
|
/external/toybox/toys/other/ |
bzcat.c | 65 int limit[MAX_HUFCODE_BITS+1], base[MAX_HUFCODE_BITS], permute[MAX_SYMBOLS]; member in struct:group_data 257 /* Calculate permute[], base[], and limit[] tables from length[]. 259 * permute[] is the lookup table for converting huffman coded symbols 263 * of a given length when using permute[]. 270 * equals permute[hufcode_value - base[hufcode_bitcount]]. 282 // zero temp[] and limit[], and calculate permute[] 287 if (length[hh] == ii) hufGroup->permute[pp++] = hh; 376 nextSym = hufGroup->permute[jj];
|
/external/icu/android_icu4j/src/main/tests/android/icu/dev/test/normalizer/ |
TestCanonicalIterator.java | 133 // check permute 137 CanonicalIterator.permute("ABC", false, results);
|
/external/icu/icu4c/source/test/intltest/ |
canittst.cpp | 130 // check permute 137 CanonicalIterator::permute(toPermute, FALSE, permutations, status);
|
/external/icu/icu4j/main/tests/core/src/com/ibm/icu/dev/test/normalizer/ |
TestCanonicalIterator.java | 132 // check permute 136 CanonicalIterator.permute("ABC", false, results);
|
/device/linaro/bootloader/edk2/BaseTools/Source/C/VfrCompile/Pccts/antlr/ |
proto.h | 346 extern Tree * permute( int, int );
627 extern Tree * permute();
[all...] |
fset2.c | 49 /* ick! globals. Used by permute() to track which elements of a set have been used */
1176 /* for each element of ftbl[k], make it the root of a tree with permute(ftbl[k+1])
1181 permute( int k, int max_k )
function 1183 permute( k, max_k )
1191 t = permute(k+1, max_k);
1196 return permute(k, max_k);
[all...] |
/external/valgrind/none/tests/ppc32/ |
test_isa_2_06_part1.stdout.exp | 155 Test VSX permute instructions [all...] |
/external/libopus/celt/arm/ |
celt_pitch_xcorr_arm_gnu.s | 76 @ - 10 cycles of load/store/byte permute instructions, and
|
/prebuilts/go/darwin-x86/src/runtime/ |
select.go | 284 // Start with the pollorder to permute cases on the same channel.
|
/prebuilts/go/linux-x86/src/runtime/ |
select.go | 284 // Start with the pollorder to permute cases on the same channel.
|