Package mil.nga.giat.geowave.index.sfc

Examples of mil.nga.giat.geowave.index.sfc.RangeDecomposition

134
135
136
137
138
139
140
141
142
143
144
        query.getDimensionCount());
    final byte[] maxZorder = ZOrderUtils.encode(
        normalizedMaxes,
        cardinalityPerDimension,
        query.getDimensionCount());
    return new RangeDecomposition(
        new ByteArrayRange[] {
          new ByteArrayRange(
              new ByteArrayId(
                  minZorder),
              new ByteArrayId(
View Full Code Here
218
219
220
221
222
223
224
225
226
227
228
229
230
231
        new NumericData[] {
          rangeX,
          rangeY
        });

    RangeDecomposition rangeDecomposition = hilbertSFC.decomposeQuery(
        spatialQuery,
        1);

    Assert.assertEquals(
        1,
        rangeDecomposition.getRanges().length);

  }
View Full Code Here
261
262
263
264
265
266
267
268
269
270
271
272
273
274
        new NumericData[] {
          rangeX,
          rangeY
        });

    RangeDecomposition rangeDecomposition = hilbertSFC.decomposeQuery(
        spatialQuery,
        20);

    Assert.assertEquals(
        20,
        rangeDecomposition.getRanges().length);

  }
View Full Code Here
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
        0);

    final NumericRange rangeLatitude4 = new NumericRange(
        0,
        Double.MIN_VALUE);
    final RangeDecomposition expectedResult1 = expectedResultOperations.decomposeRange(
        new NumericData[] {
          rangeLongitude1,
          rangeLatitude1
        },
        compactHilbertCurve,
        sfcDimensions,
        totalPrecision,
        Integer.MAX_VALUE,
        true);
    final RangeDecomposition testResult1 = testOperations.decomposeRange(
        new NumericData[] {
          rangeLongitude1,
          rangeLatitude1
        },
        compactHilbertCurve,
        sfcDimensions,
        totalPrecision,
        Integer.MAX_VALUE,
        true);
    Assert.assertTrue(expectedResult1.getRanges().length == testResult1.getRanges().length);
    for (int i = 0; i < expectedResult1.getRanges().length; i++) {
      Assert.assertTrue(expectedResult1.getRanges()[i].equals(testResult1.getRanges()[i]));
    }
    final RangeDecomposition expectedResult2 = expectedResultOperations.decomposeRange(
        new NumericData[] {
          rangeLongitude2,
          rangeLatitude2
        },
        compactHilbertCurve,
        sfcDimensions,
        totalPrecision,
        Integer.MAX_VALUE,
        true);
    final RangeDecomposition testResult2 = testOperations.decomposeRange(
        new NumericData[] {
          rangeLongitude2,
          rangeLatitude2
        },
        compactHilbertCurve,
        sfcDimensions,
        totalPrecision,
        Integer.MAX_VALUE,
        true);
    Assert.assertTrue(expectedResult2.getRanges().length == testResult2.getRanges().length);
    for (int i = 0; i < expectedResult2.getRanges().length; i++) {
      Assert.assertTrue(expectedResult2.getRanges()[i].equals(testResult2.getRanges()[i]));
    }
    final RangeDecomposition expectedResult3 = expectedResultOperations.decomposeRange(
        new NumericData[] {
          rangeLongitude3,
          rangeLatitude3
        },
        compactHilbertCurve,
        sfcDimensions,
        totalPrecision,
        Integer.MAX_VALUE,
        true);
    final RangeDecomposition testResult3 = testOperations.decomposeRange(
        new NumericData[] {
          rangeLongitude3,
          rangeLatitude3
        },
        compactHilbertCurve,
        sfcDimensions,
        totalPrecision,
        Integer.MAX_VALUE,
        true);
    Assert.assertTrue(expectedResult3.getRanges().length == testResult3.getRanges().length);
    for (int i = 0; i < expectedResult3.getRanges().length; i++) {
      Assert.assertTrue(expectedResult3.getRanges()[i].equals(testResult3.getRanges()[i]));
    }
    final RangeDecomposition expectedResult4 = expectedResultOperations.decomposeRange(
        new NumericData[] {
          rangeLongitude4,
          rangeLatitude4
        },
        compactHilbertCurve,
        sfcDimensions,
        totalPrecision,
        Integer.MAX_VALUE,
        true);
    final RangeDecomposition testResult4 = testOperations.decomposeRange(
        new NumericData[] {
          rangeLongitude4,
          rangeLatitude4
        },
        compactHilbertCurve,
        sfcDimensions,
        totalPrecision,
        Integer.MAX_VALUE,
        true);
    Assert.assertTrue(expectedResult4.getRanges().length == testResult4.getRanges().length);
    for (int i = 0; i < expectedResult4.getRanges().length; i++) {
      Assert.assertTrue(expectedResult4.getRanges()[i].equals(testResult4.getRanges()[i]));
    }
  }
