com.simiacryptus.mindseye.art.photo.topology.SimpleRasterTopology Maven / Gradle / Ivy
/*
* Copyright (c) 2019 by Andrew Charneski.
*
* The author licenses this file to you 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.
*/
package com.simiacryptus.mindseye.art.photo.topology;
import com.simiacryptus.ref.lang.ReferenceCountingBase;
import javax.annotation.Nonnull;
import java.util.Arrays;
import java.util.List;
import java.util.stream.Collectors;
import java.util.stream.IntStream;
public class SimpleRasterTopology extends ReferenceCountingBase implements RasterTopology {
protected final int[] dimensions;
private final int max_neighborhood_size = 9;
public SimpleRasterTopology(int[] dimensions) {
this.dimensions = dimensions;
}
@Override
public int[] getDimensions() {
return dimensions;
}
@Override
public List connectivity() {
final ThreadLocal neighbors = ThreadLocal.withInitial(() -> new int[max_neighborhood_size]);
return IntStream.range(0, dimensions[0] * dimensions[1]).parallel().mapToObj(i -> {
final int[] original = neighbors.get();
return Arrays.copyOf(original, getNeighbors(getCoordsFromIndex(i), original));
}).collect(Collectors.toList());
}
@Override
public int getIndexFromCoords(int x, int y) {
return x + dimensions[0] * y;
}
@Nonnull
@Override
public int[] getCoordsFromIndex(int i) {
final int x = i % dimensions[0];
final int y = (i - x) / dimensions[0];
return new int[]{x, y};
}
@Override
public SimpleRasterTopology addRef() {
return (SimpleRasterTopology) super.addRef();
}
@Override
protected void _free() {
super._free();
}
private int getNeighbors(int[] coords, int[] neighbors) {
int neighborCount = 0;
final int x = coords[0];
final int y = coords[1];
final int w = dimensions[0];
final int h = dimensions[1];
if (y > 0) {
if (x > 0) {
neighbors[neighborCount++] = getIndexFromCoords(x - 1, y - 1);
}
if (x < w - 1) {
neighbors[neighborCount++] = getIndexFromCoords(x + 1, y - 1);
}
neighbors[neighborCount++] = getIndexFromCoords(x, y - 1);
}
if (y < h - 1) {
if (x > 0) {
neighbors[neighborCount++] = getIndexFromCoords(x - 1, y + 1);
}
if (x < w - 1) {
neighbors[neighborCount++] = getIndexFromCoords(x + 1, y + 1);
}
neighbors[neighborCount++] = getIndexFromCoords(x, y + 1);
}
if (x > 0) {
neighbors[neighborCount++] = getIndexFromCoords(x - 1, y);
}
if (x < w - 1) {
neighbors[neighborCount++] = getIndexFromCoords(x + 1, y);
}
// neighbors[neighborCount++] = getIndexFromCoords(x, y);
return neighborCount;
}
}
© 2015 - 2025 Weber Informatics LLC | Privacy Policy