Home
last modified time | relevance | path

Searched refs:MAX_LEVEL (Results 1 – 25 of 34) sorted by relevance

12

/external/s2-geometry-library-java/tests/com/google/common/geometry/
DS2CellIdTest.java46 id = S2CellId.fromFacePosLevel(3, 0x12345678, S2CellId.MAX_LEVEL - 4); in testBasic()
50 assertEquals(id.level(), S2CellId.MAX_LEVEL - 4); in testBasic()
71 assertEquals(id.childBegin(S2CellId.MAX_LEVEL), id.rangeMin()); in testBasic()
72 assertEquals(id.childEnd(S2CellId.MAX_LEVEL), id.rangeMax().next()); in testBasic()
77 assertEquals(S2CellId.begin(S2CellId.MAX_LEVEL).prevWrap(), in testBasic()
78 S2CellId.fromFacePosLevel(5, ~0L >>> S2CellId.FACE_BITS, S2CellId.MAX_LEVEL)); in testBasic()
81 assertEquals(S2CellId.end(S2CellId.MAX_LEVEL).prev().nextWrap(), in testBasic()
82 S2CellId.fromFacePosLevel(0, 0, S2CellId.MAX_LEVEL)); in testBasic()
93 S2CellId id = getRandomCellId(S2CellId.MAX_LEVEL); in testInverses()
94 assertTrue(id.isLeaf() && id.level() == S2CellId.MAX_LEVEL); in testInverses()
[all …]
DS2CellUnionTest.java63 randomCells.add(getRandomCellId(S2CellId.MAX_LEVEL)); in testContainsCellUnion()
70 while (!randomCells.add(getRandomCellId(S2CellId.MAX_LEVEL))) { in testContainsCellUnion()
118 if (!selected && random(S2CellId.MAX_LEVEL - id.level()) != 0) { in addCells()
204 assertTrue(cellunion.contains(input.get(j).childBegin(S2CellId.MAX_LEVEL))); in testNormalize()
205 assertTrue(cellunion.intersects(input.get(j).childBegin(S2CellId.MAX_LEVEL))); in testNormalize()
318 S2Cap cap = getRandomCap(S2Cell.averageArea(S2CellId.MAX_LEVEL), 4 * S2.M_PI); in testExpand()
335 int minLevel = S2CellId.MAX_LEVEL; in testExpand()
363 0, (1L << ((S2CellId.MAX_LEVEL << 1) - 1)), S2CellId.MAX_LEVEL)); in testLeafCellsCovered()
407 double expected = S2Cell.averageArea(S2CellId.MAX_LEVEL) * (1L + (1L << 58)); in testAverageBasedArea()
DS2CellTest.java104 S2CellId.MAX_LEVEL + 1);
107 for (int i = 0; i < S2CellId.MAX_LEVEL + 1; ++i) {
365 for (int i = 0; i <= S2CellId.MAX_LEVEL; ++i) { in testSubdivide()
384 for (int i = 0; i <= S2CellId.MAX_LEVEL; ++i) { in testSubdivide()
422 static final int MAX_LEVEL = DEBUG_MODE ? 6 : 10; field in S2CellTest
427 if (children[0].level() < MAX_LEVEL) { in expandChildren1()
438 if (child.level() < MAX_LEVEL) { in expandChildren2()
DS2RegionCovererTest.java80 final int kMaxLevel = S2CellId.MAX_LEVEL; in testRandomCaps()
122 final int kMaxLevel = S2CellId.MAX_LEVEL; in testSimpleCoverings()
DGeometryTestCase.java73 long pos = rand.nextLong() & ((1L << (2 * S2CellId.MAX_LEVEL)) - 1);
78 return getRandomCellId(random(S2CellId.MAX_LEVEL + 1));
DS2Test.java276 for (int level = -2; level <= S2CellId.MAX_LEVEL + 3; ++level) {
278 if (level >= S2CellId.MAX_LEVEL + 3) {
283 int expectedLevel = Math.max(0, Math.min(S2CellId.MAX_LEVEL, level));
/external/s2-geometry-library-java/src/com/google/common/geometry/
DS2CellId.java58 public static final int MAX_LEVEL = 30; // Valid levels: 0..MAX_LEVEL field in S2CellId
59 public static final int POS_BITS = 2 * MAX_LEVEL + 1;
60 public static final int MAX_SIZE = 1 << MAX_LEVEL;
234 return MAX_LEVEL; in level()
287 return (int) (id >>> (2 * (MAX_LEVEL - level) + 1)) & 3; in childPosition()
563 int size = 1 << (MAX_LEVEL - level); in getEdgeNeighbors()
597 int halfsize = 1 << (MAX_LEVEL - (level + 1)); in getVertexNeighbors()
649 int size = 1 << (MAX_LEVEL - level()); in getAllNeighbors()
653 int nbrSize = 1 << (MAX_LEVEL - nbrLevel); in getAllNeighbors()
781 final int nbits = (k == 7) ? (MAX_LEVEL - 7 * LOOKUP_BITS) : LOOKUP_BITS; in getBits1()
[all …]
DS2RegionCoverer.java141 maxLevel = S2CellId.MAX_LEVEL; in S2RegionCoverer()
170 this.minLevel = Math.max(0, Math.min(S2CellId.MAX_LEVEL, minLevel)); in setMinLevel()
178 this.maxLevel = Math.max(0, Math.min(S2CellId.MAX_LEVEL, maxLevel)); in setMaxLevel()
448 Math.min(maxLevel(), S2CellId.MAX_LEVEL - 1)); in getInitialCandidates()
DS2CellUnion.java130 newLevel += (S2CellId.MAX_LEVEL - (newLevel - minLevel)) % levelMod; in denormalize()
131 newLevel = Math.min(S2CellId.MAX_LEVEL, newLevel); in denormalize()
393 int minLevel = S2CellId.MAX_LEVEL; in expand()
478 int invertedLevel = S2CellId.MAX_LEVEL - cellId.level(); in leafCellsCovered()
499 return S2Cell.averageArea(S2CellId.MAX_LEVEL) * leafCellsCovered(); in averageBasedArea()
DS2Cell.java28 private static final int MAX_CELL_SIZE = 1 << S2CellId.MAX_LEVEL;
82 return level == S2CellId.MAX_LEVEL; in isLeaf()
185 int cellSize = 1 << (S2CellId.MAX_LEVEL - level); in getCenterUV()
393 int cellSize = 1 << (S2CellId.MAX_LEVEL - level); in init()
DS2.java186 return S2CellId.MAX_LEVEL; in getMinLevel()
193 Math.min(S2CellId.MAX_LEVEL, -((exponent - 1) >> (dim - 1)))); in getMinLevel()
208 return S2CellId.MAX_LEVEL; in getMaxLevel()
215 Math.min(S2CellId.MAX_LEVEL, ((exponent - 1) >> (dim - 1)))); in getMaxLevel()
DS2EdgeIndex.java75 minimumS2LevelUsed = S2CellId.MAX_LEVEL; in reset()
321 if (idealLevel == S2CellId.MAX_LEVEL) { in getCovering()
371 int actualLevel = Math.min(idealLevel, S2CellId.MAX_LEVEL - 1); in getCovering()
DS2PolygonBuilder.java644 Math.min(S2Projections.MIN_WIDTH.getMaxLevel(2 * searchRadius), S2CellId.MAX_LEVEL - 1); in PointIndex()
/external/kotlinx.coroutines/kotlinx-coroutines-core/jvm/test/scheduling/
DCoroutineSchedulerCloseStressTest.kt26 private val MAX_LEVEL = 5 constant in kotlinx.coroutines.scheduling.CoroutineSchedulerCloseStressTest
27 private val N_COROS = (1 shl (MAX_LEVEL + 1)) - 1
75 if (level < MAX_LEVEL) { in launchChild()
/external/webp/src/enc/
Dconfig_enc.c138 #define MAX_LEVEL 9 macro
144 } kLosslessPresets[MAX_LEVEL + 1] = {
150 if (config == NULL || level < 0 || level > MAX_LEVEL) return 0; in WebPConfigLosslessPreset()
Dvp8i_enc.h39 MAX_LEVEL = 2047 // max level (note: max codable is 2047 + 67) enumerator
Dquant_enc.c648 if (thresh_level > MAX_LEVEL) thresh_level = MAX_LEVEL; in TrellisQuantizeBlock()
649 if (level0 > MAX_LEVEL) level0 = MAX_LEVEL; in TrellisQuantizeBlock()
/external/dtc/
Dfdtget.c144 #define MAX_LEVEL 32 /* how deeply nested we will go */ macro
175 if (level >= MAX_LEVEL) { in list_subnodes()
/external/libhevc/decoder/
Dihevcd_defs.h129 #define MAX_LEVEL IHEVC_LEVEL_62 macro
/external/webp/src/dsp/
Dcost.c52 const uint16_t VP8LevelFixedCosts[MAX_LEVEL + 1] = {
Denc_sse41.c203 const __m128i max_coeff_2047 = _mm_set1_epi16(MAX_LEVEL); in DoQuantizeBlock_SSE41()
Denc.c666 if (level > MAX_LEVEL) level = MAX_LEVEL; in QuantizeBlock_C()
/external/libavc/encoder/
Dih264e_defs.h185 #define MAX_LEVEL IH264_LEVEL_51 macro
Dih264e_utils.c479 WORD32 lvl_idx = MAX_LEVEL, i; in ih264e_get_min_level()
482 for (i = 0; i < MAX_LEVEL; i++) in ih264e_get_min_level()
/external/cldr/tools/java/org/unicode/cldr/util/
DXMLSource.java1079 static final int MAX_LEVEL = 40; /* Throw an error if it goes past this. */ field in XMLSource.ResolvingSource
1096 if (TRACE_FILL && DEBUG_PATH == null || level > MAX_LEVEL) { in fillKeys()
1101 if (level > MAX_LEVEL) throw new IllegalArgumentException("Stack overflow"); in fillKeys()

12