/* Metallurgy - Higher Level Interface to Chordata
 * Copyright (C) 2001-2002  Jay Freeman (saurik)
*/

/*
 *        Redistribution and use in source and binary
 * forms, with or without modification, are permitted
 * provided that the following conditions are met:
 * 
 * 1. Redistributions of source code must retain the
 *    above copyright notice, this list of conditions
 *    and the following disclaimer.
 * 2. Redistributions in binary form must reproduce the
 *    above copyright notice, this list of conditions
 *    and the following disclaimer in the documentation
 *    and/or other materials provided with the
 *    distribution.
 * 3. The name of the author may not be used to endorse
 *    or promote products derived from this software
 *    without specific prior written permission.
 * 
 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS''
 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING,
 * BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
 * MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE
 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
 * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
 * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
 * LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR
 * TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
 * ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
 * ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/

#include "stdafx.h"

#include "metallurgy/TokenList.h"
#include "metallurgy/TypeDef.h"
#include "metallurgy/TypeRef.h"

namespace Metallurgy {

TokenList::TokenList() {
}

TokenList::~TokenList() {
}

void TokenList::insert(const std::wstring &name, Token *token) {
	names.insert(TokenMap::value_type(name, token));
	tokens.push_back(token);
}

void TokenList::insert(IName *token) {
	insert(token->getName(), dynamic_cast<Token *>(token));
}

void TokenList::remove(const Token *token) {
	for (TokenVector::iterator tk = tokens.begin(); tk != tokens.end(); ++tk)
		if (*tk == token)
			tokens.erase(tk--);
}

Token *TokenList::operator [](const std::wstring &name) const {
	TokenMap::const_iterator token = names.find(name);
	return token == names.end() ? NULL : token->second;
}

Token *TokenList::operator [](const int index) const {
	return tokens[index];
}

/*TokenSet TokenList::set() const {
	TokenSet set;
	for (TokenVector::const_iterator token = tokens.begin(); token != tokens.end(); token++)
		set.insert(*token);
	return set;
}*/

size_t TokenList::size() const {
	return tokens.size();
}

}