/*
 * GNU LESSER GENERAL PUBLIC LICENSE Copyright (C) 2006 The Lobo Project
 * 
 * This library is free software; you can redistribute it and/or modify it under
 * the terms of the GNU Lesser General Public License as published by the Free
 * Software Foundation; either version 2.1 of the License, or (at your option)
 * any later version.
 * 
 * This library 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 Lesser General Public License for more
 * details.
 * 
 * You should have received a copy of the GNU Lesser General Public License
 * along with this library; if not, write to the Free Software Foundation, Inc.,
 * 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
 * 
 * Contact info: lobochief@users.sourceforge.net
 */
/*
 * Created on Oct 9, 2005
 */
package com.nvarghese.beowulf.common.cobra.html.js;

import java.util.Collection;
import java.util.Iterator;

import com.nvarghese.beowulf.common.cobra.js.AbstractScriptableDelegate;

public class FilteredObjectList extends AbstractScriptableDelegate {

	private final Collection sourceNodeList;
	private final ObjectFilter filter;
	private final Object lock;

	/**
	 * @param filter
	 * @param list
	 */
	public FilteredObjectList(ObjectFilter filter, Collection list, Object lock) {

		super();
		this.filter = filter;
		sourceNodeList = list;
		this.lock = lock;
	}

	public Object item(int index) {

		synchronized (this.lock) {
			int count = 0;
			Iterator i = this.sourceNodeList.iterator();
			while (i.hasNext()) {
				Object node = (Object) i.next();
				if (this.filter.accept(node)) {
					if (count == index) {
						return node;
					}
					count++;
				}
			}
			return null;
		}
	}

	public int getLength() {

		synchronized (this.lock) {
			int count = 0;
			Iterator i = this.sourceNodeList.iterator();
			while (i.hasNext()) {
				Object node = (Object) i.next();
				if (this.filter.accept(node)) {
					count++;
				}
			}
			return count;
		}
	}
}