All Downloads are FREE. Search and download functionalities are using the official Maven repository.

net.pwall.pipeline.codec.UTF32BE_CodePoint Maven / Gradle / Ivy

The newest version!
/*
 * @(#) UTF32BE_CodePoint.java
 *
 * pipelines   Pipeline conversion library for Java
 * Copyright (c) 2021, 2023 Peter Wall
 *
 * Permission is hereby granted, free of charge, to any person obtaining a copy
 * of this software and associated documentation files (the "Software"), to deal
 * in the Software without restriction, including without limitation the rights
 * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
 * copies of the Software, and to permit persons to whom the Software is
 * furnished to do so, subject to the following conditions:
 *
 * The above copyright notice and this permission notice shall be included in all
 * copies or substantial portions of the Software.
 *
 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
 * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
 * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
 * SOFTWARE.
 */

package net.pwall.pipeline.codec;

import net.pwall.pipeline.AbstractIntPipeline;
import net.pwall.pipeline.IntAcceptor;
import net.pwall.pipeline.IntPipeline;

/**
 * A decoder {@link IntPipeline} to convert UTF-32BE encoding to Unicode code points.
 *
 * @author  Peter Wall
 * @param        the pipeline result type
 */
public class UTF32BE_CodePoint extends AbstractIntPipeline {

    private int index;
    private int stored;

    public UTF32BE_CodePoint(IntAcceptor downstream) {
        super(downstream);
        index = 0;
        stored = 0;
    }

    @Override
    public void acceptInt(int value) {
        if (index == 3) {
            emit((stored << 8) | (value & 0xFF));
            index = 0;
        }
        else {
            stored = (stored << 8) | (value & 0xFF);
            index++;
        }
    }

    /**
     * Return {@code true} if all sequences in the input to this stage of the pipeline are complete, that is, the input
     * is not in the middle of a sequence requiring more data.
     *
     * @return {@code true} if the input is in the "complete" state
     */
    @Override
    public boolean isStageComplete() {
        return index == 0;
    }

}




© 2015 - 2024 Weber Informatics LLC | Privacy Policy