01: /*
02: * Copyright (c) 2007, intarsys consulting GmbH
03: *
04: * Redistribution and use in source and binary forms, with or without
05: * modification, are permitted provided that the following conditions are met:
06: *
07: * - Redistributions of source code must retain the above copyright notice,
08: * this list of conditions and the following disclaimer.
09: *
10: * - Redistributions in binary form must reproduce the above copyright notice,
11: * this list of conditions and the following disclaimer in the documentation
12: * and/or other materials provided with the distribution.
13: *
14: * - Neither the name of intarsys nor the names of its contributors may be used
15: * to endorse or promote products derived from this software without specific
16: * prior written permission.
17: *
18: * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
19: * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
20: * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
21: * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
22: * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
23: * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
24: * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
25: * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
26: * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
27: * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
28: * POSSIBILITY OF SUCH DAMAGE.
29: */
30: package de.intarsys.pdf.font;
31:
32: /**
33: * A codespace range for a CMap.
34: *
35: * <p>
36: * todo 1 cmap implement correct byte check
37: * </p>
38: */
39: public class CMapRange {
40: /** The start index of the range */
41: private final byte[] start;
42:
43: /** The end index of the range */
44: private final byte[] end;
45:
46: /**
47: *
48: */
49: public CMapRange(byte[] start, byte[] end) {
50: super ();
51: this .start = start;
52: this .end = end;
53: }
54:
55: public byte[] getEnd() {
56: return end;
57: }
58:
59: public byte[] getStart() {
60: return start;
61: }
62:
63: public boolean contains(byte[] value) {
64: if (value.length == start.length) {
65: for (int i = 0; i < value.length; i++) {
66: if ((value[i] < start[i]) || (value[i] > end[i])) {
67: return false;
68: }
69: }
70: return true;
71: } else {
72: return false;
73: }
74: }
75: }
|