View Full Code Here
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
    final ByteArrayRange[] sfcRanges = new ByteArrayRange[hilbertRanges.size()];
    final int expectedByteCount = (int) Math.ceil(totalPrecision / 8.0);
    if (expectedByteCount <= 0) {
      // special case for no precision
      return new RangeDecomposition(
          new ByteArrayRange[] {
            new ByteArrayRange(
                new ByteArrayId(
                    new byte[] {}),
                new ByteArrayId(
                    new byte[] {}))
          });
    }
    for (int i = 0; i < hilbertRanges.size(); i++) {
      final FilteredIndexRange<BigIntegerRange, BigIntegerRange> range = hilbertRanges.get(i);
      // sanity check that values fit within the expected range
      // it seems that uzaygezen can produce a value at 2^totalPrecision
      // rather than 2^totalPrecision - 1
      final BigInteger startValue = clamp(
          minHilbertValue,
          maxHilbertValue,
          range.getIndexRange().getStart());
      final BigInteger endValue = clamp(
          minHilbertValue,
          maxHilbertValue,
          range.getIndexRange().getEnd().subtract(BigInteger.ONE));
      // make sure its padded if necessary
      final byte[] start = HilbertSFC.fitExpectedByteCount(
          expectedByteCount,
          startValue.toByteArray());

      // make sure its padded if necessary
      final byte[] end = HilbertSFC.fitExpectedByteCount(
          expectedByteCount,
          endValue.toByteArray());
      sfcRanges[i] = new ByteArrayRange(
          new ByteArrayId(
              start),
          new ByteArrayId(
              end));
    }

    final RangeDecomposition rangeDecomposition = new RangeDecomposition(
        sfcRanges);

    return rangeDecomposition;
  }
View Full Code Here
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
      final SpaceFillingCurve sfc,
      final int maxRanges,
      final byte tier ) {
    final List<ByteArrayRange> queryRanges = new ArrayList<ByteArrayRange>();
    for (final BinnedNumericDataset binnedQuery : binnedQueries) {
      final RangeDecomposition rangeDecomp = sfc.decomposeQuery(
          binnedQuery,
          maxRanges);
      final byte[] tierAndBinId = ByteArrayUtils.combineArrays(
          new byte[] {
            tier
          // we're assuming tiers only go to 127 (the max byte
          // value)
          },
          binnedQuery.getBinId());
      for (final ByteArrayRange range : rangeDecomp.getRanges()) {
        queryRanges.add(new ByteArrayRange(
            new ByteArrayId(
                ByteArrayUtils.combineArrays(
                    tierAndBinId,
                    range.getStart().getBytes())),
View Full Code Here
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
    final byte[] tierAndBinId = ByteArrayUtils.combineArrays(
        new byte[] {
          (byte) tier
        },
        index.getBinId());
    final RangeDecomposition rangeDecomp = sfc.decomposeQuery(
        index,
        DEFAULT_MAX_RANGES);
    // this range does not fit into a single row ID at the lowest
    // tier, decompose it
    for (final ByteArrayRange range : rangeDecomp.getRanges()) {
      final byte[] currentRowId = Arrays.copyOf(
          range.getStart().getBytes(),
          range.getStart().getBytes().length);
      retVal.add(new ByteArrayId(
          ByteArrayUtils.combineArrays(
View Full Code Here
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
    final ByteArrayRange[] sfcRanges = new ByteArrayRange[hilbertRanges.size()];
    final int expectedByteCount = (int) Math.ceil(totalPrecision / 8.0);
    if (expectedByteCount <= 0) {
      // special case for no precision
      return new RangeDecomposition(
          new ByteArrayRange[] {
            new ByteArrayRange(
                new ByteArrayId(
                    new byte[] {}),
                new ByteArrayId(
                    new byte[] {}))
          });
    }
    for (int i = 0; i < hilbertRanges.size(); i++) {
      final FilteredIndexRange<LongRange, LongRange> range = hilbertRanges.get(i);
      // sanity check that values fit within the expected range
      // it seems that uzaygezen can produce a value at 2^totalPrecision
      // rather than 2^totalPrecision - 1
      final long startValue = clamp(
          minHilbertValue,
          maxHilbertValue,
          range.getIndexRange().getStart());
      final long endValue = clamp(
          minHilbertValue,
          maxHilbertValue,
          range.getIndexRange().getEnd() - 1);
      // make sure its padded if necessary
      final byte[] start = HilbertSFC.fitExpectedByteCount(
          expectedByteCount,
          ByteBuffer.allocate(
              8).putLong(
              startValue).array());

      // make sure its padded if necessary
      final byte[] end = HilbertSFC.fitExpectedByteCount(
          expectedByteCount,
          ByteBuffer.allocate(
              8).putLong(
              endValue).array());
      sfcRanges[i] = new ByteArrayRange(
          new ByteArrayId(
              start),
          new ByteArrayId(
              end));
    }

    final RangeDecomposition rangeDecomposition = new RangeDecomposition(
        sfcRanges);

    return rangeDecomposition;
  }
View Full Code Here
TOP

Related Classes of mil.nga.giat.geowave.index.sfc.RangeDecomposition

  • mil.nga.giat.geowave.index.sfc.hilbert.HilbertSFCTest
  • mil.nga.giat.geowave.index.sfc.hilbert.PrimitiveHilbertSFCOperations
  • mil.nga.giat.geowave.index.sfc.hilbert.PrimitiveHilbertSFCTest
  • mil.nga.giat.geowave.index.sfc.hilbert.UnboundedHilbertSFCOperations
  • mil.nga.giat.geowave.index.sfc.tiered.TieredSFCIndexStrategy
  • mil.nga.giat.geowave.index.sfc.zorder.ZOrderSFC
    • Copyright © 2018 www.massapicom. All rights reserved.
    All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.