Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

modify TieredSpationJoin createReprojectMap return result Not comprehensive #1553

Open
wants to merge 7 commits into
base: master
Choose a base branch
from
Open

modify TieredSpationJoin createReprojectMap return result Not comprehensive #1553

Changes from all commits
Commits
Show all changes
7 commits
Select commit Hold shift + click to select a range
8b0b8f2
Create readme.txt
hsg77 Mar 25, 2019
e2d1605
Update readme.txt
hsg77 Mar 28, 2019
a71335a
Update readme.txt
hsg77 Apr 29, 2019
0c6da33
modify TieredSpationJoin createReprojectMap return result Not compreh…
hsg77 May 6, 2019
5656b3f
test
hsg77 May 6, 2019
48f8828
modify TieredSpatialJoin.java code style
hsg77 May 6, 2019
0b1bd3c
remove readme.txt
hsg77 May 6, 2019
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
46 changes: 23 additions & 23 deletions ...park/src/main/java/org/locationtech/geowave/analytic/spark/spatial/TieredSpatialJoin.java
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -379,30 +379,30 @@ public void join(
private Map<Byte, HashSet<Byte>> createReprojectMap(
final Byte[] buildSide,
final Byte[] testSide,
final HashSet<Byte> sharedTiers) {
final Map<Byte, HashSet<Byte>> resultMap = Maps.newHashMap();
final int testLastIndex = testSide.length;
for (final Byte tierLeft : buildSide) {
final int firstGreater = Arrays.binarySearch(testSide, tierLeft);

if (firstGreater >= 0) {
// Found in array
sharedTiers.add(tierLeft);
}

final int insertionPoint = Math.abs(firstGreater);
if (insertionPoint >= testLastIndex) {
// Not present in array, and none greater than this value
continue;
final HashSet<Byte> sharedTiers)
{
final Map<Byte, HashSet<Byte>> resultMap = Maps.newHashMap();
final int testLastIndex = testSide.length;
for (final Byte tierLeft : buildSide)
{
final int firstGreater = Arrays.binarySearch(testSide, tierLeft);
//add same tier id
if (firstGreater >= 0) {
// Found in array
sharedTiers.add(tierLeft);
}
//add highter tier id
HashSet<Byte> higherTiers = Sets.newHashSet();
for(Byte testID :testSide)
{
if(testID>tierLeft)
{
higherTiers.add(testID);
}
}
resultMap.put(tierLeft, higherTiers);
}

// There is at least one value greater than the current copy it and
// add to map
final HashSet<Byte> higherTiers =
Sets.newHashSet(Arrays.copyOfRange(testSide, insertionPoint, testLastIndex));
resultMap.put(tierLeft, higherTiers);
}
return resultMap;
return resultMap;
}

private void setBufferAmount(final double bufferAmount) {
Expand Down