Examples with ChunkFilterBlock com.fastasyncworldedit.core.extent.filter.block.ChunkFilterBlock used on opensource projects

Example 1 with ChunkFilterBlock

use of com.fastasyncworldedit.core.extent.filter.block.ChunkFilterBlock in project FastAsyncWorldEdit by IntellectualSites.

the class IQueueExtent method apply.

@Override
default <T extends Filter> T apply(Region region, T filter, boolean full) {
    final Set<BlockVector2> chunks = region.getChunks();
    ChunkFilterBlock block = null;
    for (BlockVector2 chunk : chunks) {
        block = apply(block, filter, region, chunk.getX(), chunk.getZ(), full);
    }
    flush();
    return filter;
}

Example 2 with ChunkFilterBlock

use of com.fastasyncworldedit.core.extent.filter.block.ChunkFilterBlock in project FastAsyncWorldEdit by IntellectualSites.

the class ParallelQueueExtent method apply.

@Override
@SuppressWarnings("rawtypes")
public <T extends Filter> T apply(Region region, T filter, boolean full) {
    // The chunks positions to iterate over
    final Set<BlockVector2> chunks = region.getChunks();
    final Iterator<BlockVector2> chunksIter = chunks.iterator();
    // Get a pool, to operate on the chunks in parallel
    final int size = Math.min(chunks.size(), Settings.settings().QUEUE.PARALLEL_THREADS);
    if (size <= 1 && chunksIter.hasNext()) {
        BlockVector2 pos = chunksIter.next();
        getExtent().apply(null, filter, region, pos.getX(), pos.getZ(), full);
    } else {
        final ForkJoinTask[] tasks = IntStream.range(0, size).mapToObj(i -> handler.submit(() -> {
            try {
                final Filter newFilter = filter.fork();
                // Create a chunk that we will reuse/reset for each operation
                final SingleThreadQueueExtent queue = (SingleThreadQueueExtent) getNewQueue();
                queue.setFastMode(fastmode);
                queue.setFaweExceptionArray(faweExceptionReasonsUsed);
                synchronized (queue) {
                    try {
                        ChunkFilterBlock block = null;
                        while (true) {
                            // Get the next chunk posWeakChunk
                            final int chunkX;
                            final int chunkZ;
                            synchronized (chunksIter) {
                                if (!chunksIter.hasNext()) {
                                    break;
                                }
                                final BlockVector2 pos = chunksIter.next();
                                chunkX = pos.getX();
                                chunkZ = pos.getZ();
                            }
                            block = queue.apply(block, newFilter, region, chunkX, chunkZ, full);
                        }
                        queue.flush();
                    } catch (Throwable t) {
                        if (t instanceof FaweException) {
                            Fawe.handleFaweException(faweExceptionReasonsUsed, (FaweException) t, LOGGER);
                        } else if (t.getCause() instanceof FaweException) {
                            Fawe.handleFaweException(faweExceptionReasonsUsed, (FaweException) t.getCause(), LOGGER);
                        } else {
                            throw t;
                        }
                    }
                }
            } catch (Throwable e) {
                String message = e.getMessage();
                int hash = message.hashCode();
                if (lastException != hash) {
                    lastException = hash;
                    exceptionCount = 0;
                    LOGGER.catching(e);
                } else if (exceptionCount < Settings.settings().QUEUE.PARALLEL_THREADS) {
                    exceptionCount++;
                    LOGGER.warn(message);
                }
            }
        })).toArray(ForkJoinTask[]::new);
        // Join filters
        for (ForkJoinTask task : tasks) {
            if (task != null) {
                task.quietlyJoin();
            }
        }
        filter.join();
    }
    return filter;
}