Home
last modified time | relevance | path

Searched refs:skeletonParts (Results 1 – 3 of 3) sorted by relevance

/external/icu/android_icu4j/src/main/tests/android/icu/dev/test/number/
DNumberPermutationTest.java88 ArrayList<ArrayList<String>> skeletonParts = new ArrayList<>(); in testPermutations() local
93 skeletonParts.add(currentSection); in testPermutations()
108 for (int i = 0; i < skeletonParts.size() - 2; i++) { in testPermutations()
109 ArrayList<String> skeletons1 = skeletonParts.get(i); in testPermutations()
110 for (int j = i + 1; j < skeletonParts.size() - 1; j++) { in testPermutations()
111 ArrayList<String> skeletons2 = skeletonParts.get(j); in testPermutations()
112 for (int k = j + 1; k < skeletonParts.size(); k++) { in testPermutations()
113 ArrayList<String> skeletons3 = skeletonParts.get(k); in testPermutations()
/external/icu/icu4j/main/tests/core/src/com/ibm/icu/dev/test/number/
DNumberPermutationTest.java85 ArrayList<ArrayList<String>> skeletonParts = new ArrayList<>(); in testPermutations() local
90 skeletonParts.add(currentSection); in testPermutations()
105 for (int i = 0; i < skeletonParts.size() - 2; i++) { in testPermutations()
106 ArrayList<String> skeletons1 = skeletonParts.get(i); in testPermutations()
107 for (int j = i + 1; j < skeletonParts.size() - 1; j++) { in testPermutations()
108 ArrayList<String> skeletons2 = skeletonParts.get(j); in testPermutations()
109 for (int k = j + 1; k < skeletonParts.size(); k++) { in testPermutations()
110 ArrayList<String> skeletons3 = skeletonParts.get(k); in testPermutations()
/external/icu/icu4c/source/test/intltest/
Dnumbertest_permutation.cpp93 auto skeletonParts = std::vector<std::vector<const char16_t*>>(); in testPermutations() local
98 skeletonParts.push_back(currentSection); in testPermutations()
112 for (size_t i = 0; i < skeletonParts.size() - 2; i++) { in testPermutations()
113 const auto& skeletons1 = skeletonParts[i]; in testPermutations()
114 for (size_t j = i + 1; j < skeletonParts.size() - 1; j++) { in testPermutations()
115 const auto& skeletons2 = skeletonParts[j]; in testPermutations()
116 for (size_t k = j + 1; k < skeletonParts.size(); k++) { in testPermutations()
117 const auto& skeletons3 = skeletonParts[k]; in testPermutations()