Jskad/source/org/thdl/tib/scanner/FileSyllableListTree.java

/*
The contents of this file are subject to the AMP Open Community License
Version 1.0 (the "License"); you may not use this file except in compliance
with the License. You may obtain a copy of the License on the AMP web site 
(http://www.tibet.iteso.mx/Guatemala/).

Software distributed under the License is distributed on an "AS IS" basis, 
WITHOUT WARRANTY OF ANY KIND, either express or implied. See the 
License for the specific terms governing rights and limitations under the 
License. 

The Initial Developer of this software is Andres Montano Pellegrini. Portions
created by Andres Montano Pellegrini are Copyright 2001 Andres Montano
Pellegrini. All Rights Reserved. 

Contributor(s): ______________________________________.
*/
package org.thdl.tib.scanner;

import java.io.*;

/** Searches the words directly in a file; not the prefered
	implementation. The search is too slow!
	The prefered implementation is the CachedSyllableList.
		
	<p>The words must be stored in a binary file tree structure format.
	This can be done using the BinaryFileGenerator.</p>

    @author Andr&eacute;s Montano Pellegrini
    @see TibetanScanner
    @see CachedSyllableList
    @see BinaryFileGenerator
*/

public class FileSyllableListTree implements SyllableListTree
{
	private String sil;
	private long def[];
	private long posLista;
	private DictionarySource defSource;
	public static DictionarySource defSourcesWanted;
	public static RandomAccessFile wordRaf=null;
	private static RandomAccessFile defRaf=null;
	
	/** Creates the root */
	public FileSyllableListTree(String archivo, int defSourcesWanted) throws Exception
	{
		sil = null;
		def = null;
		this.defSource = new DictionarySource();
		openFiles(archivo);
		posLista = wordRaf.length() - 4;
		wordRaf.seek(posLista);
		posLista = (long)wordRaf.readInt();
	}
	
	/** Used to create each node (except the root)
	*/
	public FileSyllableListTree(String sil, long []def, DictionarySource defSource, long posLista)
	{
		this.sil=sil;
		this.def=def;
		this.defSource = defSource;
		this.posLista=posLista;
	}

	public String toString()
	{
		return sil;
	}

	public DictionarySource getDictionarySource()
	{
		return defSource;
	}

	public static void openFiles(String archivo) throws Exception
	{
		wordRaf = new RandomAccessFile(archivo + ".wrd", "r");
		defRaf = new RandomAccessFile(archivo + ".def", "r");
		defSourcesWanted = DictionarySource.getAllDictionaries();
	}

	public String getDef()
	{
		return getDefs().toString();
	}

	public Definitions getDefs()
	{
		if (def==null) return null;
		DictionarySource defSourceAvail = defSource.intersection(defSourcesWanted);
		
		int defsAvail[] = defSourceAvail.untangleDefs(), defsFound[] = defSource.untangleDefs(def.length);


		String defs[] = new String[defsAvail.length];
		int i, n=0;
		try
		{
			for (i=0; i<defsAvail.length; i++)
			{
				while(defsAvail[i]!=defsFound[n]) n++;
				defRaf.seek(def[n]);
				defs[i] = defRaf.readUTF();
			}
		}
		catch (Exception e)
		{
			System.out.println(e);
			return null;
		}
		return new Definitions(defs, defsAvail);
	}

	public boolean hasDef()
	{
		if (def==null) return false;
		DictionarySource defSourceAvail = defSource.intersection(defSourcesWanted);
		return !defSourceAvail.isEmpty();
	}

	public SyllableListTree lookUp(String silStr)
	{
		String sil;
		long pos, defSource[];
		DictionarySource sourceDef;
		int i;

		if (silStr==null) return null;
		try
		{
			wordRaf.seek(posLista);
			do
			{
				pos = (long) wordRaf.readInt();
				sil = wordRaf.readUTF();
				sourceDef = DictionarySource.read(wordRaf);
				if (sourceDef.isEmpty()) defSource = null;
				else
				{
					defSource = new long[sourceDef.countDefs()];
					for (i=0; i<defSource.length; i++)
					{
						defSource[i] = (long) wordRaf.readInt();
					}
				}

				if (sil.compareTo(silStr)>0)
					return null;
				if (sil.equals(silStr))
					return new FileSyllableListTree(sil, defSource, sourceDef, pos);

			}while(sourceDef.hasBrothers());
		}
		catch (Exception e)
		{
		}
		return null;
	}
}