KickJava   Java API By Example, From Geeks To Geeks.

Java > Open Source Codes > org > apache > batik > svggen > font > table > LookupList


1 /*
2
3    Copyright 2001 The Apache Software Foundation
4
5    Licensed under the Apache License, Version 2.0 (the "License");
6    you may not use this file except in compliance with the License.
7    You may obtain a copy of the License at
8
9        http://www.apache.org/licenses/LICENSE-2.0
10
11    Unless required by applicable law or agreed to in writing, software
12    distributed under the License is distributed on an "AS IS" BASIS,
13    WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
14    See the License for the specific language governing permissions and
15    limitations under the License.
16
17  */
18 package org.apache.batik.svggen.font.table;
19
20 import java.io.IOException JavaDoc;
21 import java.io.RandomAccessFile JavaDoc;
22
23 /**
24  *
25  * @author <a HREF="mailto:david@steadystate.co.uk">David Schweinsberg</a>
26  * @version $Id: LookupList.java,v 1.3 2004/08/18 07:15:21 vhardy Exp $
27  */
28 public class LookupList {
29
30     private int lookupCount;
31     private int[] lookupOffsets;
32     private Lookup[] lookups;
33
34     /** Creates new LookupList */
35     public LookupList(RandomAccessFile JavaDoc raf, int offset, LookupSubtableFactory factory)
36     throws IOException JavaDoc {
37         raf.seek(offset);
38         lookupCount = raf.readUnsignedShort();
39         lookupOffsets = new int[lookupCount];
40         lookups = new Lookup[lookupCount];
41         for (int i = 0; i < lookupCount; i++) {
42             lookupOffsets[i] = raf.readUnsignedShort();
43         }
44         for (int i = 0; i < lookupCount; i++) {
45             lookups[i] = new Lookup(factory, raf, offset + lookupOffsets[i]);
46         }
47     }
48
49     public Lookup getLookup(Feature feature, int index) {
50         if (feature.getLookupCount() > index) {
51             int i = feature.getLookupListIndex(index);
52             return lookups[i];
53         }
54         return null;
55     }
56
57 }
58
59
Popular Tags