Lines Matching defs:kData
65 } kData[] = {
75 for (size_t n = 0; n < ARRAY_SIZE(kData); ++n) {
76 const char* text = to_cstr(kData[n].input);
79 EXPECT_EQ(kData[n].expected, wcstof(kData[n].input, &end));
81 EXPECT_EQ(kData[n].expected_len, (int)(end - kData[n].input));
90 } kData[] = {
101 for (size_t n = 0; n < ARRAY_SIZE(kData); ++n) {
102 const char* text = to_cstr(kData[n].input);
105 EXPECT_EQ(kData[n].expected, wcstod(kData[n].input, &end));
107 EXPECT_EQ(kData[n].expected_len, (int)(end - kData[n].input));
116 } kData[] = {
127 for (size_t n = 0; n < ARRAY_SIZE(kData); ++n) {
128 const char* text = to_cstr(kData[n].input);
131 EXPECT_EQ(kData[n].expected, wcstold(kData[n].input, &end));
133 EXPECT_EQ(kData[n].expected_len, (int)(end - kData[n].input));
143 } kData[] = {
153 for (size_t n = 0; n < ARRAY_SIZE(kData); ++n) {
154 const char* text = to_cstr(kData[n].input);
157 EXPECT_EQ(kData[n].expected, wcstol(kData[n].input, &end, kData[n].base));
159 EXPECT_EQ(kData[n].expected_len, (int)(end - kData[n].input));
169 } kData[] = {
179 for (size_t n = 0; n < ARRAY_SIZE(kData); ++n) {
180 const char* text = to_cstr(kData[n].input);
183 EXPECT_EQ(kData[n].expected, wcstoul(kData[n].input, &end, kData[n].base));
185 EXPECT_EQ(kData[n].expected_len, (int)(end - kData[n].input));
195 } kData[] = {
205 for (size_t n = 0; n < ARRAY_SIZE(kData); ++n) {
206 const char* text = to_cstr(kData[n].input);
209 EXPECT_EQ(kData[n].expected, wcstoll(kData[n].input, &end, kData[n].base));
211 EXPECT_EQ(kData[n].expected_len, (int)(end - kData[n].input));
221 } kData[] = {
231 for (size_t n = 0; n < ARRAY_SIZE(kData); ++n) {
232 const char* text = to_cstr(kData[n].input);
235 EXPECT_EQ(kData[n].expected, wcstoull(kData[n].input, &end, kData[n].base));
237 EXPECT_EQ(kData[n].expected_len, (int)(end - kData[n].input));
