dmolony-DiskBrowser/src/com/bytezone/diskbrowser/infocom/Dictionary.java
2016-02-25 08:11:14 +11:00

241 lines
6.6 KiB
Java
Executable File

package com.bytezone.diskbrowser.infocom;
import java.util.ArrayList;
import java.util.List;
import java.util.Map;
import java.util.TreeMap;
import com.bytezone.diskbrowser.applefile.AbstractFile;
import com.bytezone.diskbrowser.utilities.HexFormatter;
class Dictionary extends AbstractFile
{
Map<Integer, ZString> dictionary;
int totalEntries;
int totalSeparators;
int dictionaryPtr, dictionarySize;
int entryLength;
Header header;
// this could be a Google Multimap
Map<Integer, List<WordEntry>> synonymList = new TreeMap<Integer, List<WordEntry>> ();
public Dictionary (Header header)
{
super ("Dictionary", header.buffer);
this.header = header;
dictionaryPtr = header.dictionaryOffset;
dictionary = new TreeMap<Integer, ZString> ();
totalSeparators = buffer[dictionaryPtr] & 0xFF;
int ptr = dictionaryPtr + totalSeparators + 1;
entryLength = buffer[ptr++] & 0xFF;
totalEntries = header.getWord (ptr);
ptr += 2;
int count = 0;
for (int i = 0; i < totalEntries; i++)
{
ZString string = new ZString (buffer, ptr, header);
dictionary.put (ptr, string);
WordEntry wordEntry = new WordEntry (string, count++);
// add the WordEntry to the appropriate list
List<WordEntry> wordEntryList = synonymList.get (wordEntry.key);
if (wordEntryList == null)
{
wordEntryList = new ArrayList<WordEntry> ();
synonymList.put (wordEntry.key, wordEntryList);
}
wordEntryList.add (wordEntry);
// check for words with the property flag
if ((buffer[ptr + 4] & 0x10) != 0)
{
int b1 = buffer[ptr + 5] & 0xFF;
int property = (b1 >= 1 && b1 <= 31) ? b1 : buffer[ptr + 6] & 0xFF;
if (header.propertyNames[property] == null
|| header.propertyNames[property].length () > string.value.length ())
header.propertyNames[property] = string.value;
}
ptr += entryLength;
}
dictionarySize = totalSeparators + 3 + entryLength * totalEntries;
for (int i = 1; i < header.propertyNames.length; i++)
if (header.propertyNames[i] == null)
header.propertyNames[i] = i + "";
}
public boolean containsWordAt (int address)
{
return dictionary.containsKey (address);
}
public String wordAt (int address)
{
if (dictionary.containsKey (address))
return dictionary.get (address).value;
return "dictionary can't find word @ " + address;
}
public List<String> getVerbs (int value)
{
List<String> words = new ArrayList<String> ();
int ptr = dictionaryPtr + totalSeparators + 4;
for (ZString word : dictionary.values ())
{
int b1 = buffer[ptr + 4] & 0xFF;
int b2 = buffer[ptr + 5] & 0xFF;
int b3 = buffer[ptr + 6] & 0xFF;
// mask seems to be 0x40
if ((b1 == 0x41 && b2 == value) || ((b1 == 0x62 || b1 == 0xC0 || b1 == 0x44) && b3 == value))
words.add (word.value);
ptr += entryLength;
}
return words;
}
public List<String> getPrepositions (int value)
{
List<String> words = new ArrayList<String> ();
int ptr = dictionaryPtr + totalSeparators + 4;
for (ZString word : dictionary.values ())
{
int b1 = buffer[ptr + 4] & 0xFF;
int b2 = buffer[ptr + 5] & 0xFF;
int b3 = buffer[ptr + 6] & 0xFF;
// mask seems to be 0x08
if (((b1 == 0x08 || b1 == 0x18 || b1 == 0x48) && b2 == value)
|| ((b1 == 0x1B || b1 == 0x0C || b1 == 0x2A) && b3 == value))
words.add (word.value);
ptr += entryLength;
}
return words;
}
@Override
public String getHexDump ()
{
StringBuilder text = new StringBuilder ();
text.append (HexFormatter.format (buffer, dictionaryPtr, dictionarySize));
return text.toString ();
}
@Override
public String getText ()
{
StringBuilder text = new StringBuilder ();
// text.append (String.format ("Total entries : %,6d%n", totalEntries));
// text.append (String.format ("Separators : %,6d%n", totalSeparators));
// text.append (String.format ("Offset : %,6d %04X%n%n", dictionaryPtr, dictionaryPtr));
int count = 0;
int ptr = dictionaryPtr + totalSeparators + 4;
for (ZString word : dictionary.values ())
{
text.append (String.format ("%04X %3d %-6s %s", ptr, count++, word.value, HexFormatter
.getHexString (buffer, ptr + 4, entryLength - 4)));
int b1 = buffer[ptr + 4] & 0xFF;
int b2 = buffer[ptr + 5] & 0xFF;
int b3 = buffer[ptr + 6] & 0xFF;
if (b1 == 65)
text.append (String.format (" %3d%n", b2));
else if (b1 == 98 || b1 == 0xC0 || b1 == 0x44)
text.append (String.format (" %3d%n", b3));
else
text.append ("\n");
ptr += entryLength;
}
if (true)
{
int lastValue = 0;
for (List<WordEntry> list : synonymList.values ())
{
WordEntry wordEntry = list.get (0);
if (wordEntry.value != lastValue)
{
lastValue = wordEntry.value;
text.append ("\n");
}
if (wordEntry.value == 0x80) // nouns are all in one entry
{
for (WordEntry we : list)
text.append (we + "\n");
text.deleteCharAt (text.length () - 1);
}
else
text.append (wordEntry);
if ((buffer[wordEntry.word.startPtr + 4] & 0x10) != 0)
text.append (" property");
text.append ("\n");
}
}
text.deleteCharAt (text.length () - 1);
return text.toString ();
}
private class WordEntry implements Comparable<WordEntry>
{
ZString word;
int seq;
int value;
int key;
String bits;
public WordEntry (ZString word, int seq)
{
this.word = word;
this.seq = seq;
// build key from 3 bytes following the word characters
int b1 = buffer[word.startPtr + 4] & 0xFF;
int b2 = buffer[word.startPtr + 5] & 0xFF;
int b3 = buffer[word.startPtr + 6] & 0xFF;
this.key = (b1 << 16) | (b2 << 8) | b3;
this.value = b1;
this.bits = Integer.toBinaryString (b1);
if (bits.length () < 8)
bits = "00000000".substring (bits.length ()) + bits;
}
@Override
public int compareTo (WordEntry o)
{
return this.value - o.value;
}
@Override
public String toString ()
{
StringBuilder list = new StringBuilder ("[");
if ((key & 0x0800000) == 0)
{
for (WordEntry we : synonymList.get (key))
list.append (we.word.value + ", ");
list.deleteCharAt (list.length () - 1);
list.deleteCharAt (list.length () - 1);
}
else
list.append (word.value);
list.append ("]");
StringBuilder text = new StringBuilder ();
text.append (String.format ("%04X %3d %-6s %s %s %s", word.startPtr, seq,
word.value, bits, HexFormatter
.getHexString (buffer, word.startPtr + 4, entryLength - 4), list.toString ()));
return text.toString ();
}
}
}