Sha256: 69be239b079a1465f392a78ae05e20c84afbb272f6e339b42f43de7a097a923c
Contents?: true
Size: 1.95 KB
Versions: 2
Compression:
Stored size: 1.95 KB
Contents
/* * Copyright 2019 Uber Technologies, Inc. * * Licensed under the Apache License, Version 2.0 (the "License"); * you may not use this file except in compliance with the License. * You may obtain a copy of the License at * * http://www.apache.org/licenses/LICENSE-2.0 * * Unless required by applicable law or agreed to in writing, software * distributed under the License is distributed on an "AS IS" BASIS, * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. * See the License for the specific language governing permissions and * limitations under the License. */ #include <stdlib.h> #include "h3api.h" #include "test.h" #define PADDED_COUNT 16 SUITE(getPentagonIndexes) { TEST(propertyTests) { int expectedCount = H3_EXPORT(pentagonIndexCount)(); for (int res = 0; res <= 15; res++) { H3Index h3Indexes[PADDED_COUNT] = {0}; H3_EXPORT(getPentagonIndexes)(res, h3Indexes); int numFound = 0; for (int i = 0; i < PADDED_COUNT; i++) { H3Index h3Index = h3Indexes[i]; if (h3Index) { numFound++; t_assert(H3_EXPORT(h3IsValid(h3Index)), "index should be valid"); t_assert(H3_EXPORT(h3IsPentagon(h3Index)), "index should be pentagon"); t_assert(H3_EXPORT(h3GetResolution(h3Index)) == res, "index should have correct resolution"); // verify uniqueness for (int j = i + 1; j < PADDED_COUNT; j++) { if (h3Indexes[j] == h3Index) { t_assert(false, "index should be seen only once"); } } } } t_assert(numFound == expectedCount, "there should be exactly 12 pentagons"); } } }
Version data entries
2 entries across 2 versions & 1 rubygems
Version | Path |
---|---|
h3-3.7.2 | ext/h3/src/src/apps/testapps/testPentagonIndexes.c |
h3-3.7.1 | ext/h3/src/src/apps/testapps/testPentagonIndexes.c |