1e5d81f57cb97b3b6b7fccc9c5610d21eb81db09dBen Murdoch/* 2e5d81f57cb97b3b6b7fccc9c5610d21eb81db09dBen Murdoch * Copyright 2011 Google Inc. 3e5d81f57cb97b3b6b7fccc9c5610d21eb81db09dBen Murdoch * 4e5d81f57cb97b3b6b7fccc9c5610d21eb81db09dBen Murdoch * Use of this source code is governed by a BSD-style license that can be 5e5d81f57cb97b3b6b7fccc9c5610d21eb81db09dBen Murdoch * found in the LICENSE file. 6e5d81f57cb97b3b6b7fccc9c5610d21eb81db09dBen Murdoch */ 7e5d81f57cb97b3b6b7fccc9c5610d21eb81db09dBen Murdoch 8e5d81f57cb97b3b6b7fccc9c5610d21eb81db09dBen Murdoch#include "Test.h" 9e5d81f57cb97b3b6b7fccc9c5610d21eb81db09dBen Murdoch 10e5d81f57cb97b3b6b7fccc9c5610d21eb81db09dBen Murdoch// Include the implementation so we can make an appropriate template instance. 11e5d81f57cb97b3b6b7fccc9c5610d21eb81db09dBen Murdoch#include "SkAdvancedTypefaceMetrics.h" 12e5d81f57cb97b3b6b7fccc9c5610d21eb81db09dBen Murdoch 13e5d81f57cb97b3b6b7fccc9c5610d21eb81db09dBen Murdochusing namespace skia_advanced_typeface_metrics_utils; 14e5d81f57cb97b3b6b7fccc9c5610d21eb81db09dBen Murdoch 15e5d81f57cb97b3b6b7fccc9c5610d21eb81db09dBen Murdoch// Negative values and zeros in a range plus trailing zeros. 16e5d81f57cb97b3b6b7fccc9c5610d21eb81db09dBen Murdoch// 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 17e5d81f57cb97b3b6b7fccc9c5610d21eb81db09dBen Murdochstatic const int16_t data1[] = {-1, 0, -3, 4, 5, 6, 7, 0, 0, 0, 8, 0, 0, 0, 0}; 18e5d81f57cb97b3b6b7fccc9c5610d21eb81db09dBen Murdochstatic const char* expected1 = "0[-1 0 -3 4 5 6 7 0 0 0 8]"; 19e5d81f57cb97b3b6b7fccc9c5610d21eb81db09dBen Murdoch 20e5d81f57cb97b3b6b7fccc9c5610d21eb81db09dBen Murdoch// Run with leading and trailing zeros. 21e5d81f57cb97b3b6b7fccc9c5610d21eb81db09dBen Murdoch// Test rules: d 0 1 2 3 4 5 6 7 8 9 10 11 22e5d81f57cb97b3b6b7fccc9c5610d21eb81db09dBen Murdochstatic const int16_t data2[] = {0, 0, 0, 100, 100, 100, 100, 100, 100, 100, 0, 0}; 23e5d81f57cb97b3b6b7fccc9c5610d21eb81db09dBen Murdochstatic const char* expected2 = "3 9 100"; 24e5d81f57cb97b3b6b7fccc9c5610d21eb81db09dBen Murdoch 25e5d81f57cb97b3b6b7fccc9c5610d21eb81db09dBen Murdoch// Removing 0's from a range. 26e5d81f57cb97b3b6b7fccc9c5610d21eb81db09dBen Murdoch// Test rules: a 0 1 2 3 4 5 6 7 8 9 10 11 27e5d81f57cb97b3b6b7fccc9c5610d21eb81db09dBen Murdochstatic const int16_t data3[] = {1, 2, 0, 0, 0, 3, 4, 0, 0, 0, 0, 5}; 28e5d81f57cb97b3b6b7fccc9c5610d21eb81db09dBen Murdochstatic const char* expected3 = "0[1 2 0 0 0 3 4] 11[5]"; 29e5d81f57cb97b3b6b7fccc9c5610d21eb81db09dBen Murdoch 30e5d81f57cb97b3b6b7fccc9c5610d21eb81db09dBen Murdoch// Removing 0's from a run/range and between runs. 31e5d81f57cb97b3b6b7fccc9c5610d21eb81db09dBen Murdoch// Test rules: a, b 0 1 2 3 4 5 6 7 8 9 10 11 12 14 15 32e5d81f57cb97b3b6b7fccc9c5610d21eb81db09dBen Murdochstatic const int16_t data4[] = {1, 0, 0, 0, 1, 2, 2, 2, 3, 0, 0, 0, 0, 3, 4}; 33e5d81f57cb97b3b6b7fccc9c5610d21eb81db09dBen Murdochstatic const char* expected4 = "0[1 0 0 0 1] 5 7 2 8[3] 13[3 4]"; 34e5d81f57cb97b3b6b7fccc9c5610d21eb81db09dBen Murdoch 35e5d81f57cb97b3b6b7fccc9c5610d21eb81db09dBen Murdoch// Runs that starts outside a range. 36e5d81f57cb97b3b6b7fccc9c5610d21eb81db09dBen Murdoch// Test rules: a, e 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 37e5d81f57cb97b3b6b7fccc9c5610d21eb81db09dBen Murdochstatic const int16_t data5[] = {1, 1, 2, 3, 0, 0, 0, 0, 5, 5, 6, 7, 0, 0, 0, 0, 8, 0}; 38e5d81f57cb97b3b6b7fccc9c5610d21eb81db09dBen Murdochstatic const char* expected5 = "0 1 1 2[2 3] 8 9 5 10[6 7] 16[8]"; 39e5d81f57cb97b3b6b7fccc9c5610d21eb81db09dBen Murdoch 40e5d81f57cb97b3b6b7fccc9c5610d21eb81db09dBen Murdoch// Zeros and runs that should be broken out. 41e5d81f57cb97b3b6b7fccc9c5610d21eb81db09dBen Murdoch// Test rules: a, b, e 0 1 2 3 4 5 6 7 8 9 10 11 12 13 42e5d81f57cb97b3b6b7fccc9c5610d21eb81db09dBen Murdochstatic const int16_t data6[] = {1, 0, 0, 0, 0, 1, 2, 3, 3, 4, 5, 5, 5, 6}; 43e5d81f57cb97b3b6b7fccc9c5610d21eb81db09dBen Murdochstatic const char* expected6 = "0[1] 5[1 2 3 3 4] 10 12 5 13[6]"; 44e5d81f57cb97b3b6b7fccc9c5610d21eb81db09dBen Murdoch 45e5d81f57cb97b3b6b7fccc9c5610d21eb81db09dBen Murdoch// Don't cares that aren't enough to break out a run. 46e5d81f57cb97b3b6b7fccc9c5610d21eb81db09dBen Murdoch// Test rules: c 0 1 2 3 4 5 47e5d81f57cb97b3b6b7fccc9c5610d21eb81db09dBen Murdochstatic const int16_t data7[] = {1, 2, 10, 11, 2, 3}; 48e5d81f57cb97b3b6b7fccc9c5610d21eb81db09dBen Murdochstatic const char* expected7 = "0[1 2 10 11 2 3]"; 49e5d81f57cb97b3b6b7fccc9c5610d21eb81db09dBen Murdochstatic const uint32_t subset7[] = {0, 1, 4, 5}; 50e5d81f57cb97b3b6b7fccc9c5610d21eb81db09dBen Murdochstatic const char* expectedSubset7 = "0[1 2 0 0 2 3]"; 51e5d81f57cb97b3b6b7fccc9c5610d21eb81db09dBen Murdoch 52e5d81f57cb97b3b6b7fccc9c5610d21eb81db09dBen Murdoch// Don't cares that are enough to break out a run. 53e5d81f57cb97b3b6b7fccc9c5610d21eb81db09dBen Murdoch// Test rules: c 0 1 2 3 4 5 6 54e5d81f57cb97b3b6b7fccc9c5610d21eb81db09dBen Murdochstatic const int16_t data8[] = {1, 2, 10, 11, 12, 2, 3}; 55e5d81f57cb97b3b6b7fccc9c5610d21eb81db09dBen Murdochstatic const char* expected8 = "0[1 2 10 11 12 2 3]"; 56e5d81f57cb97b3b6b7fccc9c5610d21eb81db09dBen Murdochstatic const uint32_t subset8[] = {0, 1, 5, 6}; 57e5d81f57cb97b3b6b7fccc9c5610d21eb81db09dBen Murdochstatic const char* expectedSubset8 = "0[1] 1 5 2 6[3]"; 58e5d81f57cb97b3b6b7fccc9c5610d21eb81db09dBen Murdoch 59e5d81f57cb97b3b6b7fccc9c5610d21eb81db09dBen Murdoch// Leading don't cares. 60e5d81f57cb97b3b6b7fccc9c5610d21eb81db09dBen Murdoch// Test rules: d 0 1 2 3 4 61e5d81f57cb97b3b6b7fccc9c5610d21eb81db09dBen Murdochstatic const int16_t data9[] = {1, 1, 10, 2, 3}; 62e5d81f57cb97b3b6b7fccc9c5610d21eb81db09dBen Murdochstatic const char* expected9 = "0 1 1 2[10 2 3]"; 63e5d81f57cb97b3b6b7fccc9c5610d21eb81db09dBen Murdochstatic const uint32_t subset9[] = {0, 1, 3, 4}; 64e5d81f57cb97b3b6b7fccc9c5610d21eb81db09dBen Murdochstatic const char* expectedSubset9 = "0 1 1 3[2 3]"; 65e5d81f57cb97b3b6b7fccc9c5610d21eb81db09dBen Murdoch 66e5d81f57cb97b3b6b7fccc9c5610d21eb81db09dBen Murdoch// Almost run of don't cares inside a range. 67e5d81f57cb97b3b6b7fccc9c5610d21eb81db09dBen Murdoch// Test rules: c 0 1 2 3 4 5 68e5d81f57cb97b3b6b7fccc9c5610d21eb81db09dBen Murdochstatic const int16_t data10[] = {1, 2, 10, 11, 12, 3}; 69e5d81f57cb97b3b6b7fccc9c5610d21eb81db09dBen Murdochstatic const char* expected10 = "0[1 2 10 11 12 3]"; 70e5d81f57cb97b3b6b7fccc9c5610d21eb81db09dBen Murdochstatic const uint32_t subset10[] = {0, 1, 5}; 71e5d81f57cb97b3b6b7fccc9c5610d21eb81db09dBen Murdochstatic const char* expectedSubset10 = "0[1 2 0 0 0 3]"; 72e5d81f57cb97b3b6b7fccc9c5610d21eb81db09dBen Murdoch 73e5d81f57cb97b3b6b7fccc9c5610d21eb81db09dBen Murdoch// Run of don't cares inside a range. 74e5d81f57cb97b3b6b7fccc9c5610d21eb81db09dBen Murdoch// Test rules: c 0 1 2 3 4 5 6 75e5d81f57cb97b3b6b7fccc9c5610d21eb81db09dBen Murdochstatic const int16_t data11[] = {1, 2, 10, 11, 12, 13, 3}; 76e5d81f57cb97b3b6b7fccc9c5610d21eb81db09dBen Murdochstatic const char* expected11 = "0[1 2 10 11 12 13 3]"; 77e5d81f57cb97b3b6b7fccc9c5610d21eb81db09dBen Murdochstatic const uint32_t subset11[] = {0, 1, 6}; 78e5d81f57cb97b3b6b7fccc9c5610d21eb81db09dBen Murdochstatic const char* expectedSubset11 = "0[1 2] 6[3]"; 79e5d81f57cb97b3b6b7fccc9c5610d21eb81db09dBen Murdoch 80e5d81f57cb97b3b6b7fccc9c5610d21eb81db09dBen Murdoch// Almost run within a range with leading don't cares. 81e5d81f57cb97b3b6b7fccc9c5610d21eb81db09dBen Murdoch// Test rules: c 0 1 2 3 4 5 6 82e5d81f57cb97b3b6b7fccc9c5610d21eb81db09dBen Murdochstatic const int16_t data12[] = {1, 10, 11, 2, 12, 13, 3}; 83e5d81f57cb97b3b6b7fccc9c5610d21eb81db09dBen Murdochstatic const char* expected12 = "0[1 10 11 2 12 13 3]"; 84e5d81f57cb97b3b6b7fccc9c5610d21eb81db09dBen Murdochstatic const uint32_t subset12[] = {0, 3, 6}; 85e5d81f57cb97b3b6b7fccc9c5610d21eb81db09dBen Murdochstatic const char* expectedSubset12 = "0[1 0 0 2 0 0 3]"; 86e5d81f57cb97b3b6b7fccc9c5610d21eb81db09dBen Murdoch 87e5d81f57cb97b3b6b7fccc9c5610d21eb81db09dBen Murdoch// Run within a range with leading don't cares. 88e5d81f57cb97b3b6b7fccc9c5610d21eb81db09dBen Murdoch// Test rules: c 0 1 2 3 4 5 6 7 89e5d81f57cb97b3b6b7fccc9c5610d21eb81db09dBen Murdochstatic const int16_t data13[] = {1, 10, 11, 2, 2, 12, 13, 3}; 90e5d81f57cb97b3b6b7fccc9c5610d21eb81db09dBen Murdochstatic const char* expected13 = "0[1 10 11 2 2 12 13 3]"; 91e5d81f57cb97b3b6b7fccc9c5610d21eb81db09dBen Murdochstatic const uint32_t subset13[] = {0, 3, 4, 7}; 92e5d81f57cb97b3b6b7fccc9c5610d21eb81db09dBen Murdochstatic const char* expectedSubset13 = "0[1] 1 6 2 7[3]"; 93e5d81f57cb97b3b6b7fccc9c5610d21eb81db09dBen Murdoch 94e5d81f57cb97b3b6b7fccc9c5610d21eb81db09dBen Murdoch// Enough don't cares to breakup something. 95e5d81f57cb97b3b6b7fccc9c5610d21eb81db09dBen Murdoch// Test rules: a 0 1 2 3 4 5 96e5d81f57cb97b3b6b7fccc9c5610d21eb81db09dBen Murdochstatic const int16_t data14[] = {1, 0, 0, 0, 0, 2}; 97e5d81f57cb97b3b6b7fccc9c5610d21eb81db09dBen Murdochstatic const char* expected14 = "0[1] 5[2]"; 98e5d81f57cb97b3b6b7fccc9c5610d21eb81db09dBen Murdochstatic const uint32_t subset14[] = {0, 5}; 99e5d81f57cb97b3b6b7fccc9c5610d21eb81db09dBen Murdochstatic const char* expectedSubset14 = "0[1] 5[2]"; 100e5d81f57cb97b3b6b7fccc9c5610d21eb81db09dBen Murdoch 101e5d81f57cb97b3b6b7fccc9c5610d21eb81db09dBen Murdochstatic SkString stringify_advance_data(SkAdvancedTypefaceMetrics::AdvanceMetric<int16_t>* data) { 102e5d81f57cb97b3b6b7fccc9c5610d21eb81db09dBen Murdoch SkString result; 103e5d81f57cb97b3b6b7fccc9c5610d21eb81db09dBen Murdoch bool leadingSpace = false; 104e5d81f57cb97b3b6b7fccc9c5610d21eb81db09dBen Murdoch while (data != NULL) { 105e5d81f57cb97b3b6b7fccc9c5610d21eb81db09dBen Murdoch if (leadingSpace) { 106e5d81f57cb97b3b6b7fccc9c5610d21eb81db09dBen Murdoch result.append(" "); 107e5d81f57cb97b3b6b7fccc9c5610d21eb81db09dBen Murdoch } else { 108e5d81f57cb97b3b6b7fccc9c5610d21eb81db09dBen Murdoch leadingSpace = true; 109e5d81f57cb97b3b6b7fccc9c5610d21eb81db09dBen Murdoch } 110 switch(data->fType) { 111 case SkAdvancedTypefaceMetrics::AdvanceMetric<int16_t>::kRun: 112 result.appendf("%d %d %d", data->fStartId, data->fEndId, data->fAdvance[0]); 113 break; 114 case SkAdvancedTypefaceMetrics::AdvanceMetric<int16_t>::kRange: 115 result.appendf("%d[", data->fStartId); 116 for (int i = 0; i < data->fAdvance.count(); ++i) { 117 if (i > 0) { 118 result.append(" "); 119 } 120 result.appendf("%d", data->fAdvance[i]); 121 } 122 result.append("]"); 123 break; 124 case SkAdvancedTypefaceMetrics::AdvanceMetric<int16_t>::kDefault: 125 result.appendf("<Default=%d>", data->fAdvance[0]); 126 break; 127 } 128 data = data->fNext.get(); 129 } 130 return result; 131} 132 133class TestWData { 134 public: 135 TestWData(skiatest::Reporter* reporter, 136 const int16_t advances[], int advanceLen, 137 const uint32_t subset[], int subsetLen, 138 const char* expected) 139 : fAdvances(advances) 140 , fAdvancesLen(advanceLen) 141 , fSubset(subset) 142 , fSubsetLen(subsetLen) 143 , fExpected(expected) { 144 REPORTER_ASSERT(reporter, RunTest()); 145 } 146 147 private: 148 const int16_t* fAdvances; 149 const int fAdvancesLen; 150 const uint32_t* fSubset; 151 const int fSubsetLen; 152 const char* fExpected; 153 154 static bool getAdvance(void* tc, int gId, int16_t* advance) { 155 TestWData* testCase = (TestWData*)tc; 156 if (gId >= 0 && gId < testCase->fAdvancesLen) { 157 *advance = testCase->fAdvances[gId]; 158 return true; 159 } 160 return false; 161 } 162 163 bool RunTest() { 164 SkAutoTDelete<SkAdvancedTypefaceMetrics::AdvanceMetric<int16_t> > result; 165 result.reset(getAdvanceData((void*)this, fAdvancesLen, fSubset, fSubsetLen, getAdvance)); 166 167 SkString stringResult = stringify_advance_data(result); 168 if (!stringResult.equals(fExpected)) { 169 SkDebugf("Expected: %s\n Result: %s\n", fExpected, stringResult.c_str()); 170 return false; 171 } 172 return true; 173 } 174}; 175 176DEF_TEST(WArray, reporter) { 177 TestWData(reporter, data1, SK_ARRAY_COUNT(data1), NULL, 0, expected1); 178 TestWData(reporter, data2, SK_ARRAY_COUNT(data2), NULL, 0, expected2); 179 TestWData(reporter, data3, SK_ARRAY_COUNT(data3), NULL, 0, expected3); 180 TestWData(reporter, data4, SK_ARRAY_COUNT(data4), NULL, 0, expected4); 181 TestWData(reporter, data5, SK_ARRAY_COUNT(data5), NULL, 0, expected5); 182 TestWData(reporter, data6, SK_ARRAY_COUNT(data6), NULL, 0, expected6); 183 TestWData(reporter, data7, SK_ARRAY_COUNT(data7), NULL, 0, expected7); 184 TestWData(reporter, data7, SK_ARRAY_COUNT(data7), subset7, 185 SK_ARRAY_COUNT(subset7), expectedSubset7); 186 TestWData(reporter, data8, SK_ARRAY_COUNT(data8), NULL, 0, expected8); 187 TestWData(reporter, data8, SK_ARRAY_COUNT(data8), subset8, 188 SK_ARRAY_COUNT(subset8), expectedSubset8); 189 TestWData(reporter, data9, SK_ARRAY_COUNT(data9), NULL, 0, expected9); 190 TestWData(reporter, data9, SK_ARRAY_COUNT(data9), subset9, 191 SK_ARRAY_COUNT(subset9), expectedSubset9); 192 TestWData(reporter, data10, SK_ARRAY_COUNT(data10), NULL, 0, expected10); 193 TestWData(reporter, data10, SK_ARRAY_COUNT(data10), subset10, 194 SK_ARRAY_COUNT(subset10), expectedSubset10); 195 TestWData(reporter, data11, SK_ARRAY_COUNT(data11), NULL, 0, expected11); 196 TestWData(reporter, data11, SK_ARRAY_COUNT(data11), subset11, 197 SK_ARRAY_COUNT(subset11), expectedSubset11); 198 TestWData(reporter, data12, SK_ARRAY_COUNT(data12), NULL, 0, expected12); 199 TestWData(reporter, data12, SK_ARRAY_COUNT(data12), subset12, 200 SK_ARRAY_COUNT(subset12), expectedSubset12); 201 TestWData(reporter, data13, SK_ARRAY_COUNT(data13), NULL, 0, expected13); 202 TestWData(reporter, data13, SK_ARRAY_COUNT(data13), subset13, 203 SK_ARRAY_COUNT(subset13), expectedSubset13); 204 TestWData(reporter, data14, SK_ARRAY_COUNT(data14), NULL, 0, expected14); 205 TestWData(reporter, data14, SK_ARRAY_COUNT(data14), subset14, 206 SK_ARRAY_COUNT(subset14), expectedSubset14); 207} 208