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

de.intarsys.pdf.font.CMapBFRangeStringMap Maven / Gradle / Ivy

/*
 * Copyright (c) 2007, intarsys consulting GmbH
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions are met:
 *
 * - Redistributions of source code must retain the above copyright notice,
 *   this list of conditions and the following disclaimer.
 *
 * - Redistributions in binary form must reproduce the above copyright notice,
 *   this list of conditions and the following disclaimer in the documentation
 *   and/or other materials provided with the distribution.
 *
 * - Neither the name of intarsys nor the names of its contributors may be used
 *   to endorse or promote products derived from this software without specific
 *   prior written permission.
 *
 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
 * POSSIBILITY OF SUCH DAMAGE.
 */
package de.intarsys.pdf.font;

/**
 * A special map from a character code range to a character code range.
 * 
 */
public class CMapBFRangeStringMap extends CMapRangeMap {

	private final char[] chars;

	private final int last;

	public CMapBFRangeStringMap(byte[] start, byte[] end, byte[] destination) {
		super(start, end);
		this.chars = new char[destination.length >> 1];
		int byteIndex = 0;
		int charIndex = 0;
		while (byteIndex < destination.length) {
			this.chars[charIndex++] = (char) ((destination[byteIndex++] << 8) + destination[byteIndex++]);
		}
		this.last = this.chars.length - 1;
	}

	@Override
	public char[] toChars(int codepoint) {
		if ((codepoint >= start) && (codepoint <= end)) {
			return new char[] { (char) (codepoint - start + chars[last]) };
		} else {
			return null;
		}
	}

	@Override
	public int toCID(int codepoint) {
		if ((codepoint >= start) && (codepoint <= end)) {
			return codepoint - start + chars[last];
		} else {
			return 0;
		}
	}

	@Override
	public int toCodepoint(int cid) {
		int tempChar = chars[last];
		if ((cid >= tempChar) && (cid <= tempChar + end - start)) {
			return start + cid - tempChar;
		} else {
			return 0;
		}
	}

}




© 2015 - 2024 Weber Informatics LLC | Privacy Policy