DocumentTermsTest.java

/*******************************************************************************
 * Trombone is a flexible text processing and analysis library used
 * primarily by Voyant Tools (voyant-tools.org).
 * 
 * Copyright (©) 2007-2012 Stéfan Sinclair & Geoffrey Rockwell
 * 
 * This file is part of Trombone.
 * 
 * Trombone is free software: you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation, either version 3 of the License, or
 * (at your option) any later version.
 * 
 * Trombone is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 * 
 * You should have received a copy of the GNU General Public License
 * along with Trombone.  If not, see <http://www.gnu.org/licenses/>.
 ******************************************************************************/
package org.voyanttools.trombone.model;

import org.junit.Test;

/**
 * @author sgs
 *
 */
public class DocumentTermsTest {

	@Test
	public void test() {
		/*
		DocumentTerm d1 = new DocumentTerm(1, "a", "a", 1, 1, null, null);
		DocumentTerm d2 = new DocumentTerm(1, "b", "z", 2, 2, null, null);
		DocumentTerm d3 = new DocumentTerm(1, "c", "é", 3, 4, null, null);
		DocumentTerm d4 = new DocumentTerm(1, "d", "a", 3, 3, null, null);
		DocumentTermsQueue queue;

		// descending raw frequency, then ascending ascending alphabet
		queue = new DocumentTermsQueue(2, DocumentTerm.Sort.RELATIVEFREQDESC);
		queue.offer(d1);
		queue.offer(d2);
		queue.offer(d3);
		queue.offer(d4);
		assertEquals(1000000, (int) queue.poll().getRelativeFrequency());
		assertEquals("a", queue.poll().getTerm());

		// descending raw frequency, then ascending ascending alphabet
		queue = new DocumentTermsQueue(2, DocumentTerm.Sort.RELATIVEFREQASC);
		queue.offer(d1);
		queue.offer(d2);
		queue.offer(d3);
		queue.offer(d4);
		assertEquals(1000000, queue.poll().getRelativeFrequency(), .1);
		assertEquals("é", queue.poll().getTerm());

		// descending raw frequency, then ascending ascending alphabet
		queue = new DocumentTermsQueue(2, DocumentTerm.Sort.RAWFREQDESC);
		queue.offer(d1);
		queue.offer(d2);
		queue.offer(d3);
		queue.offer(d4);
		assertEquals(3, queue.poll().getRawFrequency());
		assertEquals("a", queue.poll().getTerm());
		
		// ascending raw frequency, then ascending alphabet		
		queue = new DocumentTermsQueue(2, DocumentTerm.Sort.RAWFREQASC);
		queue.offer(d1);
		queue.offer(d2);
		queue.offer(d3);
		queue.offer(d4);
		assertEquals(2, queue.poll().getRawFrequency());
		assertEquals("a", queue.poll().getTerm());
		
		// ascending term alphabet, then descending term frequency
		queue = new DocumentTermsQueue(2, DocumentTerm.Sort.TERMASC);
		queue.offer(d1);
		queue.offer(d2);
		queue.offer(d3);
		queue.offer(d4);
		assertEquals(1, queue.poll().getRawFrequency());
		assertEquals("a", queue.poll().getTerm());

		// descending term alphabet, then descending term frequency
		queue = new DocumentTermsQueue(2, DocumentTerm.Sort.TERMDESC);
		queue.offer(d1);
		queue.offer(d2);
		queue.offer(d3);
		queue.offer(d4);
		assertEquals(3, queue.poll().getRawFrequency());
		assertEquals("z", queue.poll().getTerm());
		*/
	}

